./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_nondet_test1-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_58318249-dc9e-4836-b971-3f943cb7309f/bin/utaipan-verify-sOmjnqqW8E/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/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_58318249-dc9e-4836-b971-3f943cb7309f/bin/utaipan-verify-sOmjnqqW8E/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/bin/utaipan-verify-sOmjnqqW8E/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_nondet_test1-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/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_58318249-dc9e-4836-b971-3f943cb7309f/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 112ef0f8366461020cac5f2ac7dec2d7e41f31b24e653cd7734885d2bb23b087 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-14 05:01:17,514 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-14 05:01:17,606 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2024-11-14 05:01:17,611 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-14 05:01:17,612 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-14 05:01:17,636 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-14 05:01:17,637 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-14 05:01:17,637 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-14 05:01:17,638 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-14 05:01:17,638 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-14 05:01:17,638 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-14 05:01:17,638 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-14 05:01:17,638 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-14 05:01:17,638 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-14 05:01:17,639 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-14 05:01:17,639 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-14 05:01:17,639 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-14 05:01:17,639 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-14 05:01:17,639 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-14 05:01:17,640 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-14 05:01:17,640 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-14 05:01:17,640 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-14 05:01:17,640 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-14 05:01:17,640 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-14 05:01:17,641 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-14 05:01:17,641 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-14 05:01:17,641 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-14 05:01:17,641 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-14 05:01:17,641 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-14 05:01:17,641 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-14 05:01:17,642 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-14 05:01:17,642 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-14 05:01:17,642 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-14 05:01:17,642 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-14 05:01:17,642 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-14 05:01:17,642 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-14 05:01:17,642 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-14 05:01:17,642 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-14 05:01:17,642 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-14 05:01:17,642 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-14 05:01:17,643 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-14 05:01:17,643 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 05:01:17,643 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-14 05:01:17,643 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-14 05:01:17,643 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-14 05:01:17,643 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-14 05:01:17,643 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-14 05:01:17,643 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-14 05:01:17,643 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-14 05:01:17,643 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_58318249-dc9e-4836-b971-3f943cb7309f/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 -> 112ef0f8366461020cac5f2ac7dec2d7e41f31b24e653cd7734885d2bb23b087 [2024-11-14 05:01:17,997 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-14 05:01:18,010 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-14 05:01:18,013 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-14 05:01:18,015 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-14 05:01:18,015 INFO L274 PluginConnector]: CDTParser initialized [2024-11-14 05:01:18,018 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/bin/utaipan-verify-sOmjnqqW8E/../../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_nondet_test1-2.i Unable to find full path for "g++" [2024-11-14 05:01:20,289 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-14 05:01:20,755 INFO L384 CDTParser]: Found 1 translation units. [2024-11-14 05:01:20,756 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_nondet_test1-2.i [2024-11-14 05:01:20,774 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/bin/utaipan-verify-sOmjnqqW8E/data/280fb4b43/509c2ff9087d4e5c976914c20b31b8d0/FLAG8b717ba93 [2024-11-14 05:01:20,792 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/bin/utaipan-verify-sOmjnqqW8E/data/280fb4b43/509c2ff9087d4e5c976914c20b31b8d0 [2024-11-14 05:01:20,795 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-14 05:01:20,797 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-14 05:01:20,799 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-14 05:01:20,799 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-14 05:01:20,805 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-14 05:01:20,806 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:01:20" (1/1) ... [2024-11-14 05:01:20,809 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59cf0ba1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:01:20, skipping insertion in model container [2024-11-14 05:01:20,810 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:01:20" (1/1) ... [2024-11-14 05:01:20,879 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-14 05:01:21,337 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 05:01:21,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 05:01:21,382 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 05:01:21,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 05:01:21,396 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 05:01:21,413 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 05:01:21,415 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 05:01:21,419 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 05:01:21,421 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 05:01:21,422 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 05:01:21,423 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 05:01:21,430 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 05:01:21,436 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 05:01:21,454 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 05:01:21,456 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@7fb016a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:01:21, skipping insertion in model container [2024-11-14 05:01:21,457 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-14 05:01:21,457 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-14 05:01:21,460 INFO L158 Benchmark]: Toolchain (without parser) took 662.02ms. Allocated memory is still 117.4MB. Free memory was 90.8MB in the beginning and 73.4MB in the end (delta: 17.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-14 05:01:21,464 INFO L158 Benchmark]: CDTParser took 1.06ms. Allocated memory is still 117.4MB. Free memory is still 72.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-14 05:01:21,465 INFO L158 Benchmark]: CACSL2BoogieTranslator took 658.85ms. Allocated memory is still 117.4MB. Free memory was 90.6MB in the beginning and 73.4MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-14 05:01:21,466 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.06ms. Allocated memory is still 117.4MB. Free memory is still 72.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 658.85ms. Allocated memory is still 117.4MB. Free memory was 90.6MB in the beginning and 73.4MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 753]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/bin/utaipan-verify-sOmjnqqW8E/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/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_58318249-dc9e-4836-b971-3f943cb7309f/bin/utaipan-verify-sOmjnqqW8E/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/bin/utaipan-verify-sOmjnqqW8E/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_nondet_test1-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/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_58318249-dc9e-4836-b971-3f943cb7309f/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 112ef0f8366461020cac5f2ac7dec2d7e41f31b24e653cd7734885d2bb23b087 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-14 05:01:24,348 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-14 05:01:24,485 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2024-11-14 05:01:24,490 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-14 05:01:24,491 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-14 05:01:24,537 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-14 05:01:24,538 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-14 05:01:24,538 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-14 05:01:24,539 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-14 05:01:24,540 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-14 05:01:24,540 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-14 05:01:24,540 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-14 05:01:24,540 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-14 05:01:24,541 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-14 05:01:24,541 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-14 05:01:24,541 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-14 05:01:24,542 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-14 05:01:24,542 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-14 05:01:24,542 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-14 05:01:24,542 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-14 05:01:24,542 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-14 05:01:24,542 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-14 05:01:24,542 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-14 05:01:24,543 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-14 05:01:24,543 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-14 05:01:24,543 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-14 05:01:24,543 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-14 05:01:24,543 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-14 05:01:24,543 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-14 05:01:24,543 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-14 05:01:24,543 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-14 05:01:24,543 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-14 05:01:24,543 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-14 05:01:24,543 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-14 05:01:24,543 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-14 05:01:24,544 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-14 05:01:24,544 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-14 05:01:24,544 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-14 05:01:24,544 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 05:01:24,544 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-14 05:01:24,544 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-14 05:01:24,544 INFO L153 SettingsManager]: * Trace refinement strategy=WALRUS [2024-11-14 05:01:24,544 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-14 05:01:24,544 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-14 05:01:24,544 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-14 05:01:24,544 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_58318249-dc9e-4836-b971-3f943cb7309f/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 -> 112ef0f8366461020cac5f2ac7dec2d7e41f31b24e653cd7734885d2bb23b087 [2024-11-14 05:01:24,918 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-14 05:01:24,928 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-14 05:01:24,932 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-14 05:01:24,936 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-14 05:01:24,936 INFO L274 PluginConnector]: CDTParser initialized [2024-11-14 05:01:24,940 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/bin/utaipan-verify-sOmjnqqW8E/../../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_nondet_test1-2.i Unable to find full path for "g++" [2024-11-14 05:01:27,105 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-14 05:01:27,616 INFO L384 CDTParser]: Found 1 translation units. [2024-11-14 05:01:27,617 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_nondet_test1-2.i [2024-11-14 05:01:27,647 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/bin/utaipan-verify-sOmjnqqW8E/data/42d479c0e/9d4a5631a99745a7932ed988a29d5cb3/FLAG05cf72ae5 [2024-11-14 05:01:27,674 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/bin/utaipan-verify-sOmjnqqW8E/data/42d479c0e/9d4a5631a99745a7932ed988a29d5cb3 [2024-11-14 05:01:27,677 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-14 05:01:27,681 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-14 05:01:27,684 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-14 05:01:27,686 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-14 05:01:27,691 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-14 05:01:27,694 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:01:27" (1/1) ... [2024-11-14 05:01:27,695 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42bb6595 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:01:27, skipping insertion in model container [2024-11-14 05:01:27,696 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:01:27" (1/1) ... [2024-11-14 05:01:27,765 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-14 05:01:28,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 05:01:28,370 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 05:01:28,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 05:01:28,382 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 05:01:28,392 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 05:01:28,416 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 05:01:28,417 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 05:01:28,421 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 05:01:28,423 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 05:01:28,425 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 05:01:28,426 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 05:01:28,432 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 05:01:28,437 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 05:01:28,453 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-14 05:01:28,467 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-14 05:01:28,520 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 05:01:28,549 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 05:01:28,552 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 05:01:28,556 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 05:01:28,563 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 05:01:28,576 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 05:01:28,577 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 05:01:28,580 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 05:01:28,581 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 05:01:28,583 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 05:01:28,583 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 05:01:28,588 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 05:01:28,591 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 05:01:28,601 INFO L200 MainTranslator]: Completed pre-run [2024-11-14 05:01:28,704 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 05:01:28,761 INFO L204 MainTranslator]: Completed translation [2024-11-14 05:01:28,762 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:01:28 WrapperNode [2024-11-14 05:01:28,762 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-14 05:01:28,763 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-14 05:01:28,764 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-14 05:01:28,764 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-14 05:01:28,772 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:01:28" (1/1) ... [2024-11-14 05:01:28,807 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:01:28" (1/1) ... [2024-11-14 05:01:28,855 INFO L138 Inliner]: procedures = 179, calls = 221, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 739 [2024-11-14 05:01:28,856 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-14 05:01:28,856 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-14 05:01:28,857 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-14 05:01:28,857 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-14 05:01:28,866 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:01:28" (1/1) ... [2024-11-14 05:01:28,866 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:01:28" (1/1) ... [2024-11-14 05:01:28,876 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:01:28" (1/1) ... [2024-11-14 05:01:28,877 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:01:28" (1/1) ... [2024-11-14 05:01:28,956 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:01:28" (1/1) ... [2024-11-14 05:01:28,969 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:01:28" (1/1) ... [2024-11-14 05:01:28,977 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:01:28" (1/1) ... [2024-11-14 05:01:28,984 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:01:28" (1/1) ... [2024-11-14 05:01:28,994 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-14 05:01:28,999 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-14 05:01:29,000 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-14 05:01:29,000 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-14 05:01:29,001 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:01:28" (1/1) ... [2024-11-14 05:01:29,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 05:01:29,052 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:01:29,068 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-14 05:01:29,071 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-14 05:01:29,108 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2024-11-14 05:01:29,108 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2024-11-14 05:01:29,108 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2024-11-14 05:01:29,110 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2024-11-14 05:01:29,110 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-14 05:01:29,110 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-14 05:01:29,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-14 05:01:29,111 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-11-14 05:01:29,111 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-14 05:01:29,111 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2024-11-14 05:01:29,111 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2024-11-14 05:01:29,112 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-14 05:01:29,115 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-14 05:01:29,419 INFO L238 CfgBuilder]: Building ICFG [2024-11-14 05:01:29,421 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-14 05:01:29,430 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-14 05:01:34,045 INFO L? ?]: Removed 890 outVars from TransFormulas that were not future-live. [2024-11-14 05:01:34,045 INFO L287 CfgBuilder]: Performing block encoding [2024-11-14 05:01:34,099 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-14 05:01:34,099 INFO L316 CfgBuilder]: Removed 40 assume(true) statements. [2024-11-14 05:01:34,099 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:01:34 BoogieIcfgContainer [2024-11-14 05:01:34,099 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-14 05:01:34,106 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-14 05:01:34,107 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-14 05:01:34,115 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-14 05:01:34,116 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 05:01:27" (1/3) ... [2024-11-14 05:01:34,116 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43ac3d8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:01:34, skipping insertion in model container [2024-11-14 05:01:34,116 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:01:28" (2/3) ... [2024-11-14 05:01:34,117 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43ac3d8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:01:34, skipping insertion in model container [2024-11-14 05:01:34,117 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:01:34" (3/3) ... [2024-11-14 05:01:34,118 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_SAX_nondet_test1-2.i [2024-11-14 05:01:34,138 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-14 05:01:34,140 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_SAX_nondet_test1-2.i that has 2 procedures, 836 locations, 1 initial locations, 24 loop locations, and 425 error locations. [2024-11-14 05:01:34,233 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-14 05:01:34,255 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;@4bda11de, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-14 05:01:34,255 INFO L334 AbstractCegarLoop]: Starting to check reachability of 425 error locations. [2024-11-14 05:01:34,264 INFO L276 IsEmpty]: Start isEmpty. Operand has 836 states, 409 states have (on average 2.234718826405868) internal successors, (914), 831 states have internal predecessors, (914), 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 05:01:34,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-14 05:01:34,271 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:01:34,271 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-14 05:01:34,272 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-14 05:01:34,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:01:34,278 INFO L85 PathProgramCache]: Analyzing trace with hash 37287509, now seen corresponding path program 1 times [2024-11-14 05:01:34,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:01:34,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1901645687] [2024-11-14 05:01:34,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:01:34,288 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 05:01:34,288 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:01:34,291 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/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 05:01:34,296 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/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 05:01:34,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:01:34,479 INFO L255 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-14 05:01:34,485 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:01:34,501 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 05:01:34,501 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:01:34,502 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:01:34,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1901645687] [2024-11-14 05:01:34,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1901645687] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:01:34,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:01:34,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 05:01:34,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723664121] [2024-11-14 05:01:34,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:01:34,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-14 05:01:34,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:01:34,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-14 05:01:34,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-14 05:01:34,553 INFO L87 Difference]: Start difference. First operand has 836 states, 409 states have (on average 2.234718826405868) internal successors, (914), 831 states have internal predecessors, (914), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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 05:01:34,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:01:34,648 INFO L93 Difference]: Finished difference Result 826 states and 864 transitions. [2024-11-14 05:01:34,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 05:01:34,651 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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 5 [2024-11-14 05:01:34,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:01:34,667 INFO L225 Difference]: With dead ends: 826 [2024-11-14 05:01:34,667 INFO L226 Difference]: Without dead ends: 824 [2024-11-14 05:01:34,669 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-14 05:01:34,673 INFO L432 NwaCegarLoop]: 864 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 864 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-14 05:01:34,674 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 864 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-14 05:01:34,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 824 states. [2024-11-14 05:01:34,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 824 to 824. [2024-11-14 05:01:34,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 824 states, 403 states have (on average 2.1240694789081886) internal successors, (856), 819 states have internal predecessors, (856), 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 05:01:34,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 824 states to 824 states and 862 transitions. [2024-11-14 05:01:34,810 INFO L78 Accepts]: Start accepts. Automaton has 824 states and 862 transitions. Word has length 5 [2024-11-14 05:01:34,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:01:34,811 INFO L471 AbstractCegarLoop]: Abstraction has 824 states and 862 transitions. [2024-11-14 05:01:34,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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 05:01:34,811 INFO L276 IsEmpty]: Start isEmpty. Operand 824 states and 862 transitions. [2024-11-14 05:01:34,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-14 05:01:34,812 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:01:34,812 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-14 05:01:34,816 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/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)] Forceful destruction successful, exit code 0 [2024-11-14 05:01:35,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/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 05:01:35,015 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-14 05:01:35,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:01:35,016 INFO L85 PathProgramCache]: Analyzing trace with hash 37287571, now seen corresponding path program 1 times [2024-11-14 05:01:35,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:01:35,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1697900179] [2024-11-14 05:01:35,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:01:35,016 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:01:35,016 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:01:35,021 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/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 05:01:35,024 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/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 05:01:35,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:01:35,168 INFO L255 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-14 05:01:35,170 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:01:35,207 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 05:01:35,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 05:01:35,233 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:01:35,233 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:01:35,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1697900179] [2024-11-14 05:01:35,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1697900179] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:01:35,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:01:35,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 05:01:35,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50671713] [2024-11-14 05:01:35,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:01:35,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 05:01:35,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:01:35,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 05:01:35,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 05:01:35,239 INFO L87 Difference]: Start difference. First operand 824 states and 862 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 05:01:37,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:01:37,268 INFO L93 Difference]: Finished difference Result 777 states and 816 transitions. [2024-11-14 05:01:37,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 05:01:37,269 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 5 [2024-11-14 05:01:37,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:01:37,273 INFO L225 Difference]: With dead ends: 777 [2024-11-14 05:01:37,273 INFO L226 Difference]: Without dead ends: 777 [2024-11-14 05:01:37,274 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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 05:01:37,275 INFO L432 NwaCegarLoop]: 504 mSDtfsCounter, 516 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 487 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 519 SdHoareTripleChecker+Valid, 618 SdHoareTripleChecker+Invalid, 540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 487 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-14 05:01:37,275 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [519 Valid, 618 Invalid, 540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 487 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-14 05:01:37,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 777 states. [2024-11-14 05:01:37,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 777 to 775. [2024-11-14 05:01:37,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 775 states, 403 states have (on average 2.002481389578164) internal successors, (807), 770 states have internal predecessors, (807), 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 05:01:37,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 813 transitions. [2024-11-14 05:01:37,301 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 813 transitions. Word has length 5 [2024-11-14 05:01:37,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:01:37,302 INFO L471 AbstractCegarLoop]: Abstraction has 775 states and 813 transitions. [2024-11-14 05:01:37,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 05:01:37,302 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 813 transitions. [2024-11-14 05:01:37,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-14 05:01:37,303 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:01:37,303 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-14 05:01:37,311 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/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 05:01:37,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/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 05:01:37,504 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-14 05:01:37,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:01:37,504 INFO L85 PathProgramCache]: Analyzing trace with hash 37287572, now seen corresponding path program 1 times [2024-11-14 05:01:37,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:01:37,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [194673529] [2024-11-14 05:01:37,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:01:37,505 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 05:01:37,505 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:01:37,508 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/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 05:01:37,510 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/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 05:01:37,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:01:37,604 INFO L255 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-14 05:01:37,606 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:01:37,624 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 05:01:37,658 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 05:01:37,659 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:01:37,659 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:01:37,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [194673529] [2024-11-14 05:01:37,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [194673529] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:01:37,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:01:37,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 05:01:37,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440879682] [2024-11-14 05:01:37,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:01:37,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 05:01:37,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:01:37,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 05:01:37,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 05:01:37,660 INFO L87 Difference]: Start difference. First operand 775 states and 813 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 05:01:39,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:01:39,932 INFO L93 Difference]: Finished difference Result 849 states and 891 transitions. [2024-11-14 05:01:39,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 05:01:39,934 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 5 [2024-11-14 05:01:39,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:01:39,941 INFO L225 Difference]: With dead ends: 849 [2024-11-14 05:01:39,941 INFO L226 Difference]: Without dead ends: 849 [2024-11-14 05:01:39,941 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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 05:01:39,942 INFO L432 NwaCegarLoop]: 683 mSDtfsCounter, 267 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 461 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 964 SdHoareTripleChecker+Invalid, 475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 461 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-14 05:01:39,942 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 964 Invalid, 475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 461 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-14 05:01:39,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 849 states. [2024-11-14 05:01:39,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 849 to 801. [2024-11-14 05:01:39,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 801 states, 440 states have (on average 1.9772727272727273) internal successors, (870), 796 states have internal predecessors, (870), 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 05:01:39,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 876 transitions. [2024-11-14 05:01:39,968 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 876 transitions. Word has length 5 [2024-11-14 05:01:39,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:01:39,969 INFO L471 AbstractCegarLoop]: Abstraction has 801 states and 876 transitions. [2024-11-14 05:01:39,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 05:01:39,969 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 876 transitions. [2024-11-14 05:01:39,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-14 05:01:39,970 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:01:39,970 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-14 05:01:39,973 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/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)] Ended with exit code 0 [2024-11-14 05:01:40,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/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 05:01:40,171 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr314REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-14 05:01:40,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:01:40,171 INFO L85 PathProgramCache]: Analyzing trace with hash 1156715246, now seen corresponding path program 1 times [2024-11-14 05:01:40,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:01:40,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1424064813] [2024-11-14 05:01:40,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:01:40,172 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 05:01:40,172 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:01:40,176 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/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 05:01:40,178 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/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 05:01:40,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:01:40,272 INFO L255 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-14 05:01:40,273 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:01:40,285 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 05:01:40,285 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:01:40,286 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:01:40,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1424064813] [2024-11-14 05:01:40,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1424064813] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:01:40,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:01:40,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 05:01:40,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176281232] [2024-11-14 05:01:40,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:01:40,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 05:01:40,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:01:40,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 05:01:40,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 05:01:40,288 INFO L87 Difference]: Start difference. First operand 801 states and 876 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:01:40,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:01:40,357 INFO L93 Difference]: Finished difference Result 1378 states and 1516 transitions. [2024-11-14 05:01:40,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 05:01:40,360 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-14 05:01:40,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:01:40,366 INFO L225 Difference]: With dead ends: 1378 [2024-11-14 05:01:40,366 INFO L226 Difference]: Without dead ends: 1378 [2024-11-14 05:01:40,366 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 05:01:40,367 INFO L432 NwaCegarLoop]: 799 mSDtfsCounter, 559 mSDsluCounter, 797 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 562 SdHoareTripleChecker+Valid, 1596 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-14 05:01:40,368 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [562 Valid, 1596 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-14 05:01:40,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1378 states. [2024-11-14 05:01:40,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1378 to 802. [2024-11-14 05:01:40,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 802 states, 441 states have (on average 1.9750566893424035) internal successors, (871), 797 states have internal predecessors, (871), 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 05:01:40,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 802 states to 802 states and 877 transitions. [2024-11-14 05:01:40,398 INFO L78 Accepts]: Start accepts. Automaton has 802 states and 877 transitions. Word has length 6 [2024-11-14 05:01:40,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:01:40,399 INFO L471 AbstractCegarLoop]: Abstraction has 802 states and 877 transitions. [2024-11-14 05:01:40,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:01:40,399 INFO L276 IsEmpty]: Start isEmpty. Operand 802 states and 877 transitions. [2024-11-14 05:01:40,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-14 05:01:40,400 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:01:40,400 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:01:40,402 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/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 05:01:40,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/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 05:01:40,603 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-14 05:01:40,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:01:40,603 INFO L85 PathProgramCache]: Analyzing trace with hash 47654045, now seen corresponding path program 1 times [2024-11-14 05:01:40,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:01:40,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1984014965] [2024-11-14 05:01:40,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:01:40,604 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 05:01:40,604 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:01:40,609 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/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 05:01:40,612 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/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 05:01:40,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:01:40,773 INFO L255 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-14 05:01:40,775 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:01:40,791 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 05:01:40,791 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:01:40,791 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:01:40,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1984014965] [2024-11-14 05:01:40,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1984014965] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:01:40,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:01:40,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 05:01:40,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407788004] [2024-11-14 05:01:40,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:01:40,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 05:01:40,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:01:40,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 05:01:40,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 05:01:40,793 INFO L87 Difference]: Start difference. First operand 802 states and 877 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:01:40,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:01:40,842 INFO L93 Difference]: Finished difference Result 760 states and 834 transitions. [2024-11-14 05:01:40,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 05:01:40,843 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-14 05:01:40,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:01:40,846 INFO L225 Difference]: With dead ends: 760 [2024-11-14 05:01:40,847 INFO L226 Difference]: Without dead ends: 760 [2024-11-14 05:01:40,847 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 05:01:40,848 INFO L432 NwaCegarLoop]: 747 mSDtfsCounter, 71 mSDsluCounter, 684 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 1431 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 05:01:40,848 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 1431 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-14 05:01:40,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 760 states. [2024-11-14 05:01:40,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 760 to 760. [2024-11-14 05:01:40,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 760 states, 423 states have (on average 1.9574468085106382) internal successors, (828), 755 states have internal predecessors, (828), 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 05:01:40,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 760 states to 760 states and 834 transitions. [2024-11-14 05:01:40,870 INFO L78 Accepts]: Start accepts. Automaton has 760 states and 834 transitions. Word has length 15 [2024-11-14 05:01:40,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:01:40,871 INFO L471 AbstractCegarLoop]: Abstraction has 760 states and 834 transitions. [2024-11-14 05:01:40,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:01:40,871 INFO L276 IsEmpty]: Start isEmpty. Operand 760 states and 834 transitions. [2024-11-14 05:01:40,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-14 05:01:40,871 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:01:40,872 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:01:40,875 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/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)] Ended with exit code 0 [2024-11-14 05:01:41,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/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 05:01:41,073 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-14 05:01:41,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:01:41,074 INFO L85 PathProgramCache]: Analyzing trace with hash -1449108010, now seen corresponding path program 1 times [2024-11-14 05:01:41,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:01:41,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [424270454] [2024-11-14 05:01:41,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:01:41,075 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 05:01:41,075 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:01:41,077 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/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 05:01:41,081 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/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 05:01:41,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:01:41,226 INFO L255 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-14 05:01:41,228 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:01:41,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 05:01:41,257 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:01:41,258 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:01:41,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [424270454] [2024-11-14 05:01:41,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [424270454] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:01:41,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:01:41,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 05:01:41,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812043726] [2024-11-14 05:01:41,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:01:41,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 05:01:41,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:01:41,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 05:01:41,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 05:01:41,259 INFO L87 Difference]: Start difference. First operand 760 states and 834 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:01:41,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:01:41,378 INFO L93 Difference]: Finished difference Result 738 states and 805 transitions. [2024-11-14 05:01:41,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 05:01:41,379 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-11-14 05:01:41,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:01:41,382 INFO L225 Difference]: With dead ends: 738 [2024-11-14 05:01:41,382 INFO L226 Difference]: Without dead ends: 738 [2024-11-14 05:01:41,383 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-14 05:01:41,385 INFO L432 NwaCegarLoop]: 702 mSDtfsCounter, 48 mSDsluCounter, 1378 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 2080 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 05:01:41,386 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 2080 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 05:01:41,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2024-11-14 05:01:41,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 738. [2024-11-14 05:01:41,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 738 states, 415 states have (on average 1.925301204819277) internal successors, (799), 733 states have internal predecessors, (799), 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 05:01:41,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 738 states and 805 transitions. [2024-11-14 05:01:41,410 INFO L78 Accepts]: Start accepts. Automaton has 738 states and 805 transitions. Word has length 17 [2024-11-14 05:01:41,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:01:41,410 INFO L471 AbstractCegarLoop]: Abstraction has 738 states and 805 transitions. [2024-11-14 05:01:41,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:01:41,411 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 805 transitions. [2024-11-14 05:01:41,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-14 05:01:41,412 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:01:41,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:01:41,416 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/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)] Ended with exit code 0 [2024-11-14 05:01:41,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/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 05:01:41,613 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-14 05:01:41,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:01:41,613 INFO L85 PathProgramCache]: Analyzing trace with hash -527979420, now seen corresponding path program 1 times [2024-11-14 05:01:41,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:01:41,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [943233376] [2024-11-14 05:01:41,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:01:41,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 05:01:41,614 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:01:41,615 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/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 05:01:41,617 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/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 05:01:41,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:01:41,752 INFO L255 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-14 05:01:41,754 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:01:41,763 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 05:01:41,912 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 05:01:41,913 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:01:41,913 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:01:41,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [943233376] [2024-11-14 05:01:41,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [943233376] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:01:41,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:01:41,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 05:01:41,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5643119] [2024-11-14 05:01:41,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:01:41,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 05:01:41,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:01:41,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 05:01:41,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 05:01:41,914 INFO L87 Difference]: Start difference. First operand 738 states and 805 transitions. Second operand has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:01:44,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:01:44,476 INFO L93 Difference]: Finished difference Result 738 states and 805 transitions. [2024-11-14 05:01:44,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 05:01:44,476 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2024-11-14 05:01:44,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:01:44,480 INFO L225 Difference]: With dead ends: 738 [2024-11-14 05:01:44,480 INFO L226 Difference]: Without dead ends: 738 [2024-11-14 05:01:44,480 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-14 05:01:44,481 INFO L432 NwaCegarLoop]: 458 mSDtfsCounter, 449 mSDsluCounter, 423 mSDsCounter, 0 mSdLazyCounter, 803 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 452 SdHoareTripleChecker+Valid, 881 SdHoareTripleChecker+Invalid, 811 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 803 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-14 05:01:44,481 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [452 Valid, 881 Invalid, 811 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 803 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-14 05:01:44,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2024-11-14 05:01:44,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 734. [2024-11-14 05:01:44,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 734 states, 415 states have (on average 1.9156626506024097) internal successors, (795), 729 states have internal predecessors, (795), 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 05:01:44,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 734 states to 734 states and 801 transitions. [2024-11-14 05:01:44,500 INFO L78 Accepts]: Start accepts. Automaton has 734 states and 801 transitions. Word has length 31 [2024-11-14 05:01:44,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:01:44,500 INFO L471 AbstractCegarLoop]: Abstraction has 734 states and 801 transitions. [2024-11-14 05:01:44,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:01:44,501 INFO L276 IsEmpty]: Start isEmpty. Operand 734 states and 801 transitions. [2024-11-14 05:01:44,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-14 05:01:44,502 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:01:44,502 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] [2024-11-14 05:01:44,506 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/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 05:01:44,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/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 05:01:44,705 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-14 05:01:44,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:01:44,705 INFO L85 PathProgramCache]: Analyzing trace with hash -527979419, now seen corresponding path program 1 times [2024-11-14 05:01:44,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:01:44,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1240517974] [2024-11-14 05:01:44,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:01:44,706 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 05:01:44,706 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:01:44,708 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/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 05:01:44,709 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/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 05:01:44,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:01:44,861 INFO L255 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-14 05:01:44,863 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:01:44,877 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 05:01:45,213 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 05:01:45,213 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:01:45,213 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:01:45,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1240517974] [2024-11-14 05:01:45,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1240517974] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:01:45,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:01:45,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 05:01:45,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208430187] [2024-11-14 05:01:45,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:01:45,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 05:01:45,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:01:45,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 05:01:45,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 05:01:45,214 INFO L87 Difference]: Start difference. First operand 734 states and 801 transitions. Second operand has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:01:48,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:01:48,115 INFO L93 Difference]: Finished difference Result 782 states and 816 transitions. [2024-11-14 05:01:48,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 05:01:48,118 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2024-11-14 05:01:48,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:01:48,122 INFO L225 Difference]: With dead ends: 782 [2024-11-14 05:01:48,122 INFO L226 Difference]: Without dead ends: 782 [2024-11-14 05:01:48,122 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-14 05:01:48,123 INFO L432 NwaCegarLoop]: 637 mSDtfsCounter, 196 mSDsluCounter, 607 mSDsCounter, 0 mSdLazyCounter, 775 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 1244 SdHoareTripleChecker+Invalid, 778 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 775 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-14 05:01:48,123 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 1244 Invalid, 778 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 775 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-14 05:01:48,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 782 states. [2024-11-14 05:01:48,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 782 to 730. [2024-11-14 05:01:48,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 730 states, 415 states have (on average 1.9060240963855422) internal successors, (791), 725 states have internal predecessors, (791), 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 05:01:48,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 730 states to 730 states and 797 transitions. [2024-11-14 05:01:48,143 INFO L78 Accepts]: Start accepts. Automaton has 730 states and 797 transitions. Word has length 31 [2024-11-14 05:01:48,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:01:48,143 INFO L471 AbstractCegarLoop]: Abstraction has 730 states and 797 transitions. [2024-11-14 05:01:48,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:01:48,143 INFO L276 IsEmpty]: Start isEmpty. Operand 730 states and 797 transitions. [2024-11-14 05:01:48,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-14 05:01:48,145 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:01:48,145 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] [2024-11-14 05:01:48,149 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/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 05:01:48,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/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 05:01:48,346 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr109REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-14 05:01:48,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:01:48,347 INFO L85 PathProgramCache]: Analyzing trace with hash 2001328572, now seen corresponding path program 1 times [2024-11-14 05:01:48,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:01:48,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1412402545] [2024-11-14 05:01:48,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:01:48,347 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 05:01:48,347 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:01:48,349 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/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 05:01:48,352 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/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 05:01:48,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:01:48,567 INFO L255 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-14 05:01:48,569 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:01:48,697 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 05:01:48,697 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:01:48,697 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:01:48,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1412402545] [2024-11-14 05:01:48,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1412402545] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:01:48,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:01:48,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 05:01:48,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417402188] [2024-11-14 05:01:48,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:01:48,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 05:01:48,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:01:48,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 05:01:48,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 05:01:48,700 INFO L87 Difference]: Start difference. First operand 730 states and 797 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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 05:01:48,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:01:48,796 INFO L93 Difference]: Finished difference Result 724 states and 787 transitions. [2024-11-14 05:01:48,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 05:01:48,797 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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 47 [2024-11-14 05:01:48,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:01:48,800 INFO L225 Difference]: With dead ends: 724 [2024-11-14 05:01:48,800 INFO L226 Difference]: Without dead ends: 724 [2024-11-14 05:01:48,800 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 44 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 05:01:48,801 INFO L432 NwaCegarLoop]: 696 mSDtfsCounter, 21 mSDsluCounter, 1361 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 2057 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 05:01:48,802 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 2057 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 05:01:48,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 724 states. [2024-11-14 05:01:48,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 724 to 724. [2024-11-14 05:01:48,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 724 states, 409 states have (on average 1.9095354523227384) internal successors, (781), 719 states have internal predecessors, (781), 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 05:01:48,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 724 states to 724 states and 787 transitions. [2024-11-14 05:01:48,820 INFO L78 Accepts]: Start accepts. Automaton has 724 states and 787 transitions. Word has length 47 [2024-11-14 05:01:48,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:01:48,820 INFO L471 AbstractCegarLoop]: Abstraction has 724 states and 787 transitions. [2024-11-14 05:01:48,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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 05:01:48,821 INFO L276 IsEmpty]: Start isEmpty. Operand 724 states and 787 transitions. [2024-11-14 05:01:48,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-14 05:01:48,822 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:01:48,822 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:01:48,827 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/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)] Ended with exit code 0 [2024-11-14 05:01:49,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/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 05:01:49,026 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr109REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-14 05:01:49,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:01:49,027 INFO L85 PathProgramCache]: Analyzing trace with hash 675533448, now seen corresponding path program 1 times [2024-11-14 05:01:49,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:01:49,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1898491037] [2024-11-14 05:01:49,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:01:49,027 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 05:01:49,028 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:01:49,030 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/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 05:01:49,033 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/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 05:01:49,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:01:49,236 INFO L255 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-14 05:01:49,238 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:01:49,660 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 05:01:49,661 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:01:49,661 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:01:49,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1898491037] [2024-11-14 05:01:49,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1898491037] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:01:49,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:01:49,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 05:01:49,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135952002] [2024-11-14 05:01:49,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:01:49,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 05:01:49,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:01:49,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 05:01:49,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 05:01:49,664 INFO L87 Difference]: Start difference. First operand 724 states and 787 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:01:50,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:01:50,000 INFO L93 Difference]: Finished difference Result 945 states and 1037 transitions. [2024-11-14 05:01:50,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 05:01:50,001 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2024-11-14 05:01:50,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:01:50,005 INFO L225 Difference]: With dead ends: 945 [2024-11-14 05:01:50,005 INFO L226 Difference]: Without dead ends: 945 [2024-11-14 05:01:50,005 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 53 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 05:01:50,006 INFO L432 NwaCegarLoop]: 783 mSDtfsCounter, 177 mSDsluCounter, 645 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 1428 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-14 05:01:50,006 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 1428 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-14 05:01:50,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 945 states. [2024-11-14 05:01:50,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 945 to 775. [2024-11-14 05:01:50,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 775 states, 460 states have (on average 1.808695652173913) internal successors, (832), 770 states have internal predecessors, (832), 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 05:01:50,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 838 transitions. [2024-11-14 05:01:50,025 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 838 transitions. Word has length 55 [2024-11-14 05:01:50,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:01:50,026 INFO L471 AbstractCegarLoop]: Abstraction has 775 states and 838 transitions. [2024-11-14 05:01:50,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:01:50,026 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 838 transitions. [2024-11-14 05:01:50,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-14 05:01:50,027 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:01:50,027 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 05:01:50,034 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/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 05:01:50,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/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 05:01:50,229 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-14 05:01:50,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:01:50,230 INFO L85 PathProgramCache]: Analyzing trace with hash -1507279472, now seen corresponding path program 1 times [2024-11-14 05:01:50,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:01:50,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [273790347] [2024-11-14 05:01:50,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:01:50,232 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 05:01:50,232 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:01:50,234 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/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 05:01:50,238 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/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 05:01:50,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:01:50,599 INFO L255 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-14 05:01:50,605 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:01:50,623 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 05:01:50,632 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 05:01:51,464 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:01:51,466 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 05:01:51,491 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-14 05:01:51,491 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 05:01:51,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:01:51,513 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:01:51,514 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:01:51,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [273790347] [2024-11-14 05:01:51,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [273790347] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:01:51,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:01:51,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 05:01:51,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655701872] [2024-11-14 05:01:51,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:01:51,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 05:01:51,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:01:51,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 05:01:51,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-14 05:01:51,516 INFO L87 Difference]: Start difference. First operand 775 states and 838 transitions. Second operand has 4 states, 3 states have (on average 19.333333333333332) internal successors, (58), 4 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 05:01:53,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:01:53,680 INFO L93 Difference]: Finished difference Result 737 states and 800 transitions. [2024-11-14 05:01:53,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 05:01:53,681 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 19.333333333333332) internal successors, (58), 4 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 05:01:53,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:01:53,684 INFO L225 Difference]: With dead ends: 737 [2024-11-14 05:01:53,684 INFO L226 Difference]: Without dead ends: 737 [2024-11-14 05:01:53,684 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 55 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 05:01:53,684 INFO L432 NwaCegarLoop]: 372 mSDtfsCounter, 374 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 601 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 377 SdHoareTripleChecker+Valid, 553 SdHoareTripleChecker+Invalid, 642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 601 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-14 05:01:53,685 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [377 Valid, 553 Invalid, 642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 601 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-14 05:01:53,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 737 states. [2024-11-14 05:01:53,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 737 to 700. [2024-11-14 05:01:53,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 700 states, 423 states have (on average 1.702127659574468) internal successors, (720), 695 states have internal predecessors, (720), 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 05:01:53,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 700 states to 700 states and 726 transitions. [2024-11-14 05:01:53,699 INFO L78 Accepts]: Start accepts. Automaton has 700 states and 726 transitions. Word has length 58 [2024-11-14 05:01:53,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:01:53,699 INFO L471 AbstractCegarLoop]: Abstraction has 700 states and 726 transitions. [2024-11-14 05:01:53,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 19.333333333333332) internal successors, (58), 4 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 05:01:53,699 INFO L276 IsEmpty]: Start isEmpty. Operand 700 states and 726 transitions. [2024-11-14 05:01:53,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-14 05:01:53,700 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:01:53,700 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] [2024-11-14 05:01:53,708 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/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)] Ended with exit code 0 [2024-11-14 05:01:53,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/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 05:01:53,901 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr68REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-14 05:01:53,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:01:53,901 INFO L85 PathProgramCache]: Analyzing trace with hash 2035988571, now seen corresponding path program 1 times [2024-11-14 05:01:53,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:01:53,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1119682403] [2024-11-14 05:01:53,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:01:53,902 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 05:01:53,902 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:01:53,906 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/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 05:01:53,907 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/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 05:01:54,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:01:54,166 INFO L255 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-14 05:01:54,168 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:01:54,179 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 05:01:54,202 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 05:01:54,239 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 05:01:54,254 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 05:01:54,254 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:01:54,254 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:01:54,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1119682403] [2024-11-14 05:01:54,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1119682403] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:01:54,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:01:54,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 05:01:54,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355558423] [2024-11-14 05:01:54,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:01:54,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-14 05:01:54,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:01:54,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-14 05:01:54,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-14 05:01:54,256 INFO L87 Difference]: Start difference. First operand 700 states and 726 transitions. Second operand has 5 states, 4 states have (on average 15.75) internal successors, (63), 5 states have internal predecessors, (63), 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 05:01:56,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:01:56,511 INFO L93 Difference]: Finished difference Result 699 states and 725 transitions. [2024-11-14 05:01:56,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 05:01:56,512 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 15.75) internal successors, (63), 5 states have internal predecessors, (63), 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 63 [2024-11-14 05:01:56,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:01:56,515 INFO L225 Difference]: With dead ends: 699 [2024-11-14 05:01:56,515 INFO L226 Difference]: Without dead ends: 699 [2024-11-14 05:01:56,515 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-14 05:01:56,516 INFO L432 NwaCegarLoop]: 669 mSDtfsCounter, 2 mSDsluCounter, 1007 mSDsCounter, 0 mSdLazyCounter, 1007 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1676 SdHoareTripleChecker+Invalid, 1008 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1007 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-14 05:01:56,516 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1676 Invalid, 1008 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1007 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-14 05:01:56,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2024-11-14 05:01:56,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 699. [2024-11-14 05:01:56,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 699 states, 423 states have (on average 1.6997635933806146) internal successors, (719), 694 states have internal predecessors, (719), 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 05:01:56,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 725 transitions. [2024-11-14 05:01:56,531 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 725 transitions. Word has length 63 [2024-11-14 05:01:56,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:01:56,531 INFO L471 AbstractCegarLoop]: Abstraction has 699 states and 725 transitions. [2024-11-14 05:01:56,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 15.75) internal successors, (63), 5 states have internal predecessors, (63), 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 05:01:56,531 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 725 transitions. [2024-11-14 05:01:56,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-14 05:01:56,532 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:01:56,532 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] [2024-11-14 05:01:56,540 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/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 05:01:56,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/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 05:01:56,733 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr69REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-14 05:01:56,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:01:56,734 INFO L85 PathProgramCache]: Analyzing trace with hash 2035988572, now seen corresponding path program 1 times [2024-11-14 05:01:56,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:01:56,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2141176216] [2024-11-14 05:01:56,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:01:56,735 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 05:01:56,735 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:01:56,737 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/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 05:01:56,740 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/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 05:01:57,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:01:57,031 INFO L255 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-14 05:01:57,034 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:01:57,052 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 05:01:57,076 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 05:01:57,082 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 05:01:57,158 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 05:01:57,212 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 05:01:57,212 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:01:57,212 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:01:57,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2141176216] [2024-11-14 05:01:57,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2141176216] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:01:57,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:01:57,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 05:01:57,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825541793] [2024-11-14 05:01:57,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:01:57,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-14 05:01:57,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:01:57,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-14 05:01:57,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-14 05:01:57,215 INFO L87 Difference]: Start difference. First operand 699 states and 725 transitions. Second operand has 5 states, 4 states have (on average 15.75) internal successors, (63), 5 states have internal predecessors, (63), 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 05:02:00,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:02:00,550 INFO L93 Difference]: Finished difference Result 698 states and 724 transitions. [2024-11-14 05:02:00,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 05:02:00,551 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 15.75) internal successors, (63), 5 states have internal predecessors, (63), 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 63 [2024-11-14 05:02:00,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:02:00,553 INFO L225 Difference]: With dead ends: 698 [2024-11-14 05:02:00,553 INFO L226 Difference]: Without dead ends: 698 [2024-11-14 05:02:00,553 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 59 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 05:02:00,554 INFO L432 NwaCegarLoop]: 669 mSDtfsCounter, 1 mSDsluCounter, 1032 mSDsCounter, 0 mSdLazyCounter, 979 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1701 SdHoareTripleChecker+Invalid, 980 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 979 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-11-14 05:02:00,554 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1701 Invalid, 980 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 979 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-11-14 05:02:00,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2024-11-14 05:02:00,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 698. [2024-11-14 05:02:00,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 698 states, 422 states have (on average 1.7014218009478672) internal successors, (718), 693 states have internal predecessors, (718), 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 05:02:00,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 724 transitions. [2024-11-14 05:02:00,570 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 724 transitions. Word has length 63 [2024-11-14 05:02:00,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:02:00,570 INFO L471 AbstractCegarLoop]: Abstraction has 698 states and 724 transitions. [2024-11-14 05:02:00,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 15.75) internal successors, (63), 5 states have internal predecessors, (63), 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 05:02:00,571 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 724 transitions. [2024-11-14 05:02:00,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-14 05:02:00,572 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:02:00,572 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] [2024-11-14 05:02:00,579 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/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)] Forceful destruction successful, exit code 0 [2024-11-14 05:02:00,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/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 05:02:00,772 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr72REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-14 05:02:00,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:02:00,773 INFO L85 PathProgramCache]: Analyzing trace with hash 1647677922, now seen corresponding path program 1 times [2024-11-14 05:02:00,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:02:00,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1304166] [2024-11-14 05:02:00,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:02:00,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 05:02:00,774 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:02:00,775 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/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 05:02:00,777 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/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 05:02:01,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:02:01,033 INFO L255 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-14 05:02:01,036 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:02:01,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 05:02:01,067 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:02:01,068 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:02:01,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1304166] [2024-11-14 05:02:01,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1304166] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:02:01,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:02:01,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 05:02:01,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771100746] [2024-11-14 05:02:01,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:02:01,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 05:02:01,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:02:01,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 05:02:01,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 05:02:01,070 INFO L87 Difference]: Start difference. First operand 698 states and 724 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 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 05:02:01,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:02:01,116 INFO L93 Difference]: Finished difference Result 701 states and 728 transitions. [2024-11-14 05:02:01,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 05:02:01,117 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 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 71 [2024-11-14 05:02:01,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:02:01,120 INFO L225 Difference]: With dead ends: 701 [2024-11-14 05:02:01,120 INFO L226 Difference]: Without dead ends: 701 [2024-11-14 05:02:01,120 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 68 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 05:02:01,121 INFO L432 NwaCegarLoop]: 669 mSDtfsCounter, 0 mSDsluCounter, 1333 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2002 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 05:02:01,121 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2002 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-14 05:02:01,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2024-11-14 05:02:01,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 701. [2024-11-14 05:02:01,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 701 states, 424 states have (on average 1.7004716981132075) internal successors, (721), 696 states have internal predecessors, (721), 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 05:02:01,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 701 states to 701 states and 728 transitions. [2024-11-14 05:02:01,139 INFO L78 Accepts]: Start accepts. Automaton has 701 states and 728 transitions. Word has length 71 [2024-11-14 05:02:01,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:02:01,139 INFO L471 AbstractCegarLoop]: Abstraction has 701 states and 728 transitions. [2024-11-14 05:02:01,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 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 05:02:01,139 INFO L276 IsEmpty]: Start isEmpty. Operand 701 states and 728 transitions. [2024-11-14 05:02:01,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-14 05:02:01,140 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:02:01,141 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:02:01,147 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/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 05:02:01,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/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 05:02:01,341 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr72REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-14 05:02:01,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:02:01,342 INFO L85 PathProgramCache]: Analyzing trace with hash 933339861, now seen corresponding path program 1 times [2024-11-14 05:02:01,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:02:01,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [529988006] [2024-11-14 05:02:01,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:02:01,342 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 05:02:01,342 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:02:01,344 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/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 05:02:01,346 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/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 05:02:01,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:02:01,672 INFO L255 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-14 05:02:01,675 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:02:01,718 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 05:02:01,720 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:02:01,839 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 05:02:01,839 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:02:01,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [529988006] [2024-11-14 05:02:01,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [529988006] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:02:01,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1011112189] [2024-11-14 05:02:01,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:02:01,840 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 05:02:01,840 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 05:02:01,851 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 05:02:01,858 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (17)] Waiting until timeout for monitored process [2024-11-14 05:02:02,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:02:02,471 INFO L255 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-14 05:02:02,473 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:02:02,491 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 05:02:02,491 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:02:02,533 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 05:02:02,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1011112189] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:02:02,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1177211181] [2024-11-14 05:02:02,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:02:02,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:02:02,534 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:02:02,537 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:02:02,540 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-11-14 05:02:02,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:02:02,883 INFO L255 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-14 05:02:02,886 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:02:02,906 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 05:02:02,906 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:02:02,954 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 05:02:02,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1177211181] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:02:02,954 INFO L185 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2024-11-14 05:02:02,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 5, 5, 5] total 8 [2024-11-14 05:02:02,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188328920] [2024-11-14 05:02:02,955 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2024-11-14 05:02:02,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-14 05:02:02,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:02:02,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-14 05:02:02,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-14 05:02:02,957 INFO L87 Difference]: Start difference. First operand 701 states and 728 transitions. Second operand has 8 states, 8 states have (on average 9.25) internal successors, (74), 8 states have internal predecessors, (74), 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 05:02:03,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:02:03,223 INFO L93 Difference]: Finished difference Result 713 states and 745 transitions. [2024-11-14 05:02:03,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-14 05:02:03,224 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.25) internal successors, (74), 8 states have internal predecessors, (74), 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 72 [2024-11-14 05:02:03,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:02:03,228 INFO L225 Difference]: With dead ends: 713 [2024-11-14 05:02:03,228 INFO L226 Difference]: Without dead ends: 713 [2024-11-14 05:02:03,228 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 429 GetRequests, 420 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 05:02:03,229 INFO L432 NwaCegarLoop]: 669 mSDtfsCounter, 7 mSDsluCounter, 1998 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 2667 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 05:02:03,231 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 2667 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 05:02:03,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 713 states. [2024-11-14 05:02:03,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 713 to 711. [2024-11-14 05:02:03,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 711 states, 433 states have (on average 1.699769053117783) internal successors, (736), 705 states have internal predecessors, (736), 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 05:02:03,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 711 states to 711 states and 743 transitions. [2024-11-14 05:02:03,251 INFO L78 Accepts]: Start accepts. Automaton has 711 states and 743 transitions. Word has length 72 [2024-11-14 05:02:03,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:02:03,251 INFO L471 AbstractCegarLoop]: Abstraction has 711 states and 743 transitions. [2024-11-14 05:02:03,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.25) internal successors, (74), 8 states have internal predecessors, (74), 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 05:02:03,251 INFO L276 IsEmpty]: Start isEmpty. Operand 711 states and 743 transitions. [2024-11-14 05:02:03,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-14 05:02:03,253 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:02:03,253 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] [2024-11-14 05:02:03,258 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (17)] Forceful destruction successful, exit code 0 [2024-11-14 05:02:03,471 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2024-11-14 05:02:03,658 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/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 05:02:03,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/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 05:02:03,855 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr72REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-14 05:02:03,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:02:03,855 INFO L85 PathProgramCache]: Analyzing trace with hash 1697363618, now seen corresponding path program 2 times [2024-11-14 05:02:03,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:02:03,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [602463527] [2024-11-14 05:02:03,856 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-14 05:02:03,856 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 05:02:03,856 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:02:03,858 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/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 05:02:03,861 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/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 05:02:04,445 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-14 05:02:04,446 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 05:02:04,466 INFO L255 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-14 05:02:04,469 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:02:04,565 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 05:02:04,565 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:02:04,843 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 05:02:04,844 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:02:04,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [602463527] [2024-11-14 05:02:04,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [602463527] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:02:04,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2059390337] [2024-11-14 05:02:04,844 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-14 05:02:04,844 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 05:02:04,844 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 05:02:04,848 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 05:02:04,850 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (20)] Waiting until timeout for monitored process [2024-11-14 05:02:05,837 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-14 05:02:05,837 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 05:02:05,862 INFO L255 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-14 05:02:05,864 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:02:05,919 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 05:02:05,920 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:02:06,002 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 05:02:06,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2059390337] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:02:06,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [25554058] [2024-11-14 05:02:06,003 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-14 05:02:06,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:02:06,003 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:02:06,005 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:02:06,007 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2024-11-14 05:02:23,871 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-14 05:02:23,871 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 05:02:23,885 INFO L255 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-14 05:02:23,888 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:02:24,078 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-14 05:02:24,078 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 05:02:24,123 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-14 05:02:24,476 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 05:02:24,476 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 05:02:24,577 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 05:02:24,631 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 05:02:24,631 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:02:24,750 INFO L349 Elim1Store]: treesize reduction 7, result has 63.2 percent of original size [2024-11-14 05:02:24,750 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 05:02:24,764 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1257 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_1257) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)) |c_ULTIMATE.start_main_#t~mem33#1.base|)) is different from false [2024-11-14 05:02:24,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [25554058] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:02:24,767 INFO L185 FreeRefinementEngine]: Found 0 perfect and 5 imperfect interpolant sequences. [2024-11-14 05:02:24,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 8, 11] total 24 [2024-11-14 05:02:24,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123251383] [2024-11-14 05:02:24,768 INFO L85 oduleStraightlineAll]: Using 5 imperfect interpolants to construct interpolant automaton [2024-11-14 05:02:24,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-14 05:02:24,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:02:24,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-14 05:02:24,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=513, Unknown=1, NotChecked=46, Total=650 [2024-11-14 05:02:24,772 INFO L87 Difference]: Start difference. First operand 711 states and 743 transitions. Second operand has 24 states, 23 states have (on average 6.043478260869565) internal successors, (139), 23 states have internal predecessors, (139), 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 05:02:35,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:02:35,187 INFO L93 Difference]: Finished difference Result 727 states and 766 transitions. [2024-11-14 05:02:35,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-11-14 05:02:35,188 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 6.043478260869565) internal successors, (139), 23 states have internal predecessors, (139), 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 75 [2024-11-14 05:02:35,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:02:35,190 INFO L225 Difference]: With dead ends: 727 [2024-11-14 05:02:35,190 INFO L226 Difference]: Without dead ends: 723 [2024-11-14 05:02:35,191 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 401 GetRequests, 350 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 478 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=413, Invalid=2242, Unknown=1, NotChecked=100, Total=2756 [2024-11-14 05:02:35,192 INFO L432 NwaCegarLoop]: 446 mSDtfsCounter, 427 mSDsluCounter, 5618 mSDsCounter, 0 mSdLazyCounter, 4510 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 431 SdHoareTripleChecker+Valid, 6064 SdHoareTripleChecker+Invalid, 4539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 4510 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.2s IncrementalHoareTripleChecker+Time [2024-11-14 05:02:35,192 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [431 Valid, 6064 Invalid, 4539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 4510 Invalid, 0 Unknown, 0 Unchecked, 9.2s Time] [2024-11-14 05:02:35,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 723 states. [2024-11-14 05:02:35,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 723 to 719. [2024-11-14 05:02:35,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 719 states, 442 states have (on average 1.6900452488687783) internal successors, (747), 713 states have internal predecessors, (747), 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 05:02:35,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 719 states to 719 states and 754 transitions. [2024-11-14 05:02:35,208 INFO L78 Accepts]: Start accepts. Automaton has 719 states and 754 transitions. Word has length 75 [2024-11-14 05:02:35,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:02:35,208 INFO L471 AbstractCegarLoop]: Abstraction has 719 states and 754 transitions. [2024-11-14 05:02:35,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 6.043478260869565) internal successors, (139), 23 states have internal predecessors, (139), 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 05:02:35,209 INFO L276 IsEmpty]: Start isEmpty. Operand 719 states and 754 transitions. [2024-11-14 05:02:35,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-14 05:02:35,210 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:02:35,210 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] [2024-11-14 05:02:35,219 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/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 05:02:35,419 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (20)] Forceful destruction successful, exit code 0 [2024-11-14 05:02:35,638 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2024-11-14 05:02:35,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt,21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:02:35,814 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-14 05:02:35,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:02:35,815 INFO L85 PathProgramCache]: Analyzing trace with hash -1389413949, now seen corresponding path program 1 times [2024-11-14 05:02:35,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:02:35,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [219065385] [2024-11-14 05:02:35,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:02:35,815 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 05:02:35,815 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:02:35,819 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/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 05:02:35,820 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/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 05:02:36,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:02:36,212 INFO L255 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-14 05:02:36,215 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:02:36,430 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 05:02:36,430 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:02:37,037 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 05:02:37,037 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:02:37,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [219065385] [2024-11-14 05:02:37,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [219065385] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:02:37,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [445474899] [2024-11-14 05:02:37,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:02:37,038 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 05:02:37,038 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 05:02:37,042 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 05:02:37,044 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (23)] Waiting until timeout for monitored process [2024-11-14 05:02:37,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:02:37,636 INFO L255 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-14 05:02:37,637 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:02:37,679 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 05:02:37,680 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:02:37,800 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 05:02:37,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [445474899] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:02:37,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2127892691] [2024-11-14 05:02:37,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:02:37,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:02:37,801 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:02:37,803 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:02:37,804 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2024-11-14 05:02:38,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:02:38,173 INFO L255 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-14 05:02:38,175 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:02:38,299 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 05:02:38,300 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:02:39,213 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 05:02:39,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2127892691] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:02:39,214 INFO L185 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2024-11-14 05:02:39,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14, 14, 14, 14] total 38 [2024-11-14 05:02:39,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482939734] [2024-11-14 05:02:39,214 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2024-11-14 05:02:39,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-11-14 05:02:39,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:02:39,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-11-14 05:02:39,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=447, Invalid=959, Unknown=0, NotChecked=0, Total=1406 [2024-11-14 05:02:39,216 INFO L87 Difference]: Start difference. First operand 719 states and 754 transitions. Second operand has 38 states, 38 states have (on average 2.789473684210526) internal successors, (106), 38 states have internal predecessors, (106), 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 05:02:41,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:02:41,742 INFO L93 Difference]: Finished difference Result 745 states and 795 transitions. [2024-11-14 05:02:41,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2024-11-14 05:02:41,746 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 2.789473684210526) internal successors, (106), 38 states have internal predecessors, (106), 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 81 [2024-11-14 05:02:41,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:02:41,749 INFO L225 Difference]: With dead ends: 745 [2024-11-14 05:02:41,749 INFO L226 Difference]: Without dead ends: 739 [2024-11-14 05:02:41,750 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 501 GetRequests, 444 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1168, Invalid=2254, Unknown=0, NotChecked=0, Total=3422 [2024-11-14 05:02:41,750 INFO L432 NwaCegarLoop]: 669 mSDtfsCounter, 21 mSDsluCounter, 9320 mSDsCounter, 0 mSdLazyCounter, 649 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 9989 SdHoareTripleChecker+Invalid, 678 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 649 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-14 05:02:41,750 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 9989 Invalid, 678 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [29 Valid, 649 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-14 05:02:41,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 739 states. [2024-11-14 05:02:41,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 739 to 737. [2024-11-14 05:02:41,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 737 states, 460 states have (on average 1.673913043478261) internal successors, (770), 731 states have internal predecessors, (770), 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 05:02:41,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 737 states to 737 states and 777 transitions. [2024-11-14 05:02:41,767 INFO L78 Accepts]: Start accepts. Automaton has 737 states and 777 transitions. Word has length 81 [2024-11-14 05:02:41,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:02:41,767 INFO L471 AbstractCegarLoop]: Abstraction has 737 states and 777 transitions. [2024-11-14 05:02:41,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 2.789473684210526) internal successors, (106), 38 states have internal predecessors, (106), 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 05:02:41,768 INFO L276 IsEmpty]: Start isEmpty. Operand 737 states and 777 transitions. [2024-11-14 05:02:41,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-14 05:02:41,768 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:02:41,769 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] [2024-11-14 05:02:41,776 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/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)] Ended with exit code 0 [2024-11-14 05:02:41,977 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (23)] Forceful destruction successful, exit code 0 [2024-11-14 05:02:42,193 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2024-11-14 05:02:42,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt,24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:02:42,374 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-14 05:02:42,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:02:42,374 INFO L85 PathProgramCache]: Analyzing trace with hash 1279506435, now seen corresponding path program 2 times [2024-11-14 05:02:42,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:02:42,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [889398325] [2024-11-14 05:02:42,375 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-14 05:02:42,375 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:02:42,375 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:02:42,380 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/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 05:02:42,381 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/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 05:02:42,866 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-14 05:02:42,867 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 05:02:42,882 INFO L255 TraceCheckSpWp]: Trace formula consists of 531 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-14 05:02:42,884 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:02:43,411 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 05:02:43,411 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:02:45,282 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 05:02:45,283 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:02:45,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [889398325] [2024-11-14 05:02:45,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [889398325] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:02:45,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1701036633] [2024-11-14 05:02:45,283 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-14 05:02:45,283 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 05:02:45,283 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 05:02:45,287 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 05:02:45,294 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (26)] Waiting until timeout for monitored process [2024-11-14 05:02:46,427 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-14 05:02:46,427 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 05:02:46,440 INFO L255 TraceCheckSpWp]: Trace formula consists of 531 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-14 05:02:46,443 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:02:46,537 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 05:02:46,537 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:02:46,889 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 05:02:46,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1701036633] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:02:46,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1067167778] [2024-11-14 05:02:46,890 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-14 05:02:46,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:02:46,890 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:02:46,892 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:02:46,895 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2024-11-14 05:03:08,970 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-14 05:03:08,970 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 05:03:08,990 INFO L255 TraceCheckSpWp]: Trace formula consists of 531 conjuncts, 63 conjuncts are in the unsatisfiable core [2024-11-14 05:03:08,998 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:03:09,269 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-14 05:03:09,283 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-14 05:03:09,284 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 05:03:09,407 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 05:03:09,418 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 05:03:09,827 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 05:03:09,835 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 05:03:10,704 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 05:03:10,704 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 05:03:10,715 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 05:03:10,910 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 05:03:10,918 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 05:03:11,016 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 05:03:11,017 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:03:12,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1067167778] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:03:12,679 INFO L185 FreeRefinementEngine]: Found 0 perfect and 5 imperfect interpolant sequences. [2024-11-14 05:03:12,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26, 26, 9] total 58 [2024-11-14 05:03:12,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6611662] [2024-11-14 05:03:12,680 INFO L85 oduleStraightlineAll]: Using 5 imperfect interpolants to construct interpolant automaton [2024-11-14 05:03:12,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2024-11-14 05:03:12,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:03:12,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2024-11-14 05:03:12,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=700, Invalid=2932, Unknown=28, NotChecked=0, Total=3660 [2024-11-14 05:03:12,683 INFO L87 Difference]: Start difference. First operand 737 states and 777 transitions. Second operand has 58 states, 57 states have (on average 3.0701754385964914) internal successors, (175), 58 states have internal predecessors, (175), 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 05:03:45,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:03:45,935 INFO L93 Difference]: Finished difference Result 780 states and 850 transitions. [2024-11-14 05:03:45,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2024-11-14 05:03:45,936 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 57 states have (on average 3.0701754385964914) internal successors, (175), 58 states have internal predecessors, (175), 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 93 [2024-11-14 05:03:45,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:03:45,938 INFO L225 Difference]: With dead ends: 780 [2024-11-14 05:03:45,938 INFO L226 Difference]: Without dead ends: 772 [2024-11-14 05:03:45,942 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 541 GetRequests, 406 SyntacticMatches, 1 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3207 ImplicationChecksByTransitivity, 13.8s TimeCoverageRelationStatistics Valid=3108, Invalid=15217, Unknown=35, NotChecked=0, Total=18360 [2024-11-14 05:03:45,942 INFO L432 NwaCegarLoop]: 446 mSDtfsCounter, 447 mSDsluCounter, 11984 mSDsCounter, 0 mSdLazyCounter, 10188 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 450 SdHoareTripleChecker+Valid, 12430 SdHoareTripleChecker+Invalid, 10242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 10188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 23.3s IncrementalHoareTripleChecker+Time [2024-11-14 05:03:45,943 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [450 Valid, 12430 Invalid, 10242 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [54 Valid, 10188 Invalid, 0 Unknown, 0 Unchecked, 23.3s Time] [2024-11-14 05:03:45,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 772 states. [2024-11-14 05:03:45,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 772 to 770. [2024-11-14 05:03:45,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 770 states, 494 states have (on average 1.6417004048582995) internal successors, (811), 764 states have internal predecessors, (811), 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 05:03:45,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 770 states to 770 states and 818 transitions. [2024-11-14 05:03:45,961 INFO L78 Accepts]: Start accepts. Automaton has 770 states and 818 transitions. Word has length 93 [2024-11-14 05:03:45,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:03:45,962 INFO L471 AbstractCegarLoop]: Abstraction has 770 states and 818 transitions. [2024-11-14 05:03:45,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 57 states have (on average 3.0701754385964914) internal successors, (175), 58 states have internal predecessors, (175), 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 05:03:45,962 INFO L276 IsEmpty]: Start isEmpty. Operand 770 states and 818 transitions. [2024-11-14 05:03:45,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-14 05:03:45,963 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:03:45,963 INFO L215 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:03:45,974 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/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)] Ended with exit code 0 [2024-11-14 05:03:46,170 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (26)] Forceful destruction successful, exit code 0 [2024-11-14 05:03:46,389 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2024-11-14 05:03:46,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt,27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:03:46,564 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-14 05:03:46,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:03:46,565 INFO L85 PathProgramCache]: Analyzing trace with hash 1538876695, now seen corresponding path program 1 times [2024-11-14 05:03:46,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:03:46,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [272678260] [2024-11-14 05:03:46,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:03:46,565 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 05:03:46,565 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:03:46,567 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/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 05:03:46,568 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/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 (28)] Waiting until timeout for monitored process [2024-11-14 05:03:47,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:03:47,454 INFO L255 TraceCheckSpWp]: Trace formula consists of 793 conjuncts, 59 conjuncts are in the unsatisfiable core [2024-11-14 05:03:47,465 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:03:47,470 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 05:03:47,677 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-14 05:03:47,677 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 05:03:47,715 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 05:03:47,858 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 05:03:48,992 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 05:03:48,993 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2024-11-14 05:03:49,121 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 05:03:49,121 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 05:03:49,158 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 05:03:49,207 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 05:03:49,208 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:03:49,358 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2862 (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_2862) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (_ bv0 1))) is different from false [2024-11-14 05:03:49,767 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2908 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2862 (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~mem33#1.base| v_ArrVal_2908))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2862)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-14 05:03:49,770 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:03:49,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [272678260] [2024-11-14 05:03:49,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [272678260] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:03:49,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1897081336] [2024-11-14 05:03:49,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:03:49,770 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 05:03:49,770 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 05:03:49,772 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 05:03:49,773 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (29)] Waiting until timeout for monitored process [2024-11-14 05:03:52,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:03:52,928 INFO L255 TraceCheckSpWp]: Trace formula consists of 793 conjuncts, 62 conjuncts are in the unsatisfiable core [2024-11-14 05:03:52,937 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:03:52,978 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-14 05:03:52,978 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2024-11-14 05:03:53,403 INFO L349 Elim1Store]: treesize reduction 54, result has 29.9 percent of original size [2024-11-14 05:03:53,404 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 43 [2024-11-14 05:03:53,508 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-14 05:03:53,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 34 treesize of output 16 [2024-11-14 05:03:55,582 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 05:03:55,582 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 51 [2024-11-14 05:03:55,853 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 05:03:55,853 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 51 [2024-11-14 05:03:55,906 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 19 [2024-11-14 05:03:56,003 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 05:03:56,003 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:03:56,555 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2862 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3360 (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~mem33#1.base| v_ArrVal_3360))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2862)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-14 05:03:56,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1897081336] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:03:56,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1452946072] [2024-11-14 05:03:56,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:03:56,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:03:56,558 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:03:56,559 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:03:56,561 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2024-11-14 05:03:57,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:03:57,119 INFO L255 TraceCheckSpWp]: Trace formula consists of 793 conjuncts, 57 conjuncts are in the unsatisfiable core [2024-11-14 05:03:57,149 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:03:57,270 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-14 05:03:57,271 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 05:03:57,313 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 05:03:58,078 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 05:03:58,078 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 05:03:58,298 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 05:03:58,299 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 05:03:58,322 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 05:03:58,327 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 05:03:58,327 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:03:58,350 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3764 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_3764) |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 05:03:58,362 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3764 (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_3764) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-14 05:03:58,928 INFO L349 Elim1Store]: treesize reduction 7, result has 77.4 percent of original size [2024-11-14 05:03:58,929 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 05:03:58,945 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3764 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3810 (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~mem33#1.base| v_ArrVal_3810))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3764)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |c_ULTIMATE.start_main_#t~mem33#1.base|)) is different from false [2024-11-14 05:03:58,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1452946072] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:03:58,947 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:03:58,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 11] total 27 [2024-11-14 05:03:58,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001259350] [2024-11-14 05:03:58,948 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:03:58,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-14 05:03:58,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:03:58,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-14 05:03:58,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=736, Unknown=13, NotChecked=366, Total=1260 [2024-11-14 05:03:58,950 INFO L87 Difference]: Start difference. First operand 770 states and 818 transitions. Second operand has 28 states, 24 states have (on average 7.041666666666667) internal successors, (169), 27 states have internal predecessors, (169), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 05:04:11,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:04:11,018 INFO L93 Difference]: Finished difference Result 1419 states and 1512 transitions. [2024-11-14 05:04:11,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-14 05:04:11,019 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 24 states have (on average 7.041666666666667) internal successors, (169), 27 states have internal predecessors, (169), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 118 [2024-11-14 05:04:11,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:04:11,022 INFO L225 Difference]: With dead ends: 1419 [2024-11-14 05:04:11,023 INFO L226 Difference]: Without dead ends: 1419 [2024-11-14 05:04:11,023 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 381 GetRequests, 335 SyntacticMatches, 3 SemanticMatches, 43 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 464 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=221, Invalid=1272, Unknown=13, NotChecked=474, Total=1980 [2024-11-14 05:04:11,023 INFO L432 NwaCegarLoop]: 352 mSDtfsCounter, 898 mSDsluCounter, 4724 mSDsCounter, 0 mSdLazyCounter, 5247 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 904 SdHoareTripleChecker+Valid, 5076 SdHoareTripleChecker+Invalid, 5267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 5247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.5s IncrementalHoareTripleChecker+Time [2024-11-14 05:04:11,023 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [904 Valid, 5076 Invalid, 5267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 5247 Invalid, 0 Unknown, 0 Unchecked, 11.5s Time] [2024-11-14 05:04:11,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1419 states. [2024-11-14 05:04:11,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1419 to 769. [2024-11-14 05:04:11,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 769 states, 494 states have (on average 1.639676113360324) internal successors, (810), 763 states have internal predecessors, (810), 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 05:04:11,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 769 states to 769 states and 817 transitions. [2024-11-14 05:04:11,044 INFO L78 Accepts]: Start accepts. Automaton has 769 states and 817 transitions. Word has length 118 [2024-11-14 05:04:11,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:04:11,045 INFO L471 AbstractCegarLoop]: Abstraction has 769 states and 817 transitions. [2024-11-14 05:04:11,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 24 states have (on average 7.041666666666667) internal successors, (169), 27 states have internal predecessors, (169), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 05:04:11,045 INFO L276 IsEmpty]: Start isEmpty. Operand 769 states and 817 transitions. [2024-11-14 05:04:11,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-14 05:04:11,046 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:04:11,046 INFO L215 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:04:11,082 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2024-11-14 05:04:11,260 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/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 (28)] Ended with exit code 0 [2024-11-14 05:04:11,457 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (29)] Ended with exit code 0 [2024-11-14 05:04:11,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt [2024-11-14 05:04:11,648 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-14 05:04:11,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:04:11,648 INFO L85 PathProgramCache]: Analyzing trace with hash 1538876696, now seen corresponding path program 1 times [2024-11-14 05:04:11,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:04:11,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1942199254] [2024-11-14 05:04:11,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:04:11,649 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 05:04:11,649 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:04:11,651 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/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 05:04:11,652 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/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 (31)] Waiting until timeout for monitored process [2024-11-14 05:04:12,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:04:12,561 INFO L255 TraceCheckSpWp]: Trace formula consists of 793 conjuncts, 110 conjuncts are in the unsatisfiable core [2024-11-14 05:04:12,572 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:04:12,575 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-14 05:04:12,714 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-14 05:04:12,714 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 05:04:12,723 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 05:04:12,747 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 05:04:12,756 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 05:04:12,868 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-14 05:04:12,873 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 05:04:13,727 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 05:04:13,728 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 05:04:13,737 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 05:04:13,866 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 05:04:13,866 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 05:04:13,873 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 05:04:13,906 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 05:04:13,914 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 05:04:13,942 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 05:04:13,943 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:04:14,081 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4261 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4261) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_4261 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4262 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4261) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4262) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-14 05:04:14,107 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_4261 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4262 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_4261) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_4262) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_4261 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_4261) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse2) (bvadd (_ bv8 32) .cse2))))))) is different from false [2024-11-14 05:04:15,538 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4261 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4354 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4353 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4354) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4353) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4261) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_4261 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4354 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4262 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4353 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4353))) (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~mem33#1.base| v_ArrVal_4354) .cse2 v_ArrVal_4261) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_4262) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2024-11-14 05:04:15,547 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:04:15,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1942199254] [2024-11-14 05:04:15,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1942199254] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:04:15,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1409565852] [2024-11-14 05:04:15,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:04:15,548 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 05:04:15,548 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 05:04:15,550 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 05:04:15,551 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (32)] Waiting until timeout for monitored process [2024-11-14 05:05:50,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:05:50,685 INFO L255 TraceCheckSpWp]: Trace formula consists of 793 conjuncts, 111 conjuncts are in the unsatisfiable core [2024-11-14 05:05:50,699 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:05:50,706 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 05:05:50,887 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-14 05:05:50,887 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 05:05:50,901 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 05:05:50,920 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 05:05:50,928 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 05:05:51,001 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 05:05:51,005 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 05:05:51,758 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 05:05:51,758 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 05:05:51,764 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 05:05:51,834 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 05:05:51,835 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 05:05:51,840 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 05:05:51,868 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-14 05:05:51,875 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 05:05:51,879 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 05:05:51,879 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:05:51,951 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4806 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4806) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_4805 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4806 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4806) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4805) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-14 05:05:51,984 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_4806 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_4806) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_4805 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4806 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_4806) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_4805) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2024-11-14 05:05:53,402 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4805 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4898 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4897 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4806 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4897))) (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~mem33#1.base| v_ArrVal_4898) .cse0 v_ArrVal_4806) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_4805) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_4898 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4897 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4806 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4898) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4897) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4806) |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 05:05:53,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1409565852] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:05:53,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1147428551] [2024-11-14 05:05:53,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:05:53,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:05:53,409 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:05:53,411 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:05:53,412 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2024-11-14 05:05:54,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:05:54,047 INFO L255 TraceCheckSpWp]: Trace formula consists of 793 conjuncts, 109 conjuncts are in the unsatisfiable core [2024-11-14 05:05:54,060 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:05:54,181 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 05:05:54,199 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-14 05:05:54,199 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 05:05:54,217 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 05:05:54,229 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 05:05:54,321 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 05:05:54,330 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 05:05:54,991 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 05:05:54,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 62 treesize of output 57 [2024-11-14 05:05:54,997 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-14 05:05:55,076 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 05:05:55,076 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 05:05:55,084 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-14 05:05:55,122 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-14 05:05:55,131 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 05:05:55,135 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 05:05:55,136 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:05:55,213 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5348 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_5348) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_5348 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5349 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_5348) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_5349) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-14 05:05:55,253 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_5348 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_5348) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_5348 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5349 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_5348) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_5349) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2024-11-14 05:05:56,639 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5348 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5349 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5440 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5441 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_5441))) (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~mem33#1.base| v_ArrVal_5440) .cse0 v_ArrVal_5348) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_5349) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_5348 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5440 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5441 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_5440) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_5441) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5348) |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 05:05:56,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1147428551] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:05:56,646 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:05:56,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 9 [2024-11-14 05:05:56,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233054234] [2024-11-14 05:05:56,646 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:05:56,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-14 05:05:56,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:05:56,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-14 05:05:56,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=113, Unknown=9, NotChecked=252, Total=420 [2024-11-14 05:05:56,647 INFO L87 Difference]: Start difference. First operand 769 states and 817 transitions. Second operand has 10 states, 8 states have (on average 9.625) internal successors, (77), 10 states have internal predecessors, (77), 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 05:06:04,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:06:04,969 INFO L93 Difference]: Finished difference Result 768 states and 816 transitions. [2024-11-14 05:06:04,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-14 05:06:04,969 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 9.625) internal successors, (77), 10 states have internal predecessors, (77), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 118 [2024-11-14 05:06:04,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:06:04,972 INFO L225 Difference]: With dead ends: 768 [2024-11-14 05:06:04,972 INFO L226 Difference]: Without dead ends: 768 [2024-11-14 05:06:04,972 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 377 GetRequests, 348 SyntacticMatches, 5 SemanticMatches, 24 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=77, Invalid=222, Unknown=9, NotChecked=342, Total=650 [2024-11-14 05:06:04,972 INFO L432 NwaCegarLoop]: 446 mSDtfsCounter, 369 mSDsluCounter, 1886 mSDsCounter, 0 mSdLazyCounter, 3240 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 371 SdHoareTripleChecker+Valid, 2332 SdHoareTripleChecker+Invalid, 3247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 3240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.1s IncrementalHoareTripleChecker+Time [2024-11-14 05:06:04,973 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [371 Valid, 2332 Invalid, 3247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 3240 Invalid, 0 Unknown, 0 Unchecked, 8.1s Time] [2024-11-14 05:06:04,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 768 states. [2024-11-14 05:06:04,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 768 to 768. [2024-11-14 05:06:04,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 768 states, 494 states have (on average 1.6376518218623481) internal successors, (809), 762 states have internal predecessors, (809), 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 05:06:04,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 768 states to 768 states and 816 transitions. [2024-11-14 05:06:04,986 INFO L78 Accepts]: Start accepts. Automaton has 768 states and 816 transitions. Word has length 118 [2024-11-14 05:06:04,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:06:04,987 INFO L471 AbstractCegarLoop]: Abstraction has 768 states and 816 transitions. [2024-11-14 05:06:04,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 9.625) internal successors, (77), 10 states have internal predecessors, (77), 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 05:06:04,987 INFO L276 IsEmpty]: Start isEmpty. Operand 768 states and 816 transitions. [2024-11-14 05:06:04,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-14 05:06:04,988 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:06:04,988 INFO L215 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:06:05,021 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Ended with exit code 0 [2024-11-14 05:06:05,197 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/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 (31)] Forceful destruction successful, exit code 0 [2024-11-14 05:06:05,424 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (32)] Ended with exit code 0 [2024-11-14 05:06:05,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt [2024-11-14 05:06:05,590 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-14 05:06:05,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:06:05,590 INFO L85 PathProgramCache]: Analyzing trace with hash 194986281, now seen corresponding path program 1 times [2024-11-14 05:06:05,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:06:05,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1081075215] [2024-11-14 05:06:05,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:06:05,590 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 05:06:05,590 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:06:05,592 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/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 05:06:05,593 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/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 (34)] Waiting until timeout for monitored process [2024-11-14 05:06:06,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:06:06,594 INFO L255 TraceCheckSpWp]: Trace formula consists of 822 conjuncts, 61 conjuncts are in the unsatisfiable core [2024-11-14 05:06:06,602 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:06:06,605 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 05:06:06,744 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-14 05:06:06,744 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 05:06:06,776 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 05:06:06,884 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2024-11-14 05:06:07,918 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 05:06:07,919 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2024-11-14 05:06:08,074 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 05:06:08,074 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 05:06:08,201 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 05:06:08,201 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 05:06:08,232 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 05:06:08,277 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 05:06:08,277 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:06:08,343 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5863 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_5863) |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 05:06:08,351 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5863 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_5863) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2024-11-14 05:06:08,365 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5862 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5863 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_5862))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5863)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (_ bv0 1))) is different from false [2024-11-14 05:06:08,379 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5862 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5863 (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_5862))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5863)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-14 05:06:08,821 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5862 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5863 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5909 (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~mem33#1.base| v_ArrVal_5909))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5862)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5863)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-14 05:06:08,825 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:06:08,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1081075215] [2024-11-14 05:06:08,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1081075215] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:06:08,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [358680081] [2024-11-14 05:06:08,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:06:08,825 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 05:06:08,826 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 05:06:08,827 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 05:06:08,829 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (35)] Waiting until timeout for monitored process [2024-11-14 05:06:30,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:06:30,123 INFO L255 TraceCheckSpWp]: Trace formula consists of 822 conjuncts, 64 conjuncts are in the unsatisfiable core [2024-11-14 05:06:30,131 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:06:30,188 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-14 05:06:30,189 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2024-11-14 05:06:30,572 INFO L349 Elim1Store]: treesize reduction 54, result has 29.9 percent of original size [2024-11-14 05:06:30,572 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 43 [2024-11-14 05:06:30,643 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-14 05:06:30,872 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 16 [2024-11-14 05:06:32,325 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 05:06:32,326 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 51 [2024-11-14 05:06:32,521 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 05:06:32,521 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 51 [2024-11-14 05:06:32,664 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 05:06:32,664 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 51 [2024-11-14 05:06:32,714 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 19 [2024-11-14 05:06:32,807 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 05:06:32,807 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:06:32,930 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6331 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_6331) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)) (_ bv0 1))) is different from false [2024-11-14 05:06:32,950 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6330 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6331 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_6330))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6331)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2024-11-14 05:06:32,964 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6330 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6331 (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_6330))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6331)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-14 05:06:33,442 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6330 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6331 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6377 (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~mem33#1.base| v_ArrVal_6377))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6330)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6331)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-14 05:06:33,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [358680081] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:06:33,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1958905281] [2024-11-14 05:06:33,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:06:33,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:06:33,445 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:06:33,447 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:06:33,448 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2024-11-14 05:06:34,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:06:34,159 INFO L255 TraceCheckSpWp]: Trace formula consists of 822 conjuncts, 60 conjuncts are in the unsatisfiable core [2024-11-14 05:06:34,168 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:06:34,170 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 05:06:34,284 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-14 05:06:34,285 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 05:06:34,327 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 05:06:35,049 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 05:06:35,049 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 05:06:35,205 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 05:06:35,206 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 05:06:35,321 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 05:06:35,321 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 05:06:35,341 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2024-11-14 05:06:35,344 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 05:06:35,345 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:06:35,458 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6797 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6331 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_6797))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6331)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2024-11-14 05:06:35,468 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6797 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6331 (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_6797))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6331)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-14 05:06:35,905 INFO L349 Elim1Store]: treesize reduction 7, result has 87.3 percent of original size [2024-11-14 05:06:35,905 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 05:06:35,916 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6844 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6797 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6331 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_#t~mem33#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~mem33#1.base| v_ArrVal_6844))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6797)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6331)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) is different from false [2024-11-14 05:06:35,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1958905281] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:06:35,919 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:06:35,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 12] total 30 [2024-11-14 05:06:35,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295846346] [2024-11-14 05:06:35,919 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:06:35,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-11-14 05:06:35,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:06:35,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-11-14 05:06:35,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=902, Unknown=20, NotChecked=876, Total=1980 [2024-11-14 05:06:35,921 INFO L87 Difference]: Start difference. First operand 768 states and 816 transitions. Second operand has 31 states, 27 states have (on average 6.481481481481482) internal successors, (175), 30 states have internal predecessors, (175), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 05:06:49,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:06:49,654 INFO L93 Difference]: Finished difference Result 1415 states and 1508 transitions. [2024-11-14 05:06:49,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-14 05:06:49,655 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 27 states have (on average 6.481481481481482) internal successors, (175), 30 states have internal predecessors, (175), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 121 [2024-11-14 05:06:49,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:06:49,658 INFO L225 Difference]: With dead ends: 1415 [2024-11-14 05:06:49,658 INFO L226 Difference]: Without dead ends: 1415 [2024-11-14 05:06:49,658 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 399 GetRequests, 344 SyntacticMatches, 3 SemanticMatches, 52 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 561 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=258, Invalid=1492, Unknown=20, NotChecked=1092, Total=2862 [2024-11-14 05:06:49,659 INFO L432 NwaCegarLoop]: 351 mSDtfsCounter, 882 mSDsluCounter, 5697 mSDsCounter, 0 mSdLazyCounter, 6343 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 888 SdHoareTripleChecker+Valid, 6048 SdHoareTripleChecker+Invalid, 6363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 6343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.2s IncrementalHoareTripleChecker+Time [2024-11-14 05:06:49,659 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [888 Valid, 6048 Invalid, 6363 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [20 Valid, 6343 Invalid, 0 Unknown, 0 Unchecked, 13.2s Time] [2024-11-14 05:06:49,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1415 states. [2024-11-14 05:06:49,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1415 to 767. [2024-11-14 05:06:49,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 767 states, 494 states have (on average 1.6356275303643724) internal successors, (808), 761 states have internal predecessors, (808), 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 05:06:49,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 767 states to 767 states and 815 transitions. [2024-11-14 05:06:49,675 INFO L78 Accepts]: Start accepts. Automaton has 767 states and 815 transitions. Word has length 121 [2024-11-14 05:06:49,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:06:49,675 INFO L471 AbstractCegarLoop]: Abstraction has 767 states and 815 transitions. [2024-11-14 05:06:49,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 27 states have (on average 6.481481481481482) internal successors, (175), 30 states have internal predecessors, (175), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 05:06:49,676 INFO L276 IsEmpty]: Start isEmpty. Operand 767 states and 815 transitions. [2024-11-14 05:06:49,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-14 05:06:49,677 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:06:49,677 INFO L215 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:06:49,707 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Ended with exit code 0 [2024-11-14 05:06:49,886 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/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 (34)] Ended with exit code 0 [2024-11-14 05:06:50,097 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (35)] Ended with exit code 0 [2024-11-14 05:06:50,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt [2024-11-14 05:06:50,278 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-14 05:06:50,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:06:50,278 INFO L85 PathProgramCache]: Analyzing trace with hash 194986282, now seen corresponding path program 1 times [2024-11-14 05:06:50,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:06:50,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1502106222] [2024-11-14 05:06:50,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:06:50,279 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 05:06:50,279 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:06:50,284 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/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 05:06:50,285 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/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)] Waiting until timeout for monitored process [2024-11-14 05:06:51,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:06:51,311 INFO L255 TraceCheckSpWp]: Trace formula consists of 822 conjuncts, 113 conjuncts are in the unsatisfiable core [2024-11-14 05:06:51,321 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:06:51,323 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 05:06:51,437 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-14 05:06:51,437 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-14 05:06:51,443 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 05:06:51,463 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-14 05:06:51,471 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 05:06:51,572 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-14 05:06:51,576 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 05:06:52,272 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 05:06:52,272 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 05:06:52,283 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 05:06:52,384 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 05:06:52,384 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 05:06:52,390 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 05:06:52,492 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 05:06:52,492 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 05:06:52,501 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 05:06:52,529 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 05:06:52,536 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 05:06:52,567 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 05:06:52,567 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:06:52,705 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7312 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7312) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd (_ bv12 32) .cse0)))) (forall ((v_ArrVal_7313 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7312 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv12 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7312) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7313) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-14 05:06:52,728 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_7312 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_7312) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7313 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7312 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_7312) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_7313) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2024-11-14 05:06:52,774 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7313 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7310 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7311 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7312 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7311))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv12 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7310) .cse0 v_ArrVal_7312) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_7313) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_7310 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7311 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7312 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7310) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7311) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7312) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse3) (bvadd (_ bv12 32) .cse3)))))) is different from false [2024-11-14 05:06:52,834 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_7310 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7311 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7312 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_7310) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_7311) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_7312) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd (_ bv12 32) .cse0)))) (forall ((v_ArrVal_7313 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7310 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7311 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7312 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_7311))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv12 32) (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_7310) .cse3 v_ArrVal_7312) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_7313) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false [2024-11-14 05:06:54,271 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7405 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7404 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7310 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7311 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7312 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_7405))) (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~mem33#1.base| v_ArrVal_7404) .cse1 v_ArrVal_7310) (select (select (store .cse2 .cse1 v_ArrVal_7311) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_7312))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7405 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7313 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7404 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7310 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7311 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7312 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_7405))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_7311))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_7404) .cse4 v_ArrVal_7310) .cse5 v_ArrVal_7312) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv12 32)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_7313) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) is different from false [2024-11-14 05:06:54,282 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:06:54,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1502106222] [2024-11-14 05:06:54,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1502106222] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:06:54,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [877048807] [2024-11-14 05:06:54,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:06:54,283 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 05:06:54,283 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 05:06:54,284 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 05:06:54,286 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (38)] Waiting until timeout for monitored process [2024-11-14 05:10:54,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:10:55,226 INFO L255 TraceCheckSpWp]: Trace formula consists of 822 conjuncts, 115 conjuncts are in the unsatisfiable core [2024-11-14 05:10:55,241 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:10:55,246 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 05:10:55,413 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 05:10:55,426 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-14 05:10:55,426 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 05:10:55,436 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 05:10:55,443 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 05:10:55,522 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 05:10:55,528 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 05:10:56,221 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 05:10:56,221 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 05:10:56,228 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 05:10:56,315 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 05:10:56,315 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 05:10:56,321 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 05:10:56,379 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 05:10:56,379 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 05:10:56,386 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 05:10:56,414 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 05:10:56,420 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 05:10:56,425 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 05:10:56,425 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:10:56,475 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7874 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7873 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv12 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7874) |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_7873) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_7874 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7874) |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 05:10:56,498 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_7874 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_7874) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7874 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7873 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_7874) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_7873) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2024-11-14 05:10:56,540 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7874 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7873 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7872 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7871 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7872))) (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~mem35#1.base| v_ArrVal_7871) .cse0 v_ArrVal_7874) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_7873) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_7874 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7872 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7871 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7871) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7872) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7874) |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 05:10:56,582 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_7874 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7872 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7871 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_7871) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_7872) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_7874) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd (_ bv12 32) .cse0)))) (forall ((v_ArrVal_7874 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7873 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7872 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7871 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_7872))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv12 32) (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_7871) .cse3 v_ArrVal_7874) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_7873) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false [2024-11-14 05:10:59,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [877048807] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:10:59,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1061045275] [2024-11-14 05:10:59,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:10:59,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:10:59,076 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:10:59,078 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:10:59,078 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2024-11-14 05:10:59,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:10:59,829 INFO L255 TraceCheckSpWp]: Trace formula consists of 822 conjuncts, 113 conjuncts are in the unsatisfiable core [2024-11-14 05:10:59,840 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:10:59,845 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 05:11:00,154 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 05:11:00,185 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-14 05:11:00,186 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 05:11:00,203 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 05:11:00,219 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 05:11:00,337 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 05:11:00,346 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 05:11:01,826 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 05:11:01,826 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 05:11:01,835 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 05:11:01,983 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 05:11:01,983 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 05:11:01,992 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 05:11:02,113 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 05:11:02,113 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 05:11:02,122 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 05:11:02,211 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 05:11:02,227 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 05:11:02,238 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 05:11:02,238 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:11:02,380 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8435 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8434 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv12 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_8435) |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_8434) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_8435 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_8435) |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 05:11:02,440 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_8435 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8434 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv12 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_8435) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_8434) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_8435 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_8435) |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 05:11:02,548 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8435 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8433 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8432 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_8432) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_8433) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8435) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd (_ bv12 32) .cse0)))) (forall ((v_ArrVal_8435 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8434 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8433 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8432 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_8433))) (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~mem35#1.base| v_ArrVal_8432) .cse2 v_ArrVal_8435) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_8434) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2024-11-14 05:11:02,616 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_8435 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8433 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8432 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_8432) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_8433) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_8435) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd (_ bv12 32) .cse0)))) (forall ((v_ArrVal_8435 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8434 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8433 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8432 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_8433))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv12 32) (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_8432) .cse3 v_ArrVal_8435) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_8434) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false [2024-11-14 05:11:05,035 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8527 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8526 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8435 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8434 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8433 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8432 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_8527))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_8433))) (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~mem33#1.base| v_ArrVal_8526) .cse0 v_ArrVal_8432) .cse1 v_ArrVal_8435) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_8434) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_8527 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8526 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8435 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8433 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8432 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_8527))) (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~mem33#1.base| v_ArrVal_8526) .cse6 v_ArrVal_8432) (select (select (store .cse7 .cse6 v_ArrVal_8433) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_8435))) |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 05:11:05,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1061045275] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:11:05,052 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:11:05,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 10 [2024-11-14 05:11:05,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110192475] [2024-11-14 05:11:05,052 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:11:05,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-14 05:11:05,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:11:05,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-14 05:11:05,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=152, Unknown=23, NotChecked=518, Total=756 [2024-11-14 05:11:05,053 INFO L87 Difference]: Start difference. First operand 767 states and 815 transitions. Second operand has 11 states, 9 states have (on average 8.555555555555555) internal successors, (77), 11 states have internal predecessors, (77), 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 05:11:25,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:11:25,146 INFO L93 Difference]: Finished difference Result 766 states and 814 transitions. [2024-11-14 05:11:25,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-14 05:11:25,149 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 8.555555555555555) internal successors, (77), 11 states have internal predecessors, (77), 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 121 [2024-11-14 05:11:25,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:11:25,152 INFO L225 Difference]: With dead ends: 766 [2024-11-14 05:11:25,152 INFO L226 Difference]: Without dead ends: 766 [2024-11-14 05:11:25,152 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 396 GetRequests, 359 SyntacticMatches, 5 SemanticMatches, 32 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=102, Invalid=308, Unknown=26, NotChecked=686, Total=1122 [2024-11-14 05:11:25,154 INFO L432 NwaCegarLoop]: 445 mSDtfsCounter, 367 mSDsluCounter, 2131 mSDsCounter, 0 mSdLazyCounter, 3643 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 2576 SdHoareTripleChecker+Invalid, 3650 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 3643 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.1s IncrementalHoareTripleChecker+Time [2024-11-14 05:11:25,154 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [369 Valid, 2576 Invalid, 3650 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 3643 Invalid, 0 Unknown, 0 Unchecked, 18.1s Time] [2024-11-14 05:11:25,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 766 states. [2024-11-14 05:11:25,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 766 to 766. [2024-11-14 05:11:25,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 766 states, 494 states have (on average 1.6336032388663968) internal successors, (807), 760 states have internal predecessors, (807), 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 05:11:25,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 766 states to 766 states and 814 transitions. [2024-11-14 05:11:25,169 INFO L78 Accepts]: Start accepts. Automaton has 766 states and 814 transitions. Word has length 121 [2024-11-14 05:11:25,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:11:25,170 INFO L471 AbstractCegarLoop]: Abstraction has 766 states and 814 transitions. [2024-11-14 05:11:25,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 8.555555555555555) internal successors, (77), 11 states have internal predecessors, (77), 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 05:11:25,170 INFO L276 IsEmpty]: Start isEmpty. Operand 766 states and 814 transitions. [2024-11-14 05:11:25,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-14 05:11:25,172 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:11:25,172 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] [2024-11-14 05:11:25,187 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/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)] Ended with exit code 0 [2024-11-14 05:11:25,394 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Ended with exit code 0 [2024-11-14 05:11:25,629 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (38)] Ended with exit code 0 [2024-11-14 05:11:25,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/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,39 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,38 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt [2024-11-14 05:11:25,773 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr84REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-14 05:11:25,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:11:25,773 INFO L85 PathProgramCache]: Analyzing trace with hash 2040803070, now seen corresponding path program 1 times [2024-11-14 05:11:25,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:11:25,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [108614817] [2024-11-14 05:11:25,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:11:25,774 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 05:11:25,774 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:11:25,776 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/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 05:11:25,778 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/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 (40)] Waiting until timeout for monitored process [2024-11-14 05:11:26,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:11:27,024 INFO L255 TraceCheckSpWp]: Trace formula consists of 851 conjuncts, 63 conjuncts are in the unsatisfiable core [2024-11-14 05:11:27,032 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:11:27,041 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 05:11:27,553 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-14 05:11:27,553 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 05:11:27,632 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 05:11:27,884 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2024-11-14 05:11:30,163 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 05:11:30,163 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 05:11:30,453 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 05:11:30,453 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 05:11:30,690 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 05:11:30,691 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 05:11:30,940 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 05:11:30,940 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2024-11-14 05:11:31,003 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 05:11:31,111 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 05:11:31,111 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:11:31,423 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8965 (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_8965) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-14 05:11:31,456 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8965 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8964 (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_8964))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8965)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-14 05:11:31,479 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8965 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8964 (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_8964))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8965)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-14 05:11:31,514 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8965 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8964 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8963 (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~mem35#1.base| v_ArrVal_8963))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8964)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8965)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-14 05:11:31,541 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8965 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8964 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8963 (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_8963))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8964)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8965)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-14 05:11:32,323 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9011 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8965 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8964 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8963 (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~mem33#1.base| v_ArrVal_9011))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8963)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8964)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8965)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-14 05:11:32,329 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:11:32,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [108614817] [2024-11-14 05:11:32,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [108614817] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:11:32,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2011264534] [2024-11-14 05:11:32,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:11:32,330 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 05:11:32,330 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 05:11:32,332 INFO L229 MonitoredProcess]: Starting monitored process 41 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 05:11:32,333 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (41)] Waiting until timeout for monitored process [2024-11-14 05:12:32,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:12:33,026 INFO L255 TraceCheckSpWp]: Trace formula consists of 851 conjuncts, 66 conjuncts are in the unsatisfiable core [2024-11-14 05:12:33,036 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:12:33,202 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-14 05:12:33,202 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2024-11-14 05:12:34,290 INFO L349 Elim1Store]: treesize reduction 54, result has 29.9 percent of original size [2024-11-14 05:12:34,290 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 43 [2024-11-14 05:12:34,477 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-14 05:12:35,052 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 16 [2024-11-14 05:12:38,522 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 05:12:38,522 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 51 [2024-11-14 05:12:39,042 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 05:12:39,042 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 51 [2024-11-14 05:12:39,452 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 05:12:39,452 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 51 [2024-11-14 05:12:39,935 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 05:12:39,935 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 51 [2024-11-14 05:12:40,042 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 19 [2024-11-14 05:12:40,242 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 05:12:40,242 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:12:40,454 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8965 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9448 (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_9448))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8965)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-14 05:12:40,477 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8965 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9448 (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_9448))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8965)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-14 05:12:40,513 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8965 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9448 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9447 (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~mem35#1.base| v_ArrVal_9447))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9448)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8965)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-14 05:12:40,539 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8965 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9448 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9447 (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_9447))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9448)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8965)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-14 05:12:41,318 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9495 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8965 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9448 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9447 (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~mem33#1.base| v_ArrVal_9495))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9447)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9448)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8965)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-14 05:12:41,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2011264534] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:12:41,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [641018597] [2024-11-14 05:12:41,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:12:41,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:12:41,326 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:12:41,328 INFO L229 MonitoredProcess]: Starting monitored process 42 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:12:41,329 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2024-11-14 05:12:42,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:12:42,198 INFO L255 TraceCheckSpWp]: Trace formula consists of 851 conjuncts, 61 conjuncts are in the unsatisfiable core [2024-11-14 05:12:42,205 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:12:42,650 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-14 05:12:42,651 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-14 05:12:42,784 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 05:12:44,025 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 05:12:44,025 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 05:12:44,266 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 05:12:44,266 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 05:12:44,519 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 05:12:44,519 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-11-14 05:12:44,776 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 05:12:44,776 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 05:12:44,979 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 05:12:44,994 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 05:12:44,994 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:12:45,059 INFO L349 Elim1Store]: treesize reduction 7, result has 63.2 percent of original size [2024-11-14 05:12:45,059 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 05:12:45,331 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9931 (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_9931) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) is different from false [2024-11-14 05:12:45,363 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9931 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9930 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_9930)) (.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_9931) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))) is different from false [2024-11-14 05:12:45,386 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9931 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9930 (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_9930))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= (select (select (store .cse0 .cse1 v_ArrVal_9931) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) .cse1))))) is different from false [2024-11-14 05:12:45,422 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9929 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9931 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9930 (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~mem35#1.base| v_ArrVal_9929))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_9930)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_9931) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) is different from false [2024-11-14 05:12:45,449 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9929 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9931 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9930 (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| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_9929))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_9930)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_9931) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) is different from false [2024-11-14 05:12:46,236 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9929 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9977 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9931 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9930 (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~mem33#1.base| v_ArrVal_9977))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_9929)))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_9930)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_9931) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) is different from false [2024-11-14 05:12:46,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [641018597] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:12:46,244 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:12:46,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 12] total 32 [2024-11-14 05:12:46,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483078137] [2024-11-14 05:12:46,244 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:12:46,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-11-14 05:12:46,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 05:12:46,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-11-14 05:12:46,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=1070, Unknown=42, NotChecked=1428, Total=2756 [2024-11-14 05:12:46,247 INFO L87 Difference]: Start difference. First operand 766 states and 814 transitions. Second operand has 33 states, 29 states have (on average 6.448275862068965) internal successors, (187), 33 states have internal predecessors, (187), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 05:13:13,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:13:13,269 INFO L93 Difference]: Finished difference Result 1411 states and 1504 transitions. [2024-11-14 05:13:13,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-14 05:13:13,270 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 29 states have (on average 6.448275862068965) internal successors, (187), 33 states have internal predecessors, (187), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 124 [2024-11-14 05:13:13,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:13:13,274 INFO L225 Difference]: With dead ends: 1411 [2024-11-14 05:13:13,274 INFO L226 Difference]: Without dead ends: 1411 [2024-11-14 05:13:13,275 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 412 GetRequests, 354 SyntacticMatches, 3 SemanticMatches, 55 ConstructedPredicates, 17 IntricatePredicates, 0 DeprecatedPredicates, 513 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=252, Invalid=1334, Unknown=42, NotChecked=1564, Total=3192 [2024-11-14 05:13:13,275 INFO L432 NwaCegarLoop]: 351 mSDtfsCounter, 1462 mSDsluCounter, 5147 mSDsCounter, 0 mSdLazyCounter, 5673 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1468 SdHoareTripleChecker+Valid, 5498 SdHoareTripleChecker+Invalid, 5701 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 5673 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 26.3s IncrementalHoareTripleChecker+Time [2024-11-14 05:13:13,275 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1468 Valid, 5498 Invalid, 5701 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [28 Valid, 5673 Invalid, 0 Unknown, 0 Unchecked, 26.3s Time] [2024-11-14 05:13:13,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1411 states. [2024-11-14 05:13:13,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1411 to 765. [2024-11-14 05:13:13,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 765 states, 494 states have (on average 1.631578947368421) internal successors, (806), 759 states have internal predecessors, (806), 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 05:13:13,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 765 states to 765 states and 813 transitions. [2024-11-14 05:13:13,289 INFO L78 Accepts]: Start accepts. Automaton has 765 states and 813 transitions. Word has length 124 [2024-11-14 05:13:13,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:13:13,290 INFO L471 AbstractCegarLoop]: Abstraction has 765 states and 813 transitions. [2024-11-14 05:13:13,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 29 states have (on average 6.448275862068965) internal successors, (187), 33 states have internal predecessors, (187), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 05:13:13,290 INFO L276 IsEmpty]: Start isEmpty. Operand 765 states and 813 transitions. [2024-11-14 05:13:13,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-14 05:13:13,291 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:13:13,292 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] [2024-11-14 05:13:13,338 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (41)] Forceful destruction successful, exit code 0 [2024-11-14 05:13:13,502 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/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 (40)] Ended with exit code 0 [2024-11-14 05:13:13,714 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Ended with exit code 0 [2024-11-14 05:13:13,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt,40 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/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_58318249-dc9e-4836-b971-3f943cb7309f/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:13:13,893 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr85REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-14 05:13:13,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:13:13,893 INFO L85 PathProgramCache]: Analyzing trace with hash 2040803071, now seen corresponding path program 1 times [2024-11-14 05:13:13,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 05:13:13,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2129259028] [2024-11-14 05:13:13,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:13:13,894 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 05:13:13,894 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 05:13:13,896 INFO L229 MonitoredProcess]: Starting monitored process 43 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/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 05:13:13,897 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/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 (43)] Waiting until timeout for monitored process [2024-11-14 05:13:15,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:13:15,156 INFO L255 TraceCheckSpWp]: Trace formula consists of 851 conjuncts, 117 conjuncts are in the unsatisfiable core [2024-11-14 05:13:15,167 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:13:15,186 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 05:13:16,002 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-14 05:13:16,002 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 05:13:16,025 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 05:13:16,087 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-14 05:13:16,096 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 05:13:16,387 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2024-11-14 05:13:16,396 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-14 05:13:17,996 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-14 05:13:17,996 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2024-11-14 05:13:18,007 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-14 05:13:18,285 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-14 05:13:18,286 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2024-11-14 05:13:18,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 24 treesize of output 11 [2024-11-14 05:13:18,528 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-14 05:13:18,528 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2024-11-14 05:13:18,537 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-14 05:13:18,803 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-14 05:13:18,803 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2024-11-14 05:13:18,813 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-14 05:13:18,895 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-14 05:13:18,903 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-14 05:13:18,984 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 05:13:18,984 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:13:19,280 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_10462 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_10462) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv20 32) .cse0) (bvadd (_ bv24 32) .cse0)))) (forall ((v_ArrVal_10462 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10463 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv24 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_10462) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_10463) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-14 05:13:19,325 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_10462 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_10462) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv20 32) .cse0) (bvadd (_ bv24 32) .cse0)))) (forall ((v_ArrVal_10462 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10463 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv24 32) (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_10462) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_10463) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2024-11-14 05:13:19,436 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_10461 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10462 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10460 (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_10460) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_10461) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10462) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_10461 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10462 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10460 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10463 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_10461))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_10460) .cse2 v_ArrVal_10462) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_10463) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2024-11-14 05:13:19,583 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_10461 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10462 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10460 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_10460) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_10461) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_10462) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv20 32) .cse0) (bvadd (_ bv24 32) .cse0)))) (forall ((v_ArrVal_10461 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10462 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10460 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10463 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_10461))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv24 32) (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_10460) .cse3 v_ArrVal_10462) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_10463) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false [2024-11-14 05:13:19,709 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_10461 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10462 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10460 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10458 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10459 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_10458))) (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~mem35#1.base| v_ArrVal_10459) .cse1 v_ArrVal_10460) (select (select (store .cse2 .cse1 v_ArrVal_10461) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_10462))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv20 32) .cse0) (bvadd (_ bv24 32) .cse0)))) (forall ((v_ArrVal_10461 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10462 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10460 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10463 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10458 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10459 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_10458))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_10461))) (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~mem35#1.base| v_ArrVal_10459) .cse4 v_ArrVal_10460) .cse5 v_ArrVal_10462) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_10463) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) is different from false [2024-11-14 05:13:19,856 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_10461 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10462 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10460 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10463 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10458 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10459 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_10458))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_10461))) (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_10459) .cse1 v_ArrVal_10460) .cse2 v_ArrVal_10462) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_10463) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))) (forall ((v_ArrVal_10461 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10462 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10460 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10458 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10459 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (select (select (let ((.cse8 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_10458))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_10459) .cse7 v_ArrVal_10460) (select (select (store .cse8 .cse7 v_ArrVal_10461) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_10462))) |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 05:13:22,134 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_10461 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10462 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10460 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10554 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10463 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10458 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10459 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10555 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_10554))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_10458))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_10461))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_10555) .cse0 v_ArrVal_10459) .cse1 v_ArrVal_10460) .cse2 v_ArrVal_10462) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv24 32)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_10463) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) (forall ((v_ArrVal_10461 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10462 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10460 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10554 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10458 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10459 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10555 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (select (select (let ((.cse11 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_10554))) (let ((.cse8 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse10 (store .cse11 .cse8 v_ArrVal_10458))) (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~mem33#1.base| v_ArrVal_10555) .cse8 v_ArrVal_10459) .cse9 v_ArrVal_10460) (select (select (store .cse10 .cse9 v_ArrVal_10461) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_10462))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd .cse7 (_ bv20 32)) (bvadd .cse7 (_ bv24 32))))))) is different from false [2024-11-14 05:13:22,154 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 05:13:22,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2129259028] [2024-11-14 05:13:22,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2129259028] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:13:22,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [341817083] [2024-11-14 05:13:22,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:13:22,154 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 05:13:22,154 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 05:13:22,156 INFO L229 MonitoredProcess]: Starting monitored process 44 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 05:13:22,158 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58318249-dc9e-4836-b971-3f943cb7309f/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (44)] Waiting until timeout for monitored process