./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_nondet_test1-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version a0165632 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_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_nondet_test1-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX --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 112ef0f8366461020cac5f2ac7dec2d7e41f31b24e653cd7734885d2bb23b087 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 17:02:38,720 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 17:02:38,848 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-08 17:02:38,854 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 17:02:38,857 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 17:02:38,891 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 17:02:38,892 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 17:02:38,893 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 17:02:38,894 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 17:02:38,895 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 17:02:38,896 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 17:02:38,896 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 17:02:38,897 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 17:02:38,897 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 17:02:38,899 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 17:02:38,900 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 17:02:38,900 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 17:02:38,901 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 17:02:38,901 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 17:02:38,901 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 17:02:38,902 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-08 17:02:38,902 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-08 17:02:38,903 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-08 17:02:38,903 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 17:02:38,904 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 17:02:38,904 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 17:02:38,904 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-08 17:02:38,905 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 17:02:38,905 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 17:02:38,906 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 17:02:38,906 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 17:02:38,906 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 17:02:38,907 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 17:02:38,907 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 17:02:38,908 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 17:02:38,908 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 17:02:38,908 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 17:02:38,909 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 17:02:38,909 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 17:02:38,909 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 17:02:38,910 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 17:02:38,910 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 17:02:38,911 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_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/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_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX 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 -> 112ef0f8366461020cac5f2ac7dec2d7e41f31b24e653cd7734885d2bb23b087 [2024-11-08 17:02:39,224 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 17:02:39,270 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 17:02:39,273 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 17:02:39,274 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 17:02:39,275 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 17:02:39,276 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_nondet_test1-2.i Unable to find full path for "g++" [2024-11-08 17:02:41,203 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 17:02:41,526 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 17:02:41,526 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_nondet_test1-2.i [2024-11-08 17:02:41,547 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/data/005158cca/8441ce3cefd74ff69bb678eb315b5b46/FLAGb5359df43 [2024-11-08 17:02:41,775 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/data/005158cca/8441ce3cefd74ff69bb678eb315b5b46 [2024-11-08 17:02:41,778 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 17:02:41,780 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 17:02:41,785 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 17:02:41,786 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 17:02:41,792 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 17:02:41,793 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 05:02:41" (1/1) ... [2024-11-08 17:02:41,794 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12ab8c75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:02:41, skipping insertion in model container [2024-11-08 17:02:41,795 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 05:02:41" (1/1) ... [2024-11-08 17:02:41,873 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 17:02:42,437 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-08 17:02:42,496 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-08 17:02:42,504 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-08 17:02:42,512 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-08 17:02:42,528 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-08 17:02:42,552 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-08 17:02:42,557 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-08 17:02:42,563 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-08 17:02:42,566 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-08 17:02:42,567 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-08 17:02:42,570 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-08 17:02:42,579 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-08 17:02:42,585 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 17:02:42,600 ERROR L321 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) [2024-11-08 17:02:42,601 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@73324219 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:02:42, skipping insertion in model container [2024-11-08 17:02:42,601 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 17:02:42,602 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-08 17:02:42,604 INFO L158 Benchmark]: Toolchain (without parser) took 823.35ms. Allocated memory is still 165.7MB. Free memory was 100.4MB in the beginning and 126.3MB in the end (delta: -25.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-08 17:02:42,605 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 165.7MB. Free memory is still 139.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 17:02:42,606 INFO L158 Benchmark]: CACSL2BoogieTranslator took 816.48ms. Allocated memory is still 165.7MB. Free memory was 100.2MB in the beginning and 126.3MB in the end (delta: -26.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-08 17:02:42,607 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.34ms. Allocated memory is still 165.7MB. Free memory is still 139.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 816.48ms. Allocated memory is still 165.7MB. Free memory was 100.2MB in the beginning and 126.3MB in the end (delta: -26.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 753]: 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_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_nondet_test1-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX --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 112ef0f8366461020cac5f2ac7dec2d7e41f31b24e653cd7734885d2bb23b087 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 17:02:44,855 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 17:02:44,953 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-08 17:02:44,960 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 17:02:44,961 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 17:02:44,999 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 17:02:45,000 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 17:02:45,000 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 17:02:45,001 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 17:02:45,005 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 17:02:45,005 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 17:02:45,005 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 17:02:45,007 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 17:02:45,007 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 17:02:45,008 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 17:02:45,009 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 17:02:45,010 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 17:02:45,010 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 17:02:45,010 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 17:02:45,012 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 17:02:45,012 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-08 17:02:45,012 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-08 17:02:45,013 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-08 17:02:45,013 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 17:02:45,013 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 17:02:45,014 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 17:02:45,014 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 17:02:45,014 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 17:02:45,014 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-08 17:02:45,015 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 17:02:45,015 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 17:02:45,015 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 17:02:45,016 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 17:02:45,016 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 17:02:45,016 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 17:02:45,017 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 17:02:45,018 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 17:02:45,019 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 17:02:45,019 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-08 17:02:45,019 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 17:02:45,019 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 17:02:45,020 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 17:02:45,020 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 17:02:45,029 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 17:02:45,029 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_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/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_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX 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 -> 112ef0f8366461020cac5f2ac7dec2d7e41f31b24e653cd7734885d2bb23b087 [2024-11-08 17:02:45,404 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 17:02:45,424 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 17:02:45,427 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 17:02:45,428 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 17:02:45,429 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 17:02:45,431 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_nondet_test1-2.i Unable to find full path for "g++" [2024-11-08 17:02:47,447 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 17:02:47,833 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 17:02:47,834 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_nondet_test1-2.i [2024-11-08 17:02:47,862 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/data/33668e5bd/71682b135f4c4b4e9756567186ee93a6/FLAG3eabdd5f4 [2024-11-08 17:02:47,882 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/data/33668e5bd/71682b135f4c4b4e9756567186ee93a6 [2024-11-08 17:02:47,885 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 17:02:47,888 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 17:02:47,890 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 17:02:47,890 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 17:02:47,898 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 17:02:47,899 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 05:02:47" (1/1) ... [2024-11-08 17:02:47,900 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@675b2e54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:02:47, skipping insertion in model container [2024-11-08 17:02:47,901 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 05:02:47" (1/1) ... [2024-11-08 17:02:47,981 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 17:02:48,612 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-08 17:02:48,672 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-08 17:02:48,681 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-08 17:02:48,689 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-08 17:02:48,706 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-08 17:02:48,729 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-08 17:02:48,731 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-08 17:02:48,737 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-08 17:02:48,741 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-08 17:02:48,743 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-08 17:02:48,769 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-08 17:02:48,778 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-08 17:02:48,788 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 17:02:48,808 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-08 17:02:48,829 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 17:02:48,878 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-08 17:02:48,907 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-08 17:02:48,913 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-08 17:02:48,920 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-08 17:02:48,928 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-08 17:02:48,948 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-08 17:02:48,953 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-08 17:02:48,955 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-08 17:02:48,957 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-08 17:02:48,961 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-08 17:02:48,962 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-08 17:02:48,967 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-08 17:02:48,969 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 17:02:48,975 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 17:02:49,085 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 17:02:49,137 INFO L204 MainTranslator]: Completed translation [2024-11-08 17:02:49,138 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:02:49 WrapperNode [2024-11-08 17:02:49,138 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 17:02:49,158 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 17:02:49,158 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 17:02:49,159 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 17:02:49,167 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:02:49" (1/1) ... [2024-11-08 17:02:49,214 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:02:49" (1/1) ... [2024-11-08 17:02:49,278 INFO L138 Inliner]: procedures = 179, calls = 221, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 739 [2024-11-08 17:02:49,279 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 17:02:49,280 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 17:02:49,280 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 17:02:49,280 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 17:02:49,296 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:02:49" (1/1) ... [2024-11-08 17:02:49,296 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:02:49" (1/1) ... [2024-11-08 17:02:49,304 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:02:49" (1/1) ... [2024-11-08 17:02:49,398 INFO L175 MemorySlicer]: Split 206 memory accesses to 2 slices as follows [2, 204]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 50 writes are split as follows [0, 50]. [2024-11-08 17:02:49,402 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:02:49" (1/1) ... [2024-11-08 17:02:49,403 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:02:49" (1/1) ... [2024-11-08 17:02:49,449 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:02:49" (1/1) ... [2024-11-08 17:02:49,457 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:02:49" (1/1) ... [2024-11-08 17:02:49,461 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:02:49" (1/1) ... [2024-11-08 17:02:49,465 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:02:49" (1/1) ... [2024-11-08 17:02:49,473 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 17:02:49,474 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 17:02:49,474 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 17:02:49,475 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 17:02:49,475 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:02:49" (1/1) ... [2024-11-08 17:02:49,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 17:02:49,495 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:02:49,508 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 17:02:49,520 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 17:02:49,555 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-08 17:02:49,557 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-08 17:02:49,557 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-08 17:02:49,557 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-08 17:02:49,557 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-08 17:02:49,558 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-08 17:02:49,558 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-08 17:02:49,558 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-08 17:02:49,558 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-08 17:02:49,558 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 17:02:49,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-08 17:02:49,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-08 17:02:49,559 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-08 17:02:49,559 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-08 17:02:49,559 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-08 17:02:49,559 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-08 17:02:49,559 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-08 17:02:49,559 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 17:02:49,559 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-08 17:02:49,560 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 17:02:49,560 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 17:02:49,838 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 17:02:49,841 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 17:02:49,845 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-08 17:02:49,907 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-08 17:02:53,543 INFO L? ?]: Removed 900 outVars from TransFormulas that were not future-live. [2024-11-08 17:02:53,544 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 17:02:53,588 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 17:02:53,591 INFO L316 CfgBuilder]: Removed 35 assume(true) statements. [2024-11-08 17:02:53,592 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:02:53 BoogieIcfgContainer [2024-11-08 17:02:53,592 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 17:02:53,594 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 17:02:53,594 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 17:02:53,597 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 17:02:53,599 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 05:02:47" (1/3) ... [2024-11-08 17:02:53,599 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@96c4a3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 05:02:53, skipping insertion in model container [2024-11-08 17:02:53,600 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:02:49" (2/3) ... [2024-11-08 17:02:53,601 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@96c4a3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 05:02:53, skipping insertion in model container [2024-11-08 17:02:53,602 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:02:53" (3/3) ... [2024-11-08 17:02:53,604 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_FNV_nondet_test1-2.i [2024-11-08 17:02:53,622 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 17:02:53,623 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 425 error locations. [2024-11-08 17:02:53,711 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 17:02:53,718 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, 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;@568404d5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 17:02:53,719 INFO L334 AbstractCegarLoop]: Starting to check reachability of 425 error locations. [2024-11-08 17:02:53,727 INFO L276 IsEmpty]: Start isEmpty. Operand has 841 states, 414 states have (on average 2.2198067632850242) internal successors, (919), 836 states have internal predecessors, (919), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 17:02:53,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-08 17:02:53,737 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:02:53,738 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-08 17:02:53,738 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-08 17:02:53,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:02:53,745 INFO L85 PathProgramCache]: Analyzing trace with hash 1422042701, now seen corresponding path program 1 times [2024-11-08 17:02:53,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:02:53,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1679502224] [2024-11-08 17:02:53,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:02:53,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:02:53,778 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:02:53,780 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:02:53,783 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 17:02:53,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:02:53,950 INFO L255 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 17:02:53,954 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:02:53,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:02:53,963 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:02:53,964 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:02:53,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1679502224] [2024-11-08 17:02:53,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1679502224] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:02:53,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:02:53,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 17:02:53,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234347679] [2024-11-08 17:02:53,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:02:53,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 17:02:53,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:02:54,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 17:02:54,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 17:02:54,015 INFO L87 Difference]: Start difference. First operand has 841 states, 414 states have (on average 2.2198067632850242) internal successors, (919), 836 states have internal predecessors, (919), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:02:54,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:02:54,106 INFO L93 Difference]: Finished difference Result 831 states and 874 transitions. [2024-11-08 17:02:54,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 17:02:54,112 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-08 17:02:54,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:02:54,132 INFO L225 Difference]: With dead ends: 831 [2024-11-08 17:02:54,133 INFO L226 Difference]: Without dead ends: 829 [2024-11-08 17:02:54,135 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 17:02:54,142 INFO L432 NwaCegarLoop]: 874 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 874 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 17:02:54,144 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 874 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 17:02:54,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 829 states. [2024-11-08 17:02:54,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 829 to 829. [2024-11-08 17:02:54,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 829 states, 408 states have (on average 2.122549019607843) internal successors, (866), 824 states have internal predecessors, (866), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 17:02:54,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 829 states to 829 states and 872 transitions. [2024-11-08 17:02:54,231 INFO L78 Accepts]: Start accepts. Automaton has 829 states and 872 transitions. Word has length 6 [2024-11-08 17:02:54,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:02:54,232 INFO L471 AbstractCegarLoop]: Abstraction has 829 states and 872 transitions. [2024-11-08 17:02:54,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:02:54,232 INFO L276 IsEmpty]: Start isEmpty. Operand 829 states and 872 transitions. [2024-11-08 17:02:54,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-08 17:02:54,233 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:02:54,233 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-08 17:02:54,256 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-08 17:02:54,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:02:54,435 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-08 17:02:54,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:02:54,435 INFO L85 PathProgramCache]: Analyzing trace with hash 1422042763, now seen corresponding path program 1 times [2024-11-08 17:02:54,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:02:54,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2087837889] [2024-11-08 17:02:54,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:02:54,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:02:54,436 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:02:54,438 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:02:54,441 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-08 17:02:54,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:02:54,582 INFO L255 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 17:02:54,585 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:02:54,629 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 [2024-11-08 17:02:54,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:02:54,648 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:02:54,648 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:02:54,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2087837889] [2024-11-08 17:02:54,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2087837889] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:02:54,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:02:54,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 17:02:54,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738405785] [2024-11-08 17:02:54,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:02:54,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 17:02:54,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:02:54,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 17:02:54,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 17:02:54,654 INFO L87 Difference]: Start difference. First operand 829 states and 872 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:02:56,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:02:56,437 INFO L93 Difference]: Finished difference Result 783 states and 828 transitions. [2024-11-08 17:02:56,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 17:02:56,437 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-08 17:02:56,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:02:56,440 INFO L225 Difference]: With dead ends: 783 [2024-11-08 17:02:56,440 INFO L226 Difference]: Without dead ends: 783 [2024-11-08 17:02:56,441 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 17:02:56,442 INFO L432 NwaCegarLoop]: 516 mSDtfsCounter, 522 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 491 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 525 SdHoareTripleChecker+Valid, 632 SdHoareTripleChecker+Invalid, 544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-08 17:02:56,442 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [525 Valid, 632 Invalid, 544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 491 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-08 17:02:56,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 783 states. [2024-11-08 17:02:56,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 783 to 780. [2024-11-08 17:02:56,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 780 states, 408 states have (on average 2.002450980392157) internal successors, (817), 775 states have internal predecessors, (817), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 17:02:56,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 823 transitions. [2024-11-08 17:02:56,478 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 823 transitions. Word has length 6 [2024-11-08 17:02:56,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:02:56,479 INFO L471 AbstractCegarLoop]: Abstraction has 780 states and 823 transitions. [2024-11-08 17:02:56,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:02:56,480 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 823 transitions. [2024-11-08 17:02:56,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-08 17:02:56,481 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:02:56,481 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-08 17:02:56,502 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-08 17:02:56,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:02:56,682 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-08 17:02:56,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:02:56,683 INFO L85 PathProgramCache]: Analyzing trace with hash 1422042764, now seen corresponding path program 1 times [2024-11-08 17:02:56,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:02:56,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1435652544] [2024-11-08 17:02:56,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:02:56,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:02:56,684 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:02:56,685 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:02:56,693 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-08 17:02:56,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:02:56,810 INFO L255 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-08 17:02:56,812 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:02:56,829 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 [2024-11-08 17:02:56,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:02:56,862 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:02:56,862 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:02:56,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1435652544] [2024-11-08 17:02:56,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1435652544] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:02:56,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:02:56,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 17:02:56,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243279177] [2024-11-08 17:02:56,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:02:56,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 17:02:56,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:02:56,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 17:02:56,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 17:02:56,866 INFO L87 Difference]: Start difference. First operand 780 states and 823 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:02:58,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:02:58,846 INFO L93 Difference]: Finished difference Result 855 states and 903 transitions. [2024-11-08 17:02:58,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 17:02:58,848 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-08 17:02:58,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:02:58,851 INFO L225 Difference]: With dead ends: 855 [2024-11-08 17:02:58,851 INFO L226 Difference]: Without dead ends: 855 [2024-11-08 17:02:58,851 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 17:02:58,852 INFO L432 NwaCegarLoop]: 695 mSDtfsCounter, 271 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 465 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 980 SdHoareTripleChecker+Invalid, 479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-08 17:02:58,853 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 980 Invalid, 479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 465 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-08 17:02:58,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 855 states. [2024-11-08 17:02:58,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 855 to 806. [2024-11-08 17:02:58,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 806 states, 445 states have (on average 1.9775280898876404) internal successors, (880), 801 states have internal predecessors, (880), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 17:02:58,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 806 states to 806 states and 886 transitions. [2024-11-08 17:02:58,874 INFO L78 Accepts]: Start accepts. Automaton has 806 states and 886 transitions. Word has length 6 [2024-11-08 17:02:58,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:02:58,875 INFO L471 AbstractCegarLoop]: Abstraction has 806 states and 886 transitions. [2024-11-08 17:02:58,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:02:58,875 INFO L276 IsEmpty]: Start isEmpty. Operand 806 states and 886 transitions. [2024-11-08 17:02:58,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-08 17:02:58,876 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:02:58,876 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:02:58,895 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-08 17:02:59,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:02:59,080 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr314REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-08 17:02:59,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:02:59,081 INFO L85 PathProgramCache]: Analyzing trace with hash 1969530631, now seen corresponding path program 1 times [2024-11-08 17:02:59,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:02:59,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1253197079] [2024-11-08 17:02:59,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:02:59,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:02:59,082 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:02:59,084 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:02:59,086 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-08 17:02:59,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:02:59,195 INFO L255 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-08 17:02:59,197 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:02:59,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:02:59,248 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:02:59,249 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:02:59,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1253197079] [2024-11-08 17:02:59,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1253197079] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:02:59,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:02:59,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 17:02:59,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374975974] [2024-11-08 17:02:59,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:02:59,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 17:02:59,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:02:59,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 17:02:59,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 17:02:59,251 INFO L87 Difference]: Start difference. First operand 806 states and 886 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:03:00,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:03:00,064 INFO L93 Difference]: Finished difference Result 1120 states and 1245 transitions. [2024-11-08 17:03:00,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 17:03:00,065 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-08 17:03:00,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:03:00,068 INFO L225 Difference]: With dead ends: 1120 [2024-11-08 17:03:00,068 INFO L226 Difference]: Without dead ends: 1120 [2024-11-08 17:03:00,069 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 17:03:00,070 INFO L432 NwaCegarLoop]: 878 mSDtfsCounter, 337 mSDsluCounter, 1506 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 2384 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-08 17:03:00,070 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [337 Valid, 2384 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-08 17:03:00,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1120 states. [2024-11-08 17:03:00,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1120 to 900. [2024-11-08 17:03:00,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 900 states, 539 states have (on average 1.922077922077922) internal successors, (1036), 895 states have internal predecessors, (1036), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 17:03:00,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 900 states to 900 states and 1042 transitions. [2024-11-08 17:03:00,091 INFO L78 Accepts]: Start accepts. Automaton has 900 states and 1042 transitions. Word has length 7 [2024-11-08 17:03:00,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:03:00,092 INFO L471 AbstractCegarLoop]: Abstraction has 900 states and 1042 transitions. [2024-11-08 17:03:00,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:03:00,092 INFO L276 IsEmpty]: Start isEmpty. Operand 900 states and 1042 transitions. [2024-11-08 17:03:00,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-08 17:03:00,092 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:03:00,093 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:03:00,112 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-08 17:03:00,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:03:00,297 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr318ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-08 17:03:00,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:03:00,297 INFO L85 PathProgramCache]: Analyzing trace with hash -1347388552, now seen corresponding path program 1 times [2024-11-08 17:03:00,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:03:00,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1437491579] [2024-11-08 17:03:00,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:03:00,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:03:00,298 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:03:00,300 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:03:00,302 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-08 17:03:00,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:03:00,407 INFO L255 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-08 17:03:00,409 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:03:00,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:03:00,445 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:03:00,445 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:03:00,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1437491579] [2024-11-08 17:03:00,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1437491579] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:03:00,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:03:00,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 17:03:00,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097167003] [2024-11-08 17:03:00,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:03:00,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 17:03:00,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:03:00,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 17:03:00,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 17:03:00,448 INFO L87 Difference]: Start difference. First operand 900 states and 1042 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:03:00,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:03:00,488 INFO L93 Difference]: Finished difference Result 900 states and 1041 transitions. [2024-11-08 17:03:00,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 17:03:00,489 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-08 17:03:00,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:03:00,492 INFO L225 Difference]: With dead ends: 900 [2024-11-08 17:03:00,492 INFO L226 Difference]: Without dead ends: 900 [2024-11-08 17:03:00,492 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 17:03:00,493 INFO L432 NwaCegarLoop]: 809 mSDtfsCounter, 9 mSDsluCounter, 1614 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 2423 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 17:03:00,493 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 2423 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 17:03:00,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 900 states. [2024-11-08 17:03:00,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 900 to 900. [2024-11-08 17:03:00,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 900 states, 539 states have (on average 1.9202226345083488) internal successors, (1035), 895 states have internal predecessors, (1035), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 17:03:00,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 900 states to 900 states and 1041 transitions. [2024-11-08 17:03:00,513 INFO L78 Accepts]: Start accepts. Automaton has 900 states and 1041 transitions. Word has length 9 [2024-11-08 17:03:00,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:03:00,514 INFO L471 AbstractCegarLoop]: Abstraction has 900 states and 1041 transitions. [2024-11-08 17:03:00,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:03:00,514 INFO L276 IsEmpty]: Start isEmpty. Operand 900 states and 1041 transitions. [2024-11-08 17:03:00,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-08 17:03:00,514 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:03:00,515 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:03:00,537 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-08 17:03:00,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:03:00,716 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr424ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-08 17:03:00,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:03:00,717 INFO L85 PathProgramCache]: Analyzing trace with hash 2042972166, now seen corresponding path program 1 times [2024-11-08 17:03:00,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:03:00,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [219630470] [2024-11-08 17:03:00,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:03:00,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:03:00,718 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:03:00,720 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:03:00,722 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-08 17:03:00,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:03:00,839 INFO L255 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 17:03:00,841 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:03:00,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:03:00,878 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:03:00,878 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:03:00,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [219630470] [2024-11-08 17:03:00,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [219630470] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:03:00,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:03:00,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 17:03:00,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334427117] [2024-11-08 17:03:00,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:03:00,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 17:03:00,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:03:00,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 17:03:00,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 17:03:00,881 INFO L87 Difference]: Start difference. First operand 900 states and 1041 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:03:02,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:03:02,142 INFO L93 Difference]: Finished difference Result 902 states and 1042 transitions. [2024-11-08 17:03:02,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 17:03:02,142 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-08 17:03:02,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:03:02,146 INFO L225 Difference]: With dead ends: 902 [2024-11-08 17:03:02,146 INFO L226 Difference]: Without dead ends: 892 [2024-11-08 17:03:02,146 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 17:03:02,147 INFO L432 NwaCegarLoop]: 811 mSDtfsCounter, 2 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1253 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-08 17:03:02,147 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1253 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 370 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-08 17:03:02,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 892 states. [2024-11-08 17:03:02,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 892 to 892. [2024-11-08 17:03:02,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 892 states, 531 states have (on average 1.9303201506591336) internal successors, (1025), 887 states have internal predecessors, (1025), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 17:03:02,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 892 states to 892 states and 1031 transitions. [2024-11-08 17:03:02,165 INFO L78 Accepts]: Start accepts. Automaton has 892 states and 1031 transitions. Word has length 13 [2024-11-08 17:03:02,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:03:02,166 INFO L471 AbstractCegarLoop]: Abstraction has 892 states and 1031 transitions. [2024-11-08 17:03:02,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:03:02,166 INFO L276 IsEmpty]: Start isEmpty. Operand 892 states and 1031 transitions. [2024-11-08 17:03:02,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-08 17:03:02,167 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:03:02,167 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:03:02,184 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-08 17:03:02,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:03:02,368 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-08 17:03:02,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:03:02,368 INFO L85 PathProgramCache]: Analyzing trace with hash -2115082515, now seen corresponding path program 1 times [2024-11-08 17:03:02,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:03:02,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1983504282] [2024-11-08 17:03:02,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:03:02,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:03:02,369 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:03:02,370 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:03:02,371 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-08 17:03:02,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:03:02,508 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-08 17:03:02,510 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:03:02,515 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 [2024-11-08 17:03:02,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:03:02,569 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:03:02,569 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:03:02,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1983504282] [2024-11-08 17:03:02,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1983504282] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:03:02,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:03:02,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 17:03:02,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131950401] [2024-11-08 17:03:02,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:03:02,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 17:03:02,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:03:02,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 17:03:02,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 17:03:02,571 INFO L87 Difference]: Start difference. First operand 892 states and 1031 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:03:04,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:03:04,904 INFO L93 Difference]: Finished difference Result 877 states and 993 transitions. [2024-11-08 17:03:04,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 17:03:04,905 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-11-08 17:03:04,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:03:04,908 INFO L225 Difference]: With dead ends: 877 [2024-11-08 17:03:04,908 INFO L226 Difference]: Without dead ends: 877 [2024-11-08 17:03:04,908 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 17:03:04,910 INFO L432 NwaCegarLoop]: 489 mSDtfsCounter, 570 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 865 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 573 SdHoareTripleChecker+Valid, 922 SdHoareTripleChecker+Invalid, 893 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 865 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-08 17:03:04,910 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [573 Valid, 922 Invalid, 893 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 865 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-08 17:03:04,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 877 states. [2024-11-08 17:03:04,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 877 to 869. [2024-11-08 17:03:04,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 869 states, 531 states have (on average 1.8436911487758945) internal successors, (979), 864 states have internal predecessors, (979), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 17:03:04,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 869 states to 869 states and 985 transitions. [2024-11-08 17:03:04,932 INFO L78 Accepts]: Start accepts. Automaton has 869 states and 985 transitions. Word has length 17 [2024-11-08 17:03:04,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:03:04,932 INFO L471 AbstractCegarLoop]: Abstraction has 869 states and 985 transitions. [2024-11-08 17:03:04,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:03:04,933 INFO L276 IsEmpty]: Start isEmpty. Operand 869 states and 985 transitions. [2024-11-08 17:03:04,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-08 17:03:04,933 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:03:04,933 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:03:04,956 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-08 17:03:05,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:03:05,134 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-08 17:03:05,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:03:05,135 INFO L85 PathProgramCache]: Analyzing trace with hash -2115082514, now seen corresponding path program 1 times [2024-11-08 17:03:05,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:03:05,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [349869027] [2024-11-08 17:03:05,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:03:05,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:03:05,136 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:03:05,137 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:03:05,139 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-08 17:03:05,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:03:05,285 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 17:03:05,286 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:03:05,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:03:05,297 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:03:05,297 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:03:05,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [349869027] [2024-11-08 17:03:05,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [349869027] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:03:05,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:03:05,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 17:03:05,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296947411] [2024-11-08 17:03:05,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:03:05,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 17:03:05,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:03:05,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 17:03:05,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 17:03:05,299 INFO L87 Difference]: Start difference. First operand 869 states and 985 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:03:05,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:03:05,336 INFO L93 Difference]: Finished difference Result 819 states and 919 transitions. [2024-11-08 17:03:05,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 17:03:05,337 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-11-08 17:03:05,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:03:05,339 INFO L225 Difference]: With dead ends: 819 [2024-11-08 17:03:05,339 INFO L226 Difference]: Without dead ends: 819 [2024-11-08 17:03:05,340 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 17:03:05,340 INFO L432 NwaCegarLoop]: 744 mSDtfsCounter, 61 mSDsluCounter, 691 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 1435 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 17:03:05,341 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 1435 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 17:03:05,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2024-11-08 17:03:05,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 819. [2024-11-08 17:03:05,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 819 states, 493 states have (on average 1.8519269776876268) internal successors, (913), 814 states have internal predecessors, (913), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 17:03:05,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 919 transitions. [2024-11-08 17:03:05,356 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 919 transitions. Word has length 17 [2024-11-08 17:03:05,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:03:05,357 INFO L471 AbstractCegarLoop]: Abstraction has 819 states and 919 transitions. [2024-11-08 17:03:05,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:03:05,357 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 919 transitions. [2024-11-08 17:03:05,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-08 17:03:05,358 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:03:05,358 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:03:05,381 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-08 17:03:05,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:03:05,559 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-08 17:03:05,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:03:05,559 INFO L85 PathProgramCache]: Analyzing trace with hash -1141265928, now seen corresponding path program 1 times [2024-11-08 17:03:05,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:03:05,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [411534378] [2024-11-08 17:03:05,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:03:05,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:03:05,560 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:03:05,562 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:03:05,563 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-08 17:03:05,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:03:05,698 INFO L255 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 17:03:05,700 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:03:05,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:03:05,729 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:03:05,729 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:03:05,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [411534378] [2024-11-08 17:03:05,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [411534378] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:03:05,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:03:05,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 17:03:05,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897674729] [2024-11-08 17:03:05,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:03:05,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 17:03:05,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:03:05,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 17:03:05,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 17:03:05,731 INFO L87 Difference]: Start difference. First operand 819 states and 919 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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) [2024-11-08 17:03:05,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:03:05,822 INFO L93 Difference]: Finished difference Result 796 states and 875 transitions. [2024-11-08 17:03:05,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 17:03:05,823 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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 18 [2024-11-08 17:03:05,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:03:05,825 INFO L225 Difference]: With dead ends: 796 [2024-11-08 17:03:05,825 INFO L226 Difference]: Without dead ends: 796 [2024-11-08 17:03:05,826 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 17:03:05,828 INFO L432 NwaCegarLoop]: 706 mSDtfsCounter, 45 mSDsluCounter, 1389 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 2095 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 17:03:05,828 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 2095 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 17:03:05,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 796 states. [2024-11-08 17:03:05,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 796 to 796. [2024-11-08 17:03:05,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 796 states, 477 states have (on average 1.821802935010482) internal successors, (869), 791 states have internal predecessors, (869), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 17:03:05,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 875 transitions. [2024-11-08 17:03:05,845 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 875 transitions. Word has length 18 [2024-11-08 17:03:05,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:03:05,846 INFO L471 AbstractCegarLoop]: Abstraction has 796 states and 875 transitions. [2024-11-08 17:03:05,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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) [2024-11-08 17:03:05,846 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 875 transitions. [2024-11-08 17:03:05,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-08 17:03:05,847 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:03:05,847 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:03:05,868 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-08 17:03:06,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:03:06,048 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-08 17:03:06,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:03:06,053 INFO L85 PathProgramCache]: Analyzing trace with hash 2023947366, now seen corresponding path program 1 times [2024-11-08 17:03:06,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:03:06,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1008116317] [2024-11-08 17:03:06,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:03:06,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:03:06,054 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:03:06,055 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:03:06,059 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-08 17:03:06,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:03:06,227 INFO L255 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-08 17:03:06,230 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:03:06,242 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-08 17:03:06,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:03:06,470 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:03:06,471 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:03:06,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1008116317] [2024-11-08 17:03:06,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1008116317] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:03:06,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:03:06,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 17:03:06,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341908033] [2024-11-08 17:03:06,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:03:06,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 17:03:06,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:03:06,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 17:03:06,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 17:03:06,473 INFO L87 Difference]: Start difference. First operand 796 states and 875 transitions. Second operand has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 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) [2024-11-08 17:03:08,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:03:08,859 INFO L93 Difference]: Finished difference Result 849 states and 892 transitions. [2024-11-08 17:03:08,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 17:03:08,860 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 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 32 [2024-11-08 17:03:08,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:03:08,862 INFO L225 Difference]: With dead ends: 849 [2024-11-08 17:03:08,863 INFO L226 Difference]: Without dead ends: 849 [2024-11-08 17:03:08,863 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 17:03:08,864 INFO L432 NwaCegarLoop]: 735 mSDtfsCounter, 198 mSDsluCounter, 668 mSDsCounter, 0 mSdLazyCounter, 822 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 1403 SdHoareTripleChecker+Invalid, 825 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 822 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-08 17:03:08,864 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 1403 Invalid, 825 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 822 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-08 17:03:08,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 849 states. [2024-11-08 17:03:08,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 849 to 792. [2024-11-08 17:03:08,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 792 states, 477 states have (on average 1.8050314465408805) internal successors, (861), 787 states have internal predecessors, (861), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 17:03:08,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 867 transitions. [2024-11-08 17:03:08,880 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 867 transitions. Word has length 32 [2024-11-08 17:03:08,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:03:08,881 INFO L471 AbstractCegarLoop]: Abstraction has 792 states and 867 transitions. [2024-11-08 17:03:08,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 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) [2024-11-08 17:03:08,881 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 867 transitions. [2024-11-08 17:03:08,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-08 17:03:08,882 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:03:08,882 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:03:08,905 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-08 17:03:09,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:03:09,083 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-08 17:03:09,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:03:09,083 INFO L85 PathProgramCache]: Analyzing trace with hash -577675290, now seen corresponding path program 1 times [2024-11-08 17:03:09,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:03:09,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [947052275] [2024-11-08 17:03:09,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:03:09,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:03:09,084 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:03:09,086 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:03:09,087 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-08 17:03:09,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:03:09,302 INFO L255 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 17:03:09,305 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:03:09,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:03:09,359 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:03:09,359 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:03:09,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [947052275] [2024-11-08 17:03:09,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [947052275] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:03:09,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:03:09,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 17:03:09,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115323795] [2024-11-08 17:03:09,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:03:09,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 17:03:09,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:03:09,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 17:03:09,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 17:03:09,361 INFO L87 Difference]: Start difference. First operand 792 states and 867 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:03:09,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:03:09,432 INFO L93 Difference]: Finished difference Result 780 states and 847 transitions. [2024-11-08 17:03:09,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 17:03:09,433 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2024-11-08 17:03:09,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:03:09,436 INFO L225 Difference]: With dead ends: 780 [2024-11-08 17:03:09,436 INFO L226 Difference]: Without dead ends: 780 [2024-11-08 17:03:09,436 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 17:03:09,437 INFO L432 NwaCegarLoop]: 704 mSDtfsCounter, 21 mSDsluCounter, 1377 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 2081 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 17:03:09,437 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 2081 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 17:03:09,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 780 states. [2024-11-08 17:03:09,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 780 to 780. [2024-11-08 17:03:09,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 780 states, 465 states have (on average 1.8086021505376344) internal successors, (841), 775 states have internal predecessors, (841), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 17:03:09,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 847 transitions. [2024-11-08 17:03:09,454 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 847 transitions. Word has length 51 [2024-11-08 17:03:09,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:03:09,454 INFO L471 AbstractCegarLoop]: Abstraction has 780 states and 847 transitions. [2024-11-08 17:03:09,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:03:09,454 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 847 transitions. [2024-11-08 17:03:09,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-08 17:03:09,456 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:03:09,456 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:03:09,478 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-08 17:03:09,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:03:09,657 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-08 17:03:09,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:03:09,658 INFO L85 PathProgramCache]: Analyzing trace with hash 1173253914, now seen corresponding path program 1 times [2024-11-08 17:03:09,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:03:09,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2029117463] [2024-11-08 17:03:09,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:03:09,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:03:09,659 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:03:09,661 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:03:09,662 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-08 17:03:09,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:03:09,881 INFO L255 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-08 17:03:09,884 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:03:09,898 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 [2024-11-08 17:03:10,562 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 17:03:10,563 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 [2024-11-08 17:03:10,600 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-08 17:03:10,601 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 [2024-11-08 17:03:10,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:03:10,607 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:03:10,607 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:03:10,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2029117463] [2024-11-08 17:03:10,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2029117463] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:03:10,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:03:10,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 17:03:10,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751401869] [2024-11-08 17:03:10,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:03:10,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 17:03:10,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:03:10,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 17:03:10,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 17:03:10,609 INFO L87 Difference]: Start difference. First operand 780 states and 847 transitions. Second operand has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 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) [2024-11-08 17:03:12,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:03:12,923 INFO L93 Difference]: Finished difference Result 742 states and 809 transitions. [2024-11-08 17:03:12,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 17:03:12,923 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 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 59 [2024-11-08 17:03:12,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:03:12,925 INFO L225 Difference]: With dead ends: 742 [2024-11-08 17:03:12,925 INFO L226 Difference]: Without dead ends: 742 [2024-11-08 17:03:12,926 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-08 17:03:12,926 INFO L432 NwaCegarLoop]: 381 mSDtfsCounter, 417 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 912 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 420 SdHoareTripleChecker+Valid, 671 SdHoareTripleChecker+Invalid, 954 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 912 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-08 17:03:12,927 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [420 Valid, 671 Invalid, 954 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 912 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-08 17:03:12,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 742 states. [2024-11-08 17:03:12,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 742 to 705. [2024-11-08 17:03:12,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 705 states, 428 states have (on average 1.7032710280373833) internal successors, (729), 700 states have internal predecessors, (729), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 17:03:12,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 705 states to 705 states and 735 transitions. [2024-11-08 17:03:12,940 INFO L78 Accepts]: Start accepts. Automaton has 705 states and 735 transitions. Word has length 59 [2024-11-08 17:03:12,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:03:12,940 INFO L471 AbstractCegarLoop]: Abstraction has 705 states and 735 transitions. [2024-11-08 17:03:12,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 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) [2024-11-08 17:03:12,941 INFO L276 IsEmpty]: Start isEmpty. Operand 705 states and 735 transitions. [2024-11-08 17:03:12,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-08 17:03:12,941 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:03:12,942 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:03:12,965 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-11-08 17:03:13,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:03:13,142 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr68REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-08 17:03:13,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:03:13,143 INFO L85 PathProgramCache]: Analyzing trace with hash -493315492, now seen corresponding path program 1 times [2024-11-08 17:03:13,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:03:13,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [352941805] [2024-11-08 17:03:13,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:03:13,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:03:13,144 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:03:13,145 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:03:13,147 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-08 17:03:13,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:03:13,420 INFO L255 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-08 17:03:13,427 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:03:13,441 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-08 17:03:13,468 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 [2024-11-08 17:03:13,497 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 [2024-11-08 17:03:13,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:03:13,513 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:03:13,513 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:03:13,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [352941805] [2024-11-08 17:03:13,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [352941805] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:03:13,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:03:13,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 17:03:13,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471688738] [2024-11-08 17:03:13,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:03:13,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 17:03:13,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:03:13,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 17:03:13,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 17:03:13,515 INFO L87 Difference]: Start difference. First operand 705 states and 735 transitions. Second operand has 5 states, 4 states have (on average 16.0) internal successors, (64), 5 states have internal predecessors, (64), 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) [2024-11-08 17:03:15,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:03:15,673 INFO L93 Difference]: Finished difference Result 704 states and 734 transitions. [2024-11-08 17:03:15,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 17:03:15,673 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.0) internal successors, (64), 5 states have internal predecessors, (64), 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 64 [2024-11-08 17:03:15,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:03:15,676 INFO L225 Difference]: With dead ends: 704 [2024-11-08 17:03:15,676 INFO L226 Difference]: Without dead ends: 704 [2024-11-08 17:03:15,677 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-08 17:03:15,677 INFO L432 NwaCegarLoop]: 677 mSDtfsCounter, 2 mSDsluCounter, 1027 mSDsCounter, 0 mSdLazyCounter, 1011 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1704 SdHoareTripleChecker+Invalid, 1012 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1011 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-08 17:03:15,678 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1704 Invalid, 1012 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1011 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-08 17:03:15,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704 states. [2024-11-08 17:03:15,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 704 to 704. [2024-11-08 17:03:15,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 704 states, 428 states have (on average 1.7009345794392523) internal successors, (728), 699 states have internal predecessors, (728), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 17:03:15,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 704 states to 704 states and 734 transitions. [2024-11-08 17:03:15,690 INFO L78 Accepts]: Start accepts. Automaton has 704 states and 734 transitions. Word has length 64 [2024-11-08 17:03:15,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:03:15,690 INFO L471 AbstractCegarLoop]: Abstraction has 704 states and 734 transitions. [2024-11-08 17:03:15,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.0) internal successors, (64), 5 states have internal predecessors, (64), 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) [2024-11-08 17:03:15,691 INFO L276 IsEmpty]: Start isEmpty. Operand 704 states and 734 transitions. [2024-11-08 17:03:15,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-08 17:03:15,692 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:03:15,692 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:03:15,715 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-11-08 17:03:15,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:03:15,893 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr69REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-08 17:03:15,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:03:15,893 INFO L85 PathProgramCache]: Analyzing trace with hash -493315491, now seen corresponding path program 1 times [2024-11-08 17:03:15,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:03:15,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1872129596] [2024-11-08 17:03:15,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:03:15,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:03:15,894 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:03:15,895 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:03:15,896 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-08 17:03:16,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:03:16,133 INFO L255 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-08 17:03:16,136 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:03:16,147 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 [2024-11-08 17:03:16,169 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 [2024-11-08 17:03:16,179 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 [2024-11-08 17:03:16,231 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 [2024-11-08 17:03:16,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:03:16,254 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:03:16,254 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:03:16,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1872129596] [2024-11-08 17:03:16,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1872129596] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:03:16,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:03:16,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 17:03:16,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993290778] [2024-11-08 17:03:16,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:03:16,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 17:03:16,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:03:16,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 17:03:16,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 17:03:16,256 INFO L87 Difference]: Start difference. First operand 704 states and 734 transitions. Second operand has 5 states, 4 states have (on average 16.0) internal successors, (64), 5 states have internal predecessors, (64), 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) [2024-11-08 17:03:19,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:03:19,074 INFO L93 Difference]: Finished difference Result 703 states and 733 transitions. [2024-11-08 17:03:19,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 17:03:19,075 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.0) internal successors, (64), 5 states have internal predecessors, (64), 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 64 [2024-11-08 17:03:19,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:03:19,077 INFO L225 Difference]: With dead ends: 703 [2024-11-08 17:03:19,077 INFO L226 Difference]: Without dead ends: 703 [2024-11-08 17:03:19,077 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-08 17:03:19,078 INFO L432 NwaCegarLoop]: 677 mSDtfsCounter, 1 mSDsluCounter, 1052 mSDsCounter, 0 mSdLazyCounter, 983 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1729 SdHoareTripleChecker+Invalid, 984 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 983 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-08 17:03:19,078 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1729 Invalid, 984 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 983 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-08 17:03:19,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 703 states. [2024-11-08 17:03:19,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 703 to 703. [2024-11-08 17:03:19,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 703 states, 427 states have (on average 1.7025761124121779) internal successors, (727), 698 states have internal predecessors, (727), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 17:03:19,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 703 states to 703 states and 733 transitions. [2024-11-08 17:03:19,091 INFO L78 Accepts]: Start accepts. Automaton has 703 states and 733 transitions. Word has length 64 [2024-11-08 17:03:19,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:03:19,092 INFO L471 AbstractCegarLoop]: Abstraction has 703 states and 733 transitions. [2024-11-08 17:03:19,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.0) internal successors, (64), 5 states have internal predecessors, (64), 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) [2024-11-08 17:03:19,092 INFO L276 IsEmpty]: Start isEmpty. Operand 703 states and 733 transitions. [2024-11-08 17:03:19,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-08 17:03:19,096 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:03:19,097 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:03:19,122 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-11-08 17:03:19,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:03:19,298 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr72REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-08 17:03:19,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:03:19,298 INFO L85 PathProgramCache]: Analyzing trace with hash -108415037, now seen corresponding path program 1 times [2024-11-08 17:03:19,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:03:19,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1192493559] [2024-11-08 17:03:19,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:03:19,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:03:19,299 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:03:19,301 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:03:19,302 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-08 17:03:19,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:03:19,554 INFO L255 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-08 17:03:19,562 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:03:19,573 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 [2024-11-08 17:03:19,682 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 [2024-11-08 17:03:19,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:03:19,700 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:03:19,700 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:03:19,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1192493559] [2024-11-08 17:03:19,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1192493559] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:03:19,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:03:19,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 17:03:19,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810671948] [2024-11-08 17:03:19,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:03:19,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 17:03:19,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:03:19,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 17:03:19,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-08 17:03:19,702 INFO L87 Difference]: Start difference. First operand 703 states and 733 transitions. Second operand has 7 states, 5 states have (on average 14.0) internal successors, (70), 6 states have internal predecessors, (70), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 17:03:22,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:03:22,283 INFO L93 Difference]: Finished difference Result 715 states and 748 transitions. [2024-11-08 17:03:22,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 17:03:22,284 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 14.0) internal successors, (70), 6 states have internal predecessors, (70), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 72 [2024-11-08 17:03:22,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:03:22,288 INFO L225 Difference]: With dead ends: 715 [2024-11-08 17:03:22,288 INFO L226 Difference]: Without dead ends: 715 [2024-11-08 17:03:22,288 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-08 17:03:22,289 INFO L432 NwaCegarLoop]: 669 mSDtfsCounter, 6 mSDsluCounter, 1705 mSDsCounter, 0 mSdLazyCounter, 1023 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 2374 SdHoareTripleChecker+Invalid, 1027 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1023 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-08 17:03:22,289 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 2374 Invalid, 1027 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1023 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-08 17:03:22,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states. [2024-11-08 17:03:22,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 709. [2024-11-08 17:03:22,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 709 states, 432 states have (on average 1.6990740740740742) internal successors, (734), 703 states have internal predecessors, (734), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-08 17:03:22,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 709 states to 709 states and 743 transitions. [2024-11-08 17:03:22,304 INFO L78 Accepts]: Start accepts. Automaton has 709 states and 743 transitions. Word has length 72 [2024-11-08 17:03:22,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:03:22,304 INFO L471 AbstractCegarLoop]: Abstraction has 709 states and 743 transitions. [2024-11-08 17:03:22,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 14.0) internal successors, (70), 6 states have internal predecessors, (70), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 17:03:22,305 INFO L276 IsEmpty]: Start isEmpty. Operand 709 states and 743 transitions. [2024-11-08 17:03:22,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-08 17:03:22,305 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:03:22,306 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:03:22,329 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2024-11-08 17:03:22,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:03:22,510 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-08 17:03:22,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:03:22,510 INFO L85 PathProgramCache]: Analyzing trace with hash -108415036, now seen corresponding path program 1 times [2024-11-08 17:03:22,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:03:22,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [58781578] [2024-11-08 17:03:22,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:03:22,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:03:22,511 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:03:22,514 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:03:22,516 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-11-08 17:03:22,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:03:22,791 INFO L255 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 17:03:22,793 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:03:22,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:03:22,826 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:03:22,826 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:03:22,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [58781578] [2024-11-08 17:03:22,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [58781578] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:03:22,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:03:22,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 17:03:22,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030640685] [2024-11-08 17:03:22,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:03:22,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 17:03:22,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:03:22,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 17:03:22,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 17:03:22,829 INFO L87 Difference]: Start difference. First operand 709 states and 743 transitions. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 17:03:22,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:03:22,879 INFO L93 Difference]: Finished difference Result 706 states and 737 transitions. [2024-11-08 17:03:22,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 17:03:22,880 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 72 [2024-11-08 17:03:22,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:03:22,882 INFO L225 Difference]: With dead ends: 706 [2024-11-08 17:03:22,885 INFO L226 Difference]: Without dead ends: 706 [2024-11-08 17:03:22,885 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 17:03:22,886 INFO L432 NwaCegarLoop]: 677 mSDtfsCounter, 0 mSDsluCounter, 1349 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2026 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 17:03:22,886 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2026 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 17:03:22,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 706 states. [2024-11-08 17:03:22,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 706 to 706. [2024-11-08 17:03:22,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 706 states, 429 states have (on average 1.7016317016317015) internal successors, (730), 701 states have internal predecessors, (730), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-08 17:03:22,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 737 transitions. [2024-11-08 17:03:22,908 INFO L78 Accepts]: Start accepts. Automaton has 706 states and 737 transitions. Word has length 72 [2024-11-08 17:03:22,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:03:22,908 INFO L471 AbstractCegarLoop]: Abstraction has 706 states and 737 transitions. [2024-11-08 17:03:22,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 17:03:22,909 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 737 transitions. [2024-11-08 17:03:22,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-08 17:03:22,909 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:03:22,909 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:03:22,933 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2024-11-08 17:03:23,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:03:23,110 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr72REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-08 17:03:23,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:03:23,111 INFO L85 PathProgramCache]: Analyzing trace with hash -1978774226, now seen corresponding path program 1 times [2024-11-08 17:03:23,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:03:23,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [396096418] [2024-11-08 17:03:23,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:03:23,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:03:23,112 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:03:23,114 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:03:23,115 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-11-08 17:03:23,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:03:23,391 INFO L255 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-08 17:03:23,392 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:03:23,422 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:03:23,422 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:03:23,490 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:03:23,490 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:03:23,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [396096418] [2024-11-08 17:03:23,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [396096418] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 17:03:23,490 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 17:03:23,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-08 17:03:23,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039872345] [2024-11-08 17:03:23,491 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 17:03:23,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 17:03:23,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:03:23,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 17:03:23,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-08 17:03:23,492 INFO L87 Difference]: Start difference. First operand 706 states and 737 transitions. Second operand has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 states have internal predecessors, (75), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-08 17:03:23,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:03:23,674 INFO L93 Difference]: Finished difference Result 718 states and 754 transitions. [2024-11-08 17:03:23,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 17:03:23,675 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 states have internal predecessors, (75), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 73 [2024-11-08 17:03:23,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:03:23,678 INFO L225 Difference]: With dead ends: 718 [2024-11-08 17:03:23,678 INFO L226 Difference]: Without dead ends: 718 [2024-11-08 17:03:23,678 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2024-11-08 17:03:23,679 INFO L432 NwaCegarLoop]: 677 mSDtfsCounter, 7 mSDsluCounter, 2022 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 2699 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 17:03:23,679 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 2699 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 17:03:23,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 718 states. [2024-11-08 17:03:23,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 718 to 716. [2024-11-08 17:03:23,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 716 states, 438 states have (on average 1.7009132420091324) internal successors, (745), 710 states have internal predecessors, (745), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-08 17:03:23,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 716 states to 716 states and 752 transitions. [2024-11-08 17:03:23,691 INFO L78 Accepts]: Start accepts. Automaton has 716 states and 752 transitions. Word has length 73 [2024-11-08 17:03:23,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:03:23,692 INFO L471 AbstractCegarLoop]: Abstraction has 716 states and 752 transitions. [2024-11-08 17:03:23,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 states have internal predecessors, (75), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-08 17:03:23,692 INFO L276 IsEmpty]: Start isEmpty. Operand 716 states and 752 transitions. [2024-11-08 17:03:23,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-08 17:03:23,693 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:03:23,693 INFO L215 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:03:23,717 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2024-11-08 17:03:23,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:03:23,894 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr72REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-08 17:03:23,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:03:23,895 INFO L85 PathProgramCache]: Analyzing trace with hash 1085880963, now seen corresponding path program 2 times [2024-11-08 17:03:23,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:03:23,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1939058442] [2024-11-08 17:03:23,895 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-08 17:03:23,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:03:23,896 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:03:23,897 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:03:23,899 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-11-08 17:03:30,590 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-08 17:03:30,590 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 17:03:30,601 INFO L255 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-08 17:03:30,605 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:03:30,756 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-08 17:03:30,756 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 [2024-11-08 17:03:30,781 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 [2024-11-08 17:03:31,028 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:03:31,028 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 [2024-11-08 17:03:31,077 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 [2024-11-08 17:03:31,104 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-08 17:03:31,104 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:03:31,217 INFO L349 Elim1Store]: treesize reduction 7, result has 63.2 percent of original size [2024-11-08 17:03:31,217 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 25 treesize of output 24 [2024-11-08 17:03:31,231 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_883 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_#t~mem33#1.base| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_883) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))) is different from false [2024-11-08 17:03:31,234 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:03:31,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1939058442] [2024-11-08 17:03:31,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1939058442] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:03:31,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1652721745] [2024-11-08 17:03:31,234 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-08 17:03:31,234 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-08 17:03:31,235 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/cvc4 [2024-11-08 17:03:31,242 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-08 17:03:31,244 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/cvc4 --incremental --print-success --lang smt (20)] Waiting until timeout for monitored process [2024-11-08 17:03:32,122 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-08 17:03:32,122 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 17:03:32,147 INFO L255 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-08 17:03:32,148 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:03:32,336 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:03:32,336 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:03:32,705 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:03:32,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1652721745] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 17:03:32,706 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 17:03:32,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 24 [2024-11-08 17:03:32,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029154177] [2024-11-08 17:03:32,707 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 17:03:32,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-08 17:03:32,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:03:32,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-08 17:03:32,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=513, Unknown=1, NotChecked=46, Total=650 [2024-11-08 17:03:32,709 INFO L87 Difference]: Start difference. First operand 716 states and 752 transitions. Second operand has 24 states, 23 states have (on average 6.086956521739131) internal successors, (140), 23 states have internal predecessors, (140), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-08 17:03:41,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:03:41,227 INFO L93 Difference]: Finished difference Result 732 states and 775 transitions. [2024-11-08 17:03:41,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-11-08 17:03:41,228 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 6.086956521739131) internal successors, (140), 23 states have internal predecessors, (140), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 76 [2024-11-08 17:03:41,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:03:41,230 INFO L225 Difference]: With dead ends: 732 [2024-11-08 17:03:41,230 INFO L226 Difference]: Without dead ends: 728 [2024-11-08 17:03:41,231 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 205 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 472 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=413, Invalid=2242, Unknown=1, NotChecked=100, Total=2756 [2024-11-08 17:03:41,232 INFO L432 NwaCegarLoop]: 455 mSDtfsCounter, 433 mSDsluCounter, 5517 mSDsCounter, 0 mSdLazyCounter, 4055 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 437 SdHoareTripleChecker+Valid, 5972 SdHoareTripleChecker+Invalid, 4084 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 4055 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.5s IncrementalHoareTripleChecker+Time [2024-11-08 17:03:41,232 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [437 Valid, 5972 Invalid, 4084 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 4055 Invalid, 0 Unknown, 0 Unchecked, 7.5s Time] [2024-11-08 17:03:41,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2024-11-08 17:03:41,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 724. [2024-11-08 17:03:41,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 724 states, 447 states have (on average 1.691275167785235) internal successors, (756), 718 states have internal predecessors, (756), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-08 17:03:41,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 724 states to 724 states and 763 transitions. [2024-11-08 17:03:41,244 INFO L78 Accepts]: Start accepts. Automaton has 724 states and 763 transitions. Word has length 76 [2024-11-08 17:03:41,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:03:41,245 INFO L471 AbstractCegarLoop]: Abstraction has 724 states and 763 transitions. [2024-11-08 17:03:41,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 6.086956521739131) internal successors, (140), 23 states have internal predecessors, (140), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-08 17:03:41,245 INFO L276 IsEmpty]: Start isEmpty. Operand 724 states and 763 transitions. [2024-11-08 17:03:41,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-08 17:03:41,246 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:03:41,246 INFO L215 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:03:41,253 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/cvc4 --incremental --print-success --lang smt (20)] Ended with exit code 0 [2024-11-08 17:03:41,469 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2024-11-08 17:03:41,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/cvc4 --incremental --print-success --lang smt,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:03:41,647 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-08 17:03:41,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:03:41,647 INFO L85 PathProgramCache]: Analyzing trace with hash -1037522268, now seen corresponding path program 1 times [2024-11-08 17:03:41,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:03:41,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [784280155] [2024-11-08 17:03:41,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:03:41,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:03:41,648 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:03:41,649 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:03:41,651 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2024-11-08 17:03:41,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:03:41,962 INFO L255 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-08 17:03:41,964 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:03:42,137 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:03:42,137 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:03:42,916 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:03:42,916 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:03:42,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [784280155] [2024-11-08 17:03:42,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [784280155] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 17:03:42,917 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 17:03:42,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-11-08 17:03:42,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766151263] [2024-11-08 17:03:42,917 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 17:03:42,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-08 17:03:42,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:03:42,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-08 17:03:42,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-11-08 17:03:42,919 INFO L87 Difference]: Start difference. First operand 724 states and 763 transitions. Second operand has 26 states, 26 states have (on average 3.576923076923077) internal successors, (93), 26 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-08 17:03:45,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:03:45,136 INFO L93 Difference]: Finished difference Result 748 states and 802 transitions. [2024-11-08 17:03:45,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-11-08 17:03:45,137 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.576923076923077) internal successors, (93), 26 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 82 [2024-11-08 17:03:45,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:03:45,148 INFO L225 Difference]: With dead ends: 748 [2024-11-08 17:03:45,148 INFO L226 Difference]: Without dead ends: 742 [2024-11-08 17:03:45,149 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=728, Invalid=1434, Unknown=0, NotChecked=0, Total=2162 [2024-11-08 17:03:45,149 INFO L432 NwaCegarLoop]: 677 mSDtfsCounter, 14 mSDsluCounter, 13451 mSDsCounter, 0 mSdLazyCounter, 600 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 14128 SdHoareTripleChecker+Invalid, 605 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 600 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-08 17:03:45,150 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 14128 Invalid, 605 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 600 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-08 17:03:45,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 742 states. [2024-11-08 17:03:45,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 742 to 742. [2024-11-08 17:03:45,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 742 states, 465 states have (on average 1.675268817204301) internal successors, (779), 736 states have internal predecessors, (779), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-08 17:03:45,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 742 states to 742 states and 786 transitions. [2024-11-08 17:03:45,168 INFO L78 Accepts]: Start accepts. Automaton has 742 states and 786 transitions. Word has length 82 [2024-11-08 17:03:45,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:03:45,168 INFO L471 AbstractCegarLoop]: Abstraction has 742 states and 786 transitions. [2024-11-08 17:03:45,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.576923076923077) internal successors, (93), 26 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-08 17:03:45,169 INFO L276 IsEmpty]: Start isEmpty. Operand 742 states and 786 transitions. [2024-11-08 17:03:45,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-08 17:03:45,173 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:03:45,173 INFO L215 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:03:45,199 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2024-11-08 17:03:45,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:03:45,374 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-08 17:03:45,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:03:45,375 INFO L85 PathProgramCache]: Analyzing trace with hash -2127314204, now seen corresponding path program 2 times [2024-11-08 17:03:45,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:03:45,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [592205568] [2024-11-08 17:03:45,376 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-08 17:03:45,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:03:45,377 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:03:45,380 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:03:45,381 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2024-11-08 17:03:56,028 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-08 17:03:56,029 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 17:03:56,046 INFO L255 TraceCheckSpWp]: Trace formula consists of 532 conjuncts, 64 conjuncts are in the unsatisfiable core [2024-11-08 17:03:56,054 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:03:56,171 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 [2024-11-08 17:03:56,187 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-08 17:03:56,188 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 [2024-11-08 17:03:56,220 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 [2024-11-08 17:03:56,226 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 [2024-11-08 17:03:56,352 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-08 17:03:56,359 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 [2024-11-08 17:03:56,979 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:03:56,980 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-08 17:03:56,997 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 [2024-11-08 17:03:57,056 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 [2024-11-08 17:03:57,067 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 [2024-11-08 17:03:57,097 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2024-11-08 17:03:57,097 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:03:57,770 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_1458 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1459 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv20 32) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_1459) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_1458) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_1459 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_1459) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv16 32) .cse1) (bvadd (_ bv20 32) .cse1)))))) is different from false [2024-11-08 17:03:57,777 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:03:57,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [592205568] [2024-11-08 17:03:57,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [592205568] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:03:57,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1145468921] [2024-11-08 17:03:57,777 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-08 17:03:57,778 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-08 17:03:57,778 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/cvc4 [2024-11-08 17:03:57,780 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-08 17:03:57,781 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/cvc4 --incremental --print-success --lang smt (23)] Waiting until timeout for monitored process [2024-11-08 17:03:58,804 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-08 17:03:58,804 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 17:03:58,815 INFO L255 TraceCheckSpWp]: Trace formula consists of 532 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-08 17:03:58,817 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:03:59,841 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:03:59,841 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:04:02,346 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:04:02,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1145468921] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 17:04:02,346 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 17:04:02,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 26, 26] total 58 [2024-11-08 17:04:02,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165092842] [2024-11-08 17:04:02,347 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 17:04:02,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2024-11-08 17:04:02,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:04:02,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2024-11-08 17:04:02,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=699, Invalid=2844, Unknown=1, NotChecked=116, Total=3660 [2024-11-08 17:04:02,351 INFO L87 Difference]: Start difference. First operand 742 states and 786 transitions. Second operand has 58 states, 57 states have (on average 3.087719298245614) internal successors, (176), 58 states have internal predecessors, (176), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-08 17:04:36,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:04:36,920 INFO L93 Difference]: Finished difference Result 785 states and 859 transitions. [2024-11-08 17:04:36,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2024-11-08 17:04:36,921 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 57 states have (on average 3.087719298245614) internal successors, (176), 58 states have internal predecessors, (176), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 94 [2024-11-08 17:04:36,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:04:36,924 INFO L225 Difference]: With dead ends: 785 [2024-11-08 17:04:36,924 INFO L226 Difference]: Without dead ends: 777 [2024-11-08 17:04:36,928 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 360 GetRequests, 225 SyntacticMatches, 1 SemanticMatches, 134 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 3088 ImplicationChecksByTransitivity, 12.8s TimeCoverageRelationStatistics Valid=3106, Invalid=14987, Unknown=1, NotChecked=266, Total=18360 [2024-11-08 17:04:36,929 INFO L432 NwaCegarLoop]: 455 mSDtfsCounter, 449 mSDsluCounter, 12484 mSDsCounter, 0 mSdLazyCounter, 10693 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 452 SdHoareTripleChecker+Valid, 12939 SdHoareTripleChecker+Invalid, 10743 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 10693 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.8s IncrementalHoareTripleChecker+Time [2024-11-08 17:04:36,930 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [452 Valid, 12939 Invalid, 10743 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [50 Valid, 10693 Invalid, 0 Unknown, 0 Unchecked, 24.8s Time] [2024-11-08 17:04:36,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 777 states. [2024-11-08 17:04:36,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 777 to 775. [2024-11-08 17:04:36,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 775 states, 499 states have (on average 1.6432865731462927) internal successors, (820), 769 states have internal predecessors, (820), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-08 17:04:36,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 827 transitions. [2024-11-08 17:04:36,945 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 827 transitions. Word has length 94 [2024-11-08 17:04:36,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:04:36,945 INFO L471 AbstractCegarLoop]: Abstraction has 775 states and 827 transitions. [2024-11-08 17:04:36,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 57 states have (on average 3.087719298245614) internal successors, (176), 58 states have internal predecessors, (176), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-08 17:04:36,946 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 827 transitions. [2024-11-08 17:04:36,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-08 17:04:36,947 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:04:36,947 INFO L215 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:04:37,002 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2024-11-08 17:04:37,154 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/cvc4 --incremental --print-success --lang smt (23)] Forceful destruction successful, exit code 0 [2024-11-08 17:04:37,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/cvc4 --incremental --print-success --lang smt [2024-11-08 17:04:37,348 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-08 17:04:37,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:04:37,349 INFO L85 PathProgramCache]: Analyzing trace with hash -2082781119, now seen corresponding path program 1 times [2024-11-08 17:04:37,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:04:37,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1874477746] [2024-11-08 17:04:37,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:04:37,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:04:37,350 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:04:37,351 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:04:37,352 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2024-11-08 17:04:37,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:04:37,838 INFO L255 TraceCheckSpWp]: Trace formula consists of 794 conjuncts, 59 conjuncts are in the unsatisfiable core [2024-11-08 17:04:37,846 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:04:38,007 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-08 17:04:38,008 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 [2024-11-08 17:04:38,045 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 [2024-11-08 17:04:38,511 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:04:38,511 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 31 treesize of output 32 [2024-11-08 17:04:38,585 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:04:38,585 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 [2024-11-08 17:04:38,641 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 [2024-11-08 17:04:38,665 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-08 17:04:38,665 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:04:38,746 INFO L349 Elim1Store]: treesize reduction 7, result has 63.2 percent of original size [2024-11-08 17:04:38,747 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 25 treesize of output 24 [2024-11-08 17:04:38,758 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2084 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_#t~mem35#1.base| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_2084) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))) is different from false [2024-11-08 17:04:38,770 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2084 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (= .cse0 (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2084) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) is different from false [2024-11-08 17:04:39,255 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2130 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2084 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_2130)) (.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= (select (select (store .cse0 .cse1 v_ArrVal_2084) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) .cse1)))) is different from false [2024-11-08 17:04:39,257 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:04:39,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1874477746] [2024-11-08 17:04:39,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1874477746] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:04:39,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [685742728] [2024-11-08 17:04:39,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:04:39,258 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-08 17:04:39,258 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/cvc4 [2024-11-08 17:04:39,259 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-08 17:04:39,261 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/cvc4 --incremental --print-success --lang smt (25)] Waiting until timeout for monitored process [2024-11-08 17:04:42,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:04:42,157 INFO L255 TraceCheckSpWp]: Trace formula consists of 794 conjuncts, 63 conjuncts are in the unsatisfiable core [2024-11-08 17:04:42,168 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:04:42,222 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-08 17:04:42,223 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 [2024-11-08 17:04:42,729 INFO L349 Elim1Store]: treesize reduction 54, result has 29.9 percent of original size [2024-11-08 17:04:42,730 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 43 [2024-11-08 17:04:42,847 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-08 17:04:43,116 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 34 treesize of output 16 [2024-11-08 17:04:45,045 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:04:45,045 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 54 treesize of output 51 [2024-11-08 17:04:45,305 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:04:45,305 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 54 treesize of output 51 [2024-11-08 17:04:45,367 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 43 treesize of output 19 [2024-11-08 17:04:45,489 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-08 17:04:45,489 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:04:45,512 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2537 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_2537) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))))) is different from false [2024-11-08 17:04:45,524 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2537 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_2537) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-08 17:04:46,000 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2583 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2537 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_2583))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2537)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-08 17:04:46,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [685742728] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:04:46,004 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 17:04:46,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 20 [2024-11-08 17:04:46,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364964563] [2024-11-08 17:04:46,008 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 17:04:46,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-08 17:04:46,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:04:46,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-08 17:04:46,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=386, Unknown=6, NotChecked=270, Total=756 [2024-11-08 17:04:46,010 INFO L87 Difference]: Start difference. First operand 775 states and 827 transitions. Second operand has 21 states, 18 states have (on average 8.333333333333334) internal successors, (150), 21 states have internal predecessors, (150), 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) [2024-11-08 17:04:56,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:04:56,893 INFO L93 Difference]: Finished difference Result 1428 states and 1529 transitions. [2024-11-08 17:04:56,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-08 17:04:56,894 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 18 states have (on average 8.333333333333334) internal successors, (150), 21 states have internal predecessors, (150), 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) Word has length 119 [2024-11-08 17:04:56,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:04:56,899 INFO L225 Difference]: With dead ends: 1428 [2024-11-08 17:04:56,899 INFO L226 Difference]: Without dead ends: 1428 [2024-11-08 17:04:56,900 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 223 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=177, Invalid=897, Unknown=6, NotChecked=402, Total=1482 [2024-11-08 17:04:56,901 INFO L432 NwaCegarLoop]: 362 mSDtfsCounter, 964 mSDsluCounter, 4057 mSDsCounter, 0 mSdLazyCounter, 4501 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 970 SdHoareTripleChecker+Valid, 4419 SdHoareTripleChecker+Invalid, 4524 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 4501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.4s IncrementalHoareTripleChecker+Time [2024-11-08 17:04:56,901 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [970 Valid, 4419 Invalid, 4524 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [23 Valid, 4501 Invalid, 0 Unknown, 0 Unchecked, 10.4s Time] [2024-11-08 17:04:56,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1428 states. [2024-11-08 17:04:56,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1428 to 774. [2024-11-08 17:04:56,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 774 states, 499 states have (on average 1.6412825651302605) internal successors, (819), 768 states have internal predecessors, (819), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-08 17:04:56,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774 states to 774 states and 826 transitions. [2024-11-08 17:04:56,918 INFO L78 Accepts]: Start accepts. Automaton has 774 states and 826 transitions. Word has length 119 [2024-11-08 17:04:56,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:04:56,918 INFO L471 AbstractCegarLoop]: Abstraction has 774 states and 826 transitions. [2024-11-08 17:04:56,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 18 states have (on average 8.333333333333334) internal successors, (150), 21 states have internal predecessors, (150), 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) [2024-11-08 17:04:56,919 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states and 826 transitions. [2024-11-08 17:04:56,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-08 17:04:56,920 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:04:56,921 INFO L215 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:04:56,953 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2024-11-08 17:04:57,131 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/cvc4 --incremental --print-success --lang smt (25)] Forceful destruction successful, exit code 0 [2024-11-08 17:04:57,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/cvc4 --incremental --print-success --lang smt [2024-11-08 17:04:57,322 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-08 17:04:57,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:04:57,322 INFO L85 PathProgramCache]: Analyzing trace with hash -2082781118, now seen corresponding path program 1 times [2024-11-08 17:04:57,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:04:57,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [307768705] [2024-11-08 17:04:57,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:04:57,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:04:57,324 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:04:57,329 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:04:57,330 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2024-11-08 17:04:57,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:04:57,903 INFO L255 TraceCheckSpWp]: Trace formula consists of 794 conjuncts, 111 conjuncts are in the unsatisfiable core [2024-11-08 17:04:57,916 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:04:58,061 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 [2024-11-08 17:04:58,076 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-08 17:04:58,076 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 [2024-11-08 17:04:58,111 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 [2024-11-08 17:04:58,123 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 [2024-11-08 17:04:58,273 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-08 17:04:58,278 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 [2024-11-08 17:04:59,287 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:04:59,287 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 [2024-11-08 17:04:59,307 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 [2024-11-08 17:04:59,486 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:04:59,486 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-08 17:04:59,500 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 [2024-11-08 17:04:59,543 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 [2024-11-08 17:04:59,555 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 [2024-11-08 17:04:59,605 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-08 17:04:59,605 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:04:59,861 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_3035 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3034 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_3034) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_3035) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_3034 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_3034) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd .cse1 (_ bv4 32)) (bvadd .cse1 (_ bv8 32))))))) is different from false [2024-11-08 17:04:59,899 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_3035 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3034 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_3034) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_3035) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_3034 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_3034) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse2 (_ bv4 32)) (bvadd .cse2 (_ bv8 32)))))))) is different from false [2024-11-08 17:05:01,800 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_3127 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3126 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3034 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_3127) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_3126) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3034) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_3127 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3126 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3035 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3034 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_3126))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_3127) .cse2 v_ArrVal_3034) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv8 32)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_3035) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2024-11-08 17:05:01,808 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:05:01,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [307768705] [2024-11-08 17:05:01,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [307768705] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:05:01,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1497985426] [2024-11-08 17:05:01,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:05:01,809 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-08 17:05:01,809 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/cvc4 [2024-11-08 17:05:01,810 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-08 17:05:01,812 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/cvc4 --incremental --print-success --lang smt (27)] Waiting until timeout for monitored process [2024-11-08 17:05:05,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:05:05,114 INFO L255 TraceCheckSpWp]: Trace formula consists of 794 conjuncts, 112 conjuncts are in the unsatisfiable core [2024-11-08 17:05:05,131 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:05:05,138 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 [2024-11-08 17:05:05,321 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 [2024-11-08 17:05:05,338 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-08 17:05:05,339 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 [2024-11-08 17:05:05,357 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 [2024-11-08 17:05:05,369 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 [2024-11-08 17:05:05,450 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-08 17:05:05,457 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 [2024-11-08 17:05:06,410 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:05:06,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 [2024-11-08 17:05:06,420 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 [2024-11-08 17:05:06,506 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:05:06,507 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 [2024-11-08 17:05:06,517 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 [2024-11-08 17:05:06,548 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 [2024-11-08 17:05:06,556 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 [2024-11-08 17:05:06,564 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-08 17:05:06,565 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:05:06,623 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_3579 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3580 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_3579) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_3580) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_3579 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_3579) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv4 32) .cse1) (bvadd (_ bv8 32) .cse1)))))) is different from false [2024-11-08 17:05:06,652 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_3579 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3580 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_3579) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_3580) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_3579 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_3579) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse2 (_ bv4 32)) (bvadd .cse2 (_ bv8 32)))))))) is different from false [2024-11-08 17:05:08,395 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_3579 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3672 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3671 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_3672) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_3671) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3579) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_3579 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3672 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3580 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3671 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_3671))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_3672) .cse2 v_ArrVal_3579) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_3580) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2024-11-08 17:05:08,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1497985426] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:05:08,404 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 17:05:08,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 10 [2024-11-08 17:05:08,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175319242] [2024-11-08 17:05:08,405 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 17:05:08,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-08 17:05:08,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:05:08,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-08 17:05:08,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=132, Unknown=6, NotChecked=162, Total=342 [2024-11-08 17:05:08,407 INFO L87 Difference]: Start difference. First operand 774 states and 826 transitions. Second operand has 11 states, 9 states have (on average 11.555555555555555) internal successors, (104), 11 states have internal predecessors, (104), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 17:05:14,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:05:14,881 INFO L93 Difference]: Finished difference Result 773 states and 825 transitions. [2024-11-08 17:05:14,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-08 17:05:14,882 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 11.555555555555555) internal successors, (104), 11 states have internal predecessors, (104), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 119 [2024-11-08 17:05:14,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:05:14,885 INFO L225 Difference]: With dead ends: 773 [2024-11-08 17:05:14,885 INFO L226 Difference]: Without dead ends: 773 [2024-11-08 17:05:14,885 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 230 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=77, Invalid=283, Unknown=6, NotChecked=234, Total=600 [2024-11-08 17:05:14,886 INFO L432 NwaCegarLoop]: 455 mSDtfsCounter, 385 mSDsluCounter, 1569 mSDsCounter, 0 mSdLazyCounter, 2265 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 387 SdHoareTripleChecker+Valid, 2024 SdHoareTripleChecker+Invalid, 2272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 2265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2024-11-08 17:05:14,887 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [387 Valid, 2024 Invalid, 2272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 2265 Invalid, 0 Unknown, 0 Unchecked, 6.2s Time] [2024-11-08 17:05:14,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 773 states. [2024-11-08 17:05:14,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 773 to 773. [2024-11-08 17:05:14,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 773 states, 499 states have (on average 1.6392785571142285) internal successors, (818), 767 states have internal predecessors, (818), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-08 17:05:14,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 825 transitions. [2024-11-08 17:05:14,902 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 825 transitions. Word has length 119 [2024-11-08 17:05:14,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:05:14,903 INFO L471 AbstractCegarLoop]: Abstraction has 773 states and 825 transitions. [2024-11-08 17:05:14,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 11.555555555555555) internal successors, (104), 11 states have internal predecessors, (104), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 17:05:14,903 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 825 transitions. [2024-11-08 17:05:14,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-08 17:05:14,905 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:05:14,905 INFO L215 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:05:14,943 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2024-11-08 17:05:15,117 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/cvc4 --incremental --print-success --lang smt (27)] Ended with exit code 0 [2024-11-08 17:05:15,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/cvc4 --incremental --print-success --lang smt [2024-11-08 17:05:15,306 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-08 17:05:15,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:05:15,307 INFO L85 PathProgramCache]: Analyzing trace with hash 1260503146, now seen corresponding path program 1 times [2024-11-08 17:05:15,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:05:15,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1434402312] [2024-11-08 17:05:15,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:05:15,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:05:15,308 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:05:15,309 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:05:15,310 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2024-11-08 17:05:15,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:05:15,961 INFO L255 TraceCheckSpWp]: Trace formula consists of 823 conjuncts, 61 conjuncts are in the unsatisfiable core [2024-11-08 17:05:15,970 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:05:16,102 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-08 17:05:16,102 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 [2024-11-08 17:05:16,123 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 [2024-11-08 17:05:16,889 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:05:16,889 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 [2024-11-08 17:05:17,009 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:05:17,010 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 [2024-11-08 17:05:17,104 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:05:17,104 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 [2024-11-08 17:05:17,124 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 [2024-11-08 17:05:17,153 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-08 17:05:17,153 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:05:17,272 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4093 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_4093) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-08 17:05:17,295 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4093 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4092 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4092))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4093)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-08 17:05:17,312 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4093 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4092 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4092))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4093)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-08 17:05:17,839 INFO L349 Elim1Store]: treesize reduction 7, result has 87.3 percent of original size [2024-11-08 17:05:17,840 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 61 treesize of output 60 [2024-11-08 17:05:17,860 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4093 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4139 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4092 (Array (_ BitVec 32) (_ BitVec 32)))) (= (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4139))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4092)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4093)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |c_ULTIMATE.start_main_#t~mem33#1.base|)) is different from false [2024-11-08 17:05:17,864 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:05:17,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1434402312] [2024-11-08 17:05:17,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1434402312] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:05:17,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1655451071] [2024-11-08 17:05:17,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:05:17,865 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-08 17:05:17,865 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/cvc4 [2024-11-08 17:05:17,869 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-08 17:05:17,873 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/cvc4 --incremental --print-success --lang smt (29)] Waiting until timeout for monitored process [2024-11-08 17:05:29,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:05:29,250 INFO L255 TraceCheckSpWp]: Trace formula consists of 823 conjuncts, 65 conjuncts are in the unsatisfiable core [2024-11-08 17:05:29,260 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:05:29,320 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-08 17:05:29,320 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 [2024-11-08 17:05:29,726 INFO L349 Elim1Store]: treesize reduction 54, result has 29.9 percent of original size [2024-11-08 17:05:29,726 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 43 [2024-11-08 17:05:29,808 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-08 17:05:30,067 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 16 [2024-11-08 17:05:31,543 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:05:31,544 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 54 treesize of output 51 [2024-11-08 17:05:31,806 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:05:31,806 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 51 [2024-11-08 17:05:31,967 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:05:31,968 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 54 treesize of output 51 [2024-11-08 17:05:32,014 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 19 [2024-11-08 17:05:32,096 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-08 17:05:32,097 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:05:32,112 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4562 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_4562) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))))) is different from false [2024-11-08 17:05:32,121 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4562 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_4562) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-08 17:05:32,137 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4562 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4561 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4561))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4562)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-08 17:05:32,148 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4562 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4561 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4561))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4562)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-08 17:05:32,607 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4608 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4562 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4561 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4608))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4561)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4562)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-08 17:05:32,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1655451071] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:05:32,611 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 17:05:32,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 23 [2024-11-08 17:05:32,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498432060] [2024-11-08 17:05:32,611 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 17:05:32,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-08 17:05:32,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:05:32,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-08 17:05:32,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=547, Unknown=17, NotChecked=504, Total=1190 [2024-11-08 17:05:32,613 INFO L87 Difference]: Start difference. First operand 773 states and 825 transitions. Second operand has 24 states, 21 states have (on average 7.428571428571429) internal successors, (156), 23 states have internal predecessors, (156), 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) [2024-11-08 17:05:45,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:05:45,985 INFO L93 Difference]: Finished difference Result 1424 states and 1525 transitions. [2024-11-08 17:05:45,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-11-08 17:05:45,986 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 7.428571428571429) internal successors, (156), 23 states have internal predecessors, (156), 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) Word has length 122 [2024-11-08 17:05:45,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:05:45,991 INFO L225 Difference]: With dead ends: 1424 [2024-11-08 17:05:45,991 INFO L226 Difference]: Without dead ends: 1424 [2024-11-08 17:05:45,992 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 228 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 429 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=254, Invalid=1483, Unknown=21, NotChecked=792, Total=2550 [2024-11-08 17:05:45,992 INFO L432 NwaCegarLoop]: 360 mSDtfsCounter, 1565 mSDsluCounter, 4755 mSDsCounter, 0 mSdLazyCounter, 5245 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1571 SdHoareTripleChecker+Valid, 5115 SdHoareTripleChecker+Invalid, 5274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 5245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.6s IncrementalHoareTripleChecker+Time [2024-11-08 17:05:45,993 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1571 Valid, 5115 Invalid, 5274 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [29 Valid, 5245 Invalid, 0 Unknown, 0 Unchecked, 12.6s Time] [2024-11-08 17:05:45,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1424 states. [2024-11-08 17:05:46,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1424 to 772. [2024-11-08 17:05:46,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 772 states, 499 states have (on average 1.6372745490981964) internal successors, (817), 766 states have internal predecessors, (817), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-08 17:05:46,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 772 states and 824 transitions. [2024-11-08 17:05:46,011 INFO L78 Accepts]: Start accepts. Automaton has 772 states and 824 transitions. Word has length 122 [2024-11-08 17:05:46,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:05:46,012 INFO L471 AbstractCegarLoop]: Abstraction has 772 states and 824 transitions. [2024-11-08 17:05:46,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 7.428571428571429) internal successors, (156), 23 states have internal predecessors, (156), 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) [2024-11-08 17:05:46,013 INFO L276 IsEmpty]: Start isEmpty. Operand 772 states and 824 transitions. [2024-11-08 17:05:46,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-08 17:05:46,014 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:05:46,014 INFO L215 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:05:46,052 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2024-11-08 17:05:46,238 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/cvc4 --incremental --print-success --lang smt (29)] Forceful destruction successful, exit code 0 [2024-11-08 17:05:46,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/cvc4 --incremental --print-success --lang smt [2024-11-08 17:05:46,416 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-08 17:05:46,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:05:46,416 INFO L85 PathProgramCache]: Analyzing trace with hash 1260503147, now seen corresponding path program 1 times [2024-11-08 17:05:46,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:05:46,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [906814748] [2024-11-08 17:05:46,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:05:46,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:05:46,418 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:05:46,420 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:05:46,422 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2024-11-08 17:05:47,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:05:47,230 INFO L255 TraceCheckSpWp]: Trace formula consists of 823 conjuncts, 114 conjuncts are in the unsatisfiable core [2024-11-08 17:05:47,244 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:05:47,371 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-08 17:05:47,371 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 [2024-11-08 17:05:47,378 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-08 17:05:47,414 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 [2024-11-08 17:05:47,422 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 [2024-11-08 17:05:47,584 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-08 17:05:47,590 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 [2024-11-08 17:05:48,478 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:05:48,478 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-08 17:05:48,488 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 [2024-11-08 17:05:48,637 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:05:48,638 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 [2024-11-08 17:05:48,648 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 [2024-11-08 17:05:48,765 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:05:48,766 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 [2024-11-08 17:05:48,776 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 [2024-11-08 17:05:48,808 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 [2024-11-08 17:05:48,816 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 [2024-11-08 17:05:48,849 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-08 17:05:48,849 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:05:49,023 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5076 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_5076) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd (_ bv12 32) .cse0)))) (forall ((v_ArrVal_5076 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5077 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv12 32) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_5076) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_5077) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-08 17:05:49,054 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_5076 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5077 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv12 32) (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_5076) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_5077) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_5076 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_5076) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse2) (bvadd (_ bv12 32) .cse2))))))) is different from false [2024-11-08 17:05:49,137 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5074 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5075 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5076 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_5075) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_5074) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5076) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd (_ bv12 32) .cse0)))) (forall ((v_ArrVal_5074 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5075 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5076 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5077 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_5074))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv12 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_5075) .cse2 v_ArrVal_5076) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_5077) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2024-11-08 17:05:49,231 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_5074 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5075 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5076 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_5075) (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_5074) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_5076) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd (_ bv12 32) .cse0)))) (forall ((v_ArrVal_5074 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5075 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5076 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5077 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_5074))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv12 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_5075) .cse3 v_ArrVal_5076) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_5077) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false [2024-11-08 17:05:51,223 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5074 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5075 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5168 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5169 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5076 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_5168))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_5169) .cse1 v_ArrVal_5075) (select (select (store .cse2 .cse1 v_ArrVal_5074) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_5076))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd (_ bv12 32) .cse0)))) (forall ((v_ArrVal_5074 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5075 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5168 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5169 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5076 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5077 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_5168))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_5074))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv12 32) (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_5169) .cse4 v_ArrVal_5075) .cse5 v_ArrVal_5076) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_5077) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) is different from false [2024-11-08 17:05:51,239 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:05:51,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [906814748] [2024-11-08 17:05:51,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [906814748] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:05:51,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2063168038] [2024-11-08 17:05:51,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:05:51,239 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-08 17:05:51,239 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/cvc4 [2024-11-08 17:05:51,241 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-08 17:05:51,242 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/cvc4 --incremental --print-success --lang smt (31)] Waiting until timeout for monitored process [2024-11-08 17:06:04,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:06:04,079 INFO L255 TraceCheckSpWp]: Trace formula consists of 823 conjuncts, 117 conjuncts are in the unsatisfiable core [2024-11-08 17:06:04,093 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:06:04,100 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 [2024-11-08 17:06:04,416 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-08 17:06:04,416 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 [2024-11-08 17:06:04,432 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-08 17:06:04,463 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 [2024-11-08 17:06:04,489 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 [2024-11-08 17:06:04,599 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-08 17:06:04,607 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 [2024-11-08 17:06:06,116 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:06:06,116 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 [2024-11-08 17:06:06,137 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 [2024-11-08 17:06:06,274 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:06:06,274 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 [2024-11-08 17:06:06,291 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 [2024-11-08 17:06:06,401 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:06:06,401 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 [2024-11-08 17:06:06,423 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 [2024-11-08 17:06:06,468 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 [2024-11-08 17:06:06,481 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 [2024-11-08 17:06:06,483 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-08 17:06:06,483 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:06:06,570 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5639 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_5639) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_5639 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5640 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_5639) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_5640) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-08 17:06:06,608 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_5639 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5640 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv12 32) (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_5639) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_5640) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_5639 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_5639) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse2) (bvadd (_ bv12 32) .cse2))))))) is different from false [2024-11-08 17:06:06,696 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5638 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5639 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5637 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_5638) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_5637) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5639) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd (_ bv12 32) .cse0)))) (forall ((v_ArrVal_5638 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5639 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5637 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5640 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_5637))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv12 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_5638) .cse2 v_ArrVal_5639) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_5640) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2024-11-08 17:06:06,783 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_5638 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5639 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5637 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5640 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_5637))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv12 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_5638) .cse1 v_ArrVal_5639) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_5640) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_5638 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5639 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5637 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_5638) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_5637) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_5639) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse4) (bvadd (_ bv12 32) .cse4))))))) is different from false [2024-11-08 17:06:09,214 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5638 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5639 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5637 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5731 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5732 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5640 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_5731))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_5637))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv12 32) (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_5732) .cse0 v_ArrVal_5638) .cse1 v_ArrVal_5639) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_5640) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_5638 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5639 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5637 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5731 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5732 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_5731))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_5732) .cse6 v_ArrVal_5638) (select (select (store .cse7 .cse6 v_ArrVal_5637) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_5639))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse5) (bvadd (_ bv12 32) .cse5)))))) is different from false [2024-11-08 17:06:09,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2063168038] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:06:09,224 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 17:06:09,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 11 [2024-11-08 17:06:09,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307460735] [2024-11-08 17:06:09,225 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 17:06:09,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-08 17:06:09,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:06:09,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-08 17:06:09,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=158, Unknown=10, NotChecked=330, Total=552 [2024-11-08 17:06:09,226 INFO L87 Difference]: Start difference. First operand 772 states and 824 transitions. Second operand has 12 states, 10 states have (on average 10.7) internal successors, (107), 12 states have internal predecessors, (107), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 17:06:27,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:06:27,071 INFO L93 Difference]: Finished difference Result 771 states and 823 transitions. [2024-11-08 17:06:27,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-08 17:06:27,072 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 10.7) internal successors, (107), 12 states have internal predecessors, (107), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 122 [2024-11-08 17:06:27,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:06:27,074 INFO L225 Difference]: With dead ends: 771 [2024-11-08 17:06:27,074 INFO L226 Difference]: Without dead ends: 771 [2024-11-08 17:06:27,074 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 237 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=96, Invalid=354, Unknown=10, NotChecked=470, Total=930 [2024-11-08 17:06:27,075 INFO L432 NwaCegarLoop]: 454 mSDtfsCounter, 383 mSDsluCounter, 2586 mSDsCounter, 0 mSdLazyCounter, 3911 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 385 SdHoareTripleChecker+Valid, 3040 SdHoareTripleChecker+Invalid, 3918 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 3911 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.2s IncrementalHoareTripleChecker+Time [2024-11-08 17:06:27,075 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [385 Valid, 3040 Invalid, 3918 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [7 Valid, 3911 Invalid, 0 Unknown, 0 Unchecked, 17.2s Time] [2024-11-08 17:06:27,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 771 states. [2024-11-08 17:06:27,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 771 to 771. [2024-11-08 17:06:27,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 771 states, 499 states have (on average 1.6352705410821644) internal successors, (816), 765 states have internal predecessors, (816), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-08 17:06:27,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 823 transitions. [2024-11-08 17:06:27,089 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 823 transitions. Word has length 122 [2024-11-08 17:06:27,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:06:27,090 INFO L471 AbstractCegarLoop]: Abstraction has 771 states and 823 transitions. [2024-11-08 17:06:27,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 10.7) internal successors, (107), 12 states have internal predecessors, (107), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 17:06:27,091 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 823 transitions. [2024-11-08 17:06:27,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-08 17:06:27,092 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:06:27,093 INFO L215 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:06:27,131 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2024-11-08 17:06:27,316 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/cvc4 --incremental --print-success --lang smt (31)] Forceful destruction successful, exit code 0 [2024-11-08 17:06:27,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/cvc4 --incremental --print-success --lang smt [2024-11-08 17:06:27,497 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr84REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-08 17:06:27,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:06:27,497 INFO L85 PathProgramCache]: Analyzing trace with hash 750454472, now seen corresponding path program 1 times [2024-11-08 17:06:27,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:06:27,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2116789356] [2024-11-08 17:06:27,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:06:27,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:06:27,498 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:06:27,500 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:06:27,501 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2024-11-08 17:06:28,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:06:28,284 INFO L255 TraceCheckSpWp]: Trace formula consists of 852 conjuncts, 63 conjuncts are in the unsatisfiable core [2024-11-08 17:06:28,293 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:06:28,608 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-08 17:06:28,608 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 [2024-11-08 17:06:28,654 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 [2024-11-08 17:06:29,806 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:06:29,807 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 [2024-11-08 17:06:30,038 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:06:30,038 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 [2024-11-08 17:06:30,219 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:06:30,220 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 [2024-11-08 17:06:30,409 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:06:30,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 44 treesize of output 43 [2024-11-08 17:06:30,449 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2024-11-08 17:06:30,540 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-08 17:06:30,540 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:06:30,771 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6169 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_6169) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-08 17:06:30,798 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6169 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6168 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_6168))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6169)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-08 17:06:30,818 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6169 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6168 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6168))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6169)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-08 17:06:30,848 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6169 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6167 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6168 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_6167))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6168)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6169)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-08 17:06:30,871 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6169 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6167 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6168 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6167))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6168)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6169)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-08 17:06:31,662 INFO L349 Elim1Store]: treesize reduction 7, result has 93.2 percent of original size [2024-11-08 17:06:31,662 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 109 treesize of output 108 [2024-11-08 17:06:31,685 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6169 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6215 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6167 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6168 (Array (_ BitVec 32) (_ BitVec 32)))) (= (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_6215))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6167)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6168)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6169)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |c_ULTIMATE.start_main_#t~mem33#1.base|)) is different from false [2024-11-08 17:06:31,690 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:06:31,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2116789356] [2024-11-08 17:06:31,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2116789356] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:06:31,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1127455194] [2024-11-08 17:06:31,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:06:31,691 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-08 17:06:31,691 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/cvc4 [2024-11-08 17:06:31,692 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-08 17:06:31,694 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/cvc4 --incremental --print-success --lang smt (33)] Waiting until timeout for monitored process [2024-11-08 17:06:49,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:06:49,669 INFO L255 TraceCheckSpWp]: Trace formula consists of 852 conjuncts, 68 conjuncts are in the unsatisfiable core [2024-11-08 17:06:49,679 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:06:49,802 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-08 17:06:49,803 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 [2024-11-08 17:06:50,702 INFO L349 Elim1Store]: treesize reduction 54, result has 29.9 percent of original size [2024-11-08 17:06:50,702 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 43 [2024-11-08 17:06:50,877 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-08 17:06:51,377 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 16 [2024-11-08 17:06:54,605 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:06:54,605 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 54 treesize of output 51 [2024-11-08 17:06:55,088 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:06:55,089 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 54 treesize of output 51 [2024-11-08 17:06:55,416 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:06:55,416 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 51 [2024-11-08 17:06:55,750 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:06:55,750 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 54 treesize of output 51 [2024-11-08 17:06:55,842 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 43 treesize of output 19 [2024-11-08 17:06:56,018 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-08 17:06:56,018 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:06:56,208 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6169 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6654 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_6654))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6169)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-08 17:06:56,231 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6169 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6654 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6654))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6169)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-08 17:06:56,262 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6653 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6169 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6654 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_6653))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6654)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6169)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-08 17:06:56,286 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6653 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6169 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6654 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6653))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6654)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6169)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-08 17:06:56,969 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6701 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6653 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6169 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6654 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_6701))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6653)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6654)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6169)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-08 17:06:56,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1127455194] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:06:56,975 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 17:06:56,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 25 [2024-11-08 17:06:56,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664817949] [2024-11-08 17:06:56,976 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 17:06:56,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-08 17:06:56,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:06:56,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-08 17:06:56,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=640, Unknown=19, NotChecked=682, Total=1482 [2024-11-08 17:06:56,978 INFO L87 Difference]: Start difference. First operand 771 states and 823 transitions. Second operand has 26 states, 23 states have (on average 7.043478260869565) internal successors, (162), 25 states have internal predecessors, (162), 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) [2024-11-08 17:07:17,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:07:17,054 INFO L93 Difference]: Finished difference Result 1420 states and 1521 transitions. [2024-11-08 17:07:17,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-11-08 17:07:17,055 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 23 states have (on average 7.043478260869565) internal successors, (162), 25 states have internal predecessors, (162), 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) Word has length 125 [2024-11-08 17:07:17,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:07:17,059 INFO L225 Difference]: With dead ends: 1420 [2024-11-08 17:07:17,059 INFO L226 Difference]: Without dead ends: 1420 [2024-11-08 17:07:17,060 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 235 SyntacticMatches, 2 SemanticMatches, 54 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 514 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=285, Invalid=1715, Unknown=24, NotChecked=1056, Total=3080 [2024-11-08 17:07:17,061 INFO L432 NwaCegarLoop]: 359 mSDtfsCounter, 1247 mSDsluCounter, 4533 mSDsCounter, 0 mSdLazyCounter, 5057 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1253 SdHoareTripleChecker+Valid, 4892 SdHoareTripleChecker+Invalid, 5082 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 5057 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.8s IncrementalHoareTripleChecker+Time [2024-11-08 17:07:17,061 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1253 Valid, 4892 Invalid, 5082 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [25 Valid, 5057 Invalid, 0 Unknown, 0 Unchecked, 18.8s Time] [2024-11-08 17:07:17,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1420 states. [2024-11-08 17:07:17,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1420 to 770. [2024-11-08 17:07:17,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 770 states, 499 states have (on average 1.6332665330661322) internal successors, (815), 764 states have internal predecessors, (815), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-08 17:07:17,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 770 states to 770 states and 822 transitions. [2024-11-08 17:07:17,076 INFO L78 Accepts]: Start accepts. Automaton has 770 states and 822 transitions. Word has length 125 [2024-11-08 17:07:17,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:07:17,076 INFO L471 AbstractCegarLoop]: Abstraction has 770 states and 822 transitions. [2024-11-08 17:07:17,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 23 states have (on average 7.043478260869565) internal successors, (162), 25 states have internal predecessors, (162), 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) [2024-11-08 17:07:17,077 INFO L276 IsEmpty]: Start isEmpty. Operand 770 states and 822 transitions. [2024-11-08 17:07:17,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-08 17:07:17,078 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:07:17,078 INFO L215 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:07:17,106 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/cvc4 --incremental --print-success --lang smt (33)] Ended with exit code 0 [2024-11-08 17:07:17,299 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2024-11-08 17:07:17,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/cvc4 --incremental --print-success --lang smt,32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:07:17,479 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr85REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-08 17:07:17,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:07:17,479 INFO L85 PathProgramCache]: Analyzing trace with hash 750454473, now seen corresponding path program 1 times [2024-11-08 17:07:17,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:07:17,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [783295085] [2024-11-08 17:07:17,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:07:17,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:07:17,480 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:07:17,481 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:07:17,482 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2024-11-08 17:07:18,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:07:18,256 INFO L255 TraceCheckSpWp]: Trace formula consists of 852 conjuncts, 117 conjuncts are in the unsatisfiable core [2024-11-08 17:07:18,267 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:07:18,651 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-08 17:07:18,651 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 [2024-11-08 17:07:18,664 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-08 17:07:18,721 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 [2024-11-08 17:07:18,729 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 [2024-11-08 17:07:18,957 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-08 17:07:18,966 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 [2024-11-08 17:07:20,377 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:07:20,377 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-08 17:07:20,393 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 [2024-11-08 17:07:20,603 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:07:20,604 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-08 17:07:20,617 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 [2024-11-08 17:07:20,798 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:07:20,799 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-08 17:07:20,814 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 [2024-11-08 17:07:21,009 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:07:21,010 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 [2024-11-08 17:07:21,025 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 [2024-11-08 17:07:21,074 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 [2024-11-08 17:07:21,088 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 [2024-11-08 17:07:21,151 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-08 17:07:21,151 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:07:21,426 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7186 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7187 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_7186) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_7187) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_7186 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_7186) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd .cse1 (_ bv20 32)) (bvadd .cse1 (_ bv24 32))))))) is different from false [2024-11-08 17:07:21,463 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_7186 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_7186) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_7186 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7187 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_7186) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_7187) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2024-11-08 17:07:21,554 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7184 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7185 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7186 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7185) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7184) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7186) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv20 32) .cse0) (bvadd (_ bv24 32) .cse0)))) (forall ((v_ArrVal_7184 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7185 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7186 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7187 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7184))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv24 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7185) .cse2 v_ArrVal_7186) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_7187) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2024-11-08 17:07:21,680 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_7184 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7185 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7186 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_7185) (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_7184) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_7186) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_7184 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7185 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7186 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7187 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_7184))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_7185) .cse3 v_ArrVal_7186) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_7187) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false [2024-11-08 17:07:21,798 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7184 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7185 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7186 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7187 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7182 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7183 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7183))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_7184))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv24 32) (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7182) .cse0 v_ArrVal_7185) .cse1 v_ArrVal_7186) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_7187) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_7184 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7185 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7186 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7182 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7183 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7183))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7182) .cse6 v_ArrVal_7185) (select (select (store .cse7 .cse6 v_ArrVal_7184) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_7186))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv20 32) .cse5) (bvadd (_ bv24 32) .cse5)))))) is different from false [2024-11-08 17:07:21,892 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (and (forall ((v_ArrVal_7184 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7185 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7186 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7187 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7182 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7183 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_7183))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_7184))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv24 32) (select (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_7182) .cse1 v_ArrVal_7185) .cse2 v_ArrVal_7186) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_7187) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))) (forall ((v_ArrVal_7184 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7185 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7186 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7182 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7183 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (select (select (let ((.cse8 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_7183))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_7182) .cse7 v_ArrVal_7185) (select (select (store .cse8 .cse7 v_ArrVal_7184) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_7186))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv20 32) .cse6) (bvadd (_ bv24 32) .cse6))))))) is different from false [2024-11-08 17:07:23,833 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7184 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7185 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7186 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7182 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7183 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7278 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7279 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse5 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_7278))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_ArrVal_7183))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_7279) .cse1 v_ArrVal_7182) .cse2 v_ArrVal_7185) (select (select (store .cse3 .cse2 v_ArrVal_7184) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_7186))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (_ bv20 32) .cse0) (bvadd (_ bv24 32) .cse0)))) (forall ((v_ArrVal_7184 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7185 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7186 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7187 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7182 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7183 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7278 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7279 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse11 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_7278))) (let ((.cse6 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse10 (store .cse11 .cse6 v_ArrVal_7183))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_7184))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (_ bv24 32) (select (select (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_7279) .cse6 v_ArrVal_7182) .cse7 v_ArrVal_7185) .cse8 v_ArrVal_7186) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (select |c_#length| (select (select (store .cse9 .cse8 v_ArrVal_7187) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))))))) is different from false [2024-11-08 17:07:23,852 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:07:23,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [783295085] [2024-11-08 17:07:23,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [783295085] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:07:23,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [780748580] [2024-11-08 17:07:23,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:07:23,853 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-08 17:07:23,853 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/cvc4 [2024-11-08 17:07:23,854 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-08 17:07:23,855 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/cvc4 --incremental --print-success --lang smt (35)] Waiting until timeout for monitored process [2024-11-08 17:07:39,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:07:39,708 INFO L255 TraceCheckSpWp]: Trace formula consists of 852 conjuncts, 119 conjuncts are in the unsatisfiable core [2024-11-08 17:07:39,721 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:07:39,731 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 [2024-11-08 17:07:40,031 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 [2024-11-08 17:07:40,062 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-08 17:07:40,062 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 [2024-11-08 17:07:40,086 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 [2024-11-08 17:07:40,100 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 [2024-11-08 17:07:40,213 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-08 17:07:40,221 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-08 17:07:41,632 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:07:41,633 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 [2024-11-08 17:07:41,647 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 [2024-11-08 17:07:41,790 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:07:41,790 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 [2024-11-08 17:07:41,809 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 [2024-11-08 17:07:41,940 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:07:41,940 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 [2024-11-08 17:07:41,962 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 [2024-11-08 17:07:42,061 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:07:42,061 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 [2024-11-08 17:07:42,077 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 [2024-11-08 17:07:42,128 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 [2024-11-08 17:07:42,141 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 [2024-11-08 17:07:42,142 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-08 17:07:42,142 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:07:42,446 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_7765 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_7765) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv20 32) .cse0) (bvadd (_ bv24 32) .cse0)))) (forall ((v_ArrVal_7766 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7765 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv24 32) (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_7765) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_7766) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2024-11-08 17:07:42,576 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7765 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7764 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7763 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7763) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7764) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7765) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_7766 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7765 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7764 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7763 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7764))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7763) .cse2 v_ArrVal_7765) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_7766) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2024-11-08 17:07:42,654 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_7766 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7765 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7764 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7763 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_7764))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv24 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_7763) .cse1 v_ArrVal_7765) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_7766) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_7765 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7764 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7763 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_7763) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_7764) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_7765) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv20 32) .cse4) (bvadd (_ bv24 32) .cse4))))))) is different from false [2024-11-08 17:07:42,807 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7766 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7765 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7764 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7763 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7762 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7761 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7761))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_7764))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv24 32) (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7762) .cse0 v_ArrVal_7763) .cse1 v_ArrVal_7765) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_7766) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_7765 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7764 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7763 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7762 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7761 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7761))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7762) .cse6 v_ArrVal_7763) (select (select (store .cse7 .cse6 v_ArrVal_7764) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_7765))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv20 32) .cse5) (bvadd (_ bv24 32) .cse5)))))) is different from false [2024-11-08 17:07:42,991 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (and (forall ((v_ArrVal_7766 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7765 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7764 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7763 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7762 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7761 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_7761))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_7764))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv24 32) (select (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_7762) .cse1 v_ArrVal_7763) .cse2 v_ArrVal_7765) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_7766) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))) (forall ((v_ArrVal_7765 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7764 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7763 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7762 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7761 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (select (select (let ((.cse8 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_7761))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_7762) .cse7 v_ArrVal_7763) (select (select (store .cse8 .cse7 v_ArrVal_7764) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_7765))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv20 32) .cse6) (bvadd (_ bv24 32) .cse6))))))) is different from false [2024-11-08 17:07:49,003 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7858 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7857 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7766 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7765 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7764 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7763 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7762 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7761 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_7857))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_7761))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_7764))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv24 32) (select (select (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_7858) .cse0 v_ArrVal_7762) .cse1 v_ArrVal_7763) .cse2 v_ArrVal_7765) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_7766) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) (forall ((v_ArrVal_7858 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7857 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7765 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7764 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7763 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7762 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7761 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (select (select (let ((.cse11 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_7857))) (let ((.cse8 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse10 (store .cse11 .cse8 v_ArrVal_7761))) (let ((.cse9 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_7858) .cse8 v_ArrVal_7762) .cse9 v_ArrVal_7763) (select (select (store .cse10 .cse9 v_ArrVal_7764) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_7765))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv20 32) .cse7) (bvadd (_ bv24 32) .cse7)))))) is different from false [2024-11-08 17:07:49,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [780748580] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:07:49,042 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 17:07:49,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 12 [2024-11-08 17:07:49,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407344475] [2024-11-08 17:07:49,042 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 17:07:49,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-08 17:07:49,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:07:49,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-08 17:07:49,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=207, Unknown=18, NotChecked=520, Total=812 [2024-11-08 17:07:49,044 INFO L87 Difference]: Start difference. First operand 770 states and 822 transitions. Second operand has 13 states, 11 states have (on average 10.0) internal successors, (110), 13 states have internal predecessors, (110), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 17:09:00,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:09:00,825 INFO L93 Difference]: Finished difference Result 769 states and 821 transitions. [2024-11-08 17:09:00,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-08 17:09:00,825 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 10.0) internal successors, (110), 13 states have internal predecessors, (110), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 125 [2024-11-08 17:09:00,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:09:00,828 INFO L225 Difference]: With dead ends: 769 [2024-11-08 17:09:00,828 INFO L226 Difference]: Without dead ends: 769 [2024-11-08 17:09:00,828 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 244 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=117, Invalid=468, Unknown=19, NotChecked=728, Total=1332 [2024-11-08 17:09:00,829 INFO L432 NwaCegarLoop]: 453 mSDtfsCounter, 381 mSDsluCounter, 2071 mSDsCounter, 0 mSdLazyCounter, 3093 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 66.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 383 SdHoareTripleChecker+Valid, 2524 SdHoareTripleChecker+Invalid, 3100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 3093 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 67.9s IncrementalHoareTripleChecker+Time [2024-11-08 17:09:00,829 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [383 Valid, 2524 Invalid, 3100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 3093 Invalid, 0 Unknown, 0 Unchecked, 67.9s Time] [2024-11-08 17:09:00,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 769 states. [2024-11-08 17:09:00,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 769 to 769. [2024-11-08 17:09:00,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 769 states, 499 states have (on average 1.6312625250501003) internal successors, (814), 763 states have internal predecessors, (814), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-08 17:09:00,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 769 states to 769 states and 821 transitions. [2024-11-08 17:09:00,838 INFO L78 Accepts]: Start accepts. Automaton has 769 states and 821 transitions. Word has length 125 [2024-11-08 17:09:00,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:09:00,839 INFO L471 AbstractCegarLoop]: Abstraction has 769 states and 821 transitions. [2024-11-08 17:09:00,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 10.0) internal successors, (110), 13 states have internal predecessors, (110), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 17:09:00,839 INFO L276 IsEmpty]: Start isEmpty. Operand 769 states and 821 transitions. [2024-11-08 17:09:00,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-08 17:09:00,840 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:09:00,840 INFO L215 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:09:00,870 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2024-11-08 17:09:01,060 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/cvc4 --incremental --print-success --lang smt (35)] Forceful destruction successful, exit code 0 [2024-11-08 17:09:01,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,35 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/cvc4 --incremental --print-success --lang smt [2024-11-08 17:09:01,241 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr88REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-08 17:09:01,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:09:01,242 INFO L85 PathProgramCache]: Analyzing trace with hash -1218706294, now seen corresponding path program 1 times [2024-11-08 17:09:01,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:09:01,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [193882476] [2024-11-08 17:09:01,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:09:01,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:09:01,243 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:09:01,244 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:09:01,245 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2024-11-08 17:09:02,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:02,070 INFO L255 TraceCheckSpWp]: Trace formula consists of 889 conjuncts, 67 conjuncts are in the unsatisfiable core [2024-11-08 17:09:02,078 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:09:04,297 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-08 17:09:04,297 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 [2024-11-08 17:09:04,584 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 [2024-11-08 17:09:11,461 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:09:11,462 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 [2024-11-08 17:09:12,923 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:09:12,923 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 [2024-11-08 17:09:13,992 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:09:13,993 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 [2024-11-08 17:09:15,111 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:09:15,112 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2024-11-08 17:09:16,251 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:09:16,252 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 [2024-11-08 17:09:16,458 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 [2024-11-08 17:09:17,378 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2024-11-08 17:09:17,379 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 20 [2024-11-08 17:09:17,420 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-08 17:09:17,420 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:09:18,733 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8313 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_8313) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))))) is different from false [2024-11-08 17:09:18,828 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8313 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_8313) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-08 17:09:18,967 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8313 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8312 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_8312))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8313)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-08 17:09:19,080 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8313 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8312 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8312))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8313)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-08 17:09:19,221 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8313 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8312 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8311 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_8311))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8312)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8313)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-08 17:09:19,331 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8313 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8312 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8311 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8311))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8312)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8313)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-08 17:09:19,479 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8313 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8312 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8311 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8310 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_8310))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8311)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8312)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8313)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (_ bv0 1))) is different from false [2024-11-08 17:09:23,142 INFO L349 Elim1Store]: treesize reduction 7, result has 96.5 percent of original size [2024-11-08 17:09:23,142 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 205 treesize of output 204 [2024-11-08 17:09:23,225 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8360 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8313 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8312 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8311 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8310 (Array (_ BitVec 32) (_ BitVec 32)))) (= (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_8360))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8310)))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8311)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8312)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8313)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |c_ULTIMATE.start_main_#t~mem33#1.base|)) is different from false [2024-11-08 17:09:23,249 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:09:23,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [193882476] [2024-11-08 17:09:23,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [193882476] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:09:23,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [376177166] [2024-11-08 17:09:23,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:09:23,249 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-08 17:09:23,249 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/cvc4 [2024-11-08 17:09:23,250 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-08 17:09:23,252 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/cvc4 --incremental --print-success --lang smt (37)] Waiting until timeout for monitored process [2024-11-08 17:09:29,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:29,851 INFO L255 TraceCheckSpWp]: Trace formula consists of 889 conjuncts, 73 conjuncts are in the unsatisfiable core [2024-11-08 17:09:29,859 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:09:30,689 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-08 17:09:30,689 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 [2024-11-08 17:09:36,600 INFO L349 Elim1Store]: treesize reduction 54, result has 29.9 percent of original size [2024-11-08 17:09:36,600 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 43 [2024-11-08 17:09:37,731 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-08 17:09:40,467 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 16 [2024-11-08 17:09:58,938 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:09:58,938 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 54 treesize of output 51 [2024-11-08 17:10:01,465 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:10:01,465 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 54 treesize of output 51 [2024-11-08 17:10:03,395 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:10:03,395 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 54 treesize of output 51 [2024-11-08 17:10:05,221 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:10:05,222 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 54 treesize of output 51 [2024-11-08 17:10:07,165 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:10:07,166 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 54 treesize of output 51 [2024-11-08 17:10:07,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 43 treesize of output 19 [2024-11-08 17:10:09,909 INFO L349 Elim1Store]: treesize reduction 82, result has 29.3 percent of original size [2024-11-08 17:10:09,910 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 35 treesize of output 52 [2024-11-08 17:10:10,112 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-08 17:10:10,112 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:10:11,019 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8818 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_8818) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))))) is different from false [2024-11-08 17:10:11,112 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8818 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_8818) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-08 17:10:11,264 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8818 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8817 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_8817))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8818)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-08 17:10:11,359 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8818 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8817 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8817))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8818)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-08 17:10:11,499 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8818 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8817 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8816 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_8816))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8817)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8818)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-08 17:10:11,597 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8818 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8817 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8816 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8816))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8817)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8818)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2024-11-08 17:10:11,741 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8818 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8817 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8816 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8815 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_8815))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8816)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8817)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8818)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-08 17:10:11,844 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8818 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8817 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8816 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8815 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8815))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8816)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8817)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8818)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-08 17:10:15,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [376177166] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:10:15,588 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 17:10:15,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 28 [2024-11-08 17:10:15,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639601685] [2024-11-08 17:10:15,589 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 17:10:15,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-08 17:10:15,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:10:15,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-08 17:10:15,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=848, Unknown=21, NotChecked=1200, Total=2256 [2024-11-08 17:10:15,591 INFO L87 Difference]: Start difference. First operand 769 states and 821 transitions. Second operand has 29 states, 26 states have (on average 6.538461538461538) internal successors, (170), 27 states have internal predecessors, (170), 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) [2024-11-08 17:12:04,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:12:04,499 INFO L93 Difference]: Finished difference Result 1416 states and 1517 transitions. [2024-11-08 17:12:04,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-11-08 17:12:04,499 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 26 states have (on average 6.538461538461538) internal successors, (170), 27 states have internal predecessors, (170), 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) Word has length 129 [2024-11-08 17:12:04,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:12:04,502 INFO L225 Difference]: With dead ends: 1416 [2024-11-08 17:12:04,502 INFO L226 Difference]: Without dead ends: 1416 [2024-11-08 17:12:04,502 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 241 SyntacticMatches, 3 SemanticMatches, 62 ConstructedPredicates, 16 IntricatePredicates, 0 DeprecatedPredicates, 635 ImplicationChecksByTransitivity, 26.9s TimeCoverageRelationStatistics Valid=338, Invalid=1960, Unknown=22, NotChecked=1712, Total=4032 [2024-11-08 17:12:04,503 INFO L432 NwaCegarLoop]: 358 mSDtfsCounter, 1530 mSDsluCounter, 4228 mSDsCounter, 0 mSdLazyCounter, 4747 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 100.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1536 SdHoareTripleChecker+Valid, 4586 SdHoareTripleChecker+Invalid, 4776 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 4747 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 102.0s IncrementalHoareTripleChecker+Time [2024-11-08 17:12:04,503 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1536 Valid, 4586 Invalid, 4776 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [29 Valid, 4747 Invalid, 0 Unknown, 0 Unchecked, 102.0s Time] [2024-11-08 17:12:04,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1416 states. [2024-11-08 17:12:04,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1416 to 768. [2024-11-08 17:12:04,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 768 states, 499 states have (on average 1.629258517034068) internal successors, (813), 762 states have internal predecessors, (813), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-08 17:12:04,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 768 states to 768 states and 820 transitions. [2024-11-08 17:12:04,512 INFO L78 Accepts]: Start accepts. Automaton has 768 states and 820 transitions. Word has length 129 [2024-11-08 17:12:04,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:12:04,512 INFO L471 AbstractCegarLoop]: Abstraction has 768 states and 820 transitions. [2024-11-08 17:12:04,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 26 states have (on average 6.538461538461538) internal successors, (170), 27 states have internal predecessors, (170), 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) [2024-11-08 17:12:04,512 INFO L276 IsEmpty]: Start isEmpty. Operand 768 states and 820 transitions. [2024-11-08 17:12:04,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-08 17:12:04,514 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:12:04,514 INFO L215 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:12:04,541 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/cvc4 --incremental --print-success --lang smt (37)] Ended with exit code 0 [2024-11-08 17:12:04,734 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2024-11-08 17:12:04,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/cvc4 --incremental --print-success --lang smt,36 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:12:04,915 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr89REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-08 17:12:04,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:12:04,915 INFO L85 PathProgramCache]: Analyzing trace with hash -1218706293, now seen corresponding path program 1 times [2024-11-08 17:12:04,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:12:04,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1220524477] [2024-11-08 17:12:04,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:12:04,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:12:04,916 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:12:04,917 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:12:04,918 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2024-11-08 17:12:05,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:12:05,794 INFO L255 TraceCheckSpWp]: Trace formula consists of 889 conjuncts, 123 conjuncts are in the unsatisfiable core [2024-11-08 17:12:05,807 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:12:08,150 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-08 17:12:08,151 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 [2024-11-08 17:12:08,234 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-08 17:12:08,609 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 [2024-11-08 17:12:08,664 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 [2024-11-08 17:12:10,066 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-08 17:12:10,112 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 [2024-11-08 17:12:22,178 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:12:22,179 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 68 [2024-11-08 17:12:22,268 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 [2024-11-08 17:12:24,435 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:12:24,435 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 68 [2024-11-08 17:12:24,521 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 [2024-11-08 17:12:25,998 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:12:25,998 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 68 [2024-11-08 17:12:26,153 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 [2024-11-08 17:12:27,622 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:12:27,622 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 68 [2024-11-08 17:12:27,708 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 [2024-11-08 17:12:29,330 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:12:29,330 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 68 [2024-11-08 17:12:29,417 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 [2024-11-08 17:12:29,884 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 20 [2024-11-08 17:12:30,009 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 [2024-11-08 17:12:30,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 17:12:31,017 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-11-08 17:12:31,017 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 21 [2024-11-08 17:12:31,245 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-08 17:12:31,246 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 [2024-11-08 17:12:31,846 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-08 17:12:31,847 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:12:40,770 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (or (forall ((|v_ULTIMATE.start_main_#t~malloc40#1.base_8| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_8|)))) (forall ((v_ArrVal_9370 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_9370) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule .cse0 (bvadd (_ bv4 32) .cse0))))) (forall ((|v_ULTIMATE.start_main_#t~malloc40#1.base_8| (_ BitVec 32)) (v_ArrVal_9370 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9369 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_9371 (_ BitVec 32))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_9370) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc40#1.base_8| v_ArrVal_9371) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_9369) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_8|))))))) is different from false [2024-11-08 17:12:41,188 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((|v_ULTIMATE.start_main_#t~malloc40#1.base_8| (_ BitVec 32)) (v_ArrVal_9370 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9369 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_8|))) (forall ((v_ArrVal_9371 (_ BitVec 32))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_9370) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv4 32)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc40#1.base_8| v_ArrVal_9371) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_9369) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc40#1.base_8| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_8|)))) (forall ((v_ArrVal_9370 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_9370) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule .cse2 (bvadd .cse2 (_ bv4 32))))))))) is different from false [2024-11-08 17:12:41,918 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_main_#t~malloc40#1.base_8| (_ BitVec 32)) (v_ArrVal_9370 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9369 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9368 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9367 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_8|))) (forall ((v_ArrVal_9371 (_ BitVec 32))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_9367))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_9368) .cse0 v_ArrVal_9370) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc40#1.base_8| v_ArrVal_9371) (select (select (store .cse2 .cse0 v_ArrVal_9369) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc40#1.base_8| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_8|)))) (forall ((v_ArrVal_9370 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9368 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9367 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_9368) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_9367) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9370) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule .cse3 (bvadd (_ bv4 32) .cse3))))))) is different from false [2024-11-08 17:12:42,460 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((|v_ULTIMATE.start_main_#t~malloc40#1.base_8| (_ BitVec 32)) (v_ArrVal_9370 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9369 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9368 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9367 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_9371 (_ BitVec 32))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_9367))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_9368) .cse1 v_ArrVal_9370) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc40#1.base_8| v_ArrVal_9371) (select (select (store .cse3 .cse1 v_ArrVal_9369) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_8|))))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc40#1.base_8| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_8|)))) (forall ((v_ArrVal_9370 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9368 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9367 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_9368) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_9367) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_9370) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule .cse4 (bvadd (_ bv4 32) .cse4)))))))) is different from false [2024-11-08 17:12:43,231 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9365 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc40#1.base_8| (_ BitVec 32)) (v_ArrVal_9370 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9369 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9368 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9367 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9366 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_8|))) (forall ((v_ArrVal_9371 (_ BitVec 32))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_9366))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_9367))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv4 32) (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_9365) .cse0 v_ArrVal_9368) .cse1 v_ArrVal_9370) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc40#1.base_8| v_ArrVal_9371) (select (select (store .cse3 .cse1 v_ArrVal_9369) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc40#1.base_8| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_8|)))) (forall ((v_ArrVal_9365 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9370 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9368 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9367 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9366 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_9366))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_9365) .cse6 v_ArrVal_9368) (select (select (store .cse7 .cse6 v_ArrVal_9367) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_9370))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule .cse5 (bvadd (_ bv4 32) .cse5))))))) is different from false [2024-11-08 17:12:47,568 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (and (forall ((v_ArrVal_9365 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc40#1.base_8| (_ BitVec 32)) (v_ArrVal_9370 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9369 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9368 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9367 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9366 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_9371 (_ BitVec 32))) (let ((.cse5 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_9366))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_9367))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv4 32) (select (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_9365) .cse1 v_ArrVal_9368) .cse2 v_ArrVal_9370) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc40#1.base_8| v_ArrVal_9371) (select (select (store .cse4 .cse2 v_ArrVal_9369) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_8|))))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc40#1.base_8| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_8|)))) (forall ((v_ArrVal_9365 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9370 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9368 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9367 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9366 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (select (select (let ((.cse8 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_9366))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_9365) .cse7 v_ArrVal_9368) (select (select (store .cse8 .cse7 v_ArrVal_9367) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_9370))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule .cse6 (bvadd (_ bv4 32) .cse6)))))))) is different from false [2024-11-08 17:12:48,115 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (or (forall ((v_ArrVal_9365 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9364 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9363 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9370 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9368 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9367 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9366 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse5 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_9364))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_ArrVal_9366))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_9363) .cse1 v_ArrVal_9365) .cse2 v_ArrVal_9368) (select (select (store .cse3 .cse2 v_ArrVal_9367) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_9370))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule .cse0 (bvadd (_ bv4 32) .cse0)))) (forall ((|v_ULTIMATE.start_main_#t~malloc40#1.base_8| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_8|))))) (forall ((v_ArrVal_9365 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9364 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9363 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc40#1.base_8| (_ BitVec 32)) (v_ArrVal_9370 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9369 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9368 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9367 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9366 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_8|))) (forall ((v_ArrVal_9371 (_ BitVec 32))) (let ((.cse11 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_9364))) (let ((.cse6 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse10 (store .cse11 .cse6 v_ArrVal_9366))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_9367))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (_ bv4 32) (select (select (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_9363) .cse6 v_ArrVal_9365) .cse7 v_ArrVal_9368) .cse8 v_ArrVal_9370) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc40#1.base_8| v_ArrVal_9371) (select (select (store .cse9 .cse8 v_ArrVal_9369) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))))))))) is different from false [2024-11-08 17:13:06,623 WARN L286 SmtUtils]: Spent 7.42s on a formula simplification that was a NOOP. DAG size: 362 (called from [L 276] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2024-11-08 17:13:08,657 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:13:08,657 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 795 treesize of output 819 [2024-11-08 17:13:16,418 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_prenex_39 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_38 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_35 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_36 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_33 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_34 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_32 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_40 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_41 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9369 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9371 (_ BitVec 32)) (v_prenex_37 (_ BitVec 32))) (or (let ((.cse8 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_prenex_33))) (let ((.cse0 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse7 (store .cse8 .cse0 v_prenex_34))) (let ((.cse1 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse6 (store .cse7 .cse1 v_prenex_41))) (let ((.cse2 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse5 (store .cse6 .cse2 v_prenex_40))) (let ((.cse3 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (_ bv4 32) (select (select (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_prenex_35) .cse0 v_prenex_36) .cse1 v_prenex_32) .cse2 v_prenex_39) .cse3 v_prenex_38) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (select (store |c_#length| v_prenex_37 v_ArrVal_9371) (select (select (store .cse5 .cse3 v_ArrVal_9369) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))))))))))) (= v_prenex_37 |c_ULTIMATE.start_main_#t~mem33#1.base|))) (forall ((v_ArrVal_9365 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9463 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9364 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9462 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9363 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9370 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9368 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9367 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9366 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse9 (select (select (let ((.cse15 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_9463))) (let ((.cse10 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse14 (store .cse15 .cse10 v_ArrVal_9364))) (let ((.cse11 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse13 (store .cse14 .cse11 v_ArrVal_9366))) (let ((.cse12 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_9462) .cse10 v_ArrVal_9363) .cse11 v_ArrVal_9365) .cse12 v_ArrVal_9368) (select (select (store .cse13 .cse12 v_ArrVal_9367) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_9370))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule .cse9 (bvadd (_ bv4 32) .cse9)))))) is different from false [2024-11-08 17:13:16,496 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:13:16,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1220524477] [2024-11-08 17:13:16,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1220524477] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:13:16,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [7820147] [2024-11-08 17:13:16,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:13:16,496 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-08 17:13:16,497 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/cvc4 [2024-11-08 17:13:16,498 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-08 17:13:16,499 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_562aa165-27d3-4428-bcb7-b604d6bf1a9c/bin/uautomizer-verify-jihMAELWvX/cvc4 --incremental --print-success --lang smt (39)] Waiting until timeout for monitored process [2024-11-08 17:13:22,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:13:23,058 INFO L255 TraceCheckSpWp]: Trace formula consists of 889 conjuncts, 125 conjuncts are in the unsatisfiable core [2024-11-08 17:13:23,071 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:13:23,216 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 [2024-11-08 17:13:31,380 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-08 17:13:31,381 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2024-11-08 17:13:31,870 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-08 17:13:34,536 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 [2024-11-08 17:13:34,664 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 [2024-11-08 17:13:43,712 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 17 [2024-11-08 17:13:43,845 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 [2024-11-08 17:14:35,793 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:14:35,793 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 68 [2024-11-08 17:14:36,046 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 [2024-11-08 17:14:44,115 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:14:44,115 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 68 [2024-11-08 17:14:44,389 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 [2024-11-08 17:14:50,360 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:14:50,361 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 68 [2024-11-08 17:14:50,625 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 [2024-11-08 17:14:56,691 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:14:56,692 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 68 [2024-11-08 17:14:56,969 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 [2024-11-08 17:15:03,167 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 17:15:03,167 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 68 [2024-11-08 17:15:03,435 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 [2024-11-08 17:15:04,885 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 20 [2024-11-08 17:15:05,008 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 [2024-11-08 17:15:08,761 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 17:15:08,762 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-08 17:15:10,169 INFO L349 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2024-11-08 17:15:10,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2024-11-08 17:15:10,172 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-08 17:15:10,172 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:15:24,792 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (or (forall ((v_ArrVal_9970 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_9970) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule .cse0 (bvadd (_ bv4 32) .cse0)))) (forall ((|v_ULTIMATE.start_main_#t~malloc40#1.base_8| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_8|))))) (forall ((v_ArrVal_9970 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc40#1.base_8| (_ BitVec 32)) (v_ArrVal_9969 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_8|))) (forall ((v_ArrVal_9371 (_ BitVec 32))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_9970) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc40#1.base_8| v_ArrVal_9371) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_9969) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2024-11-08 17:15:25,741 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (or (forall ((|v_ULTIMATE.start_main_#t~malloc40#1.base_8| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_8|)))) (forall ((v_ArrVal_9970 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_9970) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule .cse0 (bvadd (_ bv4 32) .cse0))))) (forall ((v_ArrVal_9970 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc40#1.base_8| (_ BitVec 32)) (v_ArrVal_9969 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_9371 (_ BitVec 32))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_9970) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc40#1.base_8| v_ArrVal_9371) (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_9969) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_8|)))))))) is different from false [2024-11-08 17:15:27,283 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9970 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc40#1.base_8| (_ BitVec 32)) (v_ArrVal_9969 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9968 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9967 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_9371 (_ BitVec 32))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_9968))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_9967) .cse0 v_ArrVal_9970) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc40#1.base_8| v_ArrVal_9371) (select (select (store .cse2 .cse0 v_ArrVal_9969) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_8|))))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc40#1.base_8| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_8|)))) (forall ((v_ArrVal_9970 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9968 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9967 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_9967) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_9968) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9970) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule .cse3 (bvadd (_ bv4 32) .cse3))))))) is different from false [2024-11-08 17:15:28,226 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_9970 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc40#1.base_8| (_ BitVec 32)) (v_ArrVal_9969 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9968 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9967 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_8|))) (forall ((v_ArrVal_9371 (_ BitVec 32))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_9968))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_9967) .cse1 v_ArrVal_9970) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv4 32)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc40#1.base_8| v_ArrVal_9371) (select (select (store .cse3 .cse1 v_ArrVal_9969) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc40#1.base_8| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_8|)))) (forall ((v_ArrVal_9970 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9968 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9967 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_9967) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_9968) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_9970) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule .cse4 (bvadd .cse4 (_ bv4 32))))))))) is different from false [2024-11-08 17:15:31,705 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9970 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc40#1.base_8| (_ BitVec 32)) (v_ArrVal_9969 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9968 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9967 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9966 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9965 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_8|))) (forall ((v_ArrVal_9371 (_ BitVec 32))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_9966))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_9968))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_9965) .cse0 v_ArrVal_9967) .cse1 v_ArrVal_9970) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv4 32)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc40#1.base_8| v_ArrVal_9371) (select (select (store .cse3 .cse1 v_ArrVal_9969) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc40#1.base_8| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_8|)))) (forall ((v_ArrVal_9970 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9968 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9967 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9966 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9965 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_9966))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_9965) .cse6 v_ArrVal_9967) (select (select (store .cse7 .cse6 v_ArrVal_9968) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_9970))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule .cse5 (bvadd .cse5 (_ bv4 32)))))))) is different from false [2024-11-08 17:15:32,640 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (and (or (forall ((v_ArrVal_9970 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9968 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9967 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9966 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9965 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_9966))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_9965) .cse2 v_ArrVal_9967) (select (select (store .cse3 .cse2 v_ArrVal_9968) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_9970))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule .cse0 (bvadd (_ bv4 32) .cse0)))) (forall ((|v_ULTIMATE.start_main_#t~malloc40#1.base_8| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_8|))))) (forall ((v_ArrVal_9970 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc40#1.base_8| (_ BitVec 32)) (v_ArrVal_9969 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9968 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9967 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9966 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9965 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_8|))) (forall ((v_ArrVal_9371 (_ BitVec 32))) (let ((.cse8 (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_9966))) (let ((.cse5 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse7 (store .cse8 .cse5 v_ArrVal_9968))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (_ bv4 32) (select (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_9965) .cse5 v_ArrVal_9967) .cse6 v_ArrVal_9970) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc40#1.base_8| v_ArrVal_9371) (select (select (store .cse7 .cse6 v_ArrVal_9969) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))))))))))))) is different from false [2024-11-08 17:15:34,147 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (or (forall ((|v_ULTIMATE.start_main_#t~malloc40#1.base_8| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_8|)))) (forall ((v_ArrVal_9970 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9968 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9967 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9966 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9965 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9964 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9963 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse5 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_9964))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_ArrVal_9966))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_9963) .cse1 v_ArrVal_9965) .cse2 v_ArrVal_9967) (select (select (store .cse3 .cse2 v_ArrVal_9968) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_9970))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule .cse0 (bvadd (_ bv4 32) .cse0))))) (forall ((v_ArrVal_9970 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc40#1.base_8| (_ BitVec 32)) (v_ArrVal_9969 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9968 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9967 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9966 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9965 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9964 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9963 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_9371 (_ BitVec 32))) (let ((.cse11 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_9964))) (let ((.cse6 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse10 (store .cse11 .cse6 v_ArrVal_9966))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_9968))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (_ bv4 32) (select (select (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_9963) .cse6 v_ArrVal_9965) .cse7 v_ArrVal_9967) .cse8 v_ArrVal_9970) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc40#1.base_8| v_ArrVal_9371) (select (select (store .cse9 .cse8 v_ArrVal_9969) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_8|))))))) is different from false [2024-11-08 17:15:35,322 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (and (forall ((v_ArrVal_9970 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc40#1.base_8| (_ BitVec 32)) (v_ArrVal_9969 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9968 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9967 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9966 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9965 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9964 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9963 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_8|))) (forall ((v_ArrVal_9371 (_ BitVec 32))) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_9964))) (let ((.cse1 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse6 (store .cse7 .cse1 v_ArrVal_9966))) (let ((.cse2 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse5 (store .cse6 .cse2 v_ArrVal_9968))) (let ((.cse3 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (select (select (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_9963) .cse1 v_ArrVal_9965) .cse2 v_ArrVal_9967) .cse3 v_ArrVal_9970) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) (_ bv4 32)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc40#1.base_8| v_ArrVal_9371) (select (select (store .cse5 .cse3 v_ArrVal_9969) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))))))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc40#1.base_8| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_8|)))) (forall ((v_ArrVal_9970 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9968 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9967 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9966 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9965 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9964 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9963 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (select (select (let ((.cse12 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_9964))) (let ((.cse9 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse11 (store .cse12 .cse9 v_ArrVal_9966))) (let ((.cse10 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_9963) .cse9 v_ArrVal_9965) .cse10 v_ArrVal_9967) (select (select (store .cse11 .cse10 v_ArrVal_9968) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_9970))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule .cse8 (bvadd .cse8 (_ bv4 32))))))))) is different from false [2024-11-08 17:15:48,823 WARN L286 SmtUtils]: Spent 12.74s on a formula simplification that was a NOOP. DAG size: 356 (called from [L 276] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2024-11-08 17:15:51,498 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9970 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10063 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc40#1.base_8| (_ BitVec 32)) (v_ArrVal_9969 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9968 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9967 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9966 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9965 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9964 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9963 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10062 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_9371 (_ BitVec 32))) (let ((.cse8 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_10063))) (let ((.cse0 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse7 (store .cse8 .cse0 v_ArrVal_9964))) (let ((.cse1 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse6 (store .cse7 .cse1 v_ArrVal_9966))) (let ((.cse2 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse5 (store .cse6 .cse2 v_ArrVal_9968))) (let ((.cse3 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (_ bv4 32) (select (select (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_10062) .cse0 v_ArrVal_9963) .cse1 v_ArrVal_9965) .cse2 v_ArrVal_9967) .cse3 v_ArrVal_9970) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc40#1.base_8| v_ArrVal_9371) (select (select (store .cse5 .cse3 v_ArrVal_9969) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_8|))))) (or (forall ((v_ArrVal_9970 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10063 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9968 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9967 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9966 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9965 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9964 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9963 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10062 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse9 (select (select (let ((.cse15 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_10063))) (let ((.cse10 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse14 (store .cse15 .cse10 v_ArrVal_9964))) (let ((.cse11 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse13 (store .cse14 .cse11 v_ArrVal_9966))) (let ((.cse12 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_10062) .cse10 v_ArrVal_9963) .cse11 v_ArrVal_9965) .cse12 v_ArrVal_9967) (select (select (store .cse13 .cse12 v_ArrVal_9968) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_9970))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule .cse9 (bvadd (_ bv4 32) .cse9)))) (forall ((|v_ULTIMATE.start_main_#t~malloc40#1.base_8| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_8|))))))) is different from false [2024-11-08 17:15:51,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [7820147] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:15:51,595 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 17:15:51,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13] total 26 [2024-11-08 17:15:51,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397708623] [2024-11-08 17:15:51,596 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 17:15:51,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-08 17:15:51,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:15:51,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-08 17:15:51,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=807, Unknown=24, NotChecked=1258, Total=2256 [2024-11-08 17:15:51,598 INFO L87 Difference]: Start difference. First operand 768 states and 820 transitions. Second operand has 27 states, 24 states have (on average 5.875) internal successors, (141), 26 states have internal predecessors, (141), 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)