./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test5-3.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_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test5-3.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash cb182062e759f3e947e2f86847df2222bda90081d4cc013a50b9baa2d9844063 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-09 05:29:33,173 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 05:29:33,274 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2024-11-09 05:29:33,284 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 05:29:33,285 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 05:29:33,326 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 05:29:33,329 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 05:29:33,330 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 05:29:33,330 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 05:29:33,331 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 05:29:33,331 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-09 05:29:33,331 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-09 05:29:33,332 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-09 05:29:33,332 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-09 05:29:33,333 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-09 05:29:33,333 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-09 05:29:33,333 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-09 05:29:33,340 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-09 05:29:33,340 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-09 05:29:33,341 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-09 05:29:33,341 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-09 05:29:33,343 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-09 05:29:33,344 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 05:29:33,344 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 05:29:33,345 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 05:29:33,345 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 05:29:33,345 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 05:29:33,346 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 05:29:33,346 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 05:29:33,346 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 05:29:33,346 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 05:29:33,347 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 05:29:33,347 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 05:29:33,347 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 05:29:33,349 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 05:29:33,349 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 05:29:33,350 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 05:29:33,350 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 05:29:33,350 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 05:29:33,351 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 05:29:33,351 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 05:29:33,351 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 05:29:33,352 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 05:29:33,352 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 05:29:33,352 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-09 05:29:33,353 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 05:29:33,353 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 05:29:33,353 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-09 05:29:33,354 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 05:29:33,354 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/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_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje 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 -> Taipan 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 -> cb182062e759f3e947e2f86847df2222bda90081d4cc013a50b9baa2d9844063 [2024-11-09 05:29:33,607 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 05:29:33,638 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 05:29:33,642 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 05:29:33,644 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 05:29:33,644 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 05:29:33,646 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/../../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test5-3.i Unable to find full path for "g++" [2024-11-09 05:29:35,739 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 05:29:36,096 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 05:29:36,100 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test5-3.i [2024-11-09 05:29:36,127 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/data/eaaaeb8fa/e16cb088777f498db45dccf8c663d84f/FLAG7e9b96bea [2024-11-09 05:29:36,325 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/data/eaaaeb8fa/e16cb088777f498db45dccf8c663d84f [2024-11-09 05:29:36,327 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 05:29:36,329 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 05:29:36,330 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 05:29:36,331 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 05:29:36,337 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 05:29:36,338 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 05:29:36" (1/1) ... [2024-11-09 05:29:36,339 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@363a6fd0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:29:36, skipping insertion in model container [2024-11-09 05:29:36,340 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 05:29:36" (1/1) ... [2024-11-09 05:29:36,424 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 05:29:36,999 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-09 05:29:37,050 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-09 05:29:37,055 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-09 05:29:37,059 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-09 05:29:37,066 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-09 05:29:37,116 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-09 05:29:37,118 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-09 05:29:37,121 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-09 05:29:37,126 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-09 05:29:37,159 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-09 05:29:37,160 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-09 05:29:37,165 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-09 05:29:37,167 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-09 05:29:37,172 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-09 05:29:37,175 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-09 05:29:37,179 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-09 05:29:37,180 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-09 05:29:37,181 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-09 05:29:37,195 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-09 05:29:37,196 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-09 05:29:37,200 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-09 05:29:37,201 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-09 05:29:37,208 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-09 05:29:37,223 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 05:29:37,239 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-09 05:29:37,240 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@1dd79905 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:29:37, skipping insertion in model container [2024-11-09 05:29:37,240 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 05:29:37,241 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-09 05:29:37,243 INFO L158 Benchmark]: Toolchain (without parser) took 913.11ms. Allocated memory is still 153.1MB. Free memory was 115.7MB in the beginning and 87.2MB in the end (delta: 28.5MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-11-09 05:29:37,243 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 153.1MB. Free memory is still 99.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 05:29:37,244 INFO L158 Benchmark]: CACSL2BoogieTranslator took 910.51ms. Allocated memory is still 153.1MB. Free memory was 115.4MB in the beginning and 87.4MB in the end (delta: 28.0MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-11-09 05:29:37,246 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.25ms. Allocated memory is still 153.1MB. Free memory is still 99.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 910.51ms. Allocated memory is still 153.1MB. Free memory was 115.4MB in the beginning and 87.4MB in the end (delta: 28.0MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 760]: 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_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test5-3.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash cb182062e759f3e947e2f86847df2222bda90081d4cc013a50b9baa2d9844063 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-09 05:29:39,540 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 05:29:39,640 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2024-11-09 05:29:39,646 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 05:29:39,648 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 05:29:39,687 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 05:29:39,687 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 05:29:39,690 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 05:29:39,691 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 05:29:39,691 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 05:29:39,692 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-09 05:29:39,692 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-09 05:29:39,693 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-09 05:29:39,695 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-09 05:29:39,696 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-09 05:29:39,696 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-09 05:29:39,697 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 05:29:39,697 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 05:29:39,697 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 05:29:39,698 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 05:29:39,698 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 05:29:39,702 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 05:29:39,703 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 05:29:39,703 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 05:29:39,703 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 05:29:39,704 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 05:29:39,704 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 05:29:39,704 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 05:29:39,704 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 05:29:39,705 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 05:29:39,706 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 05:29:39,707 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 05:29:39,707 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 05:29:39,707 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 05:29:39,707 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 05:29:39,708 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 05:29:39,708 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 05:29:39,708 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 05:29:39,708 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 05:29:39,709 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 05:29:39,710 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 05:29:39,711 INFO L153 SettingsManager]: * Trace refinement strategy=WALRUS [2024-11-09 05:29:39,711 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 05:29:39,711 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 05:29:39,711 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-09 05:29:39,711 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/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_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje 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 -> Taipan 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 -> cb182062e759f3e947e2f86847df2222bda90081d4cc013a50b9baa2d9844063 [2024-11-09 05:29:40,106 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 05:29:40,134 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 05:29:40,137 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 05:29:40,139 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 05:29:40,139 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 05:29:40,142 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/../../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test5-3.i Unable to find full path for "g++" [2024-11-09 05:29:42,267 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 05:29:42,687 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 05:29:42,688 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test5-3.i [2024-11-09 05:29:42,716 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/data/80275b4c3/5bc3747c7018461697d02a9adda9802a/FLAG7ee7a692f [2024-11-09 05:29:42,841 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/data/80275b4c3/5bc3747c7018461697d02a9adda9802a [2024-11-09 05:29:42,843 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 05:29:42,845 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 05:29:42,846 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 05:29:42,847 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 05:29:42,853 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 05:29:42,853 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 05:29:42" (1/1) ... [2024-11-09 05:29:42,855 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52e01f8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:29:42, skipping insertion in model container [2024-11-09 05:29:42,855 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 05:29:42" (1/1) ... [2024-11-09 05:29:42,930 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 05:29:43,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-09 05:29:43,568 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-09 05:29:43,573 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-09 05:29:43,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-09 05:29:43,588 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-09 05:29:43,651 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-09 05:29:43,656 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-09 05:29:43,662 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-09 05:29:43,674 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-09 05:29:43,705 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-09 05:29:43,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-09 05:29:43,709 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-09 05:29:43,710 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-09 05:29:43,712 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-09 05:29:43,715 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-09 05:29:43,717 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-09 05:29:43,719 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-09 05:29:43,720 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-09 05:29:43,726 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-09 05:29:43,728 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-09 05:29:43,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-09 05:29:43,730 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-09 05:29:43,735 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-09 05:29:43,748 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 05:29:43,770 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-09 05:29:43,784 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 05:29:43,829 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-09 05:29:43,853 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-09 05:29:43,862 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-09 05:29:43,865 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-09 05:29:43,876 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-09 05:29:43,930 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-09 05:29:43,932 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-09 05:29:43,937 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-09 05:29:43,943 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-09 05:29:43,983 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-09 05:29:43,983 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-09 05:29:43,988 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-09 05:29:43,989 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-09 05:29:43,990 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-09 05:29:43,992 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-09 05:29:43,993 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-09 05:29:43,994 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-09 05:29:43,994 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-09 05:29:43,998 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-09 05:29:43,998 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-09 05:29:43,999 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-09 05:29:44,000 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-09 05:29:44,003 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-09 05:29:44,007 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 05:29:44,011 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 05:29:44,162 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 05:29:44,215 INFO L204 MainTranslator]: Completed translation [2024-11-09 05:29:44,216 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:29:44 WrapperNode [2024-11-09 05:29:44,217 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 05:29:44,218 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 05:29:44,218 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 05:29:44,219 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 05:29:44,226 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:29:44" (1/1) ... [2024-11-09 05:29:44,281 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:29:44" (1/1) ... [2024-11-09 05:29:44,376 INFO L138 Inliner]: procedures = 180, calls = 474, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1704 [2024-11-09 05:29:44,376 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 05:29:44,381 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 05:29:44,381 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 05:29:44,381 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 05:29:44,395 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:29:44" (1/1) ... [2024-11-09 05:29:44,396 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:29:44" (1/1) ... [2024-11-09 05:29:44,410 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:29:44" (1/1) ... [2024-11-09 05:29:44,410 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:29:44" (1/1) ... [2024-11-09 05:29:44,481 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:29:44" (1/1) ... [2024-11-09 05:29:44,500 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:29:44" (1/1) ... [2024-11-09 05:29:44,514 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:29:44" (1/1) ... [2024-11-09 05:29:44,527 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:29:44" (1/1) ... [2024-11-09 05:29:44,545 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 05:29:44,547 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 05:29:44,547 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 05:29:44,548 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 05:29:44,549 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:29:44" (1/1) ... [2024-11-09 05:29:44,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 05:29:44,569 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:29:44,591 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-09 05:29:44,599 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-09 05:29:44,629 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-11-09 05:29:44,630 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-11-09 05:29:44,630 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2024-11-09 05:29:44,630 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2024-11-09 05:29:44,630 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-09 05:29:44,630 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-09 05:29:44,630 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2024-11-09 05:29:44,630 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2024-11-09 05:29:44,631 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 05:29:44,631 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 05:29:44,631 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-09 05:29:44,631 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 05:29:44,631 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-11-09 05:29:44,631 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 05:29:44,631 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2024-11-09 05:29:44,632 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2024-11-09 05:29:44,632 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 05:29:44,632 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 05:29:44,982 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 05:29:44,985 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 05:29:45,012 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-09 05:29:53,355 INFO L? ?]: Removed 1908 outVars from TransFormulas that were not future-live. [2024-11-09 05:29:53,356 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 05:29:53,418 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 05:29:53,419 INFO L316 CfgBuilder]: Removed 91 assume(true) statements. [2024-11-09 05:29:53,419 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 05:29:53 BoogieIcfgContainer [2024-11-09 05:29:53,419 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 05:29:53,422 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 05:29:53,422 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 05:29:53,426 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 05:29:53,426 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 05:29:42" (1/3) ... [2024-11-09 05:29:53,427 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17bb290d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 05:29:53, skipping insertion in model container [2024-11-09 05:29:53,427 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:29:44" (2/3) ... [2024-11-09 05:29:53,428 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17bb290d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 05:29:53, skipping insertion in model container [2024-11-09 05:29:53,429 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 05:29:53" (3/3) ... [2024-11-09 05:29:53,431 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_SAX_test5-3.i [2024-11-09 05:29:53,449 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 05:29:53,450 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 915 error locations. [2024-11-09 05:29:53,534 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 05:29:53,542 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=FINITE_AUTOMATA, 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;@59561b8c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 05:29:53,542 INFO L334 AbstractCegarLoop]: Starting to check reachability of 915 error locations. [2024-11-09 05:29:53,558 INFO L276 IsEmpty]: Start isEmpty. Operand has 1832 states, 906 states have (on average 2.226269315673289) internal successors, (2017), 1822 states have internal predecessors, (2017), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 9 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-09 05:29:53,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-09 05:29:53,565 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:29:53,566 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-09 05:29:53,566 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 912 more)] === [2024-11-09 05:29:53,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:29:53,574 INFO L85 PathProgramCache]: Analyzing trace with hash 1422042701, now seen corresponding path program 1 times [2024-11-09 05:29:53,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 05:29:53,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1738584934] [2024-11-09 05:29:53,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:29:53,589 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 05:29:53,589 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 05:29:53,592 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 05:29:53,600 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-09 05:29:53,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:29:53,806 INFO L255 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-09 05:29:53,812 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:29:53,820 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-09 05:29:53,820 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 05:29:53,821 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 05:29:53,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1738584934] [2024-11-09 05:29:53,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1738584934] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:29:53,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:29:53,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 05:29:53,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307260924] [2024-11-09 05:29:53,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:29:53,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 05:29:53,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 05:29:53,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 05:29:53,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 05:29:53,863 INFO L87 Difference]: Start difference. First operand has 1832 states, 906 states have (on average 2.226269315673289) internal successors, (2017), 1822 states have internal predecessors, (2017), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 9 states have call predecessors, (13), 13 states have call successors, (13) 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-09 05:29:53,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:29:53,972 INFO L93 Difference]: Finished difference Result 1812 states and 1922 transitions. [2024-11-09 05:29:53,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 05:29:53,974 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-09 05:29:53,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:29:54,000 INFO L225 Difference]: With dead ends: 1812 [2024-11-09 05:29:54,001 INFO L226 Difference]: Without dead ends: 1810 [2024-11-09 05:29:54,002 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-09 05:29:54,006 INFO L432 NwaCegarLoop]: 1922 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, 1922 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-09 05:29:54,007 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1922 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 05:29:54,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1810 states. [2024-11-09 05:29:54,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1810 to 1810. [2024-11-09 05:29:54,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1810 states, 896 states have (on average 2.1160714285714284) internal successors, (1896), 1800 states have internal predecessors, (1896), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-09 05:29:54,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1810 states to 1810 states and 1920 transitions. [2024-11-09 05:29:54,151 INFO L78 Accepts]: Start accepts. Automaton has 1810 states and 1920 transitions. Word has length 6 [2024-11-09 05:29:54,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:29:54,152 INFO L471 AbstractCegarLoop]: Abstraction has 1810 states and 1920 transitions. [2024-11-09 05:29:54,152 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-09 05:29:54,153 INFO L276 IsEmpty]: Start isEmpty. Operand 1810 states and 1920 transitions. [2024-11-09 05:29:54,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-09 05:29:54,153 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:29:54,153 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-09 05:29:54,161 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-09 05:29:54,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 05:29:54,356 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 912 more)] === [2024-11-09 05:29:54,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:29:54,357 INFO L85 PathProgramCache]: Analyzing trace with hash 1422042763, now seen corresponding path program 1 times [2024-11-09 05:29:54,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 05:29:54,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [551608259] [2024-11-09 05:29:54,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:29:54,358 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 05:29:54,358 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 05:29:54,362 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 05:29:54,364 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-09 05:29:54,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:29:54,547 INFO L255 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 05:29:54,550 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:29:54,593 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-09 05:29:54,615 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-09 05:29:54,616 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 05:29:54,617 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 05:29:54,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [551608259] [2024-11-09 05:29:54,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [551608259] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:29:54,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:29:54,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 05:29:54,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755624031] [2024-11-09 05:29:54,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:29:54,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 05:29:54,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 05:29:54,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 05:29:54,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 05:29:54,624 INFO L87 Difference]: Start difference. First operand 1810 states and 1920 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-09 05:29:58,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:29:58,414 INFO L93 Difference]: Finished difference Result 1950 states and 2096 transitions. [2024-11-09 05:29:58,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 05:29:58,415 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-09 05:29:58,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:29:58,423 INFO L225 Difference]: With dead ends: 1950 [2024-11-09 05:29:58,423 INFO L226 Difference]: Without dead ends: 1950 [2024-11-09 05:29:58,423 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-09 05:29:58,425 INFO L432 NwaCegarLoop]: 1396 mSDtfsCounter, 1280 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 1112 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1291 SdHoareTripleChecker+Valid, 1778 SdHoareTripleChecker+Invalid, 1211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 1112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2024-11-09 05:29:58,425 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1291 Valid, 1778 Invalid, 1211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 1112 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2024-11-09 05:29:58,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1950 states. [2024-11-09 05:29:58,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1950 to 1718. [2024-11-09 05:29:58,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1718 states, 896 states have (on average 2.013392857142857) internal successors, (1804), 1708 states have internal predecessors, (1804), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-09 05:29:58,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1718 states to 1718 states and 1828 transitions. [2024-11-09 05:29:58,470 INFO L78 Accepts]: Start accepts. Automaton has 1718 states and 1828 transitions. Word has length 6 [2024-11-09 05:29:58,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:29:58,470 INFO L471 AbstractCegarLoop]: Abstraction has 1718 states and 1828 transitions. [2024-11-09 05:29:58,470 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-09 05:29:58,471 INFO L276 IsEmpty]: Start isEmpty. Operand 1718 states and 1828 transitions. [2024-11-09 05:29:58,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-09 05:29:58,471 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:29:58,471 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-09 05:29:58,475 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-09 05:29:58,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 05:29:58,672 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 912 more)] === [2024-11-09 05:29:58,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:29:58,673 INFO L85 PathProgramCache]: Analyzing trace with hash 1422042764, now seen corresponding path program 1 times [2024-11-09 05:29:58,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 05:29:58,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1501264932] [2024-11-09 05:29:58,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:29:58,674 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 05:29:58,674 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 05:29:58,677 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 05:29:58,678 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-09 05:29:58,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:29:58,834 INFO L255 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 05:29:58,837 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:29:58,849 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-09 05:29:58,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-09 05:29:58,878 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 05:29:58,878 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 05:29:58,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1501264932] [2024-11-09 05:29:58,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1501264932] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:29:58,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:29:58,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 05:29:58,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432813733] [2024-11-09 05:29:58,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:29:58,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 05:29:58,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 05:29:58,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 05:29:58,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 05:29:58,881 INFO L87 Difference]: Start difference. First operand 1718 states and 1828 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-09 05:30:04,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:30:04,495 INFO L93 Difference]: Finished difference Result 2269 states and 2435 transitions. [2024-11-09 05:30:04,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 05:30:04,495 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-09 05:30:04,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:30:04,504 INFO L225 Difference]: With dead ends: 2269 [2024-11-09 05:30:04,504 INFO L226 Difference]: Without dead ends: 2269 [2024-11-09 05:30:04,504 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-09 05:30:04,505 INFO L432 NwaCegarLoop]: 1757 mSDtfsCounter, 780 mSDsluCounter, 821 mSDsCounter, 0 mSdLazyCounter, 1151 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 785 SdHoareTripleChecker+Valid, 2578 SdHoareTripleChecker+Invalid, 1176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2024-11-09 05:30:04,506 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [785 Valid, 2578 Invalid, 1176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1151 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2024-11-09 05:30:04,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2269 states. [2024-11-09 05:30:04,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2269 to 1886. [2024-11-09 05:30:04,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1886 states, 1074 states have (on average 1.9795158286778398) internal successors, (2126), 1876 states have internal predecessors, (2126), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-09 05:30:04,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1886 states to 1886 states and 2150 transitions. [2024-11-09 05:30:04,553 INFO L78 Accepts]: Start accepts. Automaton has 1886 states and 2150 transitions. Word has length 6 [2024-11-09 05:30:04,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:30:04,554 INFO L471 AbstractCegarLoop]: Abstraction has 1886 states and 2150 transitions. [2024-11-09 05:30:04,554 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-09 05:30:04,554 INFO L276 IsEmpty]: Start isEmpty. Operand 1886 states and 2150 transitions. [2024-11-09 05:30:04,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-09 05:30:04,555 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:30:04,555 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:30:04,559 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-09 05:30:04,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 05:30:04,758 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr620REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 912 more)] === [2024-11-09 05:30:04,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:30:04,758 INFO L85 PathProgramCache]: Analyzing trace with hash -1520957550, now seen corresponding path program 1 times [2024-11-09 05:30:04,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 05:30:04,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [912901553] [2024-11-09 05:30:04,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:30:04,759 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 05:30:04,759 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 05:30:04,761 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 05:30:04,762 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-09 05:30:04,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:30:04,913 INFO L255 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 05:30:04,916 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:30:04,931 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-09 05:30:04,931 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 05:30:04,931 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 05:30:04,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [912901553] [2024-11-09 05:30:04,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [912901553] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:30:04,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:30:04,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 05:30:04,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360210137] [2024-11-09 05:30:04,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:30:04,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 05:30:04,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 05:30:04,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 05:30:04,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 05:30:04,938 INFO L87 Difference]: Start difference. First operand 1886 states and 2150 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:30:05,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:30:05,140 INFO L93 Difference]: Finished difference Result 3372 states and 3878 transitions. [2024-11-09 05:30:05,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 05:30:05,148 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-09 05:30:05,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:30:05,160 INFO L225 Difference]: With dead ends: 3372 [2024-11-09 05:30:05,160 INFO L226 Difference]: Without dead ends: 3372 [2024-11-09 05:30:05,161 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 05:30:05,162 INFO L432 NwaCegarLoop]: 2081 mSDtfsCounter, 1371 mSDsluCounter, 1804 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1382 SdHoareTripleChecker+Valid, 3885 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 05:30:05,162 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1382 Valid, 3885 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 05:30:05,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3372 states. [2024-11-09 05:30:05,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3372 to 1890. [2024-11-09 05:30:05,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1890 states, 1078 states have (on average 1.9758812615955472) internal successors, (2130), 1880 states have internal predecessors, (2130), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-09 05:30:05,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1890 states to 1890 states and 2154 transitions. [2024-11-09 05:30:05,232 INFO L78 Accepts]: Start accepts. Automaton has 1890 states and 2154 transitions. Word has length 7 [2024-11-09 05:30:05,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:30:05,233 INFO L471 AbstractCegarLoop]: Abstraction has 1890 states and 2154 transitions. [2024-11-09 05:30:05,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:30:05,233 INFO L276 IsEmpty]: Start isEmpty. Operand 1890 states and 2154 transitions. [2024-11-09 05:30:05,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-09 05:30:05,234 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:30:05,234 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:30:05,237 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-09 05:30:05,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 05:30:05,436 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 912 more)] === [2024-11-09 05:30:05,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:30:05,437 INFO L85 PathProgramCache]: Analyzing trace with hash -1910447640, now seen corresponding path program 1 times [2024-11-09 05:30:05,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 05:30:05,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [782831436] [2024-11-09 05:30:05,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:30:05,438 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 05:30:05,438 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 05:30:05,443 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 05:30:05,447 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-09 05:30:05,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:30:05,678 INFO L255 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 05:30:05,681 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:30:05,696 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-09 05:30:05,697 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 05:30:05,697 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 05:30:05,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [782831436] [2024-11-09 05:30:05,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [782831436] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:30:05,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:30:05,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 05:30:05,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636123204] [2024-11-09 05:30:05,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:30:05,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 05:30:05,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 05:30:05,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 05:30:05,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 05:30:05,702 INFO L87 Difference]: Start difference. First operand 1890 states and 2154 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) 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-09 05:30:05,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:30:05,761 INFO L93 Difference]: Finished difference Result 1847 states and 2109 transitions. [2024-11-09 05:30:05,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 05:30:05,761 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) 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-09 05:30:05,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:30:05,768 INFO L225 Difference]: With dead ends: 1847 [2024-11-09 05:30:05,769 INFO L226 Difference]: Without dead ends: 1847 [2024-11-09 05:30:05,770 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-09 05:30:05,772 INFO L432 NwaCegarLoop]: 1761 mSDtfsCounter, 71 mSDsluCounter, 1698 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 3459 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-09 05:30:05,773 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 3459 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 05:30:05,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1847 states. [2024-11-09 05:30:05,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1847 to 1847. [2024-11-09 05:30:05,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1847 states, 1059 states have (on average 1.9688385269121813) internal successors, (2085), 1837 states have internal predecessors, (2085), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-09 05:30:05,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1847 states to 1847 states and 2109 transitions. [2024-11-09 05:30:05,817 INFO L78 Accepts]: Start accepts. Automaton has 1847 states and 2109 transitions. Word has length 13 [2024-11-09 05:30:05,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:30:05,817 INFO L471 AbstractCegarLoop]: Abstraction has 1847 states and 2109 transitions. [2024-11-09 05:30:05,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) 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-09 05:30:05,818 INFO L276 IsEmpty]: Start isEmpty. Operand 1847 states and 2109 transitions. [2024-11-09 05:30:05,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-09 05:30:05,818 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:30:05,819 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:30:05,823 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-09 05:30:06,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 05:30:06,022 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 912 more)] === [2024-11-09 05:30:06,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:30:06,023 INFO L85 PathProgramCache]: Analyzing trace with hash 907447863, now seen corresponding path program 1 times [2024-11-09 05:30:06,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 05:30:06,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [228300446] [2024-11-09 05:30:06,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:30:06,023 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 05:30:06,023 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 05:30:06,025 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 05:30:06,026 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-09 05:30:06,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:30:06,236 INFO L255 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 05:30:06,238 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:30:06,269 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-09 05:30:06,270 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 05:30:06,270 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 05:30:06,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [228300446] [2024-11-09 05:30:06,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [228300446] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:30:06,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:30:06,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 05:30:06,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33295593] [2024-11-09 05:30:06,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:30:06,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 05:30:06,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 05:30:06,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 05:30:06,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 05:30:06,272 INFO L87 Difference]: Start difference. First operand 1847 states and 2109 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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-09 05:30:06,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:30:06,400 INFO L93 Difference]: Finished difference Result 1825 states and 2080 transitions. [2024-11-09 05:30:06,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 05:30:06,401 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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 14 [2024-11-09 05:30:06,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:30:06,406 INFO L225 Difference]: With dead ends: 1825 [2024-11-09 05:30:06,407 INFO L226 Difference]: Without dead ends: 1825 [2024-11-09 05:30:06,407 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 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-09 05:30:06,408 INFO L432 NwaCegarLoop]: 1716 mSDtfsCounter, 48 mSDsluCounter, 3406 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 5122 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-09 05:30:06,408 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 5122 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 05:30:06,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1825 states. [2024-11-09 05:30:06,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1825 to 1825. [2024-11-09 05:30:06,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1825 states, 1051 states have (on average 1.956232159847764) internal successors, (2056), 1815 states have internal predecessors, (2056), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-09 05:30:06,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1825 states to 1825 states and 2080 transitions. [2024-11-09 05:30:06,440 INFO L78 Accepts]: Start accepts. Automaton has 1825 states and 2080 transitions. Word has length 14 [2024-11-09 05:30:06,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:30:06,441 INFO L471 AbstractCegarLoop]: Abstraction has 1825 states and 2080 transitions. [2024-11-09 05:30:06,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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-09 05:30:06,441 INFO L276 IsEmpty]: Start isEmpty. Operand 1825 states and 2080 transitions. [2024-11-09 05:30:06,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-09 05:30:06,442 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:30:06,442 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] [2024-11-09 05:30:06,446 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2024-11-09 05:30:06,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 05:30:06,643 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 912 more)] === [2024-11-09 05:30:06,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:30:06,643 INFO L85 PathProgramCache]: Analyzing trace with hash 2061261669, now seen corresponding path program 1 times [2024-11-09 05:30:06,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 05:30:06,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1962578336] [2024-11-09 05:30:06,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:30:06,644 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 05:30:06,644 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 05:30:06,647 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 05:30:06,648 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-09 05:30:06,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:30:06,887 INFO L255 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 05:30:06,894 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:30:06,903 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-09 05:30:07,022 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-09 05:30:07,022 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 05:30:07,023 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 05:30:07,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1962578336] [2024-11-09 05:30:07,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1962578336] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:30:07,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:30:07,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 05:30:07,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106444801] [2024-11-09 05:30:07,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:30:07,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 05:30:07,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 05:30:07,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 05:30:07,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 05:30:07,025 INFO L87 Difference]: Start difference. First operand 1825 states and 2080 transitions. Second operand has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 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-09 05:30:11,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:30:11,793 INFO L93 Difference]: Finished difference Result 1825 states and 2080 transitions. [2024-11-09 05:30:11,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 05:30:11,794 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 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 28 [2024-11-09 05:30:11,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:30:11,799 INFO L225 Difference]: With dead ends: 1825 [2024-11-09 05:30:11,799 INFO L226 Difference]: Without dead ends: 1825 [2024-11-09 05:30:11,799 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 25 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-09 05:30:11,800 INFO L432 NwaCegarLoop]: 1084 mSDtfsCounter, 1215 mSDsluCounter, 1029 mSDsCounter, 0 mSdLazyCounter, 1843 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1226 SdHoareTripleChecker+Valid, 2113 SdHoareTripleChecker+Invalid, 1854 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1843 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2024-11-09 05:30:11,800 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1226 Valid, 2113 Invalid, 1854 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1843 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2024-11-09 05:30:11,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1825 states. [2024-11-09 05:30:11,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1825 to 1821. [2024-11-09 05:30:11,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1821 states, 1051 states have (on average 1.9524262607040914) internal successors, (2052), 1811 states have internal predecessors, (2052), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-09 05:30:11,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1821 states to 1821 states and 2076 transitions. [2024-11-09 05:30:11,837 INFO L78 Accepts]: Start accepts. Automaton has 1821 states and 2076 transitions. Word has length 28 [2024-11-09 05:30:11,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:30:11,838 INFO L471 AbstractCegarLoop]: Abstraction has 1821 states and 2076 transitions. [2024-11-09 05:30:11,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 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-09 05:30:11,838 INFO L276 IsEmpty]: Start isEmpty. Operand 1821 states and 2076 transitions. [2024-11-09 05:30:11,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-09 05:30:11,839 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:30:11,839 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] [2024-11-09 05:30:11,844 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-09 05:30:12,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 05:30:12,043 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 912 more)] === [2024-11-09 05:30:12,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:30:12,044 INFO L85 PathProgramCache]: Analyzing trace with hash 2061261670, now seen corresponding path program 1 times [2024-11-09 05:30:12,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 05:30:12,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1358578844] [2024-11-09 05:30:12,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:30:12,044 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 05:30:12,045 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 05:30:12,048 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 05:30:12,049 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-09 05:30:12,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:30:12,267 INFO L255 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 05:30:12,270 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:30:12,286 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-09 05:30:12,623 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-09 05:30:12,624 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 05:30:12,625 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 05:30:12,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1358578844] [2024-11-09 05:30:12,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1358578844] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:30:12,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:30:12,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 05:30:12,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939280777] [2024-11-09 05:30:12,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:30:12,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 05:30:12,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 05:30:12,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 05:30:12,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 05:30:12,629 INFO L87 Difference]: Start difference. First operand 1821 states and 2076 transitions. Second operand has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 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-09 05:30:19,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:30:19,013 INFO L93 Difference]: Finished difference Result 2206 states and 2363 transitions. [2024-11-09 05:30:19,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 05:30:19,014 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 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 28 [2024-11-09 05:30:19,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:30:19,018 INFO L225 Difference]: With dead ends: 2206 [2024-11-09 05:30:19,018 INFO L226 Difference]: Without dead ends: 2206 [2024-11-09 05:30:19,018 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 25 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-09 05:30:19,020 INFO L432 NwaCegarLoop]: 1446 mSDtfsCounter, 711 mSDsluCounter, 1667 mSDsCounter, 0 mSdLazyCounter, 1954 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 716 SdHoareTripleChecker+Valid, 3113 SdHoareTripleChecker+Invalid, 1957 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1954 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2024-11-09 05:30:19,020 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [716 Valid, 3113 Invalid, 1957 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1954 Invalid, 0 Unknown, 0 Unchecked, 6.3s Time] [2024-11-09 05:30:19,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2206 states. [2024-11-09 05:30:19,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2206 to 1817. [2024-11-09 05:30:19,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1817 states, 1051 states have (on average 1.9486203615604187) internal successors, (2048), 1807 states have internal predecessors, (2048), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-09 05:30:19,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1817 states to 1817 states and 2072 transitions. [2024-11-09 05:30:19,055 INFO L78 Accepts]: Start accepts. Automaton has 1817 states and 2072 transitions. Word has length 28 [2024-11-09 05:30:19,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:30:19,055 INFO L471 AbstractCegarLoop]: Abstraction has 1817 states and 2072 transitions. [2024-11-09 05:30:19,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 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-09 05:30:19,056 INFO L276 IsEmpty]: Start isEmpty. Operand 1817 states and 2072 transitions. [2024-11-09 05:30:19,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-09 05:30:19,057 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:30:19,057 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] [2024-11-09 05:30:19,064 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2024-11-09 05:30:19,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 05:30:19,258 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr107REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 912 more)] === [2024-11-09 05:30:19,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:30:19,259 INFO L85 PathProgramCache]: Analyzing trace with hash 1719405501, now seen corresponding path program 1 times [2024-11-09 05:30:19,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 05:30:19,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [933584953] [2024-11-09 05:30:19,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:30:19,260 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 05:30:19,260 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 05:30:19,263 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 05:30:19,265 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-09 05:30:19,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:30:19,550 INFO L255 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 05:30:19,554 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:30:19,622 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-09 05:30:19,622 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 05:30:19,622 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 05:30:19,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [933584953] [2024-11-09 05:30:19,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [933584953] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:30:19,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:30:19,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 05:30:19,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542359455] [2024-11-09 05:30:19,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:30:19,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 05:30:19,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 05:30:19,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 05:30:19,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 05:30:19,624 INFO L87 Difference]: Start difference. First operand 1817 states and 2072 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 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-09 05:30:19,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:30:19,712 INFO L93 Difference]: Finished difference Result 1811 states and 2062 transitions. [2024-11-09 05:30:19,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 05:30:19,713 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 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 44 [2024-11-09 05:30:19,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:30:19,718 INFO L225 Difference]: With dead ends: 1811 [2024-11-09 05:30:19,719 INFO L226 Difference]: Without dead ends: 1811 [2024-11-09 05:30:19,719 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 41 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-09 05:30:19,720 INFO L432 NwaCegarLoop]: 1710 mSDtfsCounter, 21 mSDsluCounter, 3389 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 5099 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-09 05:30:19,720 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 5099 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 05:30:19,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1811 states. [2024-11-09 05:30:19,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1811 to 1811. [2024-11-09 05:30:19,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1811 states, 1045 states have (on average 1.9502392344497608) internal successors, (2038), 1801 states have internal predecessors, (2038), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-09 05:30:19,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1811 states to 1811 states and 2062 transitions. [2024-11-09 05:30:19,750 INFO L78 Accepts]: Start accepts. Automaton has 1811 states and 2062 transitions. Word has length 44 [2024-11-09 05:30:19,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:30:19,751 INFO L471 AbstractCegarLoop]: Abstraction has 1811 states and 2062 transitions. [2024-11-09 05:30:19,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 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-09 05:30:19,751 INFO L276 IsEmpty]: Start isEmpty. Operand 1811 states and 2062 transitions. [2024-11-09 05:30:19,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-09 05:30:19,752 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:30:19,753 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] [2024-11-09 05:30:19,759 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2024-11-09 05:30:19,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 05:30:19,953 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr107REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 912 more)] === [2024-11-09 05:30:19,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:30:19,954 INFO L85 PathProgramCache]: Analyzing trace with hash -803305975, now seen corresponding path program 1 times [2024-11-09 05:30:19,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 05:30:19,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [732224497] [2024-11-09 05:30:19,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:30:19,954 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 05:30:19,954 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 05:30:19,955 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 05:30:19,956 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-09 05:30:20,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:30:20,241 INFO L255 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 05:30:20,244 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:30:20,643 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-09 05:30:20,644 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 05:30:20,644 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 05:30:20,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [732224497] [2024-11-09 05:30:20,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [732224497] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:30:20,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:30:20,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 05:30:20,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452647285] [2024-11-09 05:30:20,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:30:20,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 05:30:20,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 05:30:20,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 05:30:20,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 05:30:20,647 INFO L87 Difference]: Start difference. First operand 1811 states and 2062 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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-09 05:30:20,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:30:20,954 INFO L93 Difference]: Finished difference Result 2209 states and 2498 transitions. [2024-11-09 05:30:20,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 05:30:20,956 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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 52 [2024-11-09 05:30:20,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:30:20,964 INFO L225 Difference]: With dead ends: 2209 [2024-11-09 05:30:20,964 INFO L226 Difference]: Without dead ends: 2209 [2024-11-09 05:30:20,964 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 50 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-09 05:30:20,965 INFO L432 NwaCegarLoop]: 1796 mSDtfsCounter, 367 mSDsluCounter, 1659 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 367 SdHoareTripleChecker+Valid, 3455 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 05:30:20,965 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [367 Valid, 3455 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 05:30:20,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2209 states. [2024-11-09 05:30:20,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2209 to 1858. [2024-11-09 05:30:20,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1858 states, 1092 states have (on average 1.9093406593406594) internal successors, (2085), 1848 states have internal predecessors, (2085), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-09 05:30:20,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1858 states to 1858 states and 2109 transitions. [2024-11-09 05:30:20,997 INFO L78 Accepts]: Start accepts. Automaton has 1858 states and 2109 transitions. Word has length 52 [2024-11-09 05:30:20,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:30:20,997 INFO L471 AbstractCegarLoop]: Abstraction has 1858 states and 2109 transitions. [2024-11-09 05:30:20,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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-09 05:30:20,998 INFO L276 IsEmpty]: Start isEmpty. Operand 1858 states and 2109 transitions. [2024-11-09 05:30:20,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-09 05:30:20,999 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:30:20,999 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] [2024-11-09 05:30:21,005 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-11-09 05:30:21,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 05:30:21,200 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 912 more)] === [2024-11-09 05:30:21,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:30:21,200 INFO L85 PathProgramCache]: Analyzing trace with hash 161997268, now seen corresponding path program 1 times [2024-11-09 05:30:21,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 05:30:21,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [327526893] [2024-11-09 05:30:21,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:30:21,201 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 05:30:21,201 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 05:30:21,204 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 05:30:21,206 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-09 05:30:21,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:30:21,576 INFO L255 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 05:30:21,580 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:30:21,600 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-09 05:30:21,610 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-09 05:30:22,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:30:22,357 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-09 05:30:22,383 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 05:30:22,383 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-09 05:30:22,407 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-09 05:30:22,408 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 05:30:22,408 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 05:30:22,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [327526893] [2024-11-09 05:30:22,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [327526893] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:30:22,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:30:22,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 05:30:22,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133962784] [2024-11-09 05:30:22,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:30:22,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 05:30:22,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 05:30:22,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 05:30:22,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 05:30:22,412 INFO L87 Difference]: Start difference. First operand 1858 states and 2109 transitions. Second operand has 4 states, 3 states have (on average 18.333333333333332) internal successors, (55), 4 states have internal predecessors, (55), 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-09 05:30:26,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:30:26,843 INFO L93 Difference]: Finished difference Result 1774 states and 2025 transitions. [2024-11-09 05:30:26,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 05:30:26,844 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 18.333333333333332) internal successors, (55), 4 states have internal predecessors, (55), 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 55 [2024-11-09 05:30:26,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:30:26,849 INFO L225 Difference]: With dead ends: 1774 [2024-11-09 05:30:26,849 INFO L226 Difference]: Without dead ends: 1774 [2024-11-09 05:30:26,849 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 05:30:26,850 INFO L432 NwaCegarLoop]: 842 mSDtfsCounter, 2284 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 1021 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2295 SdHoareTripleChecker+Valid, 1057 SdHoareTripleChecker+Invalid, 1128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 1021 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2024-11-09 05:30:26,850 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2295 Valid, 1057 Invalid, 1128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 1021 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2024-11-09 05:30:26,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1774 states. [2024-11-09 05:30:26,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1774 to 1596. [2024-11-09 05:30:26,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1596 states, 914 states have (on average 1.8260393873085339) internal successors, (1669), 1586 states have internal predecessors, (1669), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-09 05:30:26,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1596 states to 1596 states and 1693 transitions. [2024-11-09 05:30:26,875 INFO L78 Accepts]: Start accepts. Automaton has 1596 states and 1693 transitions. Word has length 55 [2024-11-09 05:30:26,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:30:26,876 INFO L471 AbstractCegarLoop]: Abstraction has 1596 states and 1693 transitions. [2024-11-09 05:30:26,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 18.333333333333332) internal successors, (55), 4 states have internal predecessors, (55), 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-09 05:30:26,876 INFO L276 IsEmpty]: Start isEmpty. Operand 1596 states and 1693 transitions. [2024-11-09 05:30:26,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-09 05:30:26,877 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:30:26,877 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] [2024-11-09 05:30:26,885 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2024-11-09 05:30:27,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 05:30:27,078 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 912 more)] === [2024-11-09 05:30:27,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:30:27,078 INFO L85 PathProgramCache]: Analyzing trace with hash 1342467420, now seen corresponding path program 1 times [2024-11-09 05:30:27,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 05:30:27,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [418181222] [2024-11-09 05:30:27,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:30:27,079 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 05:30:27,079 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 05:30:27,080 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 05:30:27,081 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-09 05:30:27,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:30:27,423 INFO L255 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 05:30:27,427 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:30:27,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-09 05:30:27,464 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-09 05:30:27,501 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-09 05:30:27,520 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-09 05:30:27,520 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 05:30:27,520 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 05:30:27,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [418181222] [2024-11-09 05:30:27,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [418181222] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:30:27,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:30:27,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 05:30:27,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645509374] [2024-11-09 05:30:27,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:30:27,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 05:30:27,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 05:30:27,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 05:30:27,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 05:30:27,522 INFO L87 Difference]: Start difference. First operand 1596 states and 1693 transitions. Second operand has 5 states, 4 states have (on average 15.0) internal successors, (60), 5 states have internal predecessors, (60), 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-09 05:30:32,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:30:32,669 INFO L93 Difference]: Finished difference Result 1595 states and 1692 transitions. [2024-11-09 05:30:32,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 05:30:32,670 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 15.0) internal successors, (60), 5 states have internal predecessors, (60), 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 60 [2024-11-09 05:30:32,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:30:32,675 INFO L225 Difference]: With dead ends: 1595 [2024-11-09 05:30:32,676 INFO L226 Difference]: Without dead ends: 1595 [2024-11-09 05:30:32,676 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 56 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-09 05:30:32,677 INFO L432 NwaCegarLoop]: 1637 mSDtfsCounter, 2 mSDsluCounter, 2593 mSDsCounter, 0 mSdLazyCounter, 2325 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 4230 SdHoareTripleChecker+Invalid, 2326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2024-11-09 05:30:32,677 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 4230 Invalid, 2326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2325 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2024-11-09 05:30:32,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1595 states. [2024-11-09 05:30:32,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1595 to 1595. [2024-11-09 05:30:32,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1595 states, 914 states have (on average 1.824945295404814) internal successors, (1668), 1585 states have internal predecessors, (1668), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-09 05:30:32,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1595 states to 1595 states and 1692 transitions. [2024-11-09 05:30:32,703 INFO L78 Accepts]: Start accepts. Automaton has 1595 states and 1692 transitions. Word has length 60 [2024-11-09 05:30:32,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:30:32,703 INFO L471 AbstractCegarLoop]: Abstraction has 1595 states and 1692 transitions. [2024-11-09 05:30:32,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 15.0) internal successors, (60), 5 states have internal predecessors, (60), 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-09 05:30:32,704 INFO L276 IsEmpty]: Start isEmpty. Operand 1595 states and 1692 transitions. [2024-11-09 05:30:32,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-09 05:30:32,705 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:30:32,705 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] [2024-11-09 05:30:32,712 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-11-09 05:30:32,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 05:30:32,906 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 912 more)] === [2024-11-09 05:30:32,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:30:32,907 INFO L85 PathProgramCache]: Analyzing trace with hash 1342467421, now seen corresponding path program 1 times [2024-11-09 05:30:32,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 05:30:32,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [181476715] [2024-11-09 05:30:32,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:30:32,908 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 05:30:32,908 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 05:30:32,911 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 05:30:32,913 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-11-09 05:30:33,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:30:33,279 INFO L255 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-09 05:30:33,282 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:30:33,293 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-09 05:30:33,321 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-09 05:30:33,330 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-09 05:30:33,408 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-11-09 05:30:33,435 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-09 05:30:33,436 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 05:30:33,436 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 05:30:33,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [181476715] [2024-11-09 05:30:33,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [181476715] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:30:33,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:30:33,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 05:30:33,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007223990] [2024-11-09 05:30:33,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:30:33,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 05:30:33,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 05:30:33,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 05:30:33,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 05:30:33,438 INFO L87 Difference]: Start difference. First operand 1595 states and 1692 transitions. Second operand has 5 states, 4 states have (on average 15.0) internal successors, (60), 5 states have internal predecessors, (60), 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-09 05:30:40,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:30:40,414 INFO L93 Difference]: Finished difference Result 1594 states and 1691 transitions. [2024-11-09 05:30:40,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 05:30:40,415 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 15.0) internal successors, (60), 5 states have internal predecessors, (60), 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 60 [2024-11-09 05:30:40,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:30:40,419 INFO L225 Difference]: With dead ends: 1594 [2024-11-09 05:30:40,419 INFO L226 Difference]: Without dead ends: 1594 [2024-11-09 05:30:40,420 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 56 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-09 05:30:40,420 INFO L432 NwaCegarLoop]: 1637 mSDtfsCounter, 1 mSDsluCounter, 2643 mSDsCounter, 0 mSdLazyCounter, 2272 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 4280 SdHoareTripleChecker+Invalid, 2273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.9s IncrementalHoareTripleChecker+Time [2024-11-09 05:30:40,420 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 4280 Invalid, 2273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2272 Invalid, 0 Unknown, 0 Unchecked, 6.9s Time] [2024-11-09 05:30:40,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1594 states. [2024-11-09 05:30:40,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1594 to 1594. [2024-11-09 05:30:40,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1594 states, 913 states have (on average 1.8258488499452354) internal successors, (1667), 1584 states have internal predecessors, (1667), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-09 05:30:40,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1594 states to 1594 states and 1691 transitions. [2024-11-09 05:30:40,447 INFO L78 Accepts]: Start accepts. Automaton has 1594 states and 1691 transitions. Word has length 60 [2024-11-09 05:30:40,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:30:40,448 INFO L471 AbstractCegarLoop]: Abstraction has 1594 states and 1691 transitions. [2024-11-09 05:30:40,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 15.0) internal successors, (60), 5 states have internal predecessors, (60), 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-09 05:30:40,448 INFO L276 IsEmpty]: Start isEmpty. Operand 1594 states and 1691 transitions. [2024-11-09 05:30:40,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-09 05:30:40,449 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:30:40,450 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] [2024-11-09 05:30:40,459 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2024-11-09 05:30:40,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 05:30:40,651 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 912 more)] === [2024-11-09 05:30:40,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:30:40,652 INFO L85 PathProgramCache]: Analyzing trace with hash 991382723, now seen corresponding path program 1 times [2024-11-09 05:30:40,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 05:30:40,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1239723064] [2024-11-09 05:30:40,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:30:40,653 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 05:30:40,654 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 05:30:40,657 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 05:30:40,659 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-11-09 05:30:41,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:30:41,030 INFO L255 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 05:30:41,033 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:30:41,068 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-09 05:30:41,069 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 05:30:41,069 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 05:30:41,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1239723064] [2024-11-09 05:30:41,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1239723064] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:30:41,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:30:41,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 05:30:41,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439285817] [2024-11-09 05:30:41,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:30:41,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 05:30:41,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 05:30:41,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 05:30:41,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 05:30:41,071 INFO L87 Difference]: Start difference. First operand 1594 states and 1691 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 05:30:41,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:30:41,155 INFO L93 Difference]: Finished difference Result 1597 states and 1696 transitions. [2024-11-09 05:30:41,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 05:30:41,156 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 68 [2024-11-09 05:30:41,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:30:41,162 INFO L225 Difference]: With dead ends: 1597 [2024-11-09 05:30:41,162 INFO L226 Difference]: Without dead ends: 1597 [2024-11-09 05:30:41,163 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 65 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-09 05:30:41,163 INFO L432 NwaCegarLoop]: 1636 mSDtfsCounter, 0 mSDsluCounter, 3264 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4900 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 05:30:41,164 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4900 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 05:30:41,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1597 states. [2024-11-09 05:30:41,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1597 to 1597. [2024-11-09 05:30:41,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1597 states, 915 states have (on average 1.825136612021858) internal successors, (1670), 1587 states have internal predecessors, (1670), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2024-11-09 05:30:41,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1597 states to 1597 states and 1696 transitions. [2024-11-09 05:30:41,201 INFO L78 Accepts]: Start accepts. Automaton has 1597 states and 1696 transitions. Word has length 68 [2024-11-09 05:30:41,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:30:41,202 INFO L471 AbstractCegarLoop]: Abstraction has 1597 states and 1696 transitions. [2024-11-09 05:30:41,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 05:30:41,202 INFO L276 IsEmpty]: Start isEmpty. Operand 1597 states and 1696 transitions. [2024-11-09 05:30:41,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-09 05:30:41,203 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:30:41,203 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] [2024-11-09 05:30:41,212 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2024-11-09 05:30:41,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 05:30:41,408 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 912 more)] === [2024-11-09 05:30:41,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:30:41,409 INFO L85 PathProgramCache]: Analyzing trace with hash 693056251, now seen corresponding path program 1 times [2024-11-09 05:30:41,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 05:30:41,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [466011031] [2024-11-09 05:30:41,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:30:41,409 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 05:30:41,409 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 05:30:41,412 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 05:30:41,414 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-11-09 05:30:41,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:30:41,732 INFO L255 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 05:30:41,734 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:30:41,769 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-09 05:30:41,769 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:30:41,855 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-09 05:30:41,855 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 05:30:41,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [466011031] [2024-11-09 05:30:41,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [466011031] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 05:30:41,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1247948027] [2024-11-09 05:30:41,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:30:41,856 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 05:30:41,857 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/cvc4 [2024-11-09 05:30:41,859 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 05:30:41,861 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (17)] Waiting until timeout for monitored process [2024-11-09 05:30:42,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:30:42,451 INFO L255 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 05:30:42,453 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:30:42,470 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-09 05:30:42,471 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:30:42,505 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-09 05:30:42,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1247948027] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 05:30:42,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [563726942] [2024-11-09 05:30:42,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:30:42,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:30:42,506 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:30:42,507 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:30:42,509 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-11-09 05:30:42,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:30:42,840 INFO L255 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 05:30:42,842 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:30:42,859 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-09 05:30:42,859 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:30:42,900 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-09 05:30:42,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [563726942] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 05:30:42,901 INFO L185 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2024-11-09 05:30:42,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 5, 5, 5] total 8 [2024-11-09 05:30:42,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412700233] [2024-11-09 05:30:42,902 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2024-11-09 05:30:42,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 05:30:42,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 05:30:42,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 05:30:42,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-09 05:30:42,904 INFO L87 Difference]: Start difference. First operand 1597 states and 1696 transitions. Second operand has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 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-09 05:30:43,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:30:43,142 INFO L93 Difference]: Finished difference Result 1609 states and 1714 transitions. [2024-11-09 05:30:43,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 05:30:43,143 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 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 69 [2024-11-09 05:30:43,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:30:43,147 INFO L225 Difference]: With dead ends: 1609 [2024-11-09 05:30:43,147 INFO L226 Difference]: Without dead ends: 1609 [2024-11-09 05:30:43,147 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 411 GetRequests, 402 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-09 05:30:43,148 INFO L432 NwaCegarLoop]: 1635 mSDtfsCounter, 7 mSDsluCounter, 3265 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 4900 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 05:30:43,148 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 4900 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 05:30:43,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1609 states. [2024-11-09 05:30:43,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1609 to 1607. [2024-11-09 05:30:43,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1607 states, 924 states have (on average 1.8235930735930737) internal successors, (1685), 1596 states have internal predecessors, (1685), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2024-11-09 05:30:43,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1607 states to 1607 states and 1711 transitions. [2024-11-09 05:30:43,172 INFO L78 Accepts]: Start accepts. Automaton has 1607 states and 1711 transitions. Word has length 69 [2024-11-09 05:30:43,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:30:43,173 INFO L471 AbstractCegarLoop]: Abstraction has 1607 states and 1711 transitions. [2024-11-09 05:30:43,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 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-09 05:30:43,173 INFO L276 IsEmpty]: Start isEmpty. Operand 1607 states and 1711 transitions. [2024-11-09 05:30:43,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-09 05:30:43,174 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:30:43,174 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] [2024-11-09 05:30:43,182 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (17)] Ended with exit code 0 [2024-11-09 05:30:43,379 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2024-11-09 05:30:43,591 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2024-11-09 05:30:43,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:30:43,775 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 912 more)] === [2024-11-09 05:30:43,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:30:43,776 INFO L85 PathProgramCache]: Analyzing trace with hash -50652477, now seen corresponding path program 2 times [2024-11-09 05:30:43,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 05:30:43,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1655449930] [2024-11-09 05:30:43,777 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 05:30:43,777 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 05:30:43,777 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 05:30:43,781 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 05:30:43,782 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2024-11-09 05:30:44,355 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 05:30:44,355 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 05:30:44,366 INFO L255 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 05:30:44,368 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:30:44,455 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-09 05:30:44,455 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:30:44,749 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-09 05:30:44,750 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 05:30:44,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1655449930] [2024-11-09 05:30:44,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1655449930] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 05:30:44,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1390244124] [2024-11-09 05:30:44,750 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 05:30:44,750 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 05:30:44,750 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/cvc4 [2024-11-09 05:30:44,756 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 05:30:44,758 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (20)] Waiting until timeout for monitored process [2024-11-09 05:30:46,196 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 05:30:46,196 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 05:30:46,234 INFO L255 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 05:30:46,236 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:30:46,299 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-09 05:30:46,299 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:30:46,412 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-09 05:30:46,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1390244124] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 05:30:46,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [590295223] [2024-11-09 05:30:46,413 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 05:30:46,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:30:46,413 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:30:46,415 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:30:46,417 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2024-11-09 05:30:59,617 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 05:30:59,617 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 05:30:59,631 INFO L255 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-09 05:30:59,634 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:30:59,638 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-09 05:30:59,785 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 05:30:59,785 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-09 05:30:59,821 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-09 05:31:00,165 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 05:31:00,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 44 treesize of output 43 [2024-11-09 05:31:00,272 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-09 05:31:00,326 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-09 05:31:00,326 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:31:00,466 INFO L349 Elim1Store]: treesize reduction 7, result has 63.2 percent of original size [2024-11-09 05:31:00,466 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-09 05:31:00,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [590295223] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:31:00,604 INFO L185 FreeRefinementEngine]: Found 0 perfect and 5 imperfect interpolant sequences. [2024-11-09 05:31:00,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 8, 10] total 23 [2024-11-09 05:31:00,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050761532] [2024-11-09 05:31:00,605 INFO L85 oduleStraightlineAll]: Using 5 imperfect interpolants to construct interpolant automaton [2024-11-09 05:31:00,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-09 05:31:00,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 05:31:00,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-09 05:31:00,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=502, Unknown=9, NotChecked=0, Total=600 [2024-11-09 05:31:00,608 INFO L87 Difference]: Start difference. First operand 1607 states and 1711 transitions. Second operand has 23 states, 22 states have (on average 6.454545454545454) internal successors, (142), 22 states have internal predecessors, (142), 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-09 05:31:19,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:31:19,299 INFO L93 Difference]: Finished difference Result 1623 states and 1734 transitions. [2024-11-09 05:31:19,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-11-09 05:31:19,300 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 6.454545454545454) internal successors, (142), 22 states have internal predecessors, (142), 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 72 [2024-11-09 05:31:19,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:31:19,304 INFO L225 Difference]: With dead ends: 1623 [2024-11-09 05:31:19,304 INFO L226 Difference]: Without dead ends: 1617 [2024-11-09 05:31:19,305 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 385 GetRequests, 337 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 437 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=389, Invalid=2050, Unknown=11, NotChecked=0, Total=2450 [2024-11-09 05:31:19,306 INFO L432 NwaCegarLoop]: 1061 mSDtfsCounter, 1161 mSDsluCounter, 11026 mSDsCounter, 0 mSdLazyCounter, 8284 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1173 SdHoareTripleChecker+Valid, 12087 SdHoareTripleChecker+Invalid, 8320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 8284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.2s IncrementalHoareTripleChecker+Time [2024-11-09 05:31:19,306 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1173 Valid, 12087 Invalid, 8320 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [36 Valid, 8284 Invalid, 0 Unknown, 0 Unchecked, 17.2s Time] [2024-11-09 05:31:19,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1617 states. [2024-11-09 05:31:19,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1617 to 1615. [2024-11-09 05:31:19,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1615 states, 933 states have (on average 1.8167202572347267) internal successors, (1695), 1604 states have internal predecessors, (1695), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2024-11-09 05:31:19,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1615 states to 1615 states and 1721 transitions. [2024-11-09 05:31:19,332 INFO L78 Accepts]: Start accepts. Automaton has 1615 states and 1721 transitions. Word has length 72 [2024-11-09 05:31:19,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:31:19,333 INFO L471 AbstractCegarLoop]: Abstraction has 1615 states and 1721 transitions. [2024-11-09 05:31:19,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 6.454545454545454) internal successors, (142), 22 states have internal predecessors, (142), 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-09 05:31:19,333 INFO L276 IsEmpty]: Start isEmpty. Operand 1615 states and 1721 transitions. [2024-11-09 05:31:19,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-09 05:31:19,334 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:31:19,334 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] [2024-11-09 05:31:19,347 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (20)] Ended with exit code 0 [2024-11-09 05:31:19,562 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2024-11-09 05:31:19,742 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Ended with exit code 0 [2024-11-09 05:31:19,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt,21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 05:31:19,935 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 912 more)] === [2024-11-09 05:31:19,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:31:19,936 INFO L85 PathProgramCache]: Analyzing trace with hash -1450332220, now seen corresponding path program 1 times [2024-11-09 05:31:19,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 05:31:19,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [284091128] [2024-11-09 05:31:19,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:31:19,937 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 05:31:19,937 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 05:31:19,938 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 05:31:19,939 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2024-11-09 05:31:20,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:31:20,334 INFO L255 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-09 05:31:20,336 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:31:20,525 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-09 05:31:20,525 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:31:21,152 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-09 05:31:21,152 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 05:31:21,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [284091128] [2024-11-09 05:31:21,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [284091128] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 05:31:21,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1296493558] [2024-11-09 05:31:21,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:31:21,153 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 05:31:21,153 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/cvc4 [2024-11-09 05:31:21,156 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 05:31:21,160 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (23)] Waiting until timeout for monitored process [2024-11-09 05:31:21,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:31:21,890 INFO L255 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-09 05:31:21,893 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:31:21,943 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-09 05:31:21,943 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:31:22,118 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-09 05:31:22,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1296493558] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 05:31:22,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [935642498] [2024-11-09 05:31:22,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:31:22,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:31:22,119 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:31:22,121 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:31:22,123 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2024-11-09 05:31:22,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:31:22,563 INFO L255 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-09 05:31:22,566 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:31:22,667 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-09 05:31:22,667 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:31:23,501 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-09 05:31:23,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [935642498] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 05:31:23,501 INFO L185 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2024-11-09 05:31:23,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14, 14, 14, 14] total 38 [2024-11-09 05:31:23,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903117415] [2024-11-09 05:31:23,502 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2024-11-09 05:31:23,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-11-09 05:31:23,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 05:31:23,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-11-09 05:31:23,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=447, Invalid=959, Unknown=0, NotChecked=0, Total=1406 [2024-11-09 05:31:23,506 INFO L87 Difference]: Start difference. First operand 1615 states and 1721 transitions. Second operand has 38 states, 38 states have (on average 2.710526315789474) internal successors, (103), 38 states have internal predecessors, (103), 1 states have call successors, (1), 1 states have call predecessors, (1), 3 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 05:31:26,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:31:26,177 INFO L93 Difference]: Finished difference Result 1641 states and 1763 transitions. [2024-11-09 05:31:26,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2024-11-09 05:31:26,178 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 2.710526315789474) internal successors, (103), 38 states have internal predecessors, (103), 1 states have call successors, (1), 1 states have call predecessors, (1), 3 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 78 [2024-11-09 05:31:26,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:31:26,182 INFO L225 Difference]: With dead ends: 1641 [2024-11-09 05:31:26,182 INFO L226 Difference]: Without dead ends: 1635 [2024-11-09 05:31:26,183 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 483 GetRequests, 426 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1168, Invalid=2254, Unknown=0, NotChecked=0, Total=3422 [2024-11-09 05:31:26,184 INFO L432 NwaCegarLoop]: 1635 mSDtfsCounter, 24 mSDsluCounter, 19573 mSDsCounter, 0 mSdLazyCounter, 666 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 21208 SdHoareTripleChecker+Invalid, 723 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 666 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-09 05:31:26,185 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 21208 Invalid, 723 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 666 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-09 05:31:26,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1635 states. [2024-11-09 05:31:26,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1635 to 1633. [2024-11-09 05:31:26,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1633 states, 951 states have (on average 1.8065194532071505) internal successors, (1718), 1622 states have internal predecessors, (1718), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2024-11-09 05:31:26,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1633 states to 1633 states and 1744 transitions. [2024-11-09 05:31:26,213 INFO L78 Accepts]: Start accepts. Automaton has 1633 states and 1744 transitions. Word has length 78 [2024-11-09 05:31:26,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:31:26,213 INFO L471 AbstractCegarLoop]: Abstraction has 1633 states and 1744 transitions. [2024-11-09 05:31:26,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 2.710526315789474) internal successors, (103), 38 states have internal predecessors, (103), 1 states have call successors, (1), 1 states have call predecessors, (1), 3 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 05:31:26,214 INFO L276 IsEmpty]: Start isEmpty. Operand 1633 states and 1744 transitions. [2024-11-09 05:31:26,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-09 05:31:26,215 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:31:26,215 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] [2024-11-09 05:31:26,224 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (23)] Ended with exit code 0 [2024-11-09 05:31:26,433 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2024-11-09 05:31:26,620 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2024-11-09 05:31:26,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt,24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 05:31:26,816 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 912 more)] === [2024-11-09 05:31:26,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:31:26,817 INFO L85 PathProgramCache]: Analyzing trace with hash -982017596, now seen corresponding path program 2 times [2024-11-09 05:31:26,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 05:31:26,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1285133206] [2024-11-09 05:31:26,817 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 05:31:26,817 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 05:31:26,817 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 05:31:26,818 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 05:31:26,820 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2024-11-09 05:31:27,419 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 05:31:27,419 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 05:31:27,436 INFO L255 TraceCheckSpWp]: Trace formula consists of 534 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-11-09 05:31:27,440 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:31:28,290 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-09 05:31:28,291 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:31:31,093 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-09 05:31:31,094 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 05:31:31,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1285133206] [2024-11-09 05:31:31,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1285133206] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 05:31:31,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1946092066] [2024-11-09 05:31:31,095 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 05:31:31,095 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 05:31:31,095 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/cvc4 [2024-11-09 05:31:31,097 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 05:31:31,101 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (26)] Waiting until timeout for monitored process [2024-11-09 05:31:33,054 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 05:31:33,054 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 05:31:33,099 INFO L255 TraceCheckSpWp]: Trace formula consists of 534 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-11-09 05:31:33,102 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:31:33,293 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-09 05:31:33,294 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:31:34,063 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-09 05:31:34,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1946092066] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 05:31:34,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [612055669] [2024-11-09 05:31:34,064 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 05:31:34,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:31:34,064 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:31:34,066 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:31:34,069 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2024-11-09 05:31:39,987 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 05:31:39,987 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 05:31:40,006 INFO L255 TraceCheckSpWp]: Trace formula consists of 534 conjuncts, 64 conjuncts are in the unsatisfiable core [2024-11-09 05:31:40,014 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:31:40,018 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-09 05:31:40,272 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 05:31:40,272 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-09 05:31:40,282 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-09 05:31:40,427 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-09 05:31:40,441 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-09 05:31:40,848 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-09 05:31:40,854 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-09 05:31:41,737 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 05:31:41,738 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-09 05:31:41,746 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-09 05:31:42,024 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-09 05:31:42,032 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-09 05:31:42,163 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-09 05:31:42,163 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:31:43,208 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_2512 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_2512) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv16 32) .cse0) (bvadd (_ bv20 32) .cse0)))) (forall ((v_ArrVal_2512 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2511 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv20 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_2512) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_2511) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-09 05:31:43,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [612055669] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:31:43,213 INFO L185 FreeRefinementEngine]: Found 0 perfect and 5 imperfect interpolant sequences. [2024-11-09 05:31:43,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26, 26, 8] total 57 [2024-11-09 05:31:43,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940691981] [2024-11-09 05:31:43,214 INFO L85 oduleStraightlineAll]: Using 5 imperfect interpolants to construct interpolant automaton [2024-11-09 05:31:43,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2024-11-09 05:31:43,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 05:31:43,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2024-11-09 05:31:43,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=697, Invalid=2728, Unknown=1, NotChecked=114, Total=3540 [2024-11-09 05:31:43,217 INFO L87 Difference]: Start difference. First operand 1633 states and 1744 transitions. Second operand has 57 states, 56 states have (on average 3.1785714285714284) internal successors, (178), 57 states have internal predecessors, (178), 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-09 05:32:59,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:32:59,452 INFO L93 Difference]: Finished difference Result 1733 states and 1901 transitions. [2024-11-09 05:32:59,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2024-11-09 05:32:59,452 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 56 states have (on average 3.1785714285714284) internal successors, (178), 57 states have internal predecessors, (178), 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 90 [2024-11-09 05:32:59,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:32:59,457 INFO L225 Difference]: With dead ends: 1733 [2024-11-09 05:32:59,457 INFO L226 Difference]: Without dead ends: 1719 [2024-11-09 05:32:59,463 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 548 GetRequests, 392 SyntacticMatches, 1 SemanticMatches, 155 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 6071 ImplicationChecksByTransitivity, 25.1s TimeCoverageRelationStatistics Valid=5446, Invalid=18737, Unknown=1, NotChecked=308, Total=24492 [2024-11-09 05:32:59,464 INFO L432 NwaCegarLoop]: 1069 mSDtfsCounter, 1188 mSDsluCounter, 30324 mSDsCounter, 0 mSdLazyCounter, 22076 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 48.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1198 SdHoareTripleChecker+Valid, 31393 SdHoareTripleChecker+Invalid, 22188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.3s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 22076 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 54.7s IncrementalHoareTripleChecker+Time [2024-11-09 05:32:59,464 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1198 Valid, 31393 Invalid, 22188 Unknown, 0 Unchecked, 0.3s Time], IncrementalHoareTripleChecker [112 Valid, 22076 Invalid, 0 Unknown, 0 Unchecked, 54.7s Time] [2024-11-09 05:32:59,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1719 states. [2024-11-09 05:32:59,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1719 to 1719. [2024-11-09 05:32:59,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1719 states, 1037 states have (on average 1.7521697203471553) internal successors, (1817), 1707 states have internal predecessors, (1817), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2024-11-09 05:32:59,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1719 states to 1719 states and 1843 transitions. [2024-11-09 05:32:59,494 INFO L78 Accepts]: Start accepts. Automaton has 1719 states and 1843 transitions. Word has length 90 [2024-11-09 05:32:59,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:32:59,495 INFO L471 AbstractCegarLoop]: Abstraction has 1719 states and 1843 transitions. [2024-11-09 05:32:59,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 56 states have (on average 3.1785714285714284) internal successors, (178), 57 states have internal predecessors, (178), 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-09 05:32:59,495 INFO L276 IsEmpty]: Start isEmpty. Operand 1719 states and 1843 transitions. [2024-11-09 05:32:59,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-09 05:32:59,496 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:32:59,496 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] [2024-11-09 05:32:59,511 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Forceful destruction successful, exit code 0 [2024-11-09 05:32:59,706 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (26)] Ended with exit code 0 [2024-11-09 05:32:59,920 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2024-11-09 05:33:00,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt,27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:33:00,098 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr74REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 912 more)] === [2024-11-09 05:33:00,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:33:00,098 INFO L85 PathProgramCache]: Analyzing trace with hash -1196226501, now seen corresponding path program 1 times [2024-11-09 05:33:00,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 05:33:00,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1603167036] [2024-11-09 05:33:00,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:33:00,099 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 05:33:00,099 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 05:33:00,100 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 05:33:00,102 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2024-11-09 05:33:01,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:33:01,071 INFO L255 TraceCheckSpWp]: Trace formula consists of 796 conjuncts, 60 conjuncts are in the unsatisfiable core [2024-11-09 05:33:01,085 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:33:01,090 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-09 05:33:01,333 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-09 05:33:01,334 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-09 05:33:01,375 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-09 05:33:01,507 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2024-11-09 05:33:02,919 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 05:33:02,919 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-09 05:33:03,069 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 05:33:03,070 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2024-11-09 05:33:03,120 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-09 05:33:03,173 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-09 05:33:03,174 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:33:03,301 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2920 (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$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_2920) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-09 05:33:03,788 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2920 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2966 (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$.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_2966))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2920)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-09 05:33:03,790 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 05:33:03,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1603167036] [2024-11-09 05:33:03,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1603167036] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:33:03,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [148427204] [2024-11-09 05:33:03,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:33:03,791 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 05:33:03,791 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/cvc4 [2024-11-09 05:33:03,792 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 05:33:03,794 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (29)] Waiting until timeout for monitored process [2024-11-09 05:33:07,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:33:07,807 INFO L255 TraceCheckSpWp]: Trace formula consists of 796 conjuncts, 62 conjuncts are in the unsatisfiable core [2024-11-09 05:33:07,840 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:33:07,849 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-09 05:33:08,038 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-09 05:33:08,039 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-09 05:33:08,069 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-09 05:33:08,160 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2024-11-09 05:33:09,336 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 05:33:09,337 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2024-11-09 05:33:09,458 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 05:33:09,459 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2024-11-09 05:33:09,491 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-09 05:33:09,501 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-09 05:33:09,501 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:33:09,520 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3374 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_3374) |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-09 05:33:09,530 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3374 (Array (_ BitVec 32) (_ BitVec 32)))) (= (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$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_3374) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (_ bv0 1))) is different from false [2024-11-09 05:33:10,024 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3420 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3374 (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$.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_3420))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3374)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-09 05:33:10,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [148427204] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:33:10,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1720561492] [2024-11-09 05:33:10,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:33:10,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:33:10,027 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:33:10,028 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:33:10,030 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2024-11-09 05:33:10,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:33:10,722 INFO L255 TraceCheckSpWp]: Trace formula consists of 796 conjuncts, 58 conjuncts are in the unsatisfiable core [2024-11-09 05:33:10,732 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:33:10,741 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-09 05:33:10,925 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 05:33:10,926 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-09 05:33:10,963 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-09 05:33:11,488 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 05:33:11,488 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-09 05:33:11,602 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 05:33:11,603 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-09 05:33:11,700 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-09 05:33:11,705 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-09 05:33:11,705 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:33:11,747 INFO L349 Elim1Store]: treesize reduction 7, result has 63.2 percent of original size [2024-11-09 05:33:11,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-09 05:33:11,758 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3827 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_#t~mem34#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_3827) |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-09 05:33:11,773 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3827 (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$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (= .cse0 (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_3827) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) is different from false [2024-11-09 05:33:12,389 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3873 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3827 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_3873)) (.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_3827) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) .cse1)))) is different from false [2024-11-09 05:33:12,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1720561492] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:33:12,392 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 05:33:12,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 10] total 17 [2024-11-09 05:33:12,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942393502] [2024-11-09 05:33:12,393 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 05:33:12,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-09 05:33:12,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 05:33:12,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-09 05:33:12,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=313, Unknown=17, NotChecked=344, Total=756 [2024-11-09 05:33:12,395 INFO L87 Difference]: Start difference. First operand 1719 states and 1843 transitions. Second operand has 18 states, 15 states have (on average 5.933333333333334) internal successors, (89), 18 states have internal predecessors, (89), 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-09 05:33:25,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:33:25,358 INFO L93 Difference]: Finished difference Result 1720 states and 1845 transitions. [2024-11-09 05:33:25,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 05:33:25,359 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 15 states have (on average 5.933333333333334) internal successors, (89), 18 states have internal predecessors, (89), 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 115 [2024-11-09 05:33:25,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:33:25,361 INFO L225 Difference]: With dead ends: 1720 [2024-11-09 05:33:25,361 INFO L226 Difference]: Without dead ends: 1720 [2024-11-09 05:33:25,362 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 364 GetRequests, 334 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=91, Invalid=344, Unknown=17, NotChecked=360, Total=812 [2024-11-09 05:33:25,362 INFO L432 NwaCegarLoop]: 1063 mSDtfsCounter, 1137 mSDsluCounter, 6618 mSDsCounter, 0 mSdLazyCounter, 5851 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1149 SdHoareTripleChecker+Valid, 7681 SdHoareTripleChecker+Invalid, 5871 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 5851 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.7s IncrementalHoareTripleChecker+Time [2024-11-09 05:33:25,362 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1149 Valid, 7681 Invalid, 5871 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [20 Valid, 5851 Invalid, 0 Unknown, 0 Unchecked, 12.7s Time] [2024-11-09 05:33:25,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1720 states. [2024-11-09 05:33:25,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1720 to 1718. [2024-11-09 05:33:25,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1718 states, 1037 states have (on average 1.751205400192864) internal successors, (1816), 1706 states have internal predecessors, (1816), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2024-11-09 05:33:25,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1718 states to 1718 states and 1842 transitions. [2024-11-09 05:33:25,411 INFO L78 Accepts]: Start accepts. Automaton has 1718 states and 1842 transitions. Word has length 115 [2024-11-09 05:33:25,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:33:25,411 INFO L471 AbstractCegarLoop]: Abstraction has 1718 states and 1842 transitions. [2024-11-09 05:33:25,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 15 states have (on average 5.933333333333334) internal successors, (89), 18 states have internal predecessors, (89), 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-09 05:33:25,412 INFO L276 IsEmpty]: Start isEmpty. Operand 1718 states and 1842 transitions. [2024-11-09 05:33:25,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-09 05:33:25,413 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:33:25,413 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] [2024-11-09 05:33:25,447 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2024-11-09 05:33:25,622 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Forceful destruction successful, exit code 0 [2024-11-09 05:33:25,825 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (29)] Forceful destruction successful, exit code 0 [2024-11-09 05:33:26,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt [2024-11-09 05:33:26,014 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 912 more)] === [2024-11-09 05:33:26,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:33:26,015 INFO L85 PathProgramCache]: Analyzing trace with hash -1196226500, now seen corresponding path program 1 times [2024-11-09 05:33:26,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 05:33:26,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1494871960] [2024-11-09 05:33:26,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:33:26,016 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 05:33:26,016 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 05:33:26,017 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 05:33:26,018 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (31)] Waiting until timeout for monitored process [2024-11-09 05:33:26,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:33:26,941 INFO L255 TraceCheckSpWp]: Trace formula consists of 796 conjuncts, 111 conjuncts are in the unsatisfiable core [2024-11-09 05:33:26,953 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:33:26,956 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-09 05:33:27,068 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 05:33:27,090 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 05:33:27,090 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-09 05:33:27,122 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-09 05:33:27,132 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-09 05:33:27,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-09 05:33:27,306 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-09 05:33:28,131 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 05:33:28,131 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-09 05:33:28,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-09 05:33:28,238 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 05:33:28,238 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-09 05:33:28,244 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-09 05:33:28,272 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-09 05:33:28,279 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-09 05:33:28,304 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-09 05:33:28,304 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:33:28,590 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$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_4327 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_4327) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_4328 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4327 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_4327) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_4328) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2024-11-09 05:33:30,072 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4419 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4328 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4327 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4420 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_4419))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_4420) .cse0 v_ArrVal_4327) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_4328) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_4419 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4327 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4420 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_4420) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_4419) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4327) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse3) (bvadd (_ bv8 32) .cse3)))))) is different from false [2024-11-09 05:33:30,079 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 05:33:30,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1494871960] [2024-11-09 05:33:30,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1494871960] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:33:30,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1031758327] [2024-11-09 05:33:30,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:33:30,080 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 05:33:30,080 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/cvc4 [2024-11-09 05:33:30,081 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 05:33:30,083 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (32)] Waiting until timeout for monitored process [2024-11-09 05:35:00,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:35:00,265 INFO L255 TraceCheckSpWp]: Trace formula consists of 796 conjuncts, 113 conjuncts are in the unsatisfiable core [2024-11-09 05:35:00,278 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:35:00,283 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-09 05:35:00,420 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-09 05:35:00,436 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 05:35:00,437 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-09 05:35:00,453 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-09 05:35:00,458 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-09 05:35:00,553 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-09 05:35:00,559 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-09 05:35:01,399 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 05:35:01,400 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-09 05:35:01,407 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-09 05:35:01,508 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 05:35:01,508 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-09 05:35:01,515 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-09 05:35:01,547 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-09 05:35:01,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-09 05:35:01,560 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-09 05:35:01,561 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:35:01,638 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4875 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4874 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_4874) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_4875) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_4874 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_4874) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd .cse1 (_ bv4 32)) (bvadd .cse1 (_ bv8 32))))))) is different from false [2024-11-09 05:35:01,678 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$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_4874 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_4874) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_4875 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4874 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_4874) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_4875) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2024-11-09 05:35:03,259 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4967 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4966 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4874 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_4966) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_4967) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4874) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_4967 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4875 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4966 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4874 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_4967))) (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$.offset| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_4966) .cse2 v_ArrVal_4874) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_4875) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2024-11-09 05:35:03,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1031758327] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:35:03,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1659705425] [2024-11-09 05:35:03,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:35:03,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:35:03,268 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:35:03,269 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:35:03,270 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2024-11-09 05:35:03,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:35:04,001 INFO L255 TraceCheckSpWp]: Trace formula consists of 796 conjuncts, 111 conjuncts are in the unsatisfiable core [2024-11-09 05:35:04,016 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:35:04,021 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-09 05:35:04,199 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 05:35:04,200 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-09 05:35:04,208 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-09 05:35:04,223 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-09 05:35:04,232 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-09 05:35:04,311 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-09 05:35:04,319 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-09 05:35:05,150 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 05:35:05,150 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-09 05:35:05,158 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-09 05:35:05,250 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 05:35:05,250 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-09 05:35:05,257 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-09 05:35:05,288 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-09 05:35:05,296 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-09 05:35:05,301 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-09 05:35:05,301 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:35:07,097 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5513 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5514 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4327 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_5513) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_5514) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4327) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_5513 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5514 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4328 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4327 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_5514))) (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$.offset| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_5513) .cse2 v_ArrVal_4327) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_4328) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2024-11-09 05:35:07,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1659705425] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:35:07,109 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 05:35:07,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 9 [2024-11-09 05:35:07,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983857649] [2024-11-09 05:35:07,110 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 05:35:07,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 05:35:07,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 05:35:07,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 05:35:07,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=125, Unknown=12, NotChecked=162, Total=342 [2024-11-09 05:35:07,111 INFO L87 Difference]: Start difference. First operand 1718 states and 1842 transitions. Second operand has 10 states, 8 states have (on average 8.875) internal successors, (71), 10 states have internal predecessors, (71), 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-09 05:35:24,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:35:24,189 INFO L93 Difference]: Finished difference Result 1717 states and 1841 transitions. [2024-11-09 05:35:24,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 05:35:24,189 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 8.875) internal successors, (71), 10 states have internal predecessors, (71), 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 115 [2024-11-09 05:35:24,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:35:24,193 INFO L225 Difference]: With dead ends: 1717 [2024-11-09 05:35:24,193 INFO L226 Difference]: Without dead ends: 1717 [2024-11-09 05:35:24,193 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 368 GetRequests, 340 SyntacticMatches, 6 SemanticMatches, 22 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=75, Invalid=243, Unknown=12, NotChecked=222, Total=552 [2024-11-09 05:35:24,194 INFO L432 NwaCegarLoop]: 1071 mSDtfsCounter, 1135 mSDsluCounter, 3983 mSDsCounter, 0 mSdLazyCounter, 6839 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1145 SdHoareTripleChecker+Valid, 5054 SdHoareTripleChecker+Invalid, 6849 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 6839 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.7s IncrementalHoareTripleChecker+Time [2024-11-09 05:35:24,194 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1145 Valid, 5054 Invalid, 6849 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [10 Valid, 6839 Invalid, 0 Unknown, 0 Unchecked, 16.7s Time] [2024-11-09 05:35:24,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1717 states. [2024-11-09 05:35:24,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1717 to 1717. [2024-11-09 05:35:24,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1717 states, 1037 states have (on average 1.7502410800385728) internal successors, (1815), 1705 states have internal predecessors, (1815), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2024-11-09 05:35:24,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1717 states to 1717 states and 1841 transitions. [2024-11-09 05:35:24,219 INFO L78 Accepts]: Start accepts. Automaton has 1717 states and 1841 transitions. Word has length 115 [2024-11-09 05:35:24,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:35:24,219 INFO L471 AbstractCegarLoop]: Abstraction has 1717 states and 1841 transitions. [2024-11-09 05:35:24,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 8.875) internal successors, (71), 10 states have internal predecessors, (71), 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-09 05:35:24,220 INFO L276 IsEmpty]: Start isEmpty. Operand 1717 states and 1841 transitions. [2024-11-09 05:35:24,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-09 05:35:24,221 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:35:24,221 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] [2024-11-09 05:35:24,252 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2024-11-09 05:35:24,435 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (31)] Ended with exit code 0 [2024-11-09 05:35:24,658 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (32)] Forceful destruction successful, exit code 0 [2024-11-09 05:35:24,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt [2024-11-09 05:35:24,822 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 912 more)] === [2024-11-09 05:35:24,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:35:24,823 INFO L85 PathProgramCache]: Analyzing trace with hash -1439748374, now seen corresponding path program 1 times [2024-11-09 05:35:24,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 05:35:24,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1033560179] [2024-11-09 05:35:24,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:35:24,823 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 05:35:24,823 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 05:35:24,824 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 05:35:24,826 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (34)] Waiting until timeout for monitored process [2024-11-09 05:35:25,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:35:25,894 INFO L255 TraceCheckSpWp]: Trace formula consists of 825 conjuncts, 62 conjuncts are in the unsatisfiable core [2024-11-09 05:35:25,901 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:35:25,921 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-09 05:35:26,058 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-09 05:35:26,058 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-09 05:35:26,092 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-09 05:35:26,201 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2024-11-09 05:35:27,130 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 05:35:27,131 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-09 05:35:27,241 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 05:35:27,241 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-09 05:35:27,325 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 05:35:27,325 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-09 05:35:27,349 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-09 05:35:27,387 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-09 05:35:27,387 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:35:27,437 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5938 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_5938) |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-09 05:35:27,446 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5938 (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$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_5938) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-09 05:35:27,462 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5937 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5938 (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$.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_5937))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5938)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-09 05:35:27,472 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5937 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5938 (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$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5937))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5938)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-09 05:35:27,973 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5937 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5938 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5984 (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$.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_5984))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5937)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5938)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-09 05:35:27,976 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 05:35:27,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1033560179] [2024-11-09 05:35:27,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1033560179] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:35:27,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [183646796] [2024-11-09 05:35:27,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:35:27,977 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 05:35:27,977 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/cvc4 [2024-11-09 05:35:27,978 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 05:35:27,980 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (35)] Waiting until timeout for monitored process [2024-11-09 05:35:48,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:35:48,505 INFO L255 TraceCheckSpWp]: Trace formula consists of 825 conjuncts, 77 conjuncts are in the unsatisfiable core [2024-11-09 05:35:48,513 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:35:48,522 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-09 05:35:48,941 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-09 05:35:48,941 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-09 05:35:49,034 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 05:35:49,044 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 05:35:49,183 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-11-09 05:35:49,248 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-09 05:35:50,436 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 16 treesize of output 11 [2024-11-09 05:35:50,751 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 33 [2024-11-09 05:35:50,755 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2024-11-09 05:35:50,985 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:35:50,985 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 7 [2024-11-09 05:35:51,124 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 62 [2024-11-09 05:35:51,309 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 19 treesize of output 11 [2024-11-09 05:35:51,375 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-09 05:35:51,376 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:35:56,733 INFO L349 Elim1Store]: treesize reduction 36, result has 37.9 percent of original size [2024-11-09 05:35:56,733 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 955 treesize of output 836 [2024-11-09 05:35:56,843 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:35:56,844 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 852 treesize of output 846 [2024-11-09 05:36:17,671 WARN L286 SmtUtils]: Spent 20.81s on a formula simplification. DAG size of input: 142 DAG size of output: 40 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-11-09 05:36:17,671 INFO L349 Elim1Store]: treesize reduction 1022, result has 9.0 percent of original size [2024-11-09 05:36:17,672 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 6 new quantified variables, introduced 7 case distinctions, treesize of input 886 treesize of output 917 [2024-11-09 05:36:18,084 INFO L224 Elim1Store]: Index analysis took 106 ms [2024-11-09 05:36:18,297 INFO L349 Elim1Store]: treesize reduction 307, result has 13.8 percent of original size [2024-11-09 05:36:18,298 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 10 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 267 treesize of output 189 [2024-11-09 05:36:18,434 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:36:18,435 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 47 [2024-11-09 05:36:19,604 WARN L851 $PredicateComparison]: unable to prove that (or (forall ((v_arrayElimCell_92 (_ BitVec 32))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| v_arrayElimCell_92)))) (not (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |c_ULTIMATE.start_main_~user~0#1.base|)))) (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_6458 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~user~0#1.offset|) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_6458) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_6458 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_6458) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (bvadd (_ bv3 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))) (forall ((v_ArrVal_6458 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (bvadd (_ bv1 32) |c_ULTIMATE.start_main_~user~0#1.offset|) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_6458) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_6458 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_6458) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~user~0#1.offset|))))))) is different from false [2024-11-09 05:36:19,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [183646796] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:36:19,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1497424759] [2024-11-09 05:36:19,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:36:19,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:36:19,611 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:36:19,612 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:36:19,613 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2024-11-09 05:36:20,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:36:20,418 INFO L255 TraceCheckSpWp]: Trace formula consists of 825 conjuncts, 60 conjuncts are in the unsatisfiable core [2024-11-09 05:36:20,426 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:36:20,431 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-09 05:36:20,614 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 05:36:20,614 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-09 05:36:20,713 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-09 05:36:21,864 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 05:36:21,865 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-09 05:36:22,155 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 05:36:22,155 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2024-11-09 05:36:22,318 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 05:36:22,318 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-09 05:36:22,341 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-09 05:36:22,346 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-09 05:36:22,347 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:36:22,548 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6881 (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$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_6881) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-09 05:36:22,575 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6880 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6881 (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$.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_6880))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6881)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-09 05:36:22,594 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6880 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6881 (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$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6880))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6881)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-09 05:36:23,164 INFO L349 Elim1Store]: treesize reduction 7, result has 87.3 percent of original size [2024-11-09 05:36:23,164 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-09 05:36:23,177 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6927 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6880 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6881 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_#t~mem32#1.base| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_6927))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6880)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6881)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) is different from false [2024-11-09 05:36:23,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1497424759] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:36:23,181 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 05:36:23,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13, 12] total 31 [2024-11-09 05:36:23,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325126562] [2024-11-09 05:36:23,181 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 05:36:23,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-09 05:36:23,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 05:36:23,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-09 05:36:23,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=1220, Unknown=24, NotChecked=810, Total=2256 [2024-11-09 05:36:23,183 INFO L87 Difference]: Start difference. First operand 1717 states and 1841 transitions. Second operand has 32 states, 28 states have (on average 5.892857142857143) internal successors, (165), 31 states have internal predecessors, (165), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 05:37:05,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:37:05,341 INFO L93 Difference]: Finished difference Result 2401 states and 2590 transitions. [2024-11-09 05:37:05,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-09 05:37:05,342 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 28 states have (on average 5.892857142857143) internal successors, (165), 31 states have internal predecessors, (165), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 118 [2024-11-09 05:37:05,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:37:05,350 INFO L225 Difference]: With dead ends: 2401 [2024-11-09 05:37:05,350 INFO L226 Difference]: Without dead ends: 2401 [2024-11-09 05:37:05,351 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 388 GetRequests, 333 SyntacticMatches, 2 SemanticMatches, 53 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 612 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=305, Invalid=1691, Unknown=24, NotChecked=950, Total=2970 [2024-11-09 05:37:05,352 INFO L432 NwaCegarLoop]: 1059 mSDtfsCounter, 2880 mSDsluCounter, 14838 mSDsCounter, 0 mSdLazyCounter, 13732 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 37.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2901 SdHoareTripleChecker+Valid, 15897 SdHoareTripleChecker+Invalid, 13790 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 13732 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 40.8s IncrementalHoareTripleChecker+Time [2024-11-09 05:37:05,352 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2901 Valid, 15897 Invalid, 13790 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [58 Valid, 13732 Invalid, 0 Unknown, 0 Unchecked, 40.8s Time] [2024-11-09 05:37:05,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2401 states. [2024-11-09 05:37:05,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2401 to 1716. [2024-11-09 05:37:05,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1716 states, 1037 states have (on average 1.7492767598842816) internal successors, (1814), 1704 states have internal predecessors, (1814), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2024-11-09 05:37:05,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1716 states to 1716 states and 1840 transitions. [2024-11-09 05:37:05,375 INFO L78 Accepts]: Start accepts. Automaton has 1716 states and 1840 transitions. Word has length 118 [2024-11-09 05:37:05,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:37:05,376 INFO L471 AbstractCegarLoop]: Abstraction has 1716 states and 1840 transitions. [2024-11-09 05:37:05,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 28 states have (on average 5.892857142857143) internal successors, (165), 31 states have internal predecessors, (165), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 05:37:05,376 INFO L276 IsEmpty]: Start isEmpty. Operand 1716 states and 1840 transitions. [2024-11-09 05:37:05,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-09 05:37:05,379 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:37:05,379 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] [2024-11-09 05:37:05,415 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (35)] Forceful destruction successful, exit code 0 [2024-11-09 05:37:05,601 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2024-11-09 05:37:05,789 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (34)] Forceful destruction successful, exit code 0 [2024-11-09 05:37:05,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt,36 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 05:37:05,980 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 912 more)] === [2024-11-09 05:37:05,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:37:05,981 INFO L85 PathProgramCache]: Analyzing trace with hash -1439748373, now seen corresponding path program 1 times [2024-11-09 05:37:05,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 05:37:05,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [465207477] [2024-11-09 05:37:05,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:37:05,981 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 05:37:05,982 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 05:37:05,985 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 05:37:05,986 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (37)] Waiting until timeout for monitored process [2024-11-09 05:37:07,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:37:07,120 INFO L255 TraceCheckSpWp]: Trace formula consists of 825 conjuncts, 114 conjuncts are in the unsatisfiable core [2024-11-09 05:37:07,131 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:37:07,135 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-09 05:37:07,343 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 05:37:07,343 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-09 05:37:07,355 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-09 05:37:07,386 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-09 05:37:07,392 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-09 05:37:07,544 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-09 05:37:07,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-09 05:37:08,619 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 05:37:08,620 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-09 05:37:08,627 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-09 05:37:08,774 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 05:37:08,774 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-09 05:37:08,781 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-09 05:37:08,911 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 05:37:08,912 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-09 05:37:08,918 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-09 05:37:08,971 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-09 05:37:08,984 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-09 05:37:09,031 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-09 05:37:09,031 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:37:09,396 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$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_7398 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7399 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv12 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_7398) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_7399) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_7398 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_7398) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse2) (bvadd (_ bv12 32) .cse2))))))) is different from false [2024-11-09 05:37:09,464 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7396 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7397 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7398 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7399 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_7397))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv12 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_7396) .cse0 v_ArrVal_7398) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_7399) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_7396 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7397 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7398 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_7396) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_7397) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7398) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse3) (bvadd (_ bv12 32) .cse3)))))) is different from false [2024-11-09 05:37:11,594 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7396 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7490 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7491 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7397 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7398 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7399 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_7490))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_7397))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_7491) .cse0 v_ArrVal_7396) .cse1 v_ArrVal_7398) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_7399) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_7396 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7490 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7491 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7397 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7398 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_7490))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_7491) .cse6 v_ArrVal_7396) (select (select (store .cse7 .cse6 v_ArrVal_7397) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_7398))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse5 (_ bv8 32)) (bvadd .cse5 (_ bv12 32))))))) is different from false [2024-11-09 05:37:11,607 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 05:37:11,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [465207477] [2024-11-09 05:37:11,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [465207477] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:37:11,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [215067553] [2024-11-09 05:37:11,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:37:11,607 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 05:37:11,607 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/cvc4 [2024-11-09 05:37:11,608 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 05:37:11,610 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (38)] Waiting until timeout for monitored process [2024-11-09 05:37:17,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:37:17,276 INFO L255 TraceCheckSpWp]: Trace formula consists of 825 conjuncts, 116 conjuncts are in the unsatisfiable core [2024-11-09 05:37:17,288 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:37:17,293 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-09 05:37:17,558 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-09 05:37:17,607 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 05:37:17,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-09 05:37:17,623 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-09 05:37:17,637 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-09 05:37:17,744 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-09 05:37:17,751 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-09 05:37:19,020 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 05:37:19,020 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-09 05:37:19,028 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-09 05:37:19,153 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 05:37:19,153 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-09 05:37:19,161 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-09 05:37:19,270 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 05:37:19,271 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-09 05:37:19,279 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-09 05:37:19,327 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-09 05:37:19,340 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-09 05:37:19,346 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-09 05:37:19,346 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:37:19,429 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7962 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7962) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd (_ bv12 32) .cse0)))) (forall ((v_ArrVal_7963 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7962 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv12 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7962) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7963) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-09 05:37:19,472 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$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_7963 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7962 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_7962) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_7963) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_7962 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_7962) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse2 (_ bv8 32)) (bvadd .cse2 (_ bv12 32)))))))) is different from false [2024-11-09 05:37:19,582 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7962 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7961 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7960 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_7960) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_7961) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7962) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd (_ bv12 32) .cse0)))) (forall ((v_ArrVal_7963 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7962 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7961 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7960 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_7961))) (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$.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_7960) .cse2 v_ArrVal_7962) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_7963) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2024-11-09 05:37:19,631 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$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_7963 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7962 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7961 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7960 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_7961))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_7960) .cse1 v_ArrVal_7962) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_7963) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_7962 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7961 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7960 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_7960) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_7961) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_7962) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse4 (_ bv8 32)) (bvadd .cse4 (_ bv12 32)))))))) is different from false [2024-11-09 05:37:24,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [215067553] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:37:24,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [594445314] [2024-11-09 05:37:24,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:37:24,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:37:24,513 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:37:24,514 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:37:24,515 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2024-11-09 05:37:25,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:37:25,422 INFO L255 TraceCheckSpWp]: Trace formula consists of 825 conjuncts, 114 conjuncts are in the unsatisfiable core [2024-11-09 05:37:25,434 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:37:25,455 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-09 05:37:26,292 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-09 05:37:26,398 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 05:37:26,398 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-09 05:37:26,446 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-09 05:37:26,466 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-09 05:37:26,783 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-09 05:37:26,801 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-09 05:37:30,330 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 05:37:30,331 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-09 05:37:30,350 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-09 05:37:30,692 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 05:37:30,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 62 treesize of output 57 [2024-11-09 05:37:30,711 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-09 05:37:30,997 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 05:37:30,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 62 treesize of output 57 [2024-11-09 05:37:31,018 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-09 05:37:31,144 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-09 05:37:31,179 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-09 05:37:31,196 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-09 05:37:31,196 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:37:31,381 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8526 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_8526) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd (_ bv12 32) .cse0)))) (forall ((v_ArrVal_8527 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8526 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv12 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_8526) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_8527) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-09 05:37:31,459 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$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_8527 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8526 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv12 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_8526) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_8527) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_8526 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_8526) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse2) (bvadd (_ bv12 32) .cse2))))))) is different from false [2024-11-09 05:37:31,593 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8527 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8526 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8525 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8524 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_8524))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv12 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_8525) .cse0 v_ArrVal_8526) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_8527) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_8526 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8525 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8524 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_8525) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_8524) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8526) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse3) (bvadd (_ bv12 32) .cse3)))))) is different from false [2024-11-09 05:37:31,750 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$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_8526 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8525 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8524 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_8525) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_8524) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_8526) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd (_ bv12 32) .cse0)))) (forall ((v_ArrVal_8527 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8526 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8525 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8524 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_8524))) (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$.offset| .cse1 v_ArrVal_8525) .cse3 v_ArrVal_8526) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_8527) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false [2024-11-09 05:37:34,993 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8619 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8618 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8526 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8525 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8524 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_8618))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_8619) .cse1 v_ArrVal_8525) (select (select (store .cse2 .cse1 v_ArrVal_8524) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_8526))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd (_ bv12 32) .cse0)))) (forall ((v_ArrVal_8619 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8618 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8527 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8526 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8525 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8524 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_8618))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_8524))) (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$.offset| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_8619) .cse4 v_ArrVal_8525) .cse5 v_ArrVal_8526) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_8527) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) is different from false [2024-11-09 05:37:35,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [594445314] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:37:35,011 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 05:37:35,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 10 [2024-11-09 05:37:35,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563607041] [2024-11-09 05:37:35,012 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 05:37:35,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 05:37:35,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 05:37:35,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 05:37:35,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=183, Unknown=37, NotChecked=468, Total=756 [2024-11-09 05:37:35,013 INFO L87 Difference]: Start difference. First operand 1716 states and 1840 transitions. Second operand has 11 states, 9 states have (on average 8.222222222222221) internal successors, (74), 11 states have internal predecessors, (74), 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-09 05:38:19,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:38:19,355 INFO L93 Difference]: Finished difference Result 1715 states and 1839 transitions. [2024-11-09 05:38:19,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 05:38:19,356 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 8.222222222222221) internal successors, (74), 11 states have internal predecessors, (74), 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 118 [2024-11-09 05:38:19,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:38:19,360 INFO L225 Difference]: With dead ends: 1715 [2024-11-09 05:38:19,360 INFO L226 Difference]: Without dead ends: 1715 [2024-11-09 05:38:19,360 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 387 GetRequests, 350 SyntacticMatches, 5 SemanticMatches, 32 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=113, Invalid=357, Unknown=40, NotChecked=612, Total=1122 [2024-11-09 05:38:19,361 INFO L432 NwaCegarLoop]: 1070 mSDtfsCounter, 1133 mSDsluCounter, 2739 mSDsCounter, 0 mSdLazyCounter, 4829 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 41.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1143 SdHoareTripleChecker+Valid, 3809 SdHoareTripleChecker+Invalid, 4839 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 4829 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 42.7s IncrementalHoareTripleChecker+Time [2024-11-09 05:38:19,361 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1143 Valid, 3809 Invalid, 4839 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [10 Valid, 4829 Invalid, 0 Unknown, 0 Unchecked, 42.7s Time] [2024-11-09 05:38:19,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1715 states. [2024-11-09 05:38:19,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1715 to 1715. [2024-11-09 05:38:19,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1715 states, 1037 states have (on average 1.7483124397299903) internal successors, (1813), 1703 states have internal predecessors, (1813), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2024-11-09 05:38:19,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1715 states to 1715 states and 1839 transitions. [2024-11-09 05:38:19,380 INFO L78 Accepts]: Start accepts. Automaton has 1715 states and 1839 transitions. Word has length 118 [2024-11-09 05:38:19,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:38:19,381 INFO L471 AbstractCegarLoop]: Abstraction has 1715 states and 1839 transitions. [2024-11-09 05:38:19,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 8.222222222222221) internal successors, (74), 11 states have internal predecessors, (74), 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-09 05:38:19,381 INFO L276 IsEmpty]: Start isEmpty. Operand 1715 states and 1839 transitions. [2024-11-09 05:38:19,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-09 05:38:19,382 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:38:19,383 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] [2024-11-09 05:38:19,414 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Forceful destruction successful, exit code 0 [2024-11-09 05:38:19,597 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (37)] Forceful destruction successful, exit code 0 [2024-11-09 05:38:19,804 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (38)] Forceful destruction successful, exit code 0 [2024-11-09 05:38:19,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,37 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,38 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt [2024-11-09 05:38:19,988 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 912 more)] === [2024-11-09 05:38:19,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:38:19,989 INFO L85 PathProgramCache]: Analyzing trace with hash -2000097022, now seen corresponding path program 1 times [2024-11-09 05:38:19,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 05:38:19,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2075727771] [2024-11-09 05:38:19,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:38:19,990 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 05:38:19,990 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 05:38:19,991 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 05:38:19,992 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (40)] Waiting until timeout for monitored process [2024-11-09 05:38:21,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:38:21,215 INFO L255 TraceCheckSpWp]: Trace formula consists of 854 conjuncts, 63 conjuncts are in the unsatisfiable core [2024-11-09 05:38:21,222 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:38:21,237 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-09 05:38:22,198 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-09 05:38:22,198 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-09 05:38:22,358 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-09 05:38:22,921 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2024-11-09 05:38:26,986 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 05:38:26,986 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-09 05:38:27,514 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 05:38:27,515 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-09 05:38:27,976 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 05:38:27,976 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-09 05:38:28,447 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 05:38:28,448 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2024-11-09 05:38:28,572 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-09 05:38:28,779 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-09 05:38:28,779 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:38:29,384 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9059 (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$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_9059) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-09 05:38:29,464 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9059 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9058 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_9058))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9059)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (_ bv0 1))) is different from false [2024-11-09 05:38:29,521 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9059 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9058 (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$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9058))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9059)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-09 05:38:29,607 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9057 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9059 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9058 (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$.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_9057))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9058)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9059)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-09 05:38:29,668 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9057 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9059 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9058 (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$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9057))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9058)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9059)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-09 05:38:30,894 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9057 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9105 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9059 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9058 (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$.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_9105))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9057)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9058)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9059)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-09 05:38:30,904 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 05:38:30,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2075727771] [2024-11-09 05:38:30,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2075727771] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:38:30,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [563326580] [2024-11-09 05:38:30,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:38:30,905 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 05:38:30,905 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/cvc4 [2024-11-09 05:38:30,906 INFO L229 MonitoredProcess]: Starting monitored process 41 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 05:38:30,908 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (41)] Waiting until timeout for monitored process [2024-11-09 05:39:30,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:39:30,311 INFO L255 TraceCheckSpWp]: Trace formula consists of 854 conjuncts, 66 conjuncts are in the unsatisfiable core [2024-11-09 05:39:30,320 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:39:30,352 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-09 05:39:31,306 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-09 05:39:31,307 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-09 05:39:31,390 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-09 05:39:31,656 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2024-11-09 05:39:35,607 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 05:39:35,608 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-09 05:39:35,969 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 05:39:35,969 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-09 05:39:36,239 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 05:39:36,239 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-09 05:39:36,519 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 05:39:36,519 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-09 05:39:36,635 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-09 05:39:36,685 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-09 05:39:36,685 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:39:36,763 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9545 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_9545) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))) (_ bv0 1))) is different from false [2024-11-09 05:39:36,800 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9545 (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$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_9545) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-09 05:39:36,858 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9545 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9544 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_9544))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9545)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (_ bv0 1))) is different from false [2024-11-09 05:39:36,897 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9545 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9544 (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$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9544))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9545)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-09 05:39:36,956 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9545 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9544 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9543 (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$.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_9543))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9544)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9545)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-09 05:39:36,998 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9545 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9544 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9543 (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$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9543))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9544)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9545)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-09 05:39:38,149 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9591 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9545 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9544 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9543 (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$.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_9591))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9543)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9544)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9545)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-09 05:39:38,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [563326580] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:39:38,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1837676662] [2024-11-09 05:39:38,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:39:38,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:39:38,160 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:39:38,161 INFO L229 MonitoredProcess]: Starting monitored process 42 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:39:38,162 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2024-11-09 05:39:39,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:39:39,117 INFO L255 TraceCheckSpWp]: Trace formula consists of 854 conjuncts, 62 conjuncts are in the unsatisfiable core [2024-11-09 05:39:39,124 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:39:39,139 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-09 05:39:39,957 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 05:39:39,957 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-09 05:39:40,143 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-09 05:39:43,309 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 05:39:43,309 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-09 05:39:43,957 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 05:39:43,958 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2024-11-09 05:39:44,368 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 05:39:44,368 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-09 05:39:44,793 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 05:39:44,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 44 treesize of output 43 [2024-11-09 05:39:44,873 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-09 05:39:44,889 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-09 05:39:44,889 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:39:44,965 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10030 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_10030) |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-09 05:39:45,001 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10030 (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$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_10030) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-09 05:39:45,058 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10030 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10029 (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$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_10029))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10030)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-09 05:39:45,097 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10030 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10029 (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$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10029))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10030)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-09 05:39:45,158 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10030 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10029 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10028 (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$.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_10028))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10029)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10030)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-09 05:39:45,200 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10030 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10029 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10028 (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$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10028))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10029)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10030)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-09 05:39:46,503 INFO L349 Elim1Store]: treesize reduction 7, result has 93.2 percent of original size [2024-11-09 05:39:46,504 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-09 05:39:46,542 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10076 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10030 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10029 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10028 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_#t~mem32#1.base| (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$.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_10076))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10028)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10029)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10030)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) is different from false [2024-11-09 05:39:46,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1837676662] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:39:46,552 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 05:39:46,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 13] total 22 [2024-11-09 05:39:46,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969189340] [2024-11-09 05:39:46,553 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 05:39:46,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-09 05:39:46,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 05:39:46,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-09 05:39:46,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=515, Unknown=29, NotChecked=1300, Total=1980 [2024-11-09 05:39:46,554 INFO L87 Difference]: Start difference. First operand 1715 states and 1839 transitions. Second operand has 23 states, 20 states have (on average 5.05) internal successors, (101), 22 states have internal predecessors, (101), 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-09 05:41:04,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:41:04,023 INFO L93 Difference]: Finished difference Result 1716 states and 1841 transitions. [2024-11-09 05:41:04,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-09 05:41:04,024 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 20 states have (on average 5.05) internal successors, (101), 22 states have internal predecessors, (101), 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 121 [2024-11-09 05:41:04,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:41:04,027 INFO L225 Difference]: With dead ends: 1716 [2024-11-09 05:41:04,027 INFO L226 Difference]: Without dead ends: 1716 [2024-11-09 05:41:04,028 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 402 GetRequests, 353 SyntacticMatches, 3 SemanticMatches, 46 ConstructedPredicates, 20 IntricatePredicates, 0 DeprecatedPredicates, 228 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=157, Invalid=650, Unknown=29, NotChecked=1420, Total=2256 [2024-11-09 05:41:04,028 INFO L432 NwaCegarLoop]: 1058 mSDtfsCounter, 1129 mSDsluCounter, 9730 mSDsCounter, 0 mSdLazyCounter, 8876 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 74.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1141 SdHoareTripleChecker+Valid, 10788 SdHoareTripleChecker+Invalid, 8896 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 8876 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 76.6s IncrementalHoareTripleChecker+Time [2024-11-09 05:41:04,028 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1141 Valid, 10788 Invalid, 8896 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [20 Valid, 8876 Invalid, 0 Unknown, 0 Unchecked, 76.6s Time] [2024-11-09 05:41:04,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1716 states. [2024-11-09 05:41:04,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1716 to 1714. [2024-11-09 05:41:04,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1714 states, 1037 states have (on average 1.747348119575699) internal successors, (1812), 1702 states have internal predecessors, (1812), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2024-11-09 05:41:04,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1714 states to 1714 states and 1838 transitions. [2024-11-09 05:41:04,049 INFO L78 Accepts]: Start accepts. Automaton has 1714 states and 1838 transitions. Word has length 121 [2024-11-09 05:41:04,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:41:04,049 INFO L471 AbstractCegarLoop]: Abstraction has 1714 states and 1838 transitions. [2024-11-09 05:41:04,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 20 states have (on average 5.05) internal successors, (101), 22 states have internal predecessors, (101), 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-09 05:41:04,050 INFO L276 IsEmpty]: Start isEmpty. Operand 1714 states and 1838 transitions. [2024-11-09 05:41:04,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-09 05:41:04,051 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:41:04,051 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] [2024-11-09 05:41:04,068 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (40)] Ended with exit code 0 [2024-11-09 05:41:04,286 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (41)] Forceful destruction successful, exit code 0 [2024-11-09 05:41:04,474 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Forceful destruction successful, exit code 0 [2024-11-09 05:41:04,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,41 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt,42 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:41:04,652 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr83REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 912 more)] === [2024-11-09 05:41:04,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:41:04,652 INFO L85 PathProgramCache]: Analyzing trace with hash -2000097021, now seen corresponding path program 1 times [2024-11-09 05:41:04,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 05:41:04,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [465600023] [2024-11-09 05:41:04,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:41:04,653 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 05:41:04,653 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 05:41:04,657 INFO L229 MonitoredProcess]: Starting monitored process 43 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 05:41:04,658 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (43)] Waiting until timeout for monitored process [2024-11-09 05:41:06,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:41:06,145 INFO L255 TraceCheckSpWp]: Trace formula consists of 854 conjuncts, 117 conjuncts are in the unsatisfiable core [2024-11-09 05:41:06,156 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:41:06,172 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-09 05:41:07,001 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 05:41:07,106 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 05:41:07,107 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-09 05:41:07,227 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-09 05:41:07,245 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-09 05:41:07,766 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-09 05:41:07,784 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-09 05:41:11,252 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 05:41:11,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 62 treesize of output 57 [2024-11-09 05:41:11,272 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-09 05:41:11,805 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 05:41:11,806 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-09 05:41:11,827 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-09 05:41:12,313 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 05:41:12,313 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-09 05:41:12,350 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-09 05:41:12,898 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 05:41:12,898 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-09 05:41:12,917 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-09 05:41:13,045 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-09 05:41:13,078 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-09 05:41:13,248 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-09 05:41:13,248 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:41:13,774 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_10564 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10565 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv24 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_10565) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_10564) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_10565 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_10565) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv20 32) .cse1) (bvadd (_ bv24 32) .cse1)))))) is different from false [2024-11-09 05:41:13,846 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$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_10564 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10565 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv24 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_10565) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_10564) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_10565 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_10565) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv20 32) .cse2) (bvadd (_ bv24 32) .cse2))))))) is different from false [2024-11-09 05:41:13,999 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_10565 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10562 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10563 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_10562) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_10563) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10565) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_10564 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10565 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10562 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10563 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_10563))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_10562) .cse2 v_ArrVal_10565) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_10564) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2024-11-09 05:41:14,099 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$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_10565 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10562 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10563 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_10562) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_10563) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_10565) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv20 32) .cse0) (bvadd (_ bv24 32) .cse0)))) (forall ((v_ArrVal_10564 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10565 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10562 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10563 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_10563))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv24 32) (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_10562) .cse3 v_ArrVal_10565) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_10564) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false [2024-11-09 05:41:14,464 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_10560 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10561 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10564 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10565 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10562 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10563 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_10561))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_10563))) (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$.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_10560) .cse0 v_ArrVal_10562) .cse1 v_ArrVal_10565) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_10564) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_10560 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10561 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10565 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10562 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10563 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_10561))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_10560) .cse6 v_ArrVal_10562) (select (select (store .cse7 .cse6 v_ArrVal_10563) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_10565))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv20 32) .cse5) (bvadd (_ bv24 32) .cse5)))))) is different from false [2024-11-09 05:41:15,196 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$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (and (forall ((v_ArrVal_10560 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10561 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10565 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10562 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10563 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_10561))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_10560) .cse2 v_ArrVal_10562) (select (select (store .cse3 .cse2 v_ArrVal_10563) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_10565))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (_ bv20 32) .cse0) (bvadd (_ bv24 32) .cse0)))) (forall ((v_ArrVal_10560 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10561 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10564 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10565 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10562 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10563 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_10561))) (let ((.cse5 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse7 (store .cse8 .cse5 v_ArrVal_10563))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (_ bv24 32) (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_10560) .cse5 v_ArrVal_10562) .cse6 v_ArrVal_10565) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (select |c_#length| (select (select (store .cse7 .cse6 v_ArrVal_10564) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))))))))))) is different from false [2024-11-09 05:41:18,841 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_10560 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10561 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10565 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10562 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10563 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10656 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10657 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_10656))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_ArrVal_10561))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_10657) .cse1 v_ArrVal_10560) .cse2 v_ArrVal_10562) (select (select (store .cse3 .cse2 v_ArrVal_10563) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_10565))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (_ bv20 32) .cse0) (bvadd (_ bv24 32) .cse0)))) (forall ((v_ArrVal_10560 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10561 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10564 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10565 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10562 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10563 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10656 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10657 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse11 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_10656))) (let ((.cse6 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse10 (store .cse11 .cse6 v_ArrVal_10561))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_10563))) (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$.offset| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_10657) .cse6 v_ArrVal_10560) .cse7 v_ArrVal_10562) .cse8 v_ArrVal_10565) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (select |c_#length| (select (select (store .cse9 .cse8 v_ArrVal_10564) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))))))) is different from false [2024-11-09 05:41:18,866 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 05:41:18,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [465600023] [2024-11-09 05:41:18,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [465600023] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:41:18,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [248704460] [2024-11-09 05:41:18,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:41:18,867 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 05:41:18,867 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/cvc4 [2024-11-09 05:41:18,868 INFO L229 MonitoredProcess]: Starting monitored process 44 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 05:41:18,870 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_299bb79c-8990-4259-969d-2a6c008b84a4/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (44)] Waiting until timeout for monitored process