./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_nondet_test2-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_nondet_test2-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E --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 0fdcb64865aeb8184805095bc8dbe7392078d445cf902388dac9d1ca4533bb8c --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-14 03:20:00,040 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-14 03:20:00,149 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2024-11-14 03:20:00,154 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-14 03:20:00,155 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-14 03:20:00,199 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-14 03:20:00,199 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-14 03:20:00,200 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-14 03:20:00,200 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-14 03:20:00,200 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-14 03:20:00,200 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-14 03:20:00,200 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-14 03:20:00,201 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-14 03:20:00,201 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-14 03:20:00,201 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-14 03:20:00,201 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-14 03:20:00,201 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-14 03:20:00,201 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-14 03:20:00,201 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-14 03:20:00,201 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-14 03:20:00,202 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-14 03:20:00,202 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-14 03:20:00,205 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-14 03:20:00,205 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-14 03:20:00,206 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-14 03:20:00,206 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-14 03:20:00,206 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-14 03:20:00,206 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-14 03:20:00,206 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-14 03:20:00,206 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-14 03:20:00,206 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-14 03:20:00,206 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-14 03:20:00,206 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-14 03:20:00,207 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-14 03:20:00,207 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-14 03:20:00,207 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-14 03:20:00,207 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-14 03:20:00,207 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-14 03:20:00,207 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-14 03:20:00,207 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-14 03:20:00,207 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-14 03:20:00,207 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 03:20:00,207 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-14 03:20:00,208 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-14 03:20:00,208 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-14 03:20:00,208 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-14 03:20:00,208 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-14 03:20:00,208 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-14 03:20:00,208 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-14 03:20:00,208 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E 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 -> 0fdcb64865aeb8184805095bc8dbe7392078d445cf902388dac9d1ca4533bb8c [2024-11-14 03:20:00,583 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-14 03:20:00,594 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-14 03:20:00,597 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-14 03:20:00,599 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-14 03:20:00,600 INFO L274 PluginConnector]: CDTParser initialized [2024-11-14 03:20:00,601 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/../../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_nondet_test2-2.i Unable to find full path for "g++" [2024-11-14 03:20:02,909 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-14 03:20:03,423 INFO L384 CDTParser]: Found 1 translation units. [2024-11-14 03:20:03,424 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_nondet_test2-2.i [2024-11-14 03:20:03,445 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/data/2d4bd932f/0549c9e595614e76932a2373f4c264a0/FLAG9cb0cd705 [2024-11-14 03:20:03,464 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/data/2d4bd932f/0549c9e595614e76932a2373f4c264a0 [2024-11-14 03:20:03,467 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-14 03:20:03,469 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-14 03:20:03,471 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-14 03:20:03,471 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-14 03:20:03,477 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-14 03:20:03,478 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 03:20:03" (1/1) ... [2024-11-14 03:20:03,479 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@419f9c1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:20:03, skipping insertion in model container [2024-11-14 03:20:03,480 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 03:20:03" (1/1) ... [2024-11-14 03:20:03,547 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-14 03:20:04,233 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-14 03:20:04,294 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-14 03:20:04,303 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-14 03:20:04,309 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-14 03:20:04,320 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-14 03:20:04,364 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-14 03:20:04,365 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-14 03:20:04,369 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-14 03:20:04,369 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-14 03:20:04,371 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-14 03:20:04,375 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-14 03:20:04,377 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-14 03:20:04,379 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-14 03:20:04,380 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-14 03:20:04,387 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-14 03:20:04,397 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 03:20:04,412 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-14 03:20:04,413 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@2dc9bb84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:20:04, skipping insertion in model container [2024-11-14 03:20:04,413 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-14 03:20:04,414 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-14 03:20:04,416 INFO L158 Benchmark]: Toolchain (without parser) took 946.37ms. Allocated memory is still 142.6MB. Free memory was 116.9MB in the beginning and 97.0MB in the end (delta: 19.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-14 03:20:04,417 INFO L158 Benchmark]: CDTParser took 0.52ms. Allocated memory is still 167.8MB. Free memory is still 105.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-14 03:20:04,418 INFO L158 Benchmark]: CACSL2BoogieTranslator took 942.97ms. Allocated memory is still 142.6MB. Free memory was 116.5MB in the beginning and 97.0MB in the end (delta: 19.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-14 03:20:04,419 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.52ms. Allocated memory is still 167.8MB. Free memory is still 105.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 942.97ms. Allocated memory is still 142.6MB. Free memory was 116.5MB in the beginning and 97.0MB in the end (delta: 19.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 831]: 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/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_nondet_test2-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E --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 0fdcb64865aeb8184805095bc8dbe7392078d445cf902388dac9d1ca4533bb8c --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-14 03:20:07,496 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-14 03:20:07,637 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2024-11-14 03:20:07,644 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-14 03:20:07,644 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-14 03:20:07,686 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-14 03:20:07,687 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-14 03:20:07,687 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-14 03:20:07,687 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-14 03:20:07,688 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-14 03:20:07,688 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-14 03:20:07,688 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-14 03:20:07,690 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-14 03:20:07,690 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-14 03:20:07,691 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-14 03:20:07,691 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-14 03:20:07,692 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-14 03:20:07,692 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-14 03:20:07,692 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-14 03:20:07,693 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-14 03:20:07,693 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-14 03:20:07,693 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-14 03:20:07,694 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-14 03:20:07,694 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-14 03:20:07,694 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-14 03:20:07,694 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-14 03:20:07,694 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-14 03:20:07,694 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-14 03:20:07,695 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-14 03:20:07,695 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-14 03:20:07,695 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-14 03:20:07,695 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-14 03:20:07,695 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-14 03:20:07,696 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-14 03:20:07,696 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-14 03:20:07,697 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-14 03:20:07,697 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-14 03:20:07,697 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-14 03:20:07,698 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 03:20:07,698 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-14 03:20:07,698 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-14 03:20:07,698 INFO L153 SettingsManager]: * Trace refinement strategy=WALRUS [2024-11-14 03:20:07,698 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-14 03:20:07,698 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-14 03:20:07,698 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-14 03:20:07,698 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E 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 -> 0fdcb64865aeb8184805095bc8dbe7392078d445cf902388dac9d1ca4533bb8c [2024-11-14 03:20:08,092 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-14 03:20:08,107 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-14 03:20:08,112 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-14 03:20:08,115 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-14 03:20:08,115 INFO L274 PluginConnector]: CDTParser initialized [2024-11-14 03:20:08,117 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/../../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_nondet_test2-2.i Unable to find full path for "g++" [2024-11-14 03:20:10,421 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-14 03:20:10,816 INFO L384 CDTParser]: Found 1 translation units. [2024-11-14 03:20:10,817 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_nondet_test2-2.i [2024-11-14 03:20:10,845 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/data/1a6774263/ef6869febb9041628379528e9032d57e/FLAG3908c6cb9 [2024-11-14 03:20:10,999 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/data/1a6774263/ef6869febb9041628379528e9032d57e [2024-11-14 03:20:11,004 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-14 03:20:11,006 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-14 03:20:11,007 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-14 03:20:11,008 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-14 03:20:11,013 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-14 03:20:11,015 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 03:20:11" (1/1) ... [2024-11-14 03:20:11,017 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60ff8ff7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:20:11, skipping insertion in model container [2024-11-14 03:20:11,018 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 03:20:11" (1/1) ... [2024-11-14 03:20:11,087 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-14 03:20:11,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-14 03:20:11,764 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-14 03:20:11,769 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 03:20:11,775 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-14 03:20:11,786 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-14 03:20:11,836 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-14 03:20:11,836 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-14 03:20:11,841 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-14 03:20:11,841 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-14 03:20:11,844 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-14 03:20:11,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-14 03:20:11,858 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-14 03:20:11,860 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-14 03:20:11,861 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-14 03:20:11,877 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-14 03:20:11,883 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 03:20:11,904 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-14 03:20:11,920 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-14 03:20:11,961 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 03:20:11,984 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-14 03:20:11,987 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-14 03:20:11,991 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-14 03:20:11,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-14 03:20:12,065 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-14 03:20:12,065 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-14 03:20:12,072 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-14 03:20:12,072 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-14 03:20:12,074 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-14 03:20:12,077 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-14 03:20:12,078 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-14 03:20:12,079 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-14 03:20:12,079 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-14 03:20:12,084 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-14 03:20:12,087 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 03:20:12,092 INFO L200 MainTranslator]: Completed pre-run [2024-11-14 03:20:12,258 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 03:20:12,311 INFO L204 MainTranslator]: Completed translation [2024-11-14 03:20:12,312 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:20:12 WrapperNode [2024-11-14 03:20:12,312 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-14 03:20:12,313 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-14 03:20:12,313 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-14 03:20:12,314 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-14 03:20:12,320 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:20:12" (1/1) ... [2024-11-14 03:20:12,349 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:20:12" (1/1) ... [2024-11-14 03:20:12,415 INFO L138 Inliner]: procedures = 210, calls = 273, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1024 [2024-11-14 03:20:12,416 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-14 03:20:12,417 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-14 03:20:12,417 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-14 03:20:12,417 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-14 03:20:12,429 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:20:12" (1/1) ... [2024-11-14 03:20:12,429 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:20:12" (1/1) ... [2024-11-14 03:20:12,443 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:20:12" (1/1) ... [2024-11-14 03:20:12,443 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:20:12" (1/1) ... [2024-11-14 03:20:12,486 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:20:12" (1/1) ... [2024-11-14 03:20:12,500 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:20:12" (1/1) ... [2024-11-14 03:20:12,516 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:20:12" (1/1) ... [2024-11-14 03:20:12,524 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:20:12" (1/1) ... [2024-11-14 03:20:12,591 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-14 03:20:12,592 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-14 03:20:12,595 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-14 03:20:12,596 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-14 03:20:12,597 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:20:12" (1/1) ... [2024-11-14 03:20:12,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 03:20:12,633 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:20:12,650 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-14 03:20:12,660 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-14 03:20:12,698 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2024-11-14 03:20:12,698 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2024-11-14 03:20:12,698 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2024-11-14 03:20:12,699 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2024-11-14 03:20:12,699 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-14 03:20:12,699 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-11-14 03:20:12,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2024-11-14 03:20:12,699 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-14 03:20:12,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2024-11-14 03:20:12,699 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-14 03:20:12,699 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-14 03:20:12,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-14 03:20:12,699 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-14 03:20:12,699 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-14 03:20:13,026 INFO L238 CfgBuilder]: Building ICFG [2024-11-14 03:20:13,028 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-14 03:20:13,032 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-14 03:20:19,490 INFO L? ?]: Removed 1080 outVars from TransFormulas that were not future-live. [2024-11-14 03:20:19,490 INFO L287 CfgBuilder]: Performing block encoding [2024-11-14 03:20:19,549 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-14 03:20:19,550 INFO L316 CfgBuilder]: Removed 63 assume(true) statements. [2024-11-14 03:20:19,550 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 03:20:19 BoogieIcfgContainer [2024-11-14 03:20:19,550 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-14 03:20:19,553 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-14 03:20:19,553 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-14 03:20:19,564 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-14 03:20:19,565 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 03:20:11" (1/3) ... [2024-11-14 03:20:19,565 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6733b55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 03:20:19, skipping insertion in model container [2024-11-14 03:20:19,566 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:20:12" (2/3) ... [2024-11-14 03:20:19,566 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6733b55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 03:20:19, skipping insertion in model container [2024-11-14 03:20:19,566 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 03:20:19" (3/3) ... [2024-11-14 03:20:19,567 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_OAT_nondet_test2-2.i [2024-11-14 03:20:19,587 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-14 03:20:19,589 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_OAT_nondet_test2-2.i that has 2 procedures, 1059 locations, 1 initial locations, 36 loop locations, and 525 error locations. [2024-11-14 03:20:19,698 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-14 03:20:19,722 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;@5b782477, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-14 03:20:19,723 INFO L334 AbstractCegarLoop]: Starting to check reachability of 525 error locations. [2024-11-14 03:20:19,734 INFO L276 IsEmpty]: Start isEmpty. Operand has 1059 states, 532 states have (on average 2.218045112781955) internal successors, (1180), 1054 states have internal predecessors, (1180), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 03:20:19,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-14 03:20:19,744 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:20:19,744 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-14 03:20:19,745 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-14 03:20:19,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:20:19,754 INFO L85 PathProgramCache]: Analyzing trace with hash 1202725, now seen corresponding path program 1 times [2024-11-14 03:20:19,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:20:19,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [454463440] [2024-11-14 03:20:19,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:20:19,773 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-14 03:20:19,773 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:20:19,778 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/mathsat -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-14 03:20:19,781 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/mathsat -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-14 03:20:20,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:20:20,025 INFO L255 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-14 03:20:20,031 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:20:20,075 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-14 03:20:20,113 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-14 03:20:20,115 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 03:20:20,119 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:20:20,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [454463440] [2024-11-14 03:20:20,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [454463440] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:20:20,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:20:20,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 03:20:20,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527566217] [2024-11-14 03:20:20,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:20:20,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 03:20:20,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:20:20,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 03:20:20,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 03:20:20,173 INFO L87 Difference]: Start difference. First operand has 1059 states, 532 states have (on average 2.218045112781955) internal successors, (1180), 1054 states have internal predecessors, (1180), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:20:22,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:20:22,995 INFO L93 Difference]: Finished difference Result 1225 states and 1293 transitions. [2024-11-14 03:20:22,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 03:20:23,000 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-11-14 03:20:23,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:20:23,019 INFO L225 Difference]: With dead ends: 1225 [2024-11-14 03:20:23,020 INFO L226 Difference]: Without dead ends: 1223 [2024-11-14 03:20:23,022 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 03:20:23,026 INFO L432 NwaCegarLoop]: 631 mSDtfsCounter, 968 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 637 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 971 SdHoareTripleChecker+Valid, 779 SdHoareTripleChecker+Invalid, 653 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 637 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-14 03:20:23,027 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [971 Valid, 779 Invalid, 653 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 637 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-14 03:20:23,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1223 states. [2024-11-14 03:20:23,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1223 to 1044. [2024-11-14 03:20:23,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1044 states, 534 states have (on average 2.054307116104869) internal successors, (1097), 1039 states have internal predecessors, (1097), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 03:20:23,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1044 states to 1044 states and 1103 transitions. [2024-11-14 03:20:23,136 INFO L78 Accepts]: Start accepts. Automaton has 1044 states and 1103 transitions. Word has length 4 [2024-11-14 03:20:23,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:20:23,136 INFO L471 AbstractCegarLoop]: Abstraction has 1044 states and 1103 transitions. [2024-11-14 03:20:23,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:20:23,137 INFO L276 IsEmpty]: Start isEmpty. Operand 1044 states and 1103 transitions. [2024-11-14 03:20:23,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-14 03:20:23,137 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:20:23,137 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-14 03:20:23,141 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-14 03:20:23,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/mathsat -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-14 03:20:23,339 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-14 03:20:23,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:20:23,340 INFO L85 PathProgramCache]: Analyzing trace with hash 1202726, now seen corresponding path program 1 times [2024-11-14 03:20:23,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:20:23,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [716405716] [2024-11-14 03:20:23,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:20:23,341 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-14 03:20:23,341 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:20:23,344 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/mathsat -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-14 03:20:23,352 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/mathsat -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-14 03:20:23,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:20:23,504 INFO L255 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-14 03:20:23,506 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:20:23,533 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-14 03:20:23,565 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-14 03:20:23,567 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 03:20:23,567 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:20:23,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [716405716] [2024-11-14 03:20:23,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [716405716] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:20:23,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:20:23,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 03:20:23,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571794969] [2024-11-14 03:20:23,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:20:23,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 03:20:23,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:20:23,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 03:20:23,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 03:20:23,574 INFO L87 Difference]: Start difference. First operand 1044 states and 1103 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:20:27,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:20:27,528 INFO L93 Difference]: Finished difference Result 1455 states and 1546 transitions. [2024-11-14 03:20:27,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 03:20:27,529 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-11-14 03:20:27,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:20:27,542 INFO L225 Difference]: With dead ends: 1455 [2024-11-14 03:20:27,542 INFO L226 Difference]: Without dead ends: 1455 [2024-11-14 03:20:27,542 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 03:20:27,543 INFO L432 NwaCegarLoop]: 903 mSDtfsCounter, 443 mSDsluCounter, 578 mSDsCounter, 0 mSdLazyCounter, 702 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 443 SdHoareTripleChecker+Valid, 1481 SdHoareTripleChecker+Invalid, 708 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 702 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2024-11-14 03:20:27,544 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [443 Valid, 1481 Invalid, 708 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 702 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2024-11-14 03:20:27,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1455 states. [2024-11-14 03:20:27,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1455 to 1169. [2024-11-14 03:20:27,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1169 states, 660 states have (on average 2.0090909090909093) internal successors, (1326), 1164 states have internal predecessors, (1326), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 03:20:27,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1169 states to 1169 states and 1332 transitions. [2024-11-14 03:20:27,590 INFO L78 Accepts]: Start accepts. Automaton has 1169 states and 1332 transitions. Word has length 4 [2024-11-14 03:20:27,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:20:27,591 INFO L471 AbstractCegarLoop]: Abstraction has 1169 states and 1332 transitions. [2024-11-14 03:20:27,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:20:27,591 INFO L276 IsEmpty]: Start isEmpty. Operand 1169 states and 1332 transitions. [2024-11-14 03:20:27,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-14 03:20:27,591 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:20:27,592 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-14 03:20:27,597 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/mathsat -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-14 03:20:27,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/mathsat -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-14 03:20:27,794 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr524ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-14 03:20:27,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:20:27,795 INFO L85 PathProgramCache]: Analyzing trace with hash 1204288, now seen corresponding path program 1 times [2024-11-14 03:20:27,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:20:27,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1568742191] [2024-11-14 03:20:27,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:20:27,795 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-14 03:20:27,796 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:20:27,802 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/mathsat -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-14 03:20:27,807 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/mathsat -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-14 03:20:27,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:20:27,958 INFO L255 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-14 03:20:27,960 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:20:28,063 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~#i~0#1.base_46| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#i~0#1.base_46|)) (= (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#i~0#1.base_46| (_ bv0 1)) |c_#valid|))) is different from true [2024-11-14 03:20:28,064 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-14 03:20:28,064 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 03:20:28,064 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:20:28,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1568742191] [2024-11-14 03:20:28,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1568742191] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:20:28,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:20:28,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 03:20:28,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094639156] [2024-11-14 03:20:28,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:20:28,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 03:20:28,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:20:28,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 03:20:28,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2024-11-14 03:20:28,066 INFO L87 Difference]: Start difference. First operand 1169 states and 1332 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:20:31,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:20:31,533 INFO L93 Difference]: Finished difference Result 1441 states and 1530 transitions. [2024-11-14 03:20:31,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 03:20:31,534 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-11-14 03:20:31,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:20:31,540 INFO L225 Difference]: With dead ends: 1441 [2024-11-14 03:20:31,541 INFO L226 Difference]: Without dead ends: 1440 [2024-11-14 03:20:31,541 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2024-11-14 03:20:31,546 INFO L432 NwaCegarLoop]: 911 mSDtfsCounter, 426 mSDsluCounter, 569 mSDsCounter, 0 mSdLazyCounter, 712 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 426 SdHoareTripleChecker+Valid, 1480 SdHoareTripleChecker+Invalid, 2232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 712 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1520 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-11-14 03:20:31,546 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [426 Valid, 1480 Invalid, 2232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 712 Invalid, 0 Unknown, 1520 Unchecked, 3.4s Time] [2024-11-14 03:20:31,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1440 states. [2024-11-14 03:20:31,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1440 to 1169. [2024-11-14 03:20:31,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1169 states, 660 states have (on average 2.007575757575758) internal successors, (1325), 1164 states have internal predecessors, (1325), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 03:20:31,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1169 states to 1169 states and 1331 transitions. [2024-11-14 03:20:31,598 INFO L78 Accepts]: Start accepts. Automaton has 1169 states and 1331 transitions. Word has length 4 [2024-11-14 03:20:31,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:20:31,599 INFO L471 AbstractCegarLoop]: Abstraction has 1169 states and 1331 transitions. [2024-11-14 03:20:31,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:20:31,599 INFO L276 IsEmpty]: Start isEmpty. Operand 1169 states and 1331 transitions. [2024-11-14 03:20:31,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-14 03:20:31,599 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:20:31,600 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:20:31,605 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-14 03:20:31,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/mathsat -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-14 03:20:31,800 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-14 03:20:31,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:20:31,801 INFO L85 PathProgramCache]: Analyzing trace with hash -1654943313, now seen corresponding path program 1 times [2024-11-14 03:20:31,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:20:31,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1931150126] [2024-11-14 03:20:31,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:20:31,802 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-14 03:20:31,802 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:20:31,806 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/mathsat -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-14 03:20:31,808 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/mathsat -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-14 03:20:32,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:20:32,013 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-14 03:20:32,017 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:20:32,037 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-14 03:20:32,049 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-14 03:20:32,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:20:32,202 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-14 03:20:32,230 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-14 03:20:32,231 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-14 03:20:32,268 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-14 03:20:32,268 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 03:20:32,268 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:20:32,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1931150126] [2024-11-14 03:20:32,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1931150126] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:20:32,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:20:32,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 03:20:32,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189539025] [2024-11-14 03:20:32,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:20:32,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 03:20:32,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:20:32,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 03:20:32,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-14 03:20:32,269 INFO L87 Difference]: Start difference. First operand 1169 states and 1331 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:20:36,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:20:36,799 INFO L93 Difference]: Finished difference Result 1337 states and 1507 transitions. [2024-11-14 03:20:36,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 03:20:36,799 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-14 03:20:36,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:20:36,804 INFO L225 Difference]: With dead ends: 1337 [2024-11-14 03:20:36,804 INFO L226 Difference]: Without dead ends: 1337 [2024-11-14 03:20:36,805 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 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-14 03:20:36,806 INFO L432 NwaCegarLoop]: 364 mSDtfsCounter, 1251 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 949 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1254 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 965 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 949 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2024-11-14 03:20:36,806 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1254 Valid, 449 Invalid, 965 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 949 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2024-11-14 03:20:36,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1337 states. [2024-11-14 03:20:36,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1337 to 1032. [2024-11-14 03:20:36,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1032 states, 534 states have (on average 2.0280898876404496) internal successors, (1083), 1027 states have internal predecessors, (1083), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 03:20:36,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1032 states to 1032 states and 1089 transitions. [2024-11-14 03:20:36,834 INFO L78 Accepts]: Start accepts. Automaton has 1032 states and 1089 transitions. Word has length 8 [2024-11-14 03:20:36,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:20:36,834 INFO L471 AbstractCegarLoop]: Abstraction has 1032 states and 1089 transitions. [2024-11-14 03:20:36,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:20:36,834 INFO L276 IsEmpty]: Start isEmpty. Operand 1032 states and 1089 transitions. [2024-11-14 03:20:36,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-14 03:20:36,835 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:20:36,835 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:20:36,839 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/mathsat -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-14 03:20:37,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/mathsat -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-14 03:20:37,038 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-14 03:20:37,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:20:37,038 INFO L85 PathProgramCache]: Analyzing trace with hash 236364828, now seen corresponding path program 1 times [2024-11-14 03:20:37,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:20:37,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1811040992] [2024-11-14 03:20:37,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:20:37,039 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-14 03:20:37,039 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:20:37,041 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/mathsat -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-14 03:20:37,042 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/mathsat -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-14 03:20:37,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:20:37,197 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-14 03:20:37,200 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:20:37,213 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-14 03:20:37,232 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-14 03:20:37,233 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 03:20:37,233 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:20:37,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1811040992] [2024-11-14 03:20:37,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1811040992] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:20:37,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:20:37,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 03:20:37,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015409501] [2024-11-14 03:20:37,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:20:37,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 03:20:37,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:20:37,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 03:20:37,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 03:20:37,235 INFO L87 Difference]: Start difference. First operand 1032 states and 1089 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:20:39,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:20:39,896 INFO L93 Difference]: Finished difference Result 1197 states and 1275 transitions. [2024-11-14 03:20:39,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 03:20:39,897 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-14 03:20:39,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:20:39,900 INFO L225 Difference]: With dead ends: 1197 [2024-11-14 03:20:39,900 INFO L226 Difference]: Without dead ends: 1197 [2024-11-14 03:20:39,900 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 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-14 03:20:39,901 INFO L432 NwaCegarLoop]: 865 mSDtfsCounter, 749 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 658 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 752 SdHoareTripleChecker+Valid, 1116 SdHoareTripleChecker+Invalid, 708 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 658 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-14 03:20:39,901 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [752 Valid, 1116 Invalid, 708 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 658 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-14 03:20:39,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1197 states. [2024-11-14 03:20:39,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1197 to 985. [2024-11-14 03:20:39,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 985 states, 534 states have (on average 1.9400749063670413) internal successors, (1036), 980 states have internal predecessors, (1036), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 03:20:39,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 985 states to 985 states and 1042 transitions. [2024-11-14 03:20:39,932 INFO L78 Accepts]: Start accepts. Automaton has 985 states and 1042 transitions. Word has length 9 [2024-11-14 03:20:39,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:20:39,933 INFO L471 AbstractCegarLoop]: Abstraction has 985 states and 1042 transitions. [2024-11-14 03:20:39,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:20:39,933 INFO L276 IsEmpty]: Start isEmpty. Operand 985 states and 1042 transitions. [2024-11-14 03:20:39,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-14 03:20:39,933 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:20:39,934 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:20:39,938 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-11-14 03:20:40,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/mathsat -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-14 03:20:40,137 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-14 03:20:40,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:20:40,137 INFO L85 PathProgramCache]: Analyzing trace with hash 236364829, now seen corresponding path program 1 times [2024-11-14 03:20:40,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:20:40,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1240283955] [2024-11-14 03:20:40,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:20:40,138 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-14 03:20:40,138 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:20:40,140 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/mathsat -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-14 03:20:40,142 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/mathsat -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-14 03:20:40,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:20:40,312 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-14 03:20:40,315 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:20:40,338 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-14 03:20:40,385 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-14 03:20:40,385 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 03:20:40,386 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:20:40,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1240283955] [2024-11-14 03:20:40,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1240283955] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:20:40,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:20:40,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 03:20:40,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476533537] [2024-11-14 03:20:40,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:20:40,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 03:20:40,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:20:40,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 03:20:40,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 03:20:40,388 INFO L87 Difference]: Start difference. First operand 985 states and 1042 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:20:43,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:20:43,437 INFO L93 Difference]: Finished difference Result 1273 states and 1354 transitions. [2024-11-14 03:20:43,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 03:20:43,438 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-14 03:20:43,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:20:43,442 INFO L225 Difference]: With dead ends: 1273 [2024-11-14 03:20:43,442 INFO L226 Difference]: Without dead ends: 1273 [2024-11-14 03:20:43,442 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 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-14 03:20:43,443 INFO L432 NwaCegarLoop]: 1043 mSDtfsCounter, 500 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 635 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 500 SdHoareTripleChecker+Valid, 1463 SdHoareTripleChecker+Invalid, 648 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 635 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-11-14 03:20:43,443 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [500 Valid, 1463 Invalid, 648 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 635 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-11-14 03:20:43,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1273 states. [2024-11-14 03:20:43,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1273 to 1012. [2024-11-14 03:20:43,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1012 states, 571 states have (on average 1.926444833625219) internal successors, (1100), 1007 states have internal predecessors, (1100), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 03:20:43,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1012 states to 1012 states and 1106 transitions. [2024-11-14 03:20:43,470 INFO L78 Accepts]: Start accepts. Automaton has 1012 states and 1106 transitions. Word has length 9 [2024-11-14 03:20:43,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:20:43,470 INFO L471 AbstractCegarLoop]: Abstraction has 1012 states and 1106 transitions. [2024-11-14 03:20:43,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:20:43,471 INFO L276 IsEmpty]: Start isEmpty. Operand 1012 states and 1106 transitions. [2024-11-14 03:20:43,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-14 03:20:43,471 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:20:43,471 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:20:43,475 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/mathsat -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-14 03:20:43,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/mathsat -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-14 03:20:43,672 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr419REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-14 03:20:43,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:20:43,673 INFO L85 PathProgramCache]: Analyzing trace with hash 526965881, now seen corresponding path program 1 times [2024-11-14 03:20:43,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:20:43,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [993889001] [2024-11-14 03:20:43,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:20:43,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-14 03:20:43,674 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:20:43,677 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/mathsat -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-14 03:20:43,681 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/mathsat -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-14 03:20:43,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:20:43,859 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-14 03:20:43,862 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:20:43,969 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-14 03:20:43,971 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 03:20:43,971 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:20:43,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [993889001] [2024-11-14 03:20:43,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [993889001] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:20:43,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:20:43,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 03:20:43,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940036104] [2024-11-14 03:20:43,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:20:43,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 03:20:43,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:20:43,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 03:20:43,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 03:20:43,973 INFO L87 Difference]: Start difference. First operand 1012 states and 1106 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:20:44,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:20:44,369 INFO L93 Difference]: Finished difference Result 1451 states and 1600 transitions. [2024-11-14 03:20:44,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 03:20:44,370 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-11-14 03:20:44,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:20:44,374 INFO L225 Difference]: With dead ends: 1451 [2024-11-14 03:20:44,375 INFO L226 Difference]: Without dead ends: 1451 [2024-11-14 03:20:44,375 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 03:20:44,376 INFO L432 NwaCegarLoop]: 1092 mSDtfsCounter, 465 mSDsluCounter, 939 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 465 SdHoareTripleChecker+Valid, 2031 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-14 03:20:44,376 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [465 Valid, 2031 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-14 03:20:44,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1451 states. [2024-11-14 03:20:44,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1451 to 1186. [2024-11-14 03:20:44,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1186 states, 745 states have (on average 1.8697986577181207) internal successors, (1393), 1181 states have internal predecessors, (1393), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 03:20:44,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1186 states to 1186 states and 1399 transitions. [2024-11-14 03:20:44,408 INFO L78 Accepts]: Start accepts. Automaton has 1186 states and 1399 transitions. Word has length 12 [2024-11-14 03:20:44,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:20:44,408 INFO L471 AbstractCegarLoop]: Abstraction has 1186 states and 1399 transitions. [2024-11-14 03:20:44,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:20:44,408 INFO L276 IsEmpty]: Start isEmpty. Operand 1186 states and 1399 transitions. [2024-11-14 03:20:44,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-14 03:20:44,409 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:20:44,410 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:20:44,413 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/mathsat -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-14 03:20:44,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/mathsat -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-14 03:20:44,613 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr330REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-14 03:20:44,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:20:44,613 INFO L85 PathProgramCache]: Analyzing trace with hash -733495144, now seen corresponding path program 1 times [2024-11-14 03:20:44,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:20:44,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [212873484] [2024-11-14 03:20:44,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:20:44,614 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-14 03:20:44,614 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:20:44,617 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/mathsat -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-14 03:20:44,619 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/mathsat -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-14 03:20:44,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:20:44,789 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-14 03:20:44,791 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:20:44,806 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-14 03:20:44,806 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 03:20:44,807 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:20:44,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [212873484] [2024-11-14 03:20:44,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [212873484] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:20:44,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:20:44,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 03:20:44,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634368065] [2024-11-14 03:20:44,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:20:44,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 03:20:44,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:20:44,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 03:20:44,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 03:20:44,809 INFO L87 Difference]: Start difference. First operand 1186 states and 1399 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 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-14 03:20:44,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:20:44,854 INFO L93 Difference]: Finished difference Result 1126 states and 1313 transitions. [2024-11-14 03:20:44,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 03:20:44,855 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 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-14 03:20:44,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:20:44,859 INFO L225 Difference]: With dead ends: 1126 [2024-11-14 03:20:44,859 INFO L226 Difference]: Without dead ends: 1126 [2024-11-14 03:20:44,859 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 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-14 03:20:44,860 INFO L432 NwaCegarLoop]: 969 mSDtfsCounter, 71 mSDsluCounter, 906 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 1875 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-14 03:20:44,860 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 1875 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-14 03:20:44,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1126 states. [2024-11-14 03:20:44,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1126 to 1126. [2024-11-14 03:20:44,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1126 states, 709 states have (on average 1.843441466854725) internal successors, (1307), 1121 states have internal predecessors, (1307), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 03:20:44,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1126 states to 1126 states and 1313 transitions. [2024-11-14 03:20:44,912 INFO L78 Accepts]: Start accepts. Automaton has 1126 states and 1313 transitions. Word has length 14 [2024-11-14 03:20:44,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:20:44,913 INFO L471 AbstractCegarLoop]: Abstraction has 1126 states and 1313 transitions. [2024-11-14 03:20:44,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 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-14 03:20:44,913 INFO L276 IsEmpty]: Start isEmpty. Operand 1126 states and 1313 transitions. [2024-11-14 03:20:44,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-14 03:20:44,914 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:20:44,915 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:20:44,918 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-14 03:20:45,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/mathsat -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-14 03:20:45,116 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr524ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-14 03:20:45,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:20:45,117 INFO L85 PathProgramCache]: Analyzing trace with hash 742178142, now seen corresponding path program 1 times [2024-11-14 03:20:45,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:20:45,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1175580264] [2024-11-14 03:20:45,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:20:45,118 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-14 03:20:45,118 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:20:45,121 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/mathsat -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-14 03:20:45,127 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/mathsat -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-14 03:20:45,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:20:45,340 INFO L255 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-14 03:20:45,342 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:20:45,506 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~#i~0#1.base_47| (_ BitVec 32))) (and (= |c_#valid| (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#i~0#1.base_47| (_ bv0 1))) (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#i~0#1.base_47|)))) is different from true [2024-11-14 03:20:45,507 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-14 03:20:45,507 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 03:20:45,507 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:20:45,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1175580264] [2024-11-14 03:20:45,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1175580264] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:20:45,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:20:45,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 03:20:45,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416466966] [2024-11-14 03:20:45,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:20:45,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 03:20:45,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:20:45,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 03:20:45,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2024-11-14 03:20:45,509 INFO L87 Difference]: Start difference. First operand 1126 states and 1313 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:20:47,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:20:47,718 INFO L93 Difference]: Finished difference Result 1401 states and 1608 transitions. [2024-11-14 03:20:47,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 03:20:47,719 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-14 03:20:47,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:20:47,722 INFO L225 Difference]: With dead ends: 1401 [2024-11-14 03:20:47,722 INFO L226 Difference]: Without dead ends: 1399 [2024-11-14 03:20:47,722 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2024-11-14 03:20:47,723 INFO L432 NwaCegarLoop]: 864 mSDtfsCounter, 286 mSDsluCounter, 540 mSDsCounter, 0 mSdLazyCounter, 564 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 1404 SdHoareTripleChecker+Invalid, 1843 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 564 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1279 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-14 03:20:47,723 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 1404 Invalid, 1843 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 564 Invalid, 0 Unknown, 1279 Unchecked, 2.2s Time] [2024-11-14 03:20:47,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1399 states. [2024-11-14 03:20:47,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1399 to 1197. [2024-11-14 03:20:47,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1197 states, 780 states have (on average 1.8115384615384615) internal successors, (1413), 1192 states have internal predecessors, (1413), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 03:20:47,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1197 states to 1197 states and 1419 transitions. [2024-11-14 03:20:47,754 INFO L78 Accepts]: Start accepts. Automaton has 1197 states and 1419 transitions. Word has length 15 [2024-11-14 03:20:47,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:20:47,754 INFO L471 AbstractCegarLoop]: Abstraction has 1197 states and 1419 transitions. [2024-11-14 03:20:47,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:20:47,755 INFO L276 IsEmpty]: Start isEmpty. Operand 1197 states and 1419 transitions. [2024-11-14 03:20:47,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-14 03:20:47,756 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:20:47,756 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:20:47,761 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/mathsat -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-14 03:20:47,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/mathsat -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-14 03:20:47,957 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr421REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-14 03:20:47,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:20:47,958 INFO L85 PathProgramCache]: Analyzing trace with hash 742171424, now seen corresponding path program 1 times [2024-11-14 03:20:47,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:20:47,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1799118592] [2024-11-14 03:20:47,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:20:47,958 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-14 03:20:47,958 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:20:47,962 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/mathsat -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-14 03:20:47,963 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/mathsat -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-14 03:20:48,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:20:48,129 INFO L255 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-14 03:20:48,131 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:20:48,258 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-14 03:20:48,258 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 03:20:48,259 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:20:48,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1799118592] [2024-11-14 03:20:48,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1799118592] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:20:48,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:20:48,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 03:20:48,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723756342] [2024-11-14 03:20:48,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:20:48,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 03:20:48,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:20:48,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 03:20:48,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 03:20:48,260 INFO L87 Difference]: Start difference. First operand 1197 states and 1419 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:20:49,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:20:49,174 INFO L93 Difference]: Finished difference Result 1440 states and 1621 transitions. [2024-11-14 03:20:49,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 03:20:49,175 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-14 03:20:49,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:20:49,178 INFO L225 Difference]: With dead ends: 1440 [2024-11-14 03:20:49,178 INFO L226 Difference]: Without dead ends: 1436 [2024-11-14 03:20:49,178 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 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-14 03:20:49,178 INFO L432 NwaCegarLoop]: 1049 mSDtfsCounter, 424 mSDsluCounter, 1839 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 424 SdHoareTripleChecker+Valid, 2888 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-14 03:20:49,179 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [424 Valid, 2888 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-14 03:20:49,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1436 states. [2024-11-14 03:20:49,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1436 to 1195. [2024-11-14 03:20:49,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1195 states, 778 states have (on average 1.8123393316195373) internal successors, (1410), 1190 states have internal predecessors, (1410), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 03:20:49,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1195 states to 1195 states and 1416 transitions. [2024-11-14 03:20:49,207 INFO L78 Accepts]: Start accepts. Automaton has 1195 states and 1416 transitions. Word has length 15 [2024-11-14 03:20:49,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:20:49,207 INFO L471 AbstractCegarLoop]: Abstraction has 1195 states and 1416 transitions. [2024-11-14 03:20:49,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:20:49,208 INFO L276 IsEmpty]: Start isEmpty. Operand 1195 states and 1416 transitions. [2024-11-14 03:20:49,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-14 03:20:49,208 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:20:49,208 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:20:49,212 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/mathsat -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-14 03:20:49,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/mathsat -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-14 03:20:49,414 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr354REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-14 03:20:49,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:20:49,415 INFO L85 PathProgramCache]: Analyzing trace with hash -514173391, now seen corresponding path program 1 times [2024-11-14 03:20:49,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:20:49,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [861293718] [2024-11-14 03:20:49,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:20:49,416 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-14 03:20:49,416 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:20:49,418 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/mathsat -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-14 03:20:49,427 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/mathsat -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-14 03:20:49,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:20:49,665 INFO L255 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-14 03:20:49,667 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:20:49,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-14 03:20:49,696 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 03:20:49,696 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:20:49,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [861293718] [2024-11-14 03:20:49,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [861293718] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:20:49,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:20:49,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 03:20:49,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547650519] [2024-11-14 03:20:49,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:20:49,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 03:20:49,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:20:49,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 03:20:49,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 03:20:49,698 INFO L87 Difference]: Start difference. First operand 1195 states and 1416 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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-14 03:20:49,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:20:49,821 INFO L93 Difference]: Finished difference Result 1157 states and 1329 transitions. [2024-11-14 03:20:49,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 03:20:49,822 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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 16 [2024-11-14 03:20:49,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:20:49,826 INFO L225 Difference]: With dead ends: 1157 [2024-11-14 03:20:49,826 INFO L226 Difference]: Without dead ends: 1157 [2024-11-14 03:20:49,826 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 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-14 03:20:49,827 INFO L432 NwaCegarLoop]: 924 mSDtfsCounter, 48 mSDsluCounter, 1822 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 2746 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-14 03:20:49,828 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 2746 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 03:20:49,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1157 states. [2024-11-14 03:20:49,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1157 to 1157. [2024-11-14 03:20:49,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1157 states, 754 states have (on average 1.7546419098143236) internal successors, (1323), 1152 states have internal predecessors, (1323), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 03:20:49,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1157 states to 1157 states and 1329 transitions. [2024-11-14 03:20:49,852 INFO L78 Accepts]: Start accepts. Automaton has 1157 states and 1329 transitions. Word has length 16 [2024-11-14 03:20:49,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:20:49,853 INFO L471 AbstractCegarLoop]: Abstraction has 1157 states and 1329 transitions. [2024-11-14 03:20:49,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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-14 03:20:49,853 INFO L276 IsEmpty]: Start isEmpty. Operand 1157 states and 1329 transitions. [2024-11-14 03:20:49,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-14 03:20:49,854 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:20:49,854 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:20:49,858 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/mathsat -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-14 03:20:50,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/mathsat -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-14 03:20:50,058 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-14 03:20:50,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:20:50,058 INFO L85 PathProgramCache]: Analyzing trace with hash 1783704296, now seen corresponding path program 1 times [2024-11-14 03:20:50,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:20:50,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1191495392] [2024-11-14 03:20:50,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:20:50,059 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-14 03:20:50,059 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:20:50,062 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/mathsat -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-14 03:20:50,064 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/mathsat -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-14 03:20:50,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:20:50,314 INFO L255 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-14 03:20:50,316 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:20:50,332 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-14 03:20:50,332 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 03:20:50,332 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:20:50,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1191495392] [2024-11-14 03:20:50,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1191495392] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:20:50,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:20:50,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 03:20:50,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716661960] [2024-11-14 03:20:50,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:20:50,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 03:20:50,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:20:50,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 03:20:50,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 03:20:50,334 INFO L87 Difference]: Start difference. First operand 1157 states and 1329 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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-14 03:20:50,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:20:50,382 INFO L93 Difference]: Finished difference Result 1097 states and 1243 transitions. [2024-11-14 03:20:50,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 03:20:50,383 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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 19 [2024-11-14 03:20:50,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:20:50,387 INFO L225 Difference]: With dead ends: 1097 [2024-11-14 03:20:50,387 INFO L226 Difference]: Without dead ends: 1097 [2024-11-14 03:20:50,388 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 17 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-14 03:20:50,388 INFO L432 NwaCegarLoop]: 891 mSDtfsCounter, 71 mSDsluCounter, 828 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 1719 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-14 03:20:50,389 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 1719 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-14 03:20:50,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1097 states. [2024-11-14 03:20:50,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1097 to 1097. [2024-11-14 03:20:50,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1097 states, 718 states have (on average 1.722841225626741) internal successors, (1237), 1092 states have internal predecessors, (1237), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 03:20:50,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1097 states to 1097 states and 1243 transitions. [2024-11-14 03:20:50,410 INFO L78 Accepts]: Start accepts. Automaton has 1097 states and 1243 transitions. Word has length 19 [2024-11-14 03:20:50,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:20:50,411 INFO L471 AbstractCegarLoop]: Abstraction has 1097 states and 1243 transitions. [2024-11-14 03:20:50,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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-14 03:20:50,411 INFO L276 IsEmpty]: Start isEmpty. Operand 1097 states and 1243 transitions. [2024-11-14 03:20:50,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-14 03:20:50,412 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:20:50,412 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] [2024-11-14 03:20:50,417 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/mathsat -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-14 03:20:50,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/mathsat -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-14 03:20:50,615 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-14 03:20:50,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:20:50,616 INFO L85 PathProgramCache]: Analyzing trace with hash 447872865, now seen corresponding path program 1 times [2024-11-14 03:20:50,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:20:50,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [549759599] [2024-11-14 03:20:50,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:20:50,616 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-14 03:20:50,616 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:20:50,618 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/mathsat -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-14 03:20:50,620 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/mathsat -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-14 03:20:50,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:20:50,850 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-14 03:20:50,852 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:20:50,884 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-14 03:20:50,884 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 03:20:50,885 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:20:50,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [549759599] [2024-11-14 03:20:50,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [549759599] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:20:50,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:20:50,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 03:20:50,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375822681] [2024-11-14 03:20:50,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:20:50,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 03:20:50,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:20:50,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 03:20:50,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 03:20:50,886 INFO L87 Difference]: Start difference. First operand 1097 states and 1243 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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-14 03:20:51,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:20:51,008 INFO L93 Difference]: Finished difference Result 1067 states and 1185 transitions. [2024-11-14 03:20:51,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 03:20:51,009 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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 21 [2024-11-14 03:20:51,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:20:51,015 INFO L225 Difference]: With dead ends: 1067 [2024-11-14 03:20:51,015 INFO L226 Difference]: Without dead ends: 1067 [2024-11-14 03:20:51,015 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 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-14 03:20:51,016 INFO L432 NwaCegarLoop]: 846 mSDtfsCounter, 48 mSDsluCounter, 1666 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 2512 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-14 03:20:51,016 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 2512 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 03:20:51,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1067 states. [2024-11-14 03:20:51,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1067 to 1067. [2024-11-14 03:20:51,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1067 states, 702 states have (on average 1.6794871794871795) internal successors, (1179), 1062 states have internal predecessors, (1179), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 03:20:51,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1067 states to 1067 states and 1185 transitions. [2024-11-14 03:20:51,042 INFO L78 Accepts]: Start accepts. Automaton has 1067 states and 1185 transitions. Word has length 21 [2024-11-14 03:20:51,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:20:51,043 INFO L471 AbstractCegarLoop]: Abstraction has 1067 states and 1185 transitions. [2024-11-14 03:20:51,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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-14 03:20:51,043 INFO L276 IsEmpty]: Start isEmpty. Operand 1067 states and 1185 transitions. [2024-11-14 03:20:51,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-14 03:20:51,044 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:20:51,045 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] [2024-11-14 03:20:51,050 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/mathsat -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-14 03:20:51,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/mathsat -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-14 03:20:51,248 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr368REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-14 03:20:51,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:20:51,249 INFO L85 PathProgramCache]: Analyzing trace with hash 1266060127, now seen corresponding path program 1 times [2024-11-14 03:20:51,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:20:51,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [4818251] [2024-11-14 03:20:51,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:20:51,250 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-14 03:20:51,250 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:20:51,255 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/mathsat -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-14 03:20:51,258 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/mathsat -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-14 03:20:51,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:20:51,453 INFO L255 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-14 03:20:51,456 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:20:51,465 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-14 03:20:51,614 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-14 03:20:51,615 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 03:20:51,615 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:20:51,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [4818251] [2024-11-14 03:20:51,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [4818251] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:20:51,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:20:51,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 03:20:51,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704411597] [2024-11-14 03:20:51,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:20:51,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 03:20:51,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:20:51,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 03:20:51,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 03:20:51,617 INFO L87 Difference]: Start difference. First operand 1067 states and 1185 transitions. Second operand has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 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-14 03:20:54,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:20:54,324 INFO L93 Difference]: Finished difference Result 1254 states and 1373 transitions. [2024-11-14 03:20:54,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 03:20:54,324 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 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 30 [2024-11-14 03:20:54,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:20:54,327 INFO L225 Difference]: With dead ends: 1254 [2024-11-14 03:20:54,328 INFO L226 Difference]: Without dead ends: 1254 [2024-11-14 03:20:54,328 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 27 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-14 03:20:54,328 INFO L432 NwaCegarLoop]: 527 mSDtfsCounter, 774 mSDsluCounter, 592 mSDsCounter, 0 mSdLazyCounter, 880 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 777 SdHoareTripleChecker+Valid, 1119 SdHoareTripleChecker+Invalid, 888 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 880 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-14 03:20:54,329 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [777 Valid, 1119 Invalid, 888 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 880 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-14 03:20:54,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1254 states. [2024-11-14 03:20:54,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1254 to 1063. [2024-11-14 03:20:54,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1063 states, 702 states have (on average 1.6623931623931625) internal successors, (1167), 1058 states have internal predecessors, (1167), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 03:20:54,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1063 states to 1063 states and 1173 transitions. [2024-11-14 03:20:54,347 INFO L78 Accepts]: Start accepts. Automaton has 1063 states and 1173 transitions. Word has length 30 [2024-11-14 03:20:54,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:20:54,348 INFO L471 AbstractCegarLoop]: Abstraction has 1063 states and 1173 transitions. [2024-11-14 03:20:54,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 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-14 03:20:54,348 INFO L276 IsEmpty]: Start isEmpty. Operand 1063 states and 1173 transitions. [2024-11-14 03:20:54,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-14 03:20:54,349 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:20:54,349 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] [2024-11-14 03:20:54,356 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/mathsat -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-14 03:20:54,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/mathsat -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-14 03:20:54,550 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr369REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-14 03:20:54,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:20:54,550 INFO L85 PathProgramCache]: Analyzing trace with hash 1266060128, now seen corresponding path program 1 times [2024-11-14 03:20:54,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:20:54,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [844566361] [2024-11-14 03:20:54,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:20:54,551 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-14 03:20:54,551 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:20:54,553 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/mathsat -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-14 03:20:54,555 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/mathsat -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-14 03:20:54,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:20:54,722 INFO L255 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-14 03:20:54,724 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:20:54,734 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-14 03:20:55,067 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-14 03:20:55,067 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 03:20:55,067 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:20:55,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [844566361] [2024-11-14 03:20:55,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [844566361] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:20:55,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:20:55,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 03:20:55,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123509872] [2024-11-14 03:20:55,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:20:55,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 03:20:55,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:20:55,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 03:20:55,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 03:20:55,069 INFO L87 Difference]: Start difference. First operand 1063 states and 1173 transitions. Second operand has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 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-14 03:20:58,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:20:58,631 INFO L93 Difference]: Finished difference Result 1070 states and 1175 transitions. [2024-11-14 03:20:58,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 03:20:58,632 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 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 30 [2024-11-14 03:20:58,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:20:58,636 INFO L225 Difference]: With dead ends: 1070 [2024-11-14 03:20:58,636 INFO L226 Difference]: Without dead ends: 1070 [2024-11-14 03:20:58,636 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-14 03:20:58,637 INFO L432 NwaCegarLoop]: 852 mSDtfsCounter, 79 mSDsluCounter, 897 mSDsCounter, 0 mSdLazyCounter, 840 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 1749 SdHoareTripleChecker+Invalid, 843 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 840 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-11-14 03:20:58,637 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 1749 Invalid, 843 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 840 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-11-14 03:20:58,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1070 states. [2024-11-14 03:20:58,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1070 to 1063. [2024-11-14 03:20:58,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1063 states, 702 states have (on average 1.6566951566951567) internal successors, (1163), 1058 states have internal predecessors, (1163), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 03:20:58,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1063 states to 1063 states and 1169 transitions. [2024-11-14 03:20:58,657 INFO L78 Accepts]: Start accepts. Automaton has 1063 states and 1169 transitions. Word has length 30 [2024-11-14 03:20:58,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:20:58,657 INFO L471 AbstractCegarLoop]: Abstraction has 1063 states and 1169 transitions. [2024-11-14 03:20:58,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 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-14 03:20:58,657 INFO L276 IsEmpty]: Start isEmpty. Operand 1063 states and 1169 transitions. [2024-11-14 03:20:58,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-14 03:20:58,658 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:20:58,659 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] [2024-11-14 03:20:58,663 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2024-11-14 03:20:58,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/mathsat -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-14 03:20:58,860 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-14 03:20:58,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:20:58,863 INFO L85 PathProgramCache]: Analyzing trace with hash -1463038801, now seen corresponding path program 1 times [2024-11-14 03:20:58,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:20:58,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2028179317] [2024-11-14 03:20:58,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:20:58,865 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-14 03:20:58,866 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:20:58,870 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/mathsat -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-14 03:20:58,901 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-11-14 03:20:59,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:20:59,177 INFO L255 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-14 03:20:59,180 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:20:59,191 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-14 03:20:59,328 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-14 03:20:59,328 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 03:20:59,328 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:20:59,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2028179317] [2024-11-14 03:20:59,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2028179317] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:20:59,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:20:59,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 03:20:59,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454259106] [2024-11-14 03:20:59,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:20:59,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 03:20:59,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:20:59,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 03:20:59,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 03:20:59,330 INFO L87 Difference]: Start difference. First operand 1063 states and 1169 transitions. Second operand has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 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-14 03:21:02,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:21:02,402 INFO L93 Difference]: Finished difference Result 1070 states and 1171 transitions. [2024-11-14 03:21:02,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 03:21:02,403 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 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 35 [2024-11-14 03:21:02,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:21:02,410 INFO L225 Difference]: With dead ends: 1070 [2024-11-14 03:21:02,410 INFO L226 Difference]: Without dead ends: 1070 [2024-11-14 03:21:02,411 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 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-14 03:21:02,411 INFO L432 NwaCegarLoop]: 612 mSDtfsCounter, 600 mSDsluCounter, 617 mSDsCounter, 0 mSdLazyCounter, 913 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 603 SdHoareTripleChecker+Valid, 1229 SdHoareTripleChecker+Invalid, 920 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 913 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-11-14 03:21:02,412 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [603 Valid, 1229 Invalid, 920 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 913 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-11-14 03:21:02,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1070 states. [2024-11-14 03:21:02,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1070 to 1059. [2024-11-14 03:21:02,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1059 states, 702 states have (on average 1.6452991452991452) internal successors, (1155), 1054 states have internal predecessors, (1155), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 03:21:02,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1059 states to 1059 states and 1161 transitions. [2024-11-14 03:21:02,427 INFO L78 Accepts]: Start accepts. Automaton has 1059 states and 1161 transitions. Word has length 35 [2024-11-14 03:21:02,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:21:02,428 INFO L471 AbstractCegarLoop]: Abstraction has 1059 states and 1161 transitions. [2024-11-14 03:21:02,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 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-14 03:21:02,428 INFO L276 IsEmpty]: Start isEmpty. Operand 1059 states and 1161 transitions. [2024-11-14 03:21:02,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-14 03:21:02,429 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:21:02,429 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] [2024-11-14 03:21:02,435 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2024-11-14 03:21:02,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/mathsat -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-14 03:21:02,634 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-14 03:21:02,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:21:02,635 INFO L85 PathProgramCache]: Analyzing trace with hash -1463038800, now seen corresponding path program 1 times [2024-11-14 03:21:02,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:21:02,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1643673215] [2024-11-14 03:21:02,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:21:02,636 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-14 03:21:02,636 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:21:02,638 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/mathsat -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-14 03:21:02,640 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2024-11-14 03:21:02,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:21:02,882 INFO L255 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-14 03:21:02,884 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:21:02,900 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-14 03:21:03,257 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-14 03:21:03,258 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 03:21:03,258 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:21:03,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1643673215] [2024-11-14 03:21:03,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1643673215] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:21:03,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:21:03,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 03:21:03,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526518900] [2024-11-14 03:21:03,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:21:03,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 03:21:03,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:21:03,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 03:21:03,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 03:21:03,261 INFO L87 Difference]: Start difference. First operand 1059 states and 1161 transitions. Second operand has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 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-14 03:21:07,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:21:07,258 INFO L93 Difference]: Finished difference Result 1316 states and 1403 transitions. [2024-11-14 03:21:07,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 03:21:07,259 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 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 35 [2024-11-14 03:21:07,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:21:07,262 INFO L225 Difference]: With dead ends: 1316 [2024-11-14 03:21:07,262 INFO L226 Difference]: Without dead ends: 1316 [2024-11-14 03:21:07,262 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-14 03:21:07,263 INFO L432 NwaCegarLoop]: 962 mSDtfsCounter, 347 mSDsluCounter, 937 mSDsCounter, 0 mSdLazyCounter, 1019 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 1899 SdHoareTripleChecker+Invalid, 1022 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1019 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2024-11-14 03:21:07,263 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [347 Valid, 1899 Invalid, 1022 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1019 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2024-11-14 03:21:07,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1316 states. [2024-11-14 03:21:07,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1316 to 1055. [2024-11-14 03:21:07,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1055 states, 702 states have (on average 1.6339031339031338) internal successors, (1147), 1050 states have internal predecessors, (1147), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 03:21:07,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1055 states to 1055 states and 1153 transitions. [2024-11-14 03:21:07,277 INFO L78 Accepts]: Start accepts. Automaton has 1055 states and 1153 transitions. Word has length 35 [2024-11-14 03:21:07,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:21:07,277 INFO L471 AbstractCegarLoop]: Abstraction has 1055 states and 1153 transitions. [2024-11-14 03:21:07,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 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-14 03:21:07,278 INFO L276 IsEmpty]: Start isEmpty. Operand 1055 states and 1153 transitions. [2024-11-14 03:21:07,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-14 03:21:07,279 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:21:07,279 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] [2024-11-14 03:21:07,285 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Ended with exit code 0 [2024-11-14 03:21:07,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/mathsat -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-14 03:21:07,480 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr414ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-14 03:21:07,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:21:07,480 INFO L85 PathProgramCache]: Analyzing trace with hash 497035581, now seen corresponding path program 1 times [2024-11-14 03:21:07,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:21:07,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [274072517] [2024-11-14 03:21:07,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:21:07,481 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-14 03:21:07,481 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:21:07,483 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/mathsat -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-14 03:21:07,485 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/mathsat -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-14 03:21:07,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:21:07,724 INFO L255 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-14 03:21:07,727 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:21:07,805 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-14 03:21:07,805 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 03:21:07,805 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:21:07,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [274072517] [2024-11-14 03:21:07,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [274072517] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:21:07,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:21:07,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 03:21:07,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138666062] [2024-11-14 03:21:07,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:21:07,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 03:21:07,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:21:07,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 03:21:07,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 03:21:07,807 INFO L87 Difference]: Start difference. First operand 1055 states and 1153 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:21:07,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:21:07,917 INFO L93 Difference]: Finished difference Result 1037 states and 1123 transitions. [2024-11-14 03:21:07,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 03:21:07,918 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2024-11-14 03:21:07,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:21:07,922 INFO L225 Difference]: With dead ends: 1037 [2024-11-14 03:21:07,922 INFO L226 Difference]: Without dead ends: 1037 [2024-11-14 03:21:07,922 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-14 03:21:07,923 INFO L432 NwaCegarLoop]: 836 mSDtfsCounter, 27 mSDsluCounter, 1635 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 2471 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-14 03:21:07,923 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 2471 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 03:21:07,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1037 states. [2024-11-14 03:21:07,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1037 to 1037. [2024-11-14 03:21:07,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1037 states, 684 states have (on average 1.6330409356725146) internal successors, (1117), 1032 states have internal predecessors, (1117), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 03:21:07,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1037 states to 1037 states and 1123 transitions. [2024-11-14 03:21:07,941 INFO L78 Accepts]: Start accepts. Automaton has 1037 states and 1123 transitions. Word has length 50 [2024-11-14 03:21:07,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:21:07,942 INFO L471 AbstractCegarLoop]: Abstraction has 1037 states and 1123 transitions. [2024-11-14 03:21:07,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:21:07,942 INFO L276 IsEmpty]: Start isEmpty. Operand 1037 states and 1123 transitions. [2024-11-14 03:21:07,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-14 03:21:07,943 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:21:07,944 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] [2024-11-14 03:21:07,949 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/mathsat -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-14 03:21:08,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/mathsat -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-14 03:21:08,145 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-14 03:21:08,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:21:08,145 INFO L85 PathProgramCache]: Analyzing trace with hash 458151361, now seen corresponding path program 1 times [2024-11-14 03:21:08,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:21:08,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1385060863] [2024-11-14 03:21:08,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:21:08,146 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-14 03:21:08,146 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:21:08,148 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/mathsat -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-14 03:21:08,156 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2024-11-14 03:21:08,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:21:08,465 INFO L255 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-14 03:21:08,467 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:21:08,534 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-14 03:21:08,534 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 03:21:08,534 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:21:08,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1385060863] [2024-11-14 03:21:08,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1385060863] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:21:08,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:21:08,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 03:21:08,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967264579] [2024-11-14 03:21:08,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:21:08,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 03:21:08,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:21:08,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 03:21:08,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 03:21:08,537 INFO L87 Difference]: Start difference. First operand 1037 states and 1123 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:21:08,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:21:08,618 INFO L93 Difference]: Finished difference Result 1025 states and 1103 transitions. [2024-11-14 03:21:08,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 03:21:08,619 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2024-11-14 03:21:08,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:21:08,624 INFO L225 Difference]: With dead ends: 1025 [2024-11-14 03:21:08,624 INFO L226 Difference]: Without dead ends: 1025 [2024-11-14 03:21:08,624 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 51 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-14 03:21:08,625 INFO L432 NwaCegarLoop]: 832 mSDtfsCounter, 21 mSDsluCounter, 1633 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 2465 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-14 03:21:08,625 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 2465 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 03:21:08,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1025 states. [2024-11-14 03:21:08,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1025 to 1025. [2024-11-14 03:21:08,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1025 states, 672 states have (on average 1.6324404761904763) internal successors, (1097), 1020 states have internal predecessors, (1097), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 03:21:08,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1025 states to 1025 states and 1103 transitions. [2024-11-14 03:21:08,637 INFO L78 Accepts]: Start accepts. Automaton has 1025 states and 1103 transitions. Word has length 54 [2024-11-14 03:21:08,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:21:08,637 INFO L471 AbstractCegarLoop]: Abstraction has 1025 states and 1103 transitions. [2024-11-14 03:21:08,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:21:08,637 INFO L276 IsEmpty]: Start isEmpty. Operand 1025 states and 1103 transitions. [2024-11-14 03:21:08,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-14 03:21:08,638 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:21:08,638 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] [2024-11-14 03:21:08,644 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Ended with exit code 0 [2024-11-14 03:21:08,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/mathsat -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-14 03:21:08,839 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr414ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-14 03:21:08,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:21:08,839 INFO L85 PathProgramCache]: Analyzing trace with hash -842924663, now seen corresponding path program 1 times [2024-11-14 03:21:08,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:21:08,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1485141703] [2024-11-14 03:21:08,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:21:08,840 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 03:21:08,840 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:21:08,842 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/mathsat -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-14 03:21:08,844 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2024-11-14 03:21:09,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:21:09,136 INFO L255 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-14 03:21:09,139 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:21:09,169 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:21:09,170 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:21:09,171 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:21:09,176 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 39 [2024-11-14 03:21:09,300 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:21:09,301 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 26 [2024-11-14 03:21:09,379 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-14 03:21:09,379 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 03:21:09,379 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:21:09,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1485141703] [2024-11-14 03:21:09,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1485141703] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:21:09,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:21:09,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-14 03:21:09,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549144793] [2024-11-14 03:21:09,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:21:09,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-14 03:21:09,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:21:09,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-14 03:21:09,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-14 03:21:09,382 INFO L87 Difference]: Start difference. First operand 1025 states and 1103 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:21:10,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:21:10,891 INFO L93 Difference]: Finished difference Result 1115 states and 1200 transitions. [2024-11-14 03:21:10,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 03:21:10,892 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2024-11-14 03:21:10,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:21:10,895 INFO L225 Difference]: With dead ends: 1115 [2024-11-14 03:21:10,895 INFO L226 Difference]: Without dead ends: 1112 [2024-11-14 03:21:10,896 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-14 03:21:10,896 INFO L432 NwaCegarLoop]: 825 mSDtfsCounter, 908 mSDsluCounter, 1940 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 911 SdHoareTripleChecker+Valid, 2765 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-14 03:21:10,896 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [911 Valid, 2765 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-14 03:21:10,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1112 states. [2024-11-14 03:21:10,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1112 to 971. [2024-11-14 03:21:10,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 971 states, 618 states have (on average 1.6844660194174756) internal successors, (1041), 966 states have internal predecessors, (1041), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 03:21:10,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 971 states to 971 states and 1047 transitions. [2024-11-14 03:21:10,909 INFO L78 Accepts]: Start accepts. Automaton has 971 states and 1047 transitions. Word has length 58 [2024-11-14 03:21:10,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:21:10,909 INFO L471 AbstractCegarLoop]: Abstraction has 971 states and 1047 transitions. [2024-11-14 03:21:10,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:21:10,910 INFO L276 IsEmpty]: Start isEmpty. Operand 971 states and 1047 transitions. [2024-11-14 03:21:10,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-14 03:21:10,910 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:21:10,910 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] [2024-11-14 03:21:10,914 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Ended with exit code 0 [2024-11-14 03:21:11,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/mathsat -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-14 03:21:11,111 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-14 03:21:11,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:21:11,111 INFO L85 PathProgramCache]: Analyzing trace with hash -1398281099, now seen corresponding path program 1 times [2024-11-14 03:21:11,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:21:11,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1511111997] [2024-11-14 03:21:11,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:21:11,112 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-14 03:21:11,112 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:21:11,114 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/mathsat -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-14 03:21:11,116 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/mathsat -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-14 03:21:11,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:21:11,524 INFO L255 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-14 03:21:11,527 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:21:11,538 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-14 03:21:11,552 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-14 03:21:12,435 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:21:12,436 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-14 03:21:12,463 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-14 03:21:12,463 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-14 03:21:12,483 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-14 03:21:12,483 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 03:21:12,483 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:21:12,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1511111997] [2024-11-14 03:21:12,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1511111997] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:21:12,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:21:12,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 03:21:12,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136454419] [2024-11-14 03:21:12,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:21:12,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 03:21:12,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:21:12,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 03:21:12,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-14 03:21:12,487 INFO L87 Difference]: Start difference. First operand 971 states and 1047 transitions. Second operand has 4 states, 3 states have (on average 20.666666666666668) internal successors, (62), 4 states have internal predecessors, (62), 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-14 03:21:14,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:21:14,981 INFO L93 Difference]: Finished difference Result 933 states and 1009 transitions. [2024-11-14 03:21:14,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 03:21:14,982 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 20.666666666666668) internal successors, (62), 4 states have internal predecessors, (62), 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 62 [2024-11-14 03:21:14,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:21:14,986 INFO L225 Difference]: With dead ends: 933 [2024-11-14 03:21:14,986 INFO L226 Difference]: Without dead ends: 933 [2024-11-14 03:21:14,986 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 59 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-14 03:21:14,987 INFO L432 NwaCegarLoop]: 434 mSDtfsCounter, 1044 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 494 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1047 SdHoareTripleChecker+Valid, 546 SdHoareTripleChecker+Invalid, 540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-14 03:21:14,987 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1047 Valid, 546 Invalid, 540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 494 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-14 03:21:14,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 933 states. [2024-11-14 03:21:14,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 933 to 896. [2024-11-14 03:21:14,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 896 states, 581 states have (on average 1.5989672977624785) internal successors, (929), 891 states have internal predecessors, (929), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 03:21:14,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 896 states to 896 states and 935 transitions. [2024-11-14 03:21:14,998 INFO L78 Accepts]: Start accepts. Automaton has 896 states and 935 transitions. Word has length 62 [2024-11-14 03:21:14,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:21:14,999 INFO L471 AbstractCegarLoop]: Abstraction has 896 states and 935 transitions. [2024-11-14 03:21:14,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 20.666666666666668) internal successors, (62), 4 states have internal predecessors, (62), 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-14 03:21:14,999 INFO L276 IsEmpty]: Start isEmpty. Operand 896 states and 935 transitions. [2024-11-14 03:21:14,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-14 03:21:14,999 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:21:14,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:21:15,007 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/mathsat -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-14 03:21:15,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/mathsat -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-14 03:21:15,200 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-14 03:21:15,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:21:15,201 INFO L85 PathProgramCache]: Analyzing trace with hash -1328083802, now seen corresponding path program 1 times [2024-11-14 03:21:15,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:21:15,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [108969706] [2024-11-14 03:21:15,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:21:15,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-14 03:21:15,202 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:21:15,207 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/mathsat -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-14 03:21:15,208 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2024-11-14 03:21:15,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:21:15,597 INFO L255 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-14 03:21:15,603 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:21:15,617 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-14 03:21:15,644 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-14 03:21:15,690 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-14 03:21:15,711 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-14 03:21:15,712 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 03:21:15,712 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:21:15,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [108969706] [2024-11-14 03:21:15,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [108969706] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:21:15,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:21:15,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 03:21:15,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726322285] [2024-11-14 03:21:15,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:21:15,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-14 03:21:15,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:21:15,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-14 03:21:15,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-14 03:21:15,715 INFO L87 Difference]: Start difference. First operand 896 states and 935 transitions. Second operand has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 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-14 03:21:19,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:21:19,070 INFO L93 Difference]: Finished difference Result 895 states and 934 transitions. [2024-11-14 03:21:19,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 03:21:19,072 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 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 67 [2024-11-14 03:21:19,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:21:19,076 INFO L225 Difference]: With dead ends: 895 [2024-11-14 03:21:19,076 INFO L226 Difference]: Without dead ends: 895 [2024-11-14 03:21:19,076 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 63 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-14 03:21:19,087 INFO L432 NwaCegarLoop]: 805 mSDtfsCounter, 2 mSDsluCounter, 1271 mSDsCounter, 0 mSdLazyCounter, 1151 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2076 SdHoareTripleChecker+Invalid, 1152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-11-14 03:21:19,087 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2076 Invalid, 1152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1151 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-11-14 03:21:19,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 895 states. [2024-11-14 03:21:19,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 895 to 895. [2024-11-14 03:21:19,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 895 states, 581 states have (on average 1.5972461273666092) internal successors, (928), 890 states have internal predecessors, (928), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 03:21:19,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 895 states to 895 states and 934 transitions. [2024-11-14 03:21:19,107 INFO L78 Accepts]: Start accepts. Automaton has 895 states and 934 transitions. Word has length 67 [2024-11-14 03:21:19,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:21:19,108 INFO L471 AbstractCegarLoop]: Abstraction has 895 states and 934 transitions. [2024-11-14 03:21:19,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 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-14 03:21:19,108 INFO L276 IsEmpty]: Start isEmpty. Operand 895 states and 934 transitions. [2024-11-14 03:21:19,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-14 03:21:19,109 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:21:19,109 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] [2024-11-14 03:21:19,118 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Ended with exit code 0 [2024-11-14 03:21:19,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/mathsat -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-14 03:21:19,311 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-14 03:21:19,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:21:19,312 INFO L85 PathProgramCache]: Analyzing trace with hash -1328083801, now seen corresponding path program 1 times [2024-11-14 03:21:19,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:21:19,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1968361941] [2024-11-14 03:21:19,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:21:19,313 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-14 03:21:19,313 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:21:19,316 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/mathsat -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-14 03:21:19,320 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2024-11-14 03:21:19,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:21:19,723 INFO L255 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-14 03:21:19,726 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:21:19,739 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-14 03:21:19,767 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-14 03:21:19,781 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-14 03:21:19,839 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-14 03:21:19,865 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-14 03:21:19,866 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 03:21:19,866 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:21:19,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1968361941] [2024-11-14 03:21:19,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1968361941] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:21:19,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:21:19,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 03:21:19,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705674804] [2024-11-14 03:21:19,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:21:19,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-14 03:21:19,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:21:19,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-14 03:21:19,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-14 03:21:19,868 INFO L87 Difference]: Start difference. First operand 895 states and 934 transitions. Second operand has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 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-14 03:21:23,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:21:23,828 INFO L93 Difference]: Finished difference Result 894 states and 933 transitions. [2024-11-14 03:21:23,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 03:21:23,829 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 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 67 [2024-11-14 03:21:23,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:21:23,836 INFO L225 Difference]: With dead ends: 894 [2024-11-14 03:21:23,836 INFO L226 Difference]: Without dead ends: 894 [2024-11-14 03:21:23,836 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 63 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-14 03:21:23,837 INFO L432 NwaCegarLoop]: 805 mSDtfsCounter, 1 mSDsluCounter, 1292 mSDsCounter, 0 mSdLazyCounter, 1127 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2097 SdHoareTripleChecker+Invalid, 1128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2024-11-14 03:21:23,837 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2097 Invalid, 1128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1127 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2024-11-14 03:21:23,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 894 states. [2024-11-14 03:21:23,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 894 to 894. [2024-11-14 03:21:23,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 894 states, 580 states have (on average 1.5982758620689654) internal successors, (927), 889 states have internal predecessors, (927), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 03:21:23,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 894 states to 894 states and 933 transitions. [2024-11-14 03:21:23,853 INFO L78 Accepts]: Start accepts. Automaton has 894 states and 933 transitions. Word has length 67 [2024-11-14 03:21:23,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:21:23,853 INFO L471 AbstractCegarLoop]: Abstraction has 894 states and 933 transitions. [2024-11-14 03:21:23,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 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-14 03:21:23,854 INFO L276 IsEmpty]: Start isEmpty. Operand 894 states and 933 transitions. [2024-11-14 03:21:23,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-14 03:21:23,855 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:21:23,855 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:21:23,863 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2024-11-14 03:21:24,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/mathsat -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-14 03:21:24,056 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-14 03:21:24,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:21:24,056 INFO L85 PathProgramCache]: Analyzing trace with hash 1735559533, now seen corresponding path program 1 times [2024-11-14 03:21:24,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:21:24,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [576407794] [2024-11-14 03:21:24,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:21:24,057 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-14 03:21:24,057 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:21:24,059 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/mathsat -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-14 03:21:24,060 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/mathsat -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-14 03:21:24,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:21:24,446 INFO L255 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-14 03:21:24,447 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:21:24,480 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-14 03:21:24,480 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 03:21:24,480 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:21:24,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [576407794] [2024-11-14 03:21:24,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [576407794] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:21:24,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:21:24,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 03:21:24,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591989997] [2024-11-14 03:21:24,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:21:24,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 03:21:24,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:21:24,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 03:21:24,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 03:21:24,482 INFO L87 Difference]: Start difference. First operand 894 states and 933 transitions. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 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-14 03:21:24,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:21:24,542 INFO L93 Difference]: Finished difference Result 897 states and 937 transitions. [2024-11-14 03:21:24,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 03:21:24,543 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 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 75 [2024-11-14 03:21:24,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:21:24,548 INFO L225 Difference]: With dead ends: 897 [2024-11-14 03:21:24,548 INFO L226 Difference]: Without dead ends: 897 [2024-11-14 03:21:24,549 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 72 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-14 03:21:24,549 INFO L432 NwaCegarLoop]: 805 mSDtfsCounter, 0 mSDsluCounter, 1605 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2410 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-14 03:21:24,550 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2410 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-14 03:21:24,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 897 states. [2024-11-14 03:21:24,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 897 to 897. [2024-11-14 03:21:24,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 897 states, 582 states have (on average 1.597938144329897) internal successors, (930), 892 states have internal predecessors, (930), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-14 03:21:24,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 897 states to 897 states and 937 transitions. [2024-11-14 03:21:24,569 INFO L78 Accepts]: Start accepts. Automaton has 897 states and 937 transitions. Word has length 75 [2024-11-14 03:21:24,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:21:24,569 INFO L471 AbstractCegarLoop]: Abstraction has 897 states and 937 transitions. [2024-11-14 03:21:24,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 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-14 03:21:24,569 INFO L276 IsEmpty]: Start isEmpty. Operand 897 states and 937 transitions. [2024-11-14 03:21:24,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-14 03:21:24,570 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:21:24,570 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:21:24,578 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/mathsat -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-14 03:21:24,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/mathsat -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-14 03:21:24,771 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-14 03:21:24,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:21:24,772 INFO L85 PathProgramCache]: Analyzing trace with hash -1014928194, now seen corresponding path program 1 times [2024-11-14 03:21:24,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:21:24,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [638476646] [2024-11-14 03:21:24,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:21:24,772 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-14 03:21:24,773 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:21:24,775 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/mathsat -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-14 03:21:24,778 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2024-11-14 03:21:25,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:21:25,163 INFO L255 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-14 03:21:25,165 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:21:25,201 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-14 03:21:25,201 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:21:25,321 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-14 03:21:25,321 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:21:25,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [638476646] [2024-11-14 03:21:25,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [638476646] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:21:25,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [769320803] [2024-11-14 03:21:25,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:21:25,321 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 03:21:25,322 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 03:21:25,330 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 03:21:25,332 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (27)] Waiting until timeout for monitored process [2024-11-14 03:21:26,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:21:26,046 INFO L255 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-14 03:21:26,049 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:21:26,067 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-14 03:21:26,067 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:21:26,111 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-14 03:21:26,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [769320803] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:21:26,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2071860311] [2024-11-14 03:21:26,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:21:26,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:21:26,112 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:21:26,116 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:21:26,120 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2024-11-14 03:21:26,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:21:26,576 INFO L255 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-14 03:21:26,579 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:21:26,598 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-14 03:21:26,598 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:21:26,643 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-14 03:21:26,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2071860311] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:21:26,643 INFO L185 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2024-11-14 03:21:26,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 5, 5, 5] total 8 [2024-11-14 03:21:26,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731350532] [2024-11-14 03:21:26,643 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2024-11-14 03:21:26,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-14 03:21:26,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:21:26,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-14 03:21:26,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-14 03:21:26,645 INFO L87 Difference]: Start difference. First operand 897 states and 937 transitions. Second operand has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 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-14 03:21:26,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:21:26,846 INFO L93 Difference]: Finished difference Result 909 states and 954 transitions. [2024-11-14 03:21:26,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-14 03:21:26,848 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 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 76 [2024-11-14 03:21:26,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:21:26,851 INFO L225 Difference]: With dead ends: 909 [2024-11-14 03:21:26,851 INFO L226 Difference]: Without dead ends: 909 [2024-11-14 03:21:26,851 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 453 GetRequests, 444 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-14 03:21:26,852 INFO L432 NwaCegarLoop]: 805 mSDtfsCounter, 8 mSDsluCounter, 1607 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 2412 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 03:21:26,852 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 2412 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 03:21:26,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 909 states. [2024-11-14 03:21:26,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 909 to 907. [2024-11-14 03:21:26,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 907 states, 591 states have (on average 1.598984771573604) internal successors, (945), 901 states have internal predecessors, (945), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-14 03:21:26,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 907 states to 907 states and 952 transitions. [2024-11-14 03:21:26,873 INFO L78 Accepts]: Start accepts. Automaton has 907 states and 952 transitions. Word has length 76 [2024-11-14 03:21:26,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:21:26,873 INFO L471 AbstractCegarLoop]: Abstraction has 907 states and 952 transitions. [2024-11-14 03:21:26,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 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-14 03:21:26,874 INFO L276 IsEmpty]: Start isEmpty. Operand 907 states and 952 transitions. [2024-11-14 03:21:26,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-14 03:21:26,874 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:21:26,875 INFO L215 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:21:26,884 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Ended with exit code 0 [2024-11-14 03:21:27,080 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (27)] Forceful destruction successful, exit code 0 [2024-11-14 03:21:27,302 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2024-11-14 03:21:27,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt,28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:21:27,476 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-14 03:21:27,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:21:27,476 INFO L85 PathProgramCache]: Analyzing trace with hash 1706644909, now seen corresponding path program 2 times [2024-11-14 03:21:27,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:21:27,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1322804815] [2024-11-14 03:21:27,477 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-14 03:21:27,477 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-14 03:21:27,477 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:21:27,480 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/mathsat -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-14 03:21:27,482 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/mathsat -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)] Waiting until timeout for monitored process [2024-11-14 03:21:28,106 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-14 03:21:28,106 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 03:21:28,122 INFO L255 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-14 03:21:28,124 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:21:28,247 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-14 03:21:28,247 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:21:28,507 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-14 03:21:28,507 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:21:28,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1322804815] [2024-11-14 03:21:28,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1322804815] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:21:28,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1326274815] [2024-11-14 03:21:28,508 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-14 03:21:28,508 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 03:21:28,508 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 03:21:28,510 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 03:21:28,512 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (30)] Waiting until timeout for monitored process [2024-11-14 03:21:30,923 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-14 03:21:30,923 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 03:21:30,974 INFO L255 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-14 03:21:30,976 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:21:31,001 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-14 03:21:31,002 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:21:31,082 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-14 03:21:31,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1326274815] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:21:31,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1988610265] [2024-11-14 03:21:31,083 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-14 03:21:31,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:21:31,083 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:21:31,086 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:21:31,088 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2024-11-14 03:22:25,920 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-14 03:22:25,920 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 03:22:25,941 INFO L255 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-14 03:22:25,946 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:22:25,955 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-14 03:22:26,217 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-14 03:22:26,217 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-14 03:22:26,274 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-14 03:22:26,668 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 03:22:26,669 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-14 03:22:26,751 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-14 03:22:26,796 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-14 03:22:26,796 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:22:26,969 INFO L349 Elim1Store]: treesize reduction 7, result has 63.2 percent of original size [2024-11-14 03:22:26,970 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-14 03:22:26,980 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1826 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_1826) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)) |c_ULTIMATE.start_main_#t~mem36#1.base|)) is different from false [2024-11-14 03:22:26,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1988610265] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:22:26,982 INFO L185 FreeRefinementEngine]: Found 0 perfect and 5 imperfect interpolant sequences. [2024-11-14 03:22:26,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 8, 10] total 23 [2024-11-14 03:22:26,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515198556] [2024-11-14 03:22:26,983 INFO L85 oduleStraightlineAll]: Using 5 imperfect interpolants to construct interpolant automaton [2024-11-14 03:22:26,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-14 03:22:26,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:22:26,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-14 03:22:26,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=467, Unknown=1, NotChecked=44, Total=600 [2024-11-14 03:22:26,986 INFO L87 Difference]: Start difference. First operand 907 states and 952 transitions. Second operand has 23 states, 22 states have (on average 7.0) internal successors, (154), 22 states have internal predecessors, (154), 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-14 03:22:39,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:22:39,784 INFO L93 Difference]: Finished difference Result 923 states and 975 transitions. [2024-11-14 03:22:39,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-14 03:22:39,784 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 7.0) internal successors, (154), 22 states have internal predecessors, (154), 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 79 [2024-11-14 03:22:39,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:22:39,789 INFO L225 Difference]: With dead ends: 923 [2024-11-14 03:22:39,789 INFO L226 Difference]: Without dead ends: 919 [2024-11-14 03:22:39,790 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 420 GetRequests, 371 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 443 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=407, Invalid=2046, Unknown=1, NotChecked=96, Total=2550 [2024-11-14 03:22:39,790 INFO L432 NwaCegarLoop]: 534 mSDtfsCounter, 534 mSDsluCounter, 7195 mSDsCounter, 0 mSdLazyCounter, 4845 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 538 SdHoareTripleChecker+Valid, 7729 SdHoareTripleChecker+Invalid, 4861 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 4845 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.4s IncrementalHoareTripleChecker+Time [2024-11-14 03:22:39,790 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [538 Valid, 7729 Invalid, 4861 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [16 Valid, 4845 Invalid, 0 Unknown, 0 Unchecked, 11.4s Time] [2024-11-14 03:22:39,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 919 states. [2024-11-14 03:22:39,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 919 to 915. [2024-11-14 03:22:39,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 915 states, 600 states have (on average 1.5933333333333333) internal successors, (956), 909 states have internal predecessors, (956), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-14 03:22:39,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 915 states to 915 states and 963 transitions. [2024-11-14 03:22:39,816 INFO L78 Accepts]: Start accepts. Automaton has 915 states and 963 transitions. Word has length 79 [2024-11-14 03:22:39,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:22:39,816 INFO L471 AbstractCegarLoop]: Abstraction has 915 states and 963 transitions. [2024-11-14 03:22:39,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 7.0) internal successors, (154), 22 states have internal predecessors, (154), 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-14 03:22:39,817 INFO L276 IsEmpty]: Start isEmpty. Operand 915 states and 963 transitions. [2024-11-14 03:22:39,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-14 03:22:39,817 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:22:39,818 INFO L215 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:22:39,828 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/mathsat -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)] Ended with exit code 0 [2024-11-14 03:22:40,025 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (30)] Ended with exit code 0 [2024-11-14 03:22:40,254 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2024-11-14 03:22:40,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt,31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:22:40,419 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-14 03:22:40,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:22:40,420 INFO L85 PathProgramCache]: Analyzing trace with hash -744469490, now seen corresponding path program 1 times [2024-11-14 03:22:40,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:22:40,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [305470574] [2024-11-14 03:22:40,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:22:40,420 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-14 03:22:40,420 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:22:40,422 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/mathsat -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-14 03:22:40,424 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (32)] Waiting until timeout for monitored process [2024-11-14 03:22:40,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:22:40,888 INFO L255 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-14 03:22:40,890 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:22:41,090 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-14 03:22:41,090 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:22:41,817 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-14 03:22:41,817 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:22:41,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [305470574] [2024-11-14 03:22:41,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [305470574] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:22:41,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [916202148] [2024-11-14 03:22:41,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:22:41,818 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 03:22:41,818 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 03:22:41,823 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 03:22:41,825 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (33)] Waiting until timeout for monitored process [2024-11-14 03:22:42,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:22:42,670 INFO L255 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-14 03:22:42,672 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:22:42,723 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-14 03:22:42,723 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:22:42,912 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-14 03:22:42,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [916202148] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:22:42,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2109915225] [2024-11-14 03:22:42,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:22:42,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:22:42,913 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:22:42,916 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:22:42,918 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2024-11-14 03:22:43,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:22:43,416 INFO L255 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-14 03:22:43,417 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:22:43,554 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-14 03:22:43,554 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:22:44,600 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-14 03:22:44,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2109915225] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:22:44,600 INFO L185 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2024-11-14 03:22:44,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14, 14, 14, 14] total 38 [2024-11-14 03:22:44,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945218450] [2024-11-14 03:22:44,601 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2024-11-14 03:22:44,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-11-14 03:22:44,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:22:44,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-11-14 03:22:44,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=447, Invalid=959, Unknown=0, NotChecked=0, Total=1406 [2024-11-14 03:22:44,603 INFO L87 Difference]: Start difference. First operand 915 states and 963 transitions. Second operand has 38 states, 38 states have (on average 2.8947368421052633) internal successors, (110), 38 states have internal predecessors, (110), 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-14 03:22:47,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:22:47,517 INFO L93 Difference]: Finished difference Result 941 states and 1004 transitions. [2024-11-14 03:22:47,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2024-11-14 03:22:47,518 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 2.8947368421052633) internal successors, (110), 38 states have internal predecessors, (110), 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 85 [2024-11-14 03:22:47,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:22:47,522 INFO L225 Difference]: With dead ends: 941 [2024-11-14 03:22:47,522 INFO L226 Difference]: Without dead ends: 935 [2024-11-14 03:22:47,523 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 525 GetRequests, 468 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=1168, Invalid=2254, Unknown=0, NotChecked=0, Total=3422 [2024-11-14 03:22:47,524 INFO L432 NwaCegarLoop]: 805 mSDtfsCounter, 27 mSDsluCounter, 9628 mSDsCounter, 0 mSdLazyCounter, 652 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 10433 SdHoareTripleChecker+Invalid, 690 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 652 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-14 03:22:47,525 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 10433 Invalid, 690 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 652 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-14 03:22:47,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 935 states. [2024-11-14 03:22:47,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 935 to 933. [2024-11-14 03:22:47,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 933 states, 618 states have (on average 1.5841423948220066) internal successors, (979), 927 states have internal predecessors, (979), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-14 03:22:47,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 933 states to 933 states and 986 transitions. [2024-11-14 03:22:47,546 INFO L78 Accepts]: Start accepts. Automaton has 933 states and 986 transitions. Word has length 85 [2024-11-14 03:22:47,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:22:47,546 INFO L471 AbstractCegarLoop]: Abstraction has 933 states and 986 transitions. [2024-11-14 03:22:47,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 2.8947368421052633) internal successors, (110), 38 states have internal predecessors, (110), 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-14 03:22:47,547 INFO L276 IsEmpty]: Start isEmpty. Operand 933 states and 986 transitions. [2024-11-14 03:22:47,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-14 03:22:47,548 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:22:47,548 INFO L215 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:22:47,559 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (33)] Ended with exit code 0 [2024-11-14 03:22:47,769 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Ended with exit code 0 [2024-11-14 03:22:47,956 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (32)] Ended with exit code 0 [2024-11-14 03:22:48,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt,34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/mathsat -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-14 03:22:48,150 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-14 03:22:48,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:22:48,150 INFO L85 PathProgramCache]: Analyzing trace with hash -292200242, now seen corresponding path program 2 times [2024-11-14 03:22:48,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:22:48,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2017097982] [2024-11-14 03:22:48,151 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-14 03:22:48,151 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-14 03:22:48,151 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:22:48,153 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/mathsat -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-14 03:22:48,155 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (35)] Waiting until timeout for monitored process [2024-11-14 03:22:48,910 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-14 03:22:48,910 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 03:22:48,928 INFO L255 TraceCheckSpWp]: Trace formula consists of 574 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-14 03:22:48,930 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:22:49,593 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-14 03:22:49,593 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:22:51,956 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-14 03:22:51,956 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:22:51,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2017097982] [2024-11-14 03:22:51,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2017097982] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:22:51,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1978786948] [2024-11-14 03:22:51,957 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-14 03:22:51,957 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 03:22:51,957 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 03:22:51,959 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 03:22:51,961 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (36)] Waiting until timeout for monitored process [2024-11-14 03:22:54,387 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-14 03:22:54,387 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 03:22:54,403 INFO L255 TraceCheckSpWp]: Trace formula consists of 574 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-14 03:22:54,406 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:22:54,499 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-14 03:22:54,499 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:22:54,892 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-14 03:22:54,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1978786948] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:22:54,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [635655669] [2024-11-14 03:22:54,893 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-14 03:22:54,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:22:54,893 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:22:54,896 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:22:54,898 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2024-11-14 03:23:32,176 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-14 03:23:32,176 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 03:23:32,201 INFO L255 TraceCheckSpWp]: Trace formula consists of 574 conjuncts, 64 conjuncts are in the unsatisfiable core [2024-11-14 03:23:32,209 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:23:32,458 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-14 03:23:32,485 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-14 03:23:32,485 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-14 03:23:32,636 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-14 03:23:32,643 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-14 03:23:33,101 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-14 03:23:33,108 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-14 03:23:34,140 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 03:23:34,140 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-14 03:23:34,148 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-14 03:23:34,379 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-14 03:23:34,386 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-14 03:23:34,525 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-14 03:23:34,525 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:23:35,710 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_3129 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3128 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv20 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_3129) |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_3128) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_3129 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_3129) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv16 32) .cse1) (bvadd (_ bv20 32) .cse1)))))) is different from false [2024-11-14 03:23:35,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [635655669] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:23:35,719 INFO L185 FreeRefinementEngine]: Found 0 perfect and 5 imperfect interpolant sequences. [2024-11-14 03:23:35,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26, 26, 8] total 57 [2024-11-14 03:23:35,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184426058] [2024-11-14 03:23:35,719 INFO L85 oduleStraightlineAll]: Using 5 imperfect interpolants to construct interpolant automaton [2024-11-14 03:23:35,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2024-11-14 03:23:35,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:23:35,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2024-11-14 03:23:35,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=697, Invalid=2728, Unknown=1, NotChecked=114, Total=3540 [2024-11-14 03:23:35,724 INFO L87 Difference]: Start difference. First operand 933 states and 986 transitions. Second operand has 57 states, 56 states have (on average 3.3392857142857144) internal successors, (187), 57 states have internal predecessors, (187), 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-14 03:24:17,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:24:17,511 INFO L93 Difference]: Finished difference Result 976 states and 1059 transitions. [2024-11-14 03:24:17,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2024-11-14 03:24:17,512 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 56 states have (on average 3.3392857142857144) internal successors, (187), 57 states have internal predecessors, (187), 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 97 [2024-11-14 03:24:17,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:24:17,515 INFO L225 Difference]: With dead ends: 976 [2024-11-14 03:24:17,515 INFO L226 Difference]: Without dead ends: 968 [2024-11-14 03:24:17,520 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 560 GetRequests, 427 SyntacticMatches, 1 SemanticMatches, 132 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 3061 ImplicationChecksByTransitivity, 15.6s TimeCoverageRelationStatistics Valid=3100, Invalid=14459, Unknown=1, NotChecked=262, Total=17822 [2024-11-14 03:24:17,521 INFO L432 NwaCegarLoop]: 534 mSDtfsCounter, 552 mSDsluCounter, 13931 mSDsCounter, 0 mSdLazyCounter, 11390 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 26.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 555 SdHoareTripleChecker+Valid, 14465 SdHoareTripleChecker+Invalid, 11433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 11390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 30.1s IncrementalHoareTripleChecker+Time [2024-11-14 03:24:17,521 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [555 Valid, 14465 Invalid, 11433 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [43 Valid, 11390 Invalid, 0 Unknown, 0 Unchecked, 30.1s Time] [2024-11-14 03:24:17,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 968 states. [2024-11-14 03:24:17,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 968 to 966. [2024-11-14 03:24:17,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 966 states, 652 states have (on average 1.5644171779141105) internal successors, (1020), 960 states have internal predecessors, (1020), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-14 03:24:17,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 966 states to 966 states and 1027 transitions. [2024-11-14 03:24:17,538 INFO L78 Accepts]: Start accepts. Automaton has 966 states and 1027 transitions. Word has length 97 [2024-11-14 03:24:17,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:24:17,538 INFO L471 AbstractCegarLoop]: Abstraction has 966 states and 1027 transitions. [2024-11-14 03:24:17,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 56 states have (on average 3.3392857142857144) internal successors, (187), 57 states have internal predecessors, (187), 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-14 03:24:17,539 INFO L276 IsEmpty]: Start isEmpty. Operand 966 states and 1027 transitions. [2024-11-14 03:24:17,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-14 03:24:17,540 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:24:17,540 INFO L215 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:24:17,553 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (36)] Ended with exit code 0 [2024-11-14 03:24:17,749 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (35)] Forceful destruction successful, exit code 0 [2024-11-14 03:24:17,975 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Ended with exit code 0 [2024-11-14 03:24:18,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt,35 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,37 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:24:18,141 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr84REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-14 03:24:18,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:24:18,142 INFO L85 PathProgramCache]: Analyzing trace with hash -759400132, now seen corresponding path program 1 times [2024-11-14 03:24:18,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:24:18,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1638361291] [2024-11-14 03:24:18,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:24:18,143 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-14 03:24:18,143 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:24:18,145 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/mathsat -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-14 03:24:18,146 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (38)] Waiting until timeout for monitored process [2024-11-14 03:24:19,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:24:19,176 INFO L255 TraceCheckSpWp]: Trace formula consists of 836 conjuncts, 61 conjuncts are in the unsatisfiable core [2024-11-14 03:24:19,186 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:24:19,189 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-14 03:24:19,372 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-14 03:24:19,372 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-14 03:24:19,419 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-14 03:24:19,564 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-14 03:24:21,011 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 03:24:21,012 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-14 03:24:21,159 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 03:24:21,160 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-14 03:24:21,194 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-14 03:24:21,237 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-14 03:24:21,237 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:24:21,303 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3553 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_3553) |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-14 03:24:21,316 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3553 (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_3553) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-14 03:24:21,843 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3599 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3553 (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~mem36#1.base| v_ArrVal_3599))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3553)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-14 03:24:21,846 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:24:21,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1638361291] [2024-11-14 03:24:21,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1638361291] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:24:21,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1058336293] [2024-11-14 03:24:21,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:24:21,846 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 03:24:21,846 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 03:24:21,848 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 03:24:21,852 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (39)] Waiting until timeout for monitored process [2024-11-14 03:24:24,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:24:24,753 INFO L255 TraceCheckSpWp]: Trace formula consists of 836 conjuncts, 63 conjuncts are in the unsatisfiable core [2024-11-14 03:24:24,762 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:24:24,767 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-14 03:24:24,937 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-14 03:24:24,938 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-14 03:24:24,968 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-14 03:24:25,055 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-14 03:24:26,473 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 03:24:26,473 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-14 03:24:26,615 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 03:24:26,616 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-14 03:24:26,663 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-14 03:24:26,678 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-14 03:24:26,678 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:24:26,705 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4023 (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~mem38#1.base| v_ArrVal_4023) |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-14 03:24:26,720 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4023 (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_4023) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (_ bv0 1))) is different from false [2024-11-14 03:24:27,236 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4069 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4023 (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~mem36#1.base| v_ArrVal_4069))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4023)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (_ bv0 1))) is different from false [2024-11-14 03:24:27,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1058336293] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:24:27,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [276261053] [2024-11-14 03:24:27,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:24:27,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:24:27,240 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:24:27,243 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:24:27,245 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2024-11-14 03:24:27,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:24:28,001 INFO L255 TraceCheckSpWp]: Trace formula consists of 836 conjuncts, 58 conjuncts are in the unsatisfiable core [2024-11-14 03:24:28,010 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:24:28,205 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-14 03:24:28,206 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-14 03:24:28,250 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-14 03:24:29,125 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 03:24:29,126 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-14 03:24:29,275 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 03:24:29,276 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-14 03:24:29,296 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-14 03:24:29,300 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-14 03:24:29,300 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:24:29,447 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4491 (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_4491) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-14 03:24:30,049 INFO L349 Elim1Store]: treesize reduction 7, result has 77.4 percent of original size [2024-11-14 03:24:30,049 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 37 treesize of output 36 [2024-11-14 03:24:30,061 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4491 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4537 (Array (_ BitVec 32) (_ BitVec 32)))) (= (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~mem36#1.base| v_ArrVal_4537))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4491)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |c_ULTIMATE.start_main_#t~mem36#1.base|)) is different from false [2024-11-14 03:24:30,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [276261053] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:24:30,064 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:24:30,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 11] total 18 [2024-11-14 03:24:30,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346199899] [2024-11-14 03:24:30,065 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:24:30,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-14 03:24:30,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:24:30,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-14 03:24:30,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=348, Unknown=18, NotChecked=360, Total=812 [2024-11-14 03:24:30,067 INFO L87 Difference]: Start difference. First operand 966 states and 1027 transitions. Second operand has 19 states, 16 states have (on average 6.25) internal successors, (100), 18 states have internal predecessors, (100), 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-14 03:24:41,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:24:41,415 INFO L93 Difference]: Finished difference Result 967 states and 1028 transitions. [2024-11-14 03:24:41,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-14 03:24:41,416 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 6.25) internal successors, (100), 18 states have internal predecessors, (100), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 122 [2024-11-14 03:24:41,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:24:41,419 INFO L225 Difference]: With dead ends: 967 [2024-11-14 03:24:41,419 INFO L226 Difference]: Without dead ends: 967 [2024-11-14 03:24:41,420 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 387 GetRequests, 354 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=107, Invalid=459, Unknown=18, NotChecked=408, Total=992 [2024-11-14 03:24:41,420 INFO L432 NwaCegarLoop]: 533 mSDtfsCounter, 511 mSDsluCounter, 4952 mSDsCounter, 0 mSdLazyCounter, 4410 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 514 SdHoareTripleChecker+Valid, 5485 SdHoareTripleChecker+Invalid, 4419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 4410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.0s IncrementalHoareTripleChecker+Time [2024-11-14 03:24:41,420 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [514 Valid, 5485 Invalid, 4419 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [9 Valid, 4410 Invalid, 0 Unknown, 0 Unchecked, 11.0s Time] [2024-11-14 03:24:41,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 967 states. [2024-11-14 03:24:41,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 967 to 965. [2024-11-14 03:24:41,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 965 states, 652 states have (on average 1.562883435582822) internal successors, (1019), 959 states have internal predecessors, (1019), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-14 03:24:41,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 965 states to 965 states and 1026 transitions. [2024-11-14 03:24:41,439 INFO L78 Accepts]: Start accepts. Automaton has 965 states and 1026 transitions. Word has length 122 [2024-11-14 03:24:41,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:24:41,439 INFO L471 AbstractCegarLoop]: Abstraction has 965 states and 1026 transitions. [2024-11-14 03:24:41,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 6.25) internal successors, (100), 18 states have internal predecessors, (100), 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-14 03:24:41,440 INFO L276 IsEmpty]: Start isEmpty. Operand 965 states and 1026 transitions. [2024-11-14 03:24:41,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-14 03:24:41,441 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:24:41,441 INFO L215 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:24:41,479 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Forceful destruction successful, exit code 0 [2024-11-14 03:24:41,654 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (39)] Ended with exit code 0 [2024-11-14 03:24:41,852 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (38)] Ended with exit code 0 [2024-11-14 03:24:42,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,39 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt,38 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/mathsat -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-14 03:24:42,042 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr85REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-14 03:24:42,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:24:42,043 INFO L85 PathProgramCache]: Analyzing trace with hash -759400131, now seen corresponding path program 1 times [2024-11-14 03:24:42,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:24:42,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1300374097] [2024-11-14 03:24:42,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:24:42,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-14 03:24:42,044 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:24:42,046 INFO L229 MonitoredProcess]: Starting monitored process 41 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/mathsat -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-14 03:24:42,048 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/mathsat -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)] Waiting until timeout for monitored process [2024-11-14 03:24:43,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:24:43,214 INFO L255 TraceCheckSpWp]: Trace formula consists of 836 conjuncts, 112 conjuncts are in the unsatisfiable core [2024-11-14 03:24:43,227 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:24:43,233 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-14 03:24:43,443 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-14 03:24:43,466 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-14 03:24:43,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 13 treesize of output 13 [2024-11-14 03:24:43,494 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-14 03:24:43,505 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-14 03:24:43,655 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-14 03:24:43,663 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-14 03:24:44,611 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 03:24:44,611 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-14 03:24:44,619 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-14 03:24:44,762 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 03:24:44,762 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-14 03:24:44,771 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-14 03:24:44,806 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-14 03:24:44,813 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-14 03:24:44,848 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-14 03:24:44,848 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:24:45,013 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5008 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5008) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_5007 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5008 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5008) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5007) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-14 03:24:45,046 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_5008 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_5008) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_5007 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5008 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_5008) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_5007) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2024-11-14 03:24:46,850 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5007 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5008 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5099 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5100 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_5099))) (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~mem36#1.base| v_ArrVal_5100) .cse0 v_ArrVal_5008) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_5007) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_5008 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5099 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5100 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_5100) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_5099) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5008) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse3) (bvadd (_ bv8 32) .cse3)))))) is different from false [2024-11-14 03:24:46,859 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:24:46,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1300374097] [2024-11-14 03:24:46,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1300374097] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:24:46,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [441340775] [2024-11-14 03:24:46,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:24:46,860 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 03:24:46,860 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 03:24:46,865 INFO L229 MonitoredProcess]: Starting monitored process 42 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 03:24:46,866 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (42)] Waiting until timeout for monitored process [2024-11-14 03:24:51,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:24:51,443 INFO L255 TraceCheckSpWp]: Trace formula consists of 836 conjuncts, 75 conjuncts are in the unsatisfiable core [2024-11-14 03:24:51,452 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:24:51,458 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-14 03:24:51,465 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-14 03:24:52,245 INFO L349 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2024-11-14 03:24:52,245 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2024-11-14 03:24:52,274 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-14 03:24:52,274 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-14 03:24:52,339 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-14 03:24:52,352 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 15 treesize of output 1 [2024-11-14 03:24:52,466 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 17 treesize of output 9 [2024-11-14 03:24:52,537 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 7 treesize of output 3 [2024-11-14 03:24:53,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:24:53,373 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-14 03:24:53,716 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 48 treesize of output 34 [2024-11-14 03:24:53,733 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-14 03:24:53,973 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:24:53,974 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 22 [2024-11-14 03:24:53,987 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:24:53,987 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 15 treesize of output 7 [2024-11-14 03:24:54,110 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-14 03:24:54,110 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:24:54,477 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 239 treesize of output 167 [2024-11-14 03:25:11,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [441340775] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:25:11,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1882194155] [2024-11-14 03:25:11,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:25:11,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:25:11,821 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:25:11,823 INFO L229 MonitoredProcess]: Starting monitored process 43 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:25:11,825 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2024-11-14 03:25:12,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:25:12,726 INFO L255 TraceCheckSpWp]: Trace formula consists of 836 conjuncts, 111 conjuncts are in the unsatisfiable core [2024-11-14 03:25:12,739 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:25:13,428 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-14 03:25:13,429 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-14 03:25:13,457 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-14 03:25:13,488 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-14 03:25:13,502 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-14 03:25:13,742 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-14 03:25:13,757 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-14 03:25:16,515 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 03:25:16,516 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-14 03:25:16,531 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-14 03:25:16,798 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 03:25:16,798 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-14 03:25:16,814 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-14 03:25:16,914 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-14 03:25:16,928 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-14 03:25:16,954 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-14 03:25:16,954 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:25:17,109 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_6043 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6044 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_6043) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_6044) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_6043 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_6043) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv4 32) .cse1) (bvadd (_ bv8 32) .cse1)))))) is different from false [2024-11-14 03:25:17,173 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_6043 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_6043) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_6043 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6044 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_6043) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_6044) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2024-11-14 03:25:20,101 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_6043 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6136 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6135 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_6135) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_6136) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6043) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_6043 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6136 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6044 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6135 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_6136))) (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~mem36#1.base| v_ArrVal_6135) .cse2 v_ArrVal_6043) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_6044) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2024-11-14 03:25:20,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1882194155] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:25:20,115 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:25:20,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 9] total 19 [2024-11-14 03:25:20,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954436908] [2024-11-14 03:25:20,115 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:25:20,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-14 03:25:20,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:25:20,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-14 03:25:20,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=525, Unknown=12, NotChecked=306, Total=930 [2024-11-14 03:25:20,117 INFO L87 Difference]: Start difference. First operand 965 states and 1026 transitions. Second operand has 20 states, 17 states have (on average 9.117647058823529) internal successors, (155), 20 states have internal predecessors, (155), 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-14 03:26:07,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:26:07,509 INFO L93 Difference]: Finished difference Result 1159 states and 1235 transitions. [2024-11-14 03:26:07,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-14 03:26:07,510 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 9.117647058823529) internal successors, (155), 20 states have internal predecessors, (155), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 122 [2024-11-14 03:26:07,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:26:07,513 INFO L225 Difference]: With dead ends: 1159 [2024-11-14 03:26:07,513 INFO L226 Difference]: Without dead ends: 1159 [2024-11-14 03:26:07,513 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 392 GetRequests, 351 SyntacticMatches, 4 SemanticMatches, 37 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 20.4s TimeCoverageRelationStatistics Valid=169, Invalid=899, Unknown=12, NotChecked=402, Total=1482 [2024-11-14 03:26:07,514 INFO L432 NwaCegarLoop]: 443 mSDtfsCounter, 1155 mSDsluCounter, 3710 mSDsCounter, 0 mSdLazyCounter, 5957 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 42.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1157 SdHoareTripleChecker+Valid, 4153 SdHoareTripleChecker+Invalid, 5976 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 5957 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 44.7s IncrementalHoareTripleChecker+Time [2024-11-14 03:26:07,514 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1157 Valid, 4153 Invalid, 5976 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [19 Valid, 5957 Invalid, 0 Unknown, 0 Unchecked, 44.7s Time] [2024-11-14 03:26:07,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1159 states. [2024-11-14 03:26:07,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1159 to 964. [2024-11-14 03:26:07,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 964 states, 652 states have (on average 1.5613496932515338) internal successors, (1018), 958 states have internal predecessors, (1018), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-14 03:26:07,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 964 states to 964 states and 1025 transitions. [2024-11-14 03:26:07,532 INFO L78 Accepts]: Start accepts. Automaton has 964 states and 1025 transitions. Word has length 122 [2024-11-14 03:26:07,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:26:07,532 INFO L471 AbstractCegarLoop]: Abstraction has 964 states and 1025 transitions. [2024-11-14 03:26:07,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 17 states have (on average 9.117647058823529) internal successors, (155), 20 states have internal predecessors, (155), 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-14 03:26:07,533 INFO L276 IsEmpty]: Start isEmpty. Operand 964 states and 1025 transitions. [2024-11-14 03:26:07,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-14 03:26:07,534 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:26:07,534 INFO L215 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:26:07,575 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Ended with exit code 0 [2024-11-14 03:26:07,746 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/mathsat -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)] Forceful destruction successful, exit code 0 [2024-11-14 03:26:07,952 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (42)] Ended with exit code 0 [2024-11-14 03:26:08,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 43 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,41 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,42 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt [2024-11-14 03:26:08,135 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr88REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-14 03:26:08,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:26:08,136 INFO L85 PathProgramCache]: Analyzing trace with hash -1696285452, now seen corresponding path program 1 times [2024-11-14 03:26:08,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:26:08,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1458703385] [2024-11-14 03:26:08,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:26:08,136 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-14 03:26:08,136 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:26:08,138 INFO L229 MonitoredProcess]: Starting monitored process 44 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/mathsat -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-14 03:26:08,140 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (44)] Waiting until timeout for monitored process [2024-11-14 03:26:09,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:26:09,430 INFO L255 TraceCheckSpWp]: Trace formula consists of 865 conjuncts, 63 conjuncts are in the unsatisfiable core [2024-11-14 03:26:09,443 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:26:09,463 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-14 03:26:10,427 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-14 03:26:10,428 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-14 03:26:10,546 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-14 03:26:10,974 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-14 03:26:14,656 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 03:26:14,657 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-14 03:26:15,061 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 03:26:15,062 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-14 03:26:15,409 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 03:26:15,409 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-14 03:26:15,506 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-14 03:26:15,666 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-14 03:26:15,666 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:26:16,125 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6576 (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_6576) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-14 03:26:16,187 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6576 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6575 (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~mem38#1.base| v_ArrVal_6575))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6576)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-14 03:26:16,233 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6576 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6575 (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_6575))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6576)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-14 03:26:17,367 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6576 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6622 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6575 (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~mem36#1.base| v_ArrVal_6622))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6575)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6576)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-14 03:26:17,375 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:26:17,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1458703385] [2024-11-14 03:26:17,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1458703385] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:26:17,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1963821680] [2024-11-14 03:26:17,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:26:17,376 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 03:26:17,376 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 03:26:17,378 INFO L229 MonitoredProcess]: Starting monitored process 45 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 03:26:17,382 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (45)] Waiting until timeout for monitored process [2024-11-14 03:26:44,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:26:44,428 INFO L255 TraceCheckSpWp]: Trace formula consists of 865 conjuncts, 65 conjuncts are in the unsatisfiable core [2024-11-14 03:26:44,437 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:26:44,462 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-14 03:26:45,327 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-14 03:26:45,328 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-14 03:26:45,407 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-14 03:26:45,667 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-14 03:26:49,023 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 03:26:49,024 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-14 03:26:49,289 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 03:26:49,289 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2024-11-14 03:26:49,552 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 03:26:49,552 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2024-11-14 03:26:49,689 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-14 03:26:49,729 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-14 03:26:49,729 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:26:50,032 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7061 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6576 (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~mem38#1.base| v_ArrVal_7061))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6576)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-14 03:26:50,065 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7061 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6576 (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| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7061))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6576)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (_ bv0 1))) is different from false [2024-11-14 03:26:51,144 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7108 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7061 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6576 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7108))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7061)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6576)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2024-11-14 03:26:51,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1963821680] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:26:51,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1528732235] [2024-11-14 03:26:51,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:26:51,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:26:51,154 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:26:51,156 INFO L229 MonitoredProcess]: Starting monitored process 46 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:26:51,157 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Waiting until timeout for monitored process [2024-11-14 03:26:52,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:26:52,144 INFO L255 TraceCheckSpWp]: Trace formula consists of 865 conjuncts, 61 conjuncts are in the unsatisfiable core [2024-11-14 03:26:52,153 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:26:52,165 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-14 03:26:52,948 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-14 03:26:52,948 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-14 03:26:53,089 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-14 03:26:55,611 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 03:26:55,612 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-14 03:26:56,152 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 03:26:56,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 44 treesize of output 43 [2024-11-14 03:26:56,603 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 03:26:56,604 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2024-11-14 03:26:56,674 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-14 03:26:56,687 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-14 03:26:56,687 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:26:56,985 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6576 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7546 (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~mem38#1.base| v_ArrVal_7546))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6576)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-14 03:26:57,019 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6576 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7546 (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_7546))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6576)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-14 03:26:58,199 INFO L349 Elim1Store]: treesize reduction 7, result has 87.3 percent of original size [2024-11-14 03:26:58,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 61 treesize of output 60 [2024-11-14 03:26:58,239 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7593 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6576 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7546 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_#t~mem36#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~mem36#1.base| v_ArrVal_7593))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7546)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6576)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) is different from false [2024-11-14 03:26:58,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1528732235] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:26:58,250 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:26:58,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 12] total 20 [2024-11-14 03:26:58,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615993523] [2024-11-14 03:26:58,250 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:26:58,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-14 03:26:58,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:26:58,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-14 03:26:58,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=425, Unknown=18, NotChecked=510, Total=1056 [2024-11-14 03:26:58,252 INFO L87 Difference]: Start difference. First operand 964 states and 1025 transitions. Second operand has 21 states, 18 states have (on average 5.666666666666667) internal successors, (102), 20 states have internal predecessors, (102), 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-14 03:27:30,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:27:30,236 INFO L93 Difference]: Finished difference Result 965 states and 1026 transitions. [2024-11-14 03:27:30,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-14 03:27:30,237 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 18 states have (on average 5.666666666666667) internal successors, (102), 20 states have internal predecessors, (102), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 125 [2024-11-14 03:27:30,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:27:30,239 INFO L225 Difference]: With dead ends: 965 [2024-11-14 03:27:30,239 INFO L226 Difference]: Without dead ends: 965 [2024-11-14 03:27:30,239 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 405 GetRequests, 366 SyntacticMatches, 5 SemanticMatches, 34 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=124, Invalid=547, Unknown=19, NotChecked=570, Total=1260 [2024-11-14 03:27:30,240 INFO L432 NwaCegarLoop]: 532 mSDtfsCounter, 506 mSDsluCounter, 5259 mSDsCounter, 0 mSdLazyCounter, 4685 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 29.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 509 SdHoareTripleChecker+Valid, 5791 SdHoareTripleChecker+Invalid, 4693 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 4685 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 31.4s IncrementalHoareTripleChecker+Time [2024-11-14 03:27:30,240 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [509 Valid, 5791 Invalid, 4693 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [8 Valid, 4685 Invalid, 0 Unknown, 0 Unchecked, 31.4s Time] [2024-11-14 03:27:30,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 965 states. [2024-11-14 03:27:30,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 965 to 963. [2024-11-14 03:27:30,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 963 states, 652 states have (on average 1.5598159509202454) internal successors, (1017), 957 states have internal predecessors, (1017), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-14 03:27:30,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 963 states to 963 states and 1024 transitions. [2024-11-14 03:27:30,256 INFO L78 Accepts]: Start accepts. Automaton has 963 states and 1024 transitions. Word has length 125 [2024-11-14 03:27:30,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:27:30,257 INFO L471 AbstractCegarLoop]: Abstraction has 963 states and 1024 transitions. [2024-11-14 03:27:30,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 18 states have (on average 5.666666666666667) internal successors, (102), 20 states have internal predecessors, (102), 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-14 03:27:30,257 INFO L276 IsEmpty]: Start isEmpty. Operand 963 states and 1024 transitions. [2024-11-14 03:27:30,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-14 03:27:30,258 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:27:30,258 INFO L215 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:27:30,301 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Ended with exit code 0 [2024-11-14 03:27:30,500 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (45)] Ended with exit code 0 [2024-11-14 03:27:30,670 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (44)] Forceful destruction successful, exit code 0 [2024-11-14 03:27:30,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,45 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt,44 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/mathsat -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-14 03:27:30,859 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr89REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-14 03:27:30,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:27:30,860 INFO L85 PathProgramCache]: Analyzing trace with hash -1696285451, now seen corresponding path program 1 times [2024-11-14 03:27:30,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:27:30,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [74606717] [2024-11-14 03:27:30,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:27:30,861 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 03:27:30,861 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:27:30,863 INFO L229 MonitoredProcess]: Starting monitored process 47 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/mathsat -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-14 03:27:30,864 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (47)] Waiting until timeout for monitored process [2024-11-14 03:27:32,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:27:32,218 INFO L255 TraceCheckSpWp]: Trace formula consists of 865 conjuncts, 116 conjuncts are in the unsatisfiable core [2024-11-14 03:27:32,229 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:27:32,239 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-14 03:27:32,933 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-14 03:27:32,933 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-14 03:27:32,957 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-14 03:27:33,041 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-14 03:27:33,056 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-14 03:27:33,442 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-14 03:27:33,456 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-14 03:27:36,256 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 03:27:36,256 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-14 03:27:36,295 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-14 03:27:36,658 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 03:27:36,658 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-14 03:27:36,673 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-14 03:27:37,015 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 03:27:37,015 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-14 03:27:37,030 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-14 03:27:37,119 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-14 03:27:37,132 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-14 03:27:37,258 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-14 03:27:37,258 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:27:37,655 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8080 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_8080) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd (_ bv12 32) .cse0)))) (forall ((v_ArrVal_8081 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8080 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv12 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_8080) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_8081) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-14 03:27:37,715 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_8080 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_8080) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd (_ bv12 32) .cse0)))) (forall ((v_ArrVal_8081 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8080 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv12 32) (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_8080) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_8081) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2024-11-14 03:27:37,808 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8078 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8081 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8080 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8079 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_8078))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_8079) .cse0 v_ArrVal_8080) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_8081) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_8078 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8080 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8079 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_8079) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_8078) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8080) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse3 (_ bv8 32)) (bvadd .cse3 (_ bv12 32))))))) is different from false [2024-11-14 03:27:37,876 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_8078 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8081 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8080 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8079 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_8078))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv12 32) (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_8079) .cse1 v_ArrVal_8080) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_8081) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_8078 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8080 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8079 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_8079) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_8078) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_8080) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse4) (bvadd (_ bv12 32) .cse4))))))) is different from false [2024-11-14 03:27:41,059 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8078 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8173 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8172 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8080 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8079 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_8173))) (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~mem36#1.base| v_ArrVal_8172) .cse1 v_ArrVal_8079) (select (select (store .cse2 .cse1 v_ArrVal_8078) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_8080))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd (_ bv12 32) .cse0)))) (forall ((v_ArrVal_8078 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8173 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8172 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8081 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8080 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8079 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_8173))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_8078))) (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~mem36#1.base| v_ArrVal_8172) .cse4 v_ArrVal_8079) .cse5 v_ArrVal_8080) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_8081) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) is different from false [2024-11-14 03:27:41,080 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:27:41,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [74606717] [2024-11-14 03:27:41,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [74606717] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:27:41,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [202331474] [2024-11-14 03:27:41,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:27:41,080 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 03:27:41,080 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 03:27:41,082 INFO L229 MonitoredProcess]: Starting monitored process 48 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 03:27:41,084 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (48)] Waiting until timeout for monitored process [2024-11-14 03:30:11,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:30:12,149 INFO L255 TraceCheckSpWp]: Trace formula consists of 865 conjuncts, 116 conjuncts are in the unsatisfiable core [2024-11-14 03:30:12,162 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:30:12,175 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-14 03:30:12,821 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-14 03:30:12,888 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-14 03:30:12,888 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-14 03:30:12,917 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-14 03:30:12,930 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-14 03:30:13,149 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-14 03:30:13,163 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-14 03:30:15,634 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 03:30:15,634 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-14 03:30:15,649 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-14 03:30:15,906 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 03:30:15,906 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-14 03:30:15,921 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-14 03:30:16,135 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 03:30:16,135 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-14 03:30:16,150 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-14 03:30:16,242 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-14 03:30:16,281 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-14 03:30:16,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-14 03:30:16,304 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:30:16,444 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8661 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8660 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv12 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_8660) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_8661) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_8660 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_8660) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv8 32) .cse1) (bvadd (_ bv12 32) .cse1)))))) is different from false [2024-11-14 03:30:16,503 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_8661 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8660 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv12 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_8660) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_8661) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_8660 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_8660) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse2) (bvadd (_ bv12 32) .cse2))))))) is different from false [2024-11-14 03:30:17,149 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_8660 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8659 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8658 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_8659) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_8658) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_8660) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_8661 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8660 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8659 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8658 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_8658))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_8659) .cse3 v_ArrVal_8660) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_8661) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false [2024-11-14 03:30:20,010 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8661 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8660 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8659 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8658 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8753 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8752 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_8752))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_8658))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv12 32) (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_8753) .cse0 v_ArrVal_8659) .cse1 v_ArrVal_8660) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_8661) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_8660 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8659 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8658 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8753 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8752 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_8752))) (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~mem36#1.base| v_ArrVal_8753) .cse6 v_ArrVal_8659) (select (select (store .cse7 .cse6 v_ArrVal_8658) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_8660))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse5) (bvadd (_ bv12 32) .cse5)))))) is different from false [2024-11-14 03:30:20,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [202331474] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:30:20,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1115747068] [2024-11-14 03:30:20,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:30:20,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:30:20,028 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:30:20,030 INFO L229 MonitoredProcess]: Starting monitored process 49 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:30:20,031 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Waiting until timeout for monitored process [2024-11-14 03:30:20,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:30:21,002 INFO L255 TraceCheckSpWp]: Trace formula consists of 865 conjuncts, 114 conjuncts are in the unsatisfiable core [2024-11-14 03:30:21,018 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:30:21,621 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-14 03:30:21,683 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-14 03:30:21,684 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-14 03:30:21,712 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-14 03:30:21,738 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-14 03:30:21,942 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-14 03:30:21,956 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-14 03:30:24,508 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 03:30:24,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-14 03:30:24,523 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-14 03:30:24,781 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 03:30:24,781 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-14 03:30:24,796 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-14 03:30:24,997 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 03:30:24,997 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-14 03:30:25,012 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-14 03:30:25,102 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-14 03:30:25,116 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-14 03:30:25,140 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-14 03:30:25,140 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:30:25,274 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9240 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9239 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_9239) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_9240) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_9239 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_9239) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd .cse1 (_ bv8 32)) (bvadd .cse1 (_ bv12 32))))))) is different from false [2024-11-14 03:30:25,334 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_9239 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_9239) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_9240 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9239 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_9239) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_9240) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2024-11-14 03:30:25,482 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9239 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9238 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9237 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_9237) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_9238) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9239) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd (_ bv12 32) .cse0)))) (forall ((v_ArrVal_9240 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9239 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9238 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9237 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_9238))) (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~mem38#1.base| v_ArrVal_9237) .cse2 v_ArrVal_9239) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_9240) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2024-11-14 03:30:25,553 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_9240 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9239 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9238 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9237 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_9238))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv12 32) (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_9237) .cse1 v_ArrVal_9239) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_9240) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_9239 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9238 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9237 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_9237) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_9238) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_9239) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse4) (bvadd (_ bv12 32) .cse4))))))) is different from false [2024-11-14 03:30:28,640 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9332 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9331 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9240 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9239 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9238 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9237 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_9331))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_9238))) (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~mem36#1.base| v_ArrVal_9332) .cse0 v_ArrVal_9237) .cse1 v_ArrVal_9239) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_9240) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_9332 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9331 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9239 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9238 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9237 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_9331))) (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~mem36#1.base| v_ArrVal_9332) .cse6 v_ArrVal_9237) (select (select (store .cse7 .cse6 v_ArrVal_9238) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_9239))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse5 (_ bv8 32)) (bvadd .cse5 (_ bv12 32))))))) is different from false [2024-11-14 03:30:28,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1115747068] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:30:28,659 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:30:28,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 10 [2024-11-14 03:30:28,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799444145] [2024-11-14 03:30:28,659 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:30:28,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-14 03:30:28,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:30:28,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-14 03:30:28,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=153, Unknown=22, NotChecked=518, Total=756 [2024-11-14 03:30:28,661 INFO L87 Difference]: Start difference. First operand 963 states and 1024 transitions. Second operand has 11 states, 9 states have (on average 9.444444444444445) internal successors, (85), 11 states have internal predecessors, (85), 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-14 03:30:56,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:30:56,843 INFO L93 Difference]: Finished difference Result 962 states and 1023 transitions. [2024-11-14 03:30:56,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-14 03:30:56,844 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 9.444444444444445) internal successors, (85), 11 states have internal predecessors, (85), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 125 [2024-11-14 03:30:56,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:30:56,847 INFO L225 Difference]: With dead ends: 962 [2024-11-14 03:30:56,847 INFO L226 Difference]: Without dead ends: 962 [2024-11-14 03:30:56,847 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 408 GetRequests, 371 SyntacticMatches, 5 SemanticMatches, 32 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=102, Invalid=310, Unknown=24, NotChecked=686, Total=1122 [2024-11-14 03:30:56,849 INFO L432 NwaCegarLoop]: 533 mSDtfsCounter, 514 mSDsluCounter, 2350 mSDsCounter, 0 mSdLazyCounter, 3769 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 516 SdHoareTripleChecker+Valid, 2883 SdHoareTripleChecker+Invalid, 3775 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 3769 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 27.2s IncrementalHoareTripleChecker+Time [2024-11-14 03:30:56,849 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [516 Valid, 2883 Invalid, 3775 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 3769 Invalid, 0 Unknown, 0 Unchecked, 27.2s Time] [2024-11-14 03:30:56,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 962 states. [2024-11-14 03:30:56,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 962 to 962. [2024-11-14 03:30:56,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 962 states, 652 states have (on average 1.5582822085889572) internal successors, (1016), 956 states have internal predecessors, (1016), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-14 03:30:56,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 962 states to 962 states and 1023 transitions. [2024-11-14 03:30:56,871 INFO L78 Accepts]: Start accepts. Automaton has 962 states and 1023 transitions. Word has length 125 [2024-11-14 03:30:56,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:30:56,872 INFO L471 AbstractCegarLoop]: Abstraction has 962 states and 1023 transitions. [2024-11-14 03:30:56,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 9.444444444444445) internal successors, (85), 11 states have internal predecessors, (85), 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-14 03:30:56,872 INFO L276 IsEmpty]: Start isEmpty. Operand 962 states and 1023 transitions. [2024-11-14 03:30:56,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-14 03:30:56,876 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:30:56,876 INFO L215 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:30:56,935 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (48)] Ended with exit code 0 [2024-11-14 03:30:57,110 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Ended with exit code 0 [2024-11-14 03:30:57,288 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (47)] Ended with exit code 0 [2024-11-14 03:30:57,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 48 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt,49 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,47 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/mathsat -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-14 03:30:57,477 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr92REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-14 03:30:57,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:30:57,478 INFO L85 PathProgramCache]: Analyzing trace with hash 545610083, now seen corresponding path program 1 times [2024-11-14 03:30:57,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:30:57,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1276860840] [2024-11-14 03:30:57,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:30:57,478 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-14 03:30:57,479 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:30:57,480 INFO L229 MonitoredProcess]: Starting monitored process 50 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/mathsat -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-14 03:30:57,482 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (50)] Waiting until timeout for monitored process [2024-11-14 03:30:58,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:30:58,709 INFO L255 TraceCheckSpWp]: Trace formula consists of 894 conjuncts, 65 conjuncts are in the unsatisfiable core [2024-11-14 03:30:58,717 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:30:58,727 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-14 03:30:59,422 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-14 03:30:59,422 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-14 03:30:59,557 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-14 03:30:59,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 24 treesize of output 12 [2024-11-14 03:31:02,949 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 03:31:02,949 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-14 03:31:03,311 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 03:31:03,312 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-14 03:31:03,619 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 03:31:03,619 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-14 03:31:03,938 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 03:31:03,938 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2024-11-14 03:31:04,018 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-14 03:31:04,161 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-14 03:31:04,161 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:31:04,378 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9788 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_9788) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (_ bv1 1)))) is different from false [2024-11-14 03:31:04,404 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9788 (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_9788) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-14 03:31:04,445 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9788 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9787 (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~mem39#1.base| v_ArrVal_9787))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9788)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-14 03:31:04,474 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9788 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9787 (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_9787))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9788)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-14 03:31:04,518 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9788 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9787 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9786 (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~mem38#1.base| v_ArrVal_9786))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9787)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9788)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-14 03:31:04,570 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9788 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9787 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9786 (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_9786))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9787)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9788)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-14 03:31:05,499 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9834 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9788 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9787 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9786 (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~mem36#1.base| v_ArrVal_9834))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9786)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9787)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9788)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-14 03:31:05,509 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:31:05,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1276860840] [2024-11-14 03:31:05,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1276860840] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:31:05,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [423498216] [2024-11-14 03:31:05,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:31:05,509 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 03:31:05,509 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 03:31:05,511 INFO L229 MonitoredProcess]: Starting monitored process 51 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 03:31:05,513 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (51)] Waiting until timeout for monitored process [2024-11-14 03:31:54,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:31:54,205 INFO L255 TraceCheckSpWp]: Trace formula consists of 894 conjuncts, 67 conjuncts are in the unsatisfiable core [2024-11-14 03:31:54,211 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:31:54,226 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-14 03:31:54,844 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-14 03:31:54,845 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-14 03:31:54,899 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-14 03:31:55,078 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-14 03:31:57,667 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 03:31:57,667 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-14 03:31:57,878 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 03:31:57,878 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-14 03:31:58,060 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 03:31:58,061 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2024-11-14 03:31:58,243 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 03:31:58,244 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-14 03:31:58,323 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-14 03:31:58,354 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-14 03:31:58,354 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:31:58,406 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10290 (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~mem40#1.base| v_ArrVal_10290) |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-14 03:31:58,431 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10290 (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_10290) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-14 03:31:58,471 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10289 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10290 (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~mem39#1.base| v_ArrVal_10289))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10290)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-14 03:31:58,499 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10289 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10290 (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_10289))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10290)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-14 03:31:58,542 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10289 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10288 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10290 (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~mem38#1.base| v_ArrVal_10288))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10289)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10290)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-14 03:31:58,574 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10289 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10288 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10290 (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_10288))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10289)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10290)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-14 03:31:59,529 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10289 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10288 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10336 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10290 (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~mem36#1.base| v_ArrVal_10336))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10288)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10289)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10290)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-14 03:31:59,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [423498216] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:31:59,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [735038413] [2024-11-14 03:31:59,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:31:59,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:31:59,541 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:31:59,543 INFO L229 MonitoredProcess]: Starting monitored process 52 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:31:59,546 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Waiting until timeout for monitored process [2024-11-14 03:32:00,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:32:00,500 INFO L255 TraceCheckSpWp]: Trace formula consists of 894 conjuncts, 62 conjuncts are in the unsatisfiable core [2024-11-14 03:32:00,508 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:32:01,055 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-14 03:32:01,055 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-14 03:32:01,171 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-14 03:32:02,477 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 03:32:02,477 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-14 03:32:02,724 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 03:32:02,724 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-14 03:32:02,991 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 03:32:02,992 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-14 03:32:03,306 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 03:32:03,306 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-14 03:32:03,517 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-14 03:32:03,532 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-14 03:32:03,532 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:32:03,624 INFO L349 Elim1Store]: treesize reduction 7, result has 63.2 percent of original size [2024-11-14 03:32:03,624 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-14 03:32:03,645 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10790 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_10790) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)) |c_ULTIMATE.start_main_#t~mem40#1.base|)) is different from false [2024-11-14 03:32:03,672 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10790 (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_10790) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) is different from false [2024-11-14 03:32:03,718 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10790 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10789 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_10789)) (.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_10790) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) .cse1)))) is different from false [2024-11-14 03:32:03,757 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10790 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10789 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_10789))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= (select (select (store .cse0 .cse1 v_ArrVal_10790) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) .cse1))))) is different from false [2024-11-14 03:32:03,810 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10790 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10788 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10789 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_10788))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_10789)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_10790) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) is different from false [2024-11-14 03:32:03,848 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10790 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10788 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10789 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (let ((.cse3 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_10788))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_10789)))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= (select (select (store .cse0 .cse1 v_ArrVal_10790) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) .cse1))))) is different from false [2024-11-14 03:32:04,835 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10790 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10788 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10789 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10836 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (let ((.cse3 (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_10836))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_10788)))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_10789)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_10790) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) is different from false [2024-11-14 03:32:04,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [735038413] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:32:04,842 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:32:04,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 12] total 21 [2024-11-14 03:32:04,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749002502] [2024-11-14 03:32:04,842 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:32:04,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-14 03:32:04,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:32:04,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-14 03:32:04,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=442, Unknown=21, NotChecked=1302, Total=1892 [2024-11-14 03:32:04,844 INFO L87 Difference]: Start difference. First operand 962 states and 1023 transitions. Second operand has 22 states, 19 states have (on average 5.894736842105263) internal successors, (112), 22 states have internal predecessors, (112), 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-14 03:32:22,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:32:22,501 INFO L93 Difference]: Finished difference Result 963 states and 1024 transitions. [2024-11-14 03:32:22,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-14 03:32:22,501 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 5.894736842105263) internal successors, (112), 22 states have internal predecessors, (112), 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 128 [2024-11-14 03:32:22,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:32:22,503 INFO L225 Difference]: With dead ends: 963 [2024-11-14 03:32:22,503 INFO L226 Difference]: Without dead ends: 963 [2024-11-14 03:32:22,503 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 421 GetRequests, 375 SyntacticMatches, 3 SemanticMatches, 43 ConstructedPredicates, 21 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=136, Invalid=479, Unknown=21, NotChecked=1344, Total=1980 [2024-11-14 03:32:22,504 INFO L432 NwaCegarLoop]: 533 mSDtfsCounter, 501 mSDsluCounter, 3154 mSDsCounter, 0 mSdLazyCounter, 2821 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 504 SdHoareTripleChecker+Valid, 3687 SdHoareTripleChecker+Invalid, 2829 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 2821 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.4s IncrementalHoareTripleChecker+Time [2024-11-14 03:32:22,504 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [504 Valid, 3687 Invalid, 2829 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 2821 Invalid, 0 Unknown, 0 Unchecked, 17.4s Time] [2024-11-14 03:32:22,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2024-11-14 03:32:22,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 961. [2024-11-14 03:32:22,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 961 states, 652 states have (on average 1.5567484662576687) internal successors, (1015), 955 states have internal predecessors, (1015), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-14 03:32:22,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 961 states to 961 states and 1022 transitions. [2024-11-14 03:32:22,515 INFO L78 Accepts]: Start accepts. Automaton has 961 states and 1022 transitions. Word has length 128 [2024-11-14 03:32:22,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:32:22,516 INFO L471 AbstractCegarLoop]: Abstraction has 961 states and 1022 transitions. [2024-11-14 03:32:22,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 5.894736842105263) internal successors, (112), 22 states have internal predecessors, (112), 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-14 03:32:22,516 INFO L276 IsEmpty]: Start isEmpty. Operand 961 states and 1022 transitions. [2024-11-14 03:32:22,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-14 03:32:22,517 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:32:22,517 INFO L215 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:32:22,533 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (50)] Forceful destruction successful, exit code 0 [2024-11-14 03:32:22,755 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (51)] Ended with exit code 0 [2024-11-14 03:32:22,944 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Forceful destruction successful, exit code 0 [2024-11-14 03:32:23,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 50 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,51 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt,52 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:32:23,118 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr93REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-14 03:32:23,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:32:23,118 INFO L85 PathProgramCache]: Analyzing trace with hash 545610084, now seen corresponding path program 1 times [2024-11-14 03:32:23,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:32:23,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [906101355] [2024-11-14 03:32:23,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:32:23,119 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-14 03:32:23,119 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:32:23,121 INFO L229 MonitoredProcess]: Starting monitored process 53 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/mathsat -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-14 03:32:23,123 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (53)] Waiting until timeout for monitored process [2024-11-14 03:32:24,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:32:24,378 INFO L255 TraceCheckSpWp]: Trace formula consists of 894 conjuncts, 119 conjuncts are in the unsatisfiable core [2024-11-14 03:32:24,390 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:32:24,400 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-14 03:32:24,992 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-14 03:32:24,992 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-14 03:32:25,013 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-14 03:32:25,084 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-14 03:32:25,107 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-14 03:32:25,445 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-14 03:32:25,456 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-14 03:32:27,698 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 03:32:27,698 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-14 03:32:27,712 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-14 03:32:28,048 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 03:32:28,048 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-14 03:32:28,061 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-14 03:32:28,372 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 03:32:28,372 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-14 03:32:28,384 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-14 03:32:28,689 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 03:32:28,689 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-14 03:32:28,701 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-14 03:32:28,790 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-14 03:32:28,802 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-14 03:32:28,910 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-14 03:32:28,910 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:32:29,293 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_11340 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_11340) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv20 32) .cse0) (bvadd (_ bv24 32) .cse0)))) (forall ((v_ArrVal_11341 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11340 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv24 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_11340) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_11341) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-14 03:32:29,345 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_11341 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11340 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv24 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_11340) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_11341) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_11340 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_11340) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv20 32) .cse2) (bvadd (_ bv24 32) .cse2))))))) is different from false [2024-11-14 03:32:29,462 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_11341 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11340 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11338 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11339 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_11339))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv24 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_11338) .cse0 v_ArrVal_11340) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_11341) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_11340 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11338 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11339 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_11338) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_11339) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_11340) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv20 32) .cse3) (bvadd (_ bv24 32) .cse3)))))) is different from false [2024-11-14 03:32:29,585 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_11341 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11340 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11338 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11339 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_11339))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv24 32) (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_11338) .cse1 v_ArrVal_11340) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_11341) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_11340 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11338 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11339 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_11338) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_11339) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_11340) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv20 32) .cse4) (bvadd (_ bv24 32) .cse4))))))) is different from false [2024-11-14 03:32:29,974 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_11340 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11338 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11339 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11336 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11337 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_11337))) (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~mem38#1.base| v_ArrVal_11336) .cse1 v_ArrVal_11338) (select (select (store .cse2 .cse1 v_ArrVal_11339) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_11340))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv20 32) .cse0) (bvadd (_ bv24 32) .cse0)))) (forall ((v_ArrVal_11341 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11340 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11338 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11339 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11336 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11337 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_11337))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_11339))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv24 32) (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_11336) .cse4 v_ArrVal_11338) .cse5 v_ArrVal_11340) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_11341) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) is different from false [2024-11-14 03:32:30,263 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (and (forall ((v_ArrVal_11341 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11340 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11338 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11339 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11336 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11337 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_11337))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_11339))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv24 32) (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_11336) .cse1 v_ArrVal_11338) .cse2 v_ArrVal_11340) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_11341) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))) (forall ((v_ArrVal_11340 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11338 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11339 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11336 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11337 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (select (select (let ((.cse8 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_11337))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_11336) .cse7 v_ArrVal_11338) (select (select (store .cse8 .cse7 v_ArrVal_11339) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_11340))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv20 32) .cse6) (bvadd (_ bv24 32) .cse6))))))) is different from false [2024-11-14 03:32:34,246 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_11341 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11340 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11433 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11432 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11338 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11339 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11336 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11337 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_11433))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_11337))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_11339))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv24 32) (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_11432) .cse0 v_ArrVal_11336) .cse1 v_ArrVal_11338) .cse2 v_ArrVal_11340) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_11341) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) (forall ((v_ArrVal_11340 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11433 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11432 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11338 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11339 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11336 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11337 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (select (select (let ((.cse11 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_11433))) (let ((.cse8 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse10 (store .cse11 .cse8 v_ArrVal_11337))) (let ((.cse9 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_11432) .cse8 v_ArrVal_11336) .cse9 v_ArrVal_11338) (select (select (store .cse10 .cse9 v_ArrVal_11339) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_11340))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv20 32) .cse7) (bvadd (_ bv24 32) .cse7)))))) is different from false [2024-11-14 03:32:34,274 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:32:34,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [906101355] [2024-11-14 03:32:34,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [906101355] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:32:34,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1663366650] [2024-11-14 03:32:34,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:32:34,274 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 03:32:34,274 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 03:32:34,276 INFO L229 MonitoredProcess]: Starting monitored process 54 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 03:32:34,277 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33e2e618-a9f2-4800-96c4-1c080320f338/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (54)] Waiting until timeout for monitored process