./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test1-2.i --full-output --architecture 32bit
--------------------------------------------------------------------------------
Checking for memory safety (deref-memtrack)
Using default analysis
Version d790fecc
Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test1-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) )
CHECK( init(main()), LTL(G valid-deref) )
CHECK( init(main()), LTL(G valid-memtrack) )
--witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bfb70cce6cd508003f6161c30aa2ac99ac8ddeb6209ddd86b65ca0c623c2fb1c
--- Real Ultimate output ---
This is Ultimate 0.3.0-dev-d790fec
[2024-11-28 05:10:26,152 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2024-11-28 05:10:26,237 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf
[2024-11-28 05:10:26,243 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2024-11-28 05:10:26,246 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-28 05:10:26,282 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-28 05:10:26,283 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-28 05:10:26,283 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-28 05:10:26,284 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-28 05:10:26,284 INFO L153 SettingsManager]: * Use memory slicer=true
[2024-11-28 05:10:26,285 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-28 05:10:26,285 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-28 05:10:26,285 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-28 05:10:26,285 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2024-11-28 05:10:26,285 INFO L153 SettingsManager]: * Use SBE=true
[2024-11-28 05:10:26,286 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-28 05:10:26,287 INFO L153 SettingsManager]: * sizeof long=4
[2024-11-28 05:10:26,287 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true
[2024-11-28 05:10:26,287 INFO L153 SettingsManager]: * sizeof POINTER=4
[2024-11-28 05:10:26,288 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2024-11-28 05:10:26,288 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true
[2024-11-28 05:10:26,288 INFO L153 SettingsManager]: * Bitprecise bitfields=true
[2024-11-28 05:10:26,288 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true
[2024-11-28 05:10:26,288 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-28 05:10:26,288 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true
[2024-11-28 05:10:26,288 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false
[2024-11-28 05:10:26,288 INFO L153 SettingsManager]: * sizeof long double=12
[2024-11-28 05:10:26,289 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2024-11-28 05:10:26,289 INFO L153 SettingsManager]: * Use constant arrays=true
[2024-11-28 05:10:26,289 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2024-11-28 05:10:26,289 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-11-28 05:10:26,289 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2024-11-28 05:10:26,289 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-11-28 05:10:26,289 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-28 05:10:26,289 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-28 05:10:26,289 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-11-28 05:10:26,289 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2024-11-28 05:10:26,290 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-11-28 05:10:26,290 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-28 05:10:26,290 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-28 05:10:26,290 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2024-11-28 05:10:26,290 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL
[2024-11-28 05:10:26,290 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-11-28 05:10:26,290 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-28 05:10:26,290 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2024-11-28 05:10:26,290 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO
[2024-11-28 05:10:26,290 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-28 05:10:26,290 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC
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_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) )
CHECK( init(main()), LTL(G valid-deref) )
CHECK( init(main()), LTL(G valid-memtrack) )
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> bfb70cce6cd508003f6161c30aa2ac99ac8ddeb6209ddd86b65ca0c623c2fb1c
[2024-11-28 05:10:26,602 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-28 05:10:26,613 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-28 05:10:26,617 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-28 05:10:26,618 INFO L270 PluginConnector]: Initializing CDTParser...
[2024-11-28 05:10:26,618 INFO L274 PluginConnector]: CDTParser initialized
[2024-11-28 05:10:26,619 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test1-2.i
[2024-11-28 05:10:29,657 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/data/9bb31bd4d/9461bf5d11704f60aca8b3110c1023da/FLAG8ea171871
[2024-11-28 05:10:30,055 INFO L384 CDTParser]: Found 1 translation units.
[2024-11-28 05:10:30,056 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test1-2.i
[2024-11-28 05:10:30,079 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/data/9bb31bd4d/9461bf5d11704f60aca8b3110c1023da/FLAG8ea171871
[2024-11-28 05:10:30,212 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/data/9bb31bd4d/9461bf5d11704f60aca8b3110c1023da
[2024-11-28 05:10:30,215 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-28 05:10:30,216 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-28 05:10:30,219 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-28 05:10:30,219 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-28 05:10:30,224 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-28 05:10:30,225 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 05:10:30" (1/1) ...
[2024-11-28 05:10:30,226 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f3c1ce7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:10:30, skipping insertion in model container
[2024-11-28 05:10:30,226 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 05:10:30" (1/1) ...
[2024-11-28 05:10:30,283 INFO L175 MainTranslator]: Built tables and reachable declarations
[2024-11-28 05:10:30,703 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model
[2024-11-28 05:10:30,757 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model
[2024-11-28 05:10:30,763 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model
[2024-11-28 05:10:30,772 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model
[2024-11-28 05:10:30,785 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model
[2024-11-28 05:10:30,800 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model
[2024-11-28 05:10:30,801 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model
[2024-11-28 05:10:30,804 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model
[2024-11-28 05:10:30,806 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model
[2024-11-28 05:10:30,807 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model
[2024-11-28 05:10:30,808 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model
[2024-11-28 05:10:30,814 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model
[2024-11-28 05:10:30,819 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-28 05:10:30,836 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-28 05:10:30,837 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@1cef08c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:10:30, skipping insertion in model container
[2024-11-28 05:10:30,837 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-28 05:10:30,838 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner
[2024-11-28 05:10:30,841 INFO L158 Benchmark]: Toolchain (without parser) took 624.17ms. Allocated memory is still 117.4MB. Free memory was 90.7MB in the beginning and 73.0MB in the end (delta: 17.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
[2024-11-28 05:10:30,842 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 117.4MB. Free memory was 71.2MB in the beginning and 71.1MB in the end (delta: 146.8kB). There was no memory consumed. Max. memory is 16.1GB.
[2024-11-28 05:10:30,842 INFO L158 Benchmark]: CACSL2BoogieTranslator took 618.97ms. Allocated memory is still 117.4MB. Free memory was 90.4MB in the beginning and 73.0MB in the end (delta: 17.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
[2024-11-28 05:10:30,846 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] #######################
--- Results ---
* Results from de.uni_freiburg.informatik.ultimate.core:
- StatisticsResult: Toolchain Benchmarks
Benchmark results are:
* CDTParser took 0.23ms. Allocated memory is still 117.4MB. Free memory was 71.2MB in the beginning and 71.1MB in the end (delta: 146.8kB). There was no memory consumed. Max. memory is 16.1GB.
* CACSL2BoogieTranslator took 618.97ms. Allocated memory is still 117.4MB. Free memory was 90.4MB in the beginning and 73.0MB in the end (delta: 17.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator:
- UnsupportedSyntaxResult [Line: 764]: 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_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test1-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) )
CHECK( init(main()), LTL(G valid-deref) )
CHECK( init(main()), LTL(G valid-memtrack) )
--witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bfb70cce6cd508003f6161c30aa2ac99ac8ddeb6209ddd86b65ca0c623c2fb1c
--- Real Ultimate output ---
This is Ultimate 0.3.0-dev-d790fec
[2024-11-28 05:10:33,409 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2024-11-28 05:10:33,510 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf
[2024-11-28 05:10:33,528 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2024-11-28 05:10:33,528 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-28 05:10:33,556 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-28 05:10:33,556 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-28 05:10:33,556 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-28 05:10:33,557 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-28 05:10:33,557 INFO L153 SettingsManager]: * Use memory slicer=true
[2024-11-28 05:10:33,557 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-28 05:10:33,557 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-28 05:10:33,558 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-28 05:10:33,558 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2024-11-28 05:10:33,558 INFO L153 SettingsManager]: * Use SBE=true
[2024-11-28 05:10:33,558 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-28 05:10:33,558 INFO L153 SettingsManager]: * sizeof long=4
[2024-11-28 05:10:33,558 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true
[2024-11-28 05:10:33,558 INFO L153 SettingsManager]: * sizeof POINTER=4
[2024-11-28 05:10:33,558 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2024-11-28 05:10:33,558 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true
[2024-11-28 05:10:33,559 INFO L153 SettingsManager]: * Bitprecise bitfields=true
[2024-11-28 05:10:33,559 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true
[2024-11-28 05:10:33,559 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-28 05:10:33,559 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true
[2024-11-28 05:10:33,559 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true
[2024-11-28 05:10:33,559 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution
[2024-11-28 05:10:33,559 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false
[2024-11-28 05:10:33,559 INFO L153 SettingsManager]: * sizeof long double=12
[2024-11-28 05:10:33,559 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2024-11-28 05:10:33,559 INFO L153 SettingsManager]: * Use constant arrays=true
[2024-11-28 05:10:33,560 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2024-11-28 05:10:33,560 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-11-28 05:10:33,560 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2024-11-28 05:10:33,560 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-11-28 05:10:33,560 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-28 05:10:33,560 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-28 05:10:33,560 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-11-28 05:10:33,560 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2024-11-28 05:10:33,560 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-11-28 05:10:33,561 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-28 05:10:33,561 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-28 05:10:33,561 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2024-11-28 05:10:33,561 INFO L153 SettingsManager]: * Trace refinement strategy=FOX
[2024-11-28 05:10:33,561 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt
[2024-11-28 05:10:33,561 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-28 05:10:33,561 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2024-11-28 05:10:33,561 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO
[2024-11-28 05:10:33,561 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-28 05:10:33,561 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC
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_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) )
CHECK( init(main()), LTL(G valid-deref) )
CHECK( init(main()), LTL(G valid-memtrack) )
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> bfb70cce6cd508003f6161c30aa2ac99ac8ddeb6209ddd86b65ca0c623c2fb1c
[2024-11-28 05:10:33,879 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-28 05:10:33,892 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-28 05:10:33,897 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-28 05:10:33,898 INFO L270 PluginConnector]: Initializing CDTParser...
[2024-11-28 05:10:33,900 INFO L274 PluginConnector]: CDTParser initialized
[2024-11-28 05:10:33,901 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test1-2.i
[2024-11-28 05:10:36,871 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/data/c6df0bf30/158bc8d66cdd45048809a6181dd2923f/FLAG117f4dd1c
[2024-11-28 05:10:37,251 INFO L384 CDTParser]: Found 1 translation units.
[2024-11-28 05:10:37,252 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test1-2.i
[2024-11-28 05:10:37,275 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/data/c6df0bf30/158bc8d66cdd45048809a6181dd2923f/FLAG117f4dd1c
[2024-11-28 05:10:37,292 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/data/c6df0bf30/158bc8d66cdd45048809a6181dd2923f
[2024-11-28 05:10:37,295 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-28 05:10:37,297 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-28 05:10:37,299 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-28 05:10:37,300 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-28 05:10:37,305 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-28 05:10:37,306 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 05:10:37" (1/1) ...
[2024-11-28 05:10:37,306 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d15b7d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:10:37, skipping insertion in model container
[2024-11-28 05:10:37,307 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 05:10:37" (1/1) ...
[2024-11-28 05:10:37,355 INFO L175 MainTranslator]: Built tables and reachable declarations
[2024-11-28 05:10:37,822 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model
[2024-11-28 05:10:37,873 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model
[2024-11-28 05:10:37,878 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model
[2024-11-28 05:10:37,883 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model
[2024-11-28 05:10:37,892 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model
[2024-11-28 05:10:37,912 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model
[2024-11-28 05:10:37,913 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model
[2024-11-28 05:10:37,916 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model
[2024-11-28 05:10:37,918 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model
[2024-11-28 05:10:37,919 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model
[2024-11-28 05:10:37,920 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model
[2024-11-28 05:10:37,925 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model
[2024-11-28 05:10:37,929 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-28 05:10:37,947 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution]
[2024-11-28 05:10:37,968 INFO L175 MainTranslator]: Built tables and reachable declarations
[2024-11-28 05:10:38,015 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model
[2024-11-28 05:10:38,059 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model
[2024-11-28 05:10:38,064 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model
[2024-11-28 05:10:38,067 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model
[2024-11-28 05:10:38,077 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model
[2024-11-28 05:10:38,088 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model
[2024-11-28 05:10:38,089 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model
[2024-11-28 05:10:38,091 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model
[2024-11-28 05:10:38,093 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model
[2024-11-28 05:10:38,094 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model
[2024-11-28 05:10:38,095 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model
[2024-11-28 05:10:38,099 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model
[2024-11-28 05:10:38,101 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-28 05:10:38,108 INFO L200 MainTranslator]: Completed pre-run
[2024-11-28 05:10:38,228 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-28 05:10:38,271 INFO L204 MainTranslator]: Completed translation
[2024-11-28 05:10:38,272 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:10:38 WrapperNode
[2024-11-28 05:10:38,272 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-28 05:10:38,273 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-28 05:10:38,273 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-28 05:10:38,273 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-28 05:10:38,281 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:10:38" (1/1) ...
[2024-11-28 05:10:38,306 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:10:38" (1/1) ...
[2024-11-28 05:10:38,353 INFO L138 Inliner]: procedures = 179, calls = 231, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 784
[2024-11-28 05:10:38,353 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-28 05:10:38,354 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-28 05:10:38,354 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-28 05:10:38,354 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2024-11-28 05:10:38,371 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:10:38" (1/1) ...
[2024-11-28 05:10:38,371 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:10:38" (1/1) ...
[2024-11-28 05:10:38,389 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:10:38" (1/1) ...
[2024-11-28 05:10:38,478 INFO L175 MemorySlicer]: Split 206 memory accesses to 2 slices as follows [2, 204]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 50 writes are split as follows [0, 50].
[2024-11-28 05:10:38,478 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:10:38" (1/1) ...
[2024-11-28 05:10:38,478 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:10:38" (1/1) ...
[2024-11-28 05:10:38,560 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:10:38" (1/1) ...
[2024-11-28 05:10:38,562 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:10:38" (1/1) ...
[2024-11-28 05:10:38,569 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:10:38" (1/1) ...
[2024-11-28 05:10:38,572 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:10:38" (1/1) ...
[2024-11-28 05:10:38,575 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:10:38" (1/1) ...
[2024-11-28 05:10:38,581 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-28 05:10:38,582 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-28 05:10:38,582 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2024-11-28 05:10:38,582 INFO L274 PluginConnector]: RCFGBuilder initialized
[2024-11-28 05:10:38,583 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:10:38" (1/1) ...
[2024-11-28 05:10:38,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-28 05:10:38,605 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/z3
[2024-11-28 05:10:38,621 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2024-11-28 05:10:38,628 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2024-11-28 05:10:38,648 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0
[2024-11-28 05:10:38,649 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1
[2024-11-28 05:10:38,649 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0
[2024-11-28 05:10:38,649 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1
[2024-11-28 05:10:38,649 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert
[2024-11-28 05:10:38,649 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert
[2024-11-28 05:10:38,649 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0
[2024-11-28 05:10:38,649 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1
[2024-11-28 05:10:38,649 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0
[2024-11-28 05:10:38,649 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1
[2024-11-28 05:10:38,649 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap
[2024-11-28 05:10:38,649 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-11-28 05:10:38,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0
[2024-11-28 05:10:38,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1
[2024-11-28 05:10:38,650 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0
[2024-11-28 05:10:38,650 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1
[2024-11-28 05:10:38,650 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2024-11-28 05:10:38,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0
[2024-11-28 05:10:38,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1
[2024-11-28 05:10:38,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0
[2024-11-28 05:10:38,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1
[2024-11-28 05:10:38,650 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-28 05:10:38,650 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-28 05:10:38,881 INFO L234 CfgBuilder]: Building ICFG
[2024-11-28 05:10:38,883 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-28 05:10:38,886 WARN L773 $ProcedureCfgBuilder]: Label in the middle of a codeblock.
[2024-11-28 05:10:38,942 WARN L773 $ProcedureCfgBuilder]: Label in the middle of a codeblock.
[2024-11-28 05:10:42,379 INFO L? ?]: Removed 906 outVars from TransFormulas that were not future-live.
[2024-11-28 05:10:42,379 INFO L283 CfgBuilder]: Performing block encoding
[2024-11-28 05:10:42,421 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-28 05:10:42,423 INFO L312 CfgBuilder]: Removed 23 assume(true) statements.
[2024-11-28 05:10:42,423 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:10:42 BoogieIcfgContainer
[2024-11-28 05:10:42,423 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-28 05:10:42,426 INFO L112 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-11-28 05:10:42,430 INFO L270 PluginConnector]: Initializing TraceAbstraction...
[2024-11-28 05:10:42,435 INFO L274 PluginConnector]: TraceAbstraction initialized
[2024-11-28 05:10:42,435 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 05:10:37" (1/3) ...
[2024-11-28 05:10:42,436 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@436083b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 05:10:42, skipping insertion in model container
[2024-11-28 05:10:42,436 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:10:38" (2/3) ...
[2024-11-28 05:10:42,437 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@436083b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 05:10:42, skipping insertion in model container
[2024-11-28 05:10:42,438 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:10:42" (3/3) ...
[2024-11-28 05:10:42,439 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_OAT_test1-2.i
[2024-11-28 05:10:42,455 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-11-28 05:10:42,456 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_OAT_test1-2.i that has 4 procedures, 863 locations, 1 initial locations, 25 loop locations, and 425 error locations.
[2024-11-28 05:10:42,519 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-11-28 05:10:42,535 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3ceecb6c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-11-28 05:10:42,535 INFO L334 AbstractCegarLoop]: Starting to check reachability of 425 error locations.
[2024-11-28 05:10:42,540 INFO L276 IsEmpty]: Start isEmpty. Operand has 858 states, 420 states have (on average 2.2261904761904763) internal successors, (935), 852 states have internal predecessors, (935), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13)
[2024-11-28 05:10:42,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7
[2024-11-28 05:10:42,545 INFO L210 NwaCegarLoop]: Found error trace
[2024-11-28 05:10:42,545 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1]
[2024-11-28 05:10:42,546 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-28 05:10:42,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-28 05:10:42,551 INFO L85 PathProgramCache]: Analyzing trace with hash 1422103276, now seen corresponding path program 1 times
[2024-11-28 05:10:42,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX
[2024-11-28 05:10:42,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1989832736]
[2024-11-28 05:10:42,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-28 05:10:42,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-28 05:10:42,562 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/z3
[2024-11-28 05:10:42,566 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-28 05:10:42,568 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2024-11-28 05:10:42,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-28 05:10:42,756 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 1 conjuncts are in the unsatisfiable core
[2024-11-28 05:10:42,761 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2024-11-28 05:10:42,772 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-28 05:10:42,772 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-28 05:10:42,773 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2024-11-28 05:10:42,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1989832736]
[2024-11-28 05:10:42,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1989832736] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-28 05:10:42,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-28 05:10:42,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-28 05:10:42,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596682009]
[2024-11-28 05:10:42,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-28 05:10:42,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2024-11-28 05:10:42,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2024-11-28 05:10:42,805 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2024-11-28 05:10:42,806 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2024-11-28 05:10:42,812 INFO L87 Difference]: Start difference. First operand has 858 states, 420 states have (on average 2.2261904761904763) internal successors, (935), 852 states have internal predecessors, (935), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-28 05:10:42,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-28 05:10:42,894 INFO L93 Difference]: Finished difference Result 848 states and 905 transitions.
[2024-11-28 05:10:42,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2024-11-28 05:10:42,896 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6
[2024-11-28 05:10:42,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-28 05:10:42,923 INFO L225 Difference]: With dead ends: 848
[2024-11-28 05:10:42,923 INFO L226 Difference]: Without dead ends: 846
[2024-11-28 05:10:42,925 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2024-11-28 05:10:42,929 INFO L435 NwaCegarLoop]: 905 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, 905 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-28 05:10:42,929 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 905 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-28 05:10:42,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 846 states.
[2024-11-28 05:10:43,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 846 to 846.
[2024-11-28 05:10:43,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 846 states, 414 states have (on average 2.1183574879227054) internal successors, (877), 840 states have internal predecessors, (877), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13)
[2024-11-28 05:10:43,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 846 states to 846 states and 903 transitions.
[2024-11-28 05:10:43,016 INFO L78 Accepts]: Start accepts. Automaton has 846 states and 903 transitions. Word has length 6
[2024-11-28 05:10:43,016 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-28 05:10:43,016 INFO L471 AbstractCegarLoop]: Abstraction has 846 states and 903 transitions.
[2024-11-28 05:10:43,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-28 05:10:43,017 INFO L276 IsEmpty]: Start isEmpty. Operand 846 states and 903 transitions.
[2024-11-28 05:10:43,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7
[2024-11-28 05:10:43,017 INFO L210 NwaCegarLoop]: Found error trace
[2024-11-28 05:10:43,017 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1]
[2024-11-28 05:10:43,025 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0
[2024-11-28 05:10:43,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-28 05:10:43,220 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-28 05:10:43,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-28 05:10:43,220 INFO L85 PathProgramCache]: Analyzing trace with hash 1422103338, now seen corresponding path program 1 times
[2024-11-28 05:10:43,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX
[2024-11-28 05:10:43,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1979997063]
[2024-11-28 05:10:43,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-28 05:10:43,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-28 05:10:43,221 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/z3
[2024-11-28 05:10:43,224 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-28 05:10:43,226 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2024-11-28 05:10:43,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-28 05:10:43,362 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 3 conjuncts are in the unsatisfiable core
[2024-11-28 05:10:43,363 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2024-11-28 05:10:43,399 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-28 05:10:43,420 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-28 05:10:43,420 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-28 05:10:43,420 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2024-11-28 05:10:43,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1979997063]
[2024-11-28 05:10:43,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1979997063] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-28 05:10:43,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-28 05:10:43,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-28 05:10:43,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341759750]
[2024-11-28 05:10:43,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-28 05:10:43,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-28 05:10:43,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2024-11-28 05:10:43,422 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-28 05:10:43,422 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-28 05:10:43,423 INFO L87 Difference]: Start difference. First operand 846 states and 903 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-28 05:10:45,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-28 05:10:45,171 INFO L93 Difference]: Finished difference Result 800 states and 858 transitions.
[2024-11-28 05:10:45,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-28 05:10:45,171 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6
[2024-11-28 05:10:45,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-28 05:10:45,175 INFO L225 Difference]: With dead ends: 800
[2024-11-28 05:10:45,175 INFO L226 Difference]: Without dead ends: 800
[2024-11-28 05:10:45,175 INFO L434 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-28 05:10:45,176 INFO L435 NwaCegarLoop]: 546 mSDtfsCounter, 536 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 497 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 549 SdHoareTripleChecker+Valid, 662 SdHoareTripleChecker+Invalid, 550 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time
[2024-11-28 05:10:45,176 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [549 Valid, 662 Invalid, 550 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 497 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time]
[2024-11-28 05:10:45,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states.
[2024-11-28 05:10:45,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 797.
[2024-11-28 05:10:45,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 797 states, 414 states have (on average 2.0) internal successors, (828), 791 states have internal predecessors, (828), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13)
[2024-11-28 05:10:45,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 854 transitions.
[2024-11-28 05:10:45,205 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 854 transitions. Word has length 6
[2024-11-28 05:10:45,205 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-28 05:10:45,205 INFO L471 AbstractCegarLoop]: Abstraction has 797 states and 854 transitions.
[2024-11-28 05:10:45,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-28 05:10:45,205 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 854 transitions.
[2024-11-28 05:10:45,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7
[2024-11-28 05:10:45,206 INFO L210 NwaCegarLoop]: Found error trace
[2024-11-28 05:10:45,206 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1]
[2024-11-28 05:10:45,217 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0
[2024-11-28 05:10:45,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-28 05:10:45,410 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-28 05:10:45,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-28 05:10:45,411 INFO L85 PathProgramCache]: Analyzing trace with hash 1422103339, now seen corresponding path program 1 times
[2024-11-28 05:10:45,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX
[2024-11-28 05:10:45,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [909762146]
[2024-11-28 05:10:45,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-28 05:10:45,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-28 05:10:45,412 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/z3
[2024-11-28 05:10:45,419 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-28 05:10:45,420 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2024-11-28 05:10:45,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-28 05:10:45,529 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 4 conjuncts are in the unsatisfiable core
[2024-11-28 05:10:45,531 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2024-11-28 05:10:45,547 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-28 05:10:45,570 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-28 05:10:45,570 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-28 05:10:45,570 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2024-11-28 05:10:45,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [909762146]
[2024-11-28 05:10:45,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [909762146] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-28 05:10:45,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-28 05:10:45,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-28 05:10:45,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136345664]
[2024-11-28 05:10:45,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-28 05:10:45,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-28 05:10:45,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2024-11-28 05:10:45,571 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-28 05:10:45,571 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-28 05:10:45,572 INFO L87 Difference]: Start difference. First operand 797 states and 854 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-28 05:10:47,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-28 05:10:47,360 INFO L93 Difference]: Finished difference Result 873 states and 934 transitions.
[2024-11-28 05:10:47,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-28 05:10:47,361 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6
[2024-11-28 05:10:47,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-28 05:10:47,364 INFO L225 Difference]: With dead ends: 873
[2024-11-28 05:10:47,364 INFO L226 Difference]: Without dead ends: 873
[2024-11-28 05:10:47,365 INFO L434 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-28 05:10:47,365 INFO L435 NwaCegarLoop]: 727 mSDtfsCounter, 264 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 462 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 1052 SdHoareTripleChecker+Invalid, 475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time
[2024-11-28 05:10:47,365 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 1052 Invalid, 475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 462 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time]
[2024-11-28 05:10:47,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states.
[2024-11-28 05:10:47,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 824.
[2024-11-28 05:10:47,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 824 states, 451 states have (on average 1.9778270509977827) internal successors, (892), 818 states have internal predecessors, (892), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13)
[2024-11-28 05:10:47,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 824 states to 824 states and 918 transitions.
[2024-11-28 05:10:47,387 INFO L78 Accepts]: Start accepts. Automaton has 824 states and 918 transitions. Word has length 6
[2024-11-28 05:10:47,387 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-28 05:10:47,387 INFO L471 AbstractCegarLoop]: Abstraction has 824 states and 918 transitions.
[2024-11-28 05:10:47,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-28 05:10:47,387 INFO L276 IsEmpty]: Start isEmpty. Operand 824 states and 918 transitions.
[2024-11-28 05:10:47,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7
[2024-11-28 05:10:47,388 INFO L210 NwaCegarLoop]: Found error trace
[2024-11-28 05:10:47,388 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1]
[2024-11-28 05:10:47,396 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0
[2024-11-28 05:10:47,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-28 05:10:47,589 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr312REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] ===
[2024-11-28 05:10:47,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-28 05:10:47,589 INFO L85 PathProgramCache]: Analyzing trace with hash 1423050696, now seen corresponding path program 1 times
[2024-11-28 05:10:47,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX
[2024-11-28 05:10:47,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1209413875]
[2024-11-28 05:10:47,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-28 05:10:47,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-28 05:10:47,590 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/z3
[2024-11-28 05:10:47,591 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-28 05:10:47,604 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process
[2024-11-28 05:10:47,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-28 05:10:47,699 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 5 conjuncts are in the unsatisfiable core
[2024-11-28 05:10:47,700 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2024-11-28 05:10:47,745 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-28 05:10:47,746 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-28 05:10:47,746 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2024-11-28 05:10:47,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1209413875]
[2024-11-28 05:10:47,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1209413875] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-28 05:10:47,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-28 05:10:47,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-28 05:10:47,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062829748]
[2024-11-28 05:10:47,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-28 05:10:47,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-28 05:10:47,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2024-11-28 05:10:47,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-28 05:10:47,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-28 05:10:47,748 INFO L87 Difference]: Start difference. First operand 824 states and 918 transitions. Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 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-28 05:10:48,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-28 05:10:48,550 INFO L93 Difference]: Finished difference Result 1127 states and 1263 transitions.
[2024-11-28 05:10:48,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2024-11-28 05:10:48,550 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 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-28 05:10:48,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-28 05:10:48,555 INFO L225 Difference]: With dead ends: 1127
[2024-11-28 05:10:48,555 INFO L226 Difference]: Without dead ends: 1127
[2024-11-28 05:10:48,555 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-28 05:10:48,556 INFO L435 NwaCegarLoop]: 910 mSDtfsCounter, 323 mSDsluCounter, 1573 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 2483 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2024-11-28 05:10:48,556 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [323 Valid, 2483 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2024-11-28 05:10:48,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1127 states.
[2024-11-28 05:10:48,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1127 to 911.
[2024-11-28 05:10:48,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 911 states, 538 states have (on average 1.929368029739777) internal successors, (1038), 905 states have internal predecessors, (1038), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13)
[2024-11-28 05:10:48,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 911 states to 911 states and 1064 transitions.
[2024-11-28 05:10:48,585 INFO L78 Accepts]: Start accepts. Automaton has 911 states and 1064 transitions. Word has length 6
[2024-11-28 05:10:48,585 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-28 05:10:48,585 INFO L471 AbstractCegarLoop]: Abstraction has 911 states and 1064 transitions.
[2024-11-28 05:10:48,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 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-28 05:10:48,586 INFO L276 IsEmpty]: Start isEmpty. Operand 911 states and 1064 transitions.
[2024-11-28 05:10:48,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12
[2024-11-28 05:10:48,590 INFO L210 NwaCegarLoop]: Found error trace
[2024-11-28 05:10:48,590 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-28 05:10:48,598 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0
[2024-11-28 05:10:48,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-28 05:10:48,791 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr423ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] ===
[2024-11-28 05:10:48,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-28 05:10:48,792 INFO L85 PathProgramCache]: Analyzing trace with hash 1290386196, now seen corresponding path program 1 times
[2024-11-28 05:10:48,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX
[2024-11-28 05:10:48,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1241194382]
[2024-11-28 05:10:48,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-28 05:10:48,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-28 05:10:48,792 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/z3
[2024-11-28 05:10:48,794 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-28 05:10:48,797 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process
[2024-11-28 05:10:48,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-28 05:10:48,896 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 2 conjuncts are in the unsatisfiable core
[2024-11-28 05:10:48,898 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2024-11-28 05:10:48,924 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-28 05:10:48,924 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-28 05:10:48,924 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2024-11-28 05:10:48,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1241194382]
[2024-11-28 05:10:48,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1241194382] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-28 05:10:48,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-28 05:10:48,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-28 05:10:48,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328900121]
[2024-11-28 05:10:48,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-28 05:10:48,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-28 05:10:48,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2024-11-28 05:10:48,925 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-28 05:10:48,925 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-28 05:10:48,926 INFO L87 Difference]: Start difference. First operand 911 states and 1064 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 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-28 05:10:50,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-28 05:10:50,052 INFO L93 Difference]: Finished difference Result 913 states and 1065 transitions.
[2024-11-28 05:10:50,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-28 05:10:50,053 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 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 11
[2024-11-28 05:10:50,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-28 05:10:50,056 INFO L225 Difference]: With dead ends: 913
[2024-11-28 05:10:50,056 INFO L226 Difference]: Without dead ends: 905
[2024-11-28 05:10:50,056 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-28 05:10:50,057 INFO L435 NwaCegarLoop]: 843 mSDtfsCounter, 1 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1317 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time
[2024-11-28 05:10:50,057 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1317 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 370 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time]
[2024-11-28 05:10:50,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 905 states.
[2024-11-28 05:10:50,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 905 to 905.
[2024-11-28 05:10:50,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 905 states, 532 states have (on average 1.9379699248120301) internal successors, (1031), 899 states have internal predecessors, (1031), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13)
[2024-11-28 05:10:50,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1057 transitions.
[2024-11-28 05:10:50,078 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1057 transitions. Word has length 11
[2024-11-28 05:10:50,078 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-28 05:10:50,078 INFO L471 AbstractCegarLoop]: Abstraction has 905 states and 1057 transitions.
[2024-11-28 05:10:50,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 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-28 05:10:50,078 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1057 transitions.
[2024-11-28 05:10:50,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13
[2024-11-28 05:10:50,079 INFO L210 NwaCegarLoop]: Found error trace
[2024-11-28 05:10:50,079 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-28 05:10:50,088 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0
[2024-11-28 05:10:50,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-28 05:10:50,283 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] ===
[2024-11-28 05:10:50,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-28 05:10:50,284 INFO L85 PathProgramCache]: Analyzing trace with hash 1783262039, now seen corresponding path program 1 times
[2024-11-28 05:10:50,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX
[2024-11-28 05:10:50,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1387875511]
[2024-11-28 05:10:50,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-28 05:10:50,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-28 05:10:50,284 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/z3
[2024-11-28 05:10:50,286 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-28 05:10:50,287 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process
[2024-11-28 05:10:50,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-28 05:10:50,416 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 4 conjuncts are in the unsatisfiable core
[2024-11-28 05:10:50,418 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2024-11-28 05:10:50,428 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-28 05:10:50,466 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-28 05:10:50,467 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-28 05:10:50,467 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2024-11-28 05:10:50,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1387875511]
[2024-11-28 05:10:50,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1387875511] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-28 05:10:50,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-28 05:10:50,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-28 05:10:50,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074459507]
[2024-11-28 05:10:50,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-28 05:10:50,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-28 05:10:50,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2024-11-28 05:10:50,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-28 05:10:50,468 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-28 05:10:50,468 INFO L87 Difference]: Start difference. First operand 905 states and 1057 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-28 05:10:52,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-28 05:10:52,560 INFO L93 Difference]: Finished difference Result 890 states and 1019 transitions.
[2024-11-28 05:10:52,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2024-11-28 05:10:52,560 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12
[2024-11-28 05:10:52,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-28 05:10:52,563 INFO L225 Difference]: With dead ends: 890
[2024-11-28 05:10:52,563 INFO L226 Difference]: Without dead ends: 890
[2024-11-28 05:10:52,565 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 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-28 05:10:52,566 INFO L435 NwaCegarLoop]: 520 mSDtfsCounter, 587 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 894 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 600 SdHoareTripleChecker+Valid, 967 SdHoareTripleChecker+Invalid, 922 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 894 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time
[2024-11-28 05:10:52,566 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [600 Valid, 967 Invalid, 922 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 894 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time]
[2024-11-28 05:10:52,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 890 states.
[2024-11-28 05:10:52,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 890 to 882.
[2024-11-28 05:10:52,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 882 states, 532 states have (on average 1.8515037593984962) internal successors, (985), 876 states have internal predecessors, (985), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13)
[2024-11-28 05:10:52,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 882 states to 882 states and 1011 transitions.
[2024-11-28 05:10:52,587 INFO L78 Accepts]: Start accepts. Automaton has 882 states and 1011 transitions. Word has length 12
[2024-11-28 05:10:52,587 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-28 05:10:52,587 INFO L471 AbstractCegarLoop]: Abstraction has 882 states and 1011 transitions.
[2024-11-28 05:10:52,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-28 05:10:52,587 INFO L276 IsEmpty]: Start isEmpty. Operand 882 states and 1011 transitions.
[2024-11-28 05:10:52,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13
[2024-11-28 05:10:52,587 INFO L210 NwaCegarLoop]: Found error trace
[2024-11-28 05:10:52,588 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-28 05:10:52,597 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0
[2024-11-28 05:10:52,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-28 05:10:52,788 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] ===
[2024-11-28 05:10:52,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-28 05:10:52,789 INFO L85 PathProgramCache]: Analyzing trace with hash 1783262040, now seen corresponding path program 1 times
[2024-11-28 05:10:52,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX
[2024-11-28 05:10:52,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1955424843]
[2024-11-28 05:10:52,789 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-28 05:10:52,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-28 05:10:52,789 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/z3
[2024-11-28 05:10:52,791 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-28 05:10:52,792 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process
[2024-11-28 05:10:52,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-28 05:10:52,914 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 6 conjuncts are in the unsatisfiable core
[2024-11-28 05:10:52,916 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2024-11-28 05:10:52,934 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-28 05:10:53,031 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-28 05:10:53,031 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-28 05:10:53,032 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2024-11-28 05:10:53,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1955424843]
[2024-11-28 05:10:53,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1955424843] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-28 05:10:53,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-28 05:10:53,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-28 05:10:53,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87124368]
[2024-11-28 05:10:53,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-28 05:10:53,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-28 05:10:53,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2024-11-28 05:10:53,035 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-28 05:10:53,035 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-28 05:10:53,035 INFO L87 Difference]: Start difference. First operand 882 states and 1011 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-28 05:10:55,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-28 05:10:55,651 INFO L93 Difference]: Finished difference Result 1063 states and 1183 transitions.
[2024-11-28 05:10:55,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2024-11-28 05:10:55,652 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12
[2024-11-28 05:10:55,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-28 05:10:55,655 INFO L225 Difference]: With dead ends: 1063
[2024-11-28 05:10:55,655 INFO L226 Difference]: Without dead ends: 1063
[2024-11-28 05:10:55,655 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 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-28 05:10:55,656 INFO L435 NwaCegarLoop]: 789 mSDtfsCounter, 389 mSDsluCounter, 790 mSDsCounter, 0 mSdLazyCounter, 909 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 389 SdHoareTripleChecker+Valid, 1579 SdHoareTripleChecker+Invalid, 931 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 909 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time
[2024-11-28 05:10:55,656 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [389 Valid, 1579 Invalid, 931 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 909 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time]
[2024-11-28 05:10:55,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1063 states.
[2024-11-28 05:10:55,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1063 to 998.
[2024-11-28 05:10:55,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 998 states, 648 states have (on average 1.7361111111111112) internal successors, (1125), 992 states have internal predecessors, (1125), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13)
[2024-11-28 05:10:55,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 998 states to 998 states and 1151 transitions.
[2024-11-28 05:10:55,677 INFO L78 Accepts]: Start accepts. Automaton has 998 states and 1151 transitions. Word has length 12
[2024-11-28 05:10:55,677 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-28 05:10:55,677 INFO L471 AbstractCegarLoop]: Abstraction has 998 states and 1151 transitions.
[2024-11-28 05:10:55,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-28 05:10:55,677 INFO L276 IsEmpty]: Start isEmpty. Operand 998 states and 1151 transitions.
[2024-11-28 05:10:55,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32
[2024-11-28 05:10:55,678 INFO L210 NwaCegarLoop]: Found error trace
[2024-11-28 05:10:55,678 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 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-28 05:10:55,688 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0
[2024-11-28 05:10:55,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-28 05:10:55,879 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] ===
[2024-11-28 05:10:55,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-28 05:10:55,880 INFO L85 PathProgramCache]: Analyzing trace with hash -1048779893, now seen corresponding path program 1 times
[2024-11-28 05:10:55,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX
[2024-11-28 05:10:55,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1843803682]
[2024-11-28 05:10:55,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-28 05:10:55,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-28 05:10:55,880 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/z3
[2024-11-28 05:10:55,882 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-28 05:10:55,885 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process
[2024-11-28 05:10:56,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-28 05:10:56,071 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 8 conjuncts are in the unsatisfiable core
[2024-11-28 05:10:56,072 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2024-11-28 05:10:56,080 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-28 05:10:56,376 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-28 05:10:56,376 INFO L312 TraceCheckSpWp]: Computing backward predicates...
[2024-11-28 05:10:56,958 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-28 05:10:56,958 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2024-11-28 05:10:56,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1843803682]
[2024-11-28 05:10:56,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1843803682] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-28 05:10:56,959 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2024-11-28 05:10:56,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7
[2024-11-28 05:10:56,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984357655]
[2024-11-28 05:10:56,959 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2024-11-28 05:10:56,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-11-28 05:10:56,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2024-11-28 05:10:56,960 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-11-28 05:10:56,960 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-11-28 05:10:56,960 INFO L87 Difference]: Start difference. First operand 998 states and 1151 transitions. Second operand has 8 states, 7 states have (on average 8.428571428571429) internal successors, (59), 8 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-28 05:11:04,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-28 05:11:04,240 INFO L93 Difference]: Finished difference Result 1425 states and 1679 transitions.
[2024-11-28 05:11:04,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2024-11-28 05:11:04,241 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 8.428571428571429) internal successors, (59), 8 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31
[2024-11-28 05:11:04,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-28 05:11:04,245 INFO L225 Difference]: With dead ends: 1425
[2024-11-28 05:11:04,245 INFO L226 Difference]: Without dead ends: 1425
[2024-11-28 05:11:04,245 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132
[2024-11-28 05:11:04,246 INFO L435 NwaCegarLoop]: 817 mSDtfsCounter, 1087 mSDsluCounter, 1664 mSDsCounter, 0 mSdLazyCounter, 1775 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1088 SdHoareTripleChecker+Valid, 2481 SdHoareTripleChecker+Invalid, 1802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1775 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.0s IncrementalHoareTripleChecker+Time
[2024-11-28 05:11:04,246 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1088 Valid, 2481 Invalid, 1802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1775 Invalid, 0 Unknown, 0 Unchecked, 7.0s Time]
[2024-11-28 05:11:04,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1425 states.
[2024-11-28 05:11:04,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1425 to 1164.
[2024-11-28 05:11:04,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1164 states, 814 states have (on average 1.6695331695331694) internal successors, (1359), 1158 states have internal predecessors, (1359), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13)
[2024-11-28 05:11:04,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1164 states to 1164 states and 1385 transitions.
[2024-11-28 05:11:04,271 INFO L78 Accepts]: Start accepts. Automaton has 1164 states and 1385 transitions. Word has length 31
[2024-11-28 05:11:04,271 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-28 05:11:04,271 INFO L471 AbstractCegarLoop]: Abstraction has 1164 states and 1385 transitions.
[2024-11-28 05:11:04,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 8.428571428571429) internal successors, (59), 8 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-28 05:11:04,272 INFO L276 IsEmpty]: Start isEmpty. Operand 1164 states and 1385 transitions.
[2024-11-28 05:11:04,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48
[2024-11-28 05:11:04,273 INFO L210 NwaCegarLoop]: Found error trace
[2024-11-28 05:11:04,273 INFO L218 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-28 05:11:04,285 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0
[2024-11-28 05:11:04,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-28 05:11:04,474 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] ===
[2024-11-28 05:11:04,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-28 05:11:04,474 INFO L85 PathProgramCache]: Analyzing trace with hash -717313938, now seen corresponding path program 1 times
[2024-11-28 05:11:04,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX
[2024-11-28 05:11:04,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [981649650]
[2024-11-28 05:11:04,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-28 05:11:04,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-28 05:11:04,475 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/z3
[2024-11-28 05:11:04,476 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-28 05:11:04,477 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process
[2024-11-28 05:11:04,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-28 05:11:04,683 INFO L256 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 3 conjuncts are in the unsatisfiable core
[2024-11-28 05:11:04,685 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2024-11-28 05:11:04,732 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-28 05:11:04,732 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-28 05:11:04,732 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2024-11-28 05:11:04,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [981649650]
[2024-11-28 05:11:04,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [981649650] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-28 05:11:04,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-28 05:11:04,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-28 05:11:04,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428106524]
[2024-11-28 05:11:04,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-28 05:11:04,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-28 05:11:04,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2024-11-28 05:11:04,733 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-28 05:11:04,733 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-28 05:11:04,733 INFO L87 Difference]: Start difference. First operand 1164 states and 1385 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-28 05:11:04,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-28 05:11:04,817 INFO L93 Difference]: Finished difference Result 849 states and 945 transitions.
[2024-11-28 05:11:04,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-11-28 05:11:04,820 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-28 05:11:04,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-28 05:11:04,822 INFO L225 Difference]: With dead ends: 849
[2024-11-28 05:11:04,823 INFO L226 Difference]: Without dead ends: 849
[2024-11-28 05:11:04,823 INFO L434 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-28 05:11:04,823 INFO L435 NwaCegarLoop]: 759 mSDtfsCounter, 56 mSDsluCounter, 1445 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 2204 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-11-28 05:11:04,825 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 2204 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-11-28 05:11:04,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 849 states.
[2024-11-28 05:11:04,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 849 to 847.
[2024-11-28 05:11:04,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 847 states, 520 states have (on average 1.7634615384615384) internal successors, (917), 841 states have internal predecessors, (917), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13)
[2024-11-28 05:11:04,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 847 states to 847 states and 943 transitions.
[2024-11-28 05:11:04,840 INFO L78 Accepts]: Start accepts. Automaton has 847 states and 943 transitions. Word has length 47
[2024-11-28 05:11:04,840 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-28 05:11:04,840 INFO L471 AbstractCegarLoop]: Abstraction has 847 states and 943 transitions.
[2024-11-28 05:11:04,840 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-28 05:11:04,841 INFO L276 IsEmpty]: Start isEmpty. Operand 847 states and 943 transitions.
[2024-11-28 05:11:04,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56
[2024-11-28 05:11:04,844 INFO L210 NwaCegarLoop]: Found error trace
[2024-11-28 05:11:04,844 INFO L218 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-28 05:11:04,856 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0
[2024-11-28 05:11:05,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-28 05:11:05,045 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] ===
[2024-11-28 05:11:05,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-28 05:11:05,045 INFO L85 PathProgramCache]: Analyzing trace with hash 489889826, now seen corresponding path program 1 times
[2024-11-28 05:11:05,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX
[2024-11-28 05:11:05,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1060051409]
[2024-11-28 05:11:05,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-28 05:11:05,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-28 05:11:05,046 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/z3
[2024-11-28 05:11:05,050 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-28 05:11:05,052 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process
[2024-11-28 05:11:05,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-28 05:11:05,304 INFO L256 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 8 conjuncts are in the unsatisfiable core
[2024-11-28 05:11:05,307 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2024-11-28 05:11:05,315 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-28 05:11:05,894 INFO L190 IndexEqualityManager]: detected not equals via solver
[2024-11-28 05:11:05,895 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-28 05:11:05,915 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size
[2024-11-28 05:11:05,916 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-28 05:11:05,923 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-28 05:11:05,923 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-28 05:11:05,923 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2024-11-28 05:11:05,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1060051409]
[2024-11-28 05:11:05,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1060051409] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-28 05:11:05,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-28 05:11:05,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-28 05:11:05,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36352943]
[2024-11-28 05:11:05,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-28 05:11:05,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-11-28 05:11:05,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2024-11-28 05:11:05,924 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-11-28 05:11:05,925 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2024-11-28 05:11:05,925 INFO L87 Difference]: Start difference. First operand 847 states and 943 transitions. Second operand has 5 states, 4 states have (on average 13.75) internal successors, (55), 5 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-28 05:11:08,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-28 05:11:08,044 INFO L93 Difference]: Finished difference Result 809 states and 905 transitions.
[2024-11-28 05:11:08,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-11-28 05:11:08,044 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 13.75) internal successors, (55), 5 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-28 05:11:08,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-28 05:11:08,047 INFO L225 Difference]: With dead ends: 809
[2024-11-28 05:11:08,047 INFO L226 Difference]: Without dead ends: 809
[2024-11-28 05:11:08,047 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30
[2024-11-28 05:11:08,048 INFO L435 NwaCegarLoop]: 430 mSDtfsCounter, 452 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 913 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 455 SdHoareTripleChecker+Valid, 800 SdHoareTripleChecker+Invalid, 955 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 913 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time
[2024-11-28 05:11:08,048 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [455 Valid, 800 Invalid, 955 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 913 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time]
[2024-11-28 05:11:08,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 809 states.
[2024-11-28 05:11:08,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 809 to 772.
[2024-11-28 05:11:08,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 772 states, 483 states have (on average 1.6666666666666667) internal successors, (805), 766 states have internal predecessors, (805), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13)
[2024-11-28 05:11:08,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 772 states and 831 transitions.
[2024-11-28 05:11:08,067 INFO L78 Accepts]: Start accepts. Automaton has 772 states and 831 transitions. Word has length 55
[2024-11-28 05:11:08,067 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-28 05:11:08,067 INFO L471 AbstractCegarLoop]: Abstraction has 772 states and 831 transitions.
[2024-11-28 05:11:08,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 13.75) internal successors, (55), 5 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-28 05:11:08,067 INFO L276 IsEmpty]: Start isEmpty. Operand 772 states and 831 transitions.
[2024-11-28 05:11:08,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61
[2024-11-28 05:11:08,071 INFO L210 NwaCegarLoop]: Found error trace
[2024-11-28 05:11:08,071 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-28 05:11:08,085 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0
[2024-11-28 05:11:08,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-28 05:11:08,272 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] ===
[2024-11-28 05:11:08,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-28 05:11:08,272 INFO L85 PathProgramCache]: Analyzing trace with hash 225246615, now seen corresponding path program 1 times
[2024-11-28 05:11:08,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX
[2024-11-28 05:11:08,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [342138506]
[2024-11-28 05:11:08,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-28 05:11:08,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-28 05:11:08,273 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/z3
[2024-11-28 05:11:08,276 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-28 05:11:08,278 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process
[2024-11-28 05:11:08,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-28 05:11:08,526 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 6 conjuncts are in the unsatisfiable core
[2024-11-28 05:11:08,529 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2024-11-28 05:11:08,537 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-28 05:11:08,550 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-28 05:11:08,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 23 treesize of output 11
[2024-11-28 05:11:08,593 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-28 05:11:08,593 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-28 05:11:08,593 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2024-11-28 05:11:08,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [342138506]
[2024-11-28 05:11:08,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [342138506] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-28 05:11:08,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-28 05:11:08,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-28 05:11:08,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662892375]
[2024-11-28 05:11:08,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-28 05:11:08,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-11-28 05:11:08,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2024-11-28 05:11:08,594 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-11-28 05:11:08,594 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2024-11-28 05:11:08,594 INFO L87 Difference]: Start difference. First operand 772 states and 831 transitions. Second operand has 5 states, 4 states have (on average 15.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-28 05:11:10,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-28 05:11:10,688 INFO L93 Difference]: Finished difference Result 771 states and 830 transitions.
[2024-11-28 05:11:10,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2024-11-28 05:11:10,689 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 15.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60
[2024-11-28 05:11:10,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-28 05:11:10,691 INFO L225 Difference]: With dead ends: 771
[2024-11-28 05:11:10,691 INFO L226 Difference]: Without dead ends: 771
[2024-11-28 05:11:10,692 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2024-11-28 05:11:10,692 INFO L435 NwaCegarLoop]: 732 mSDtfsCounter, 2 mSDsluCounter, 1174 mSDsCounter, 0 mSdLazyCounter, 1029 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1906 SdHoareTripleChecker+Invalid, 1030 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1029 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time
[2024-11-28 05:11:10,693 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1906 Invalid, 1030 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1029 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time]
[2024-11-28 05:11:10,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 771 states.
[2024-11-28 05:11:10,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 771 to 771.
[2024-11-28 05:11:10,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 771 states, 483 states have (on average 1.6645962732919255) internal successors, (804), 765 states have internal predecessors, (804), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13)
[2024-11-28 05:11:10,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 830 transitions.
[2024-11-28 05:11:10,705 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 830 transitions. Word has length 60
[2024-11-28 05:11:10,705 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-28 05:11:10,706 INFO L471 AbstractCegarLoop]: Abstraction has 771 states and 830 transitions.
[2024-11-28 05:11:10,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 15.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-28 05:11:10,706 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 830 transitions.
[2024-11-28 05:11:10,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61
[2024-11-28 05:11:10,707 INFO L210 NwaCegarLoop]: Found error trace
[2024-11-28 05:11:10,707 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-28 05:11:10,722 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0
[2024-11-28 05:11:10,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-28 05:11:10,907 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] ===
[2024-11-28 05:11:10,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-28 05:11:10,908 INFO L85 PathProgramCache]: Analyzing trace with hash 225246616, now seen corresponding path program 1 times
[2024-11-28 05:11:10,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX
[2024-11-28 05:11:10,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [822255561]
[2024-11-28 05:11:10,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-28 05:11:10,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-28 05:11:10,908 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/z3
[2024-11-28 05:11:10,910 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-28 05:11:10,912 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process
[2024-11-28 05:11:11,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-28 05:11:11,160 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 11 conjuncts are in the unsatisfiable core
[2024-11-28 05:11:11,163 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2024-11-28 05:11:11,175 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2024-11-28 05:11:11,207 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-28 05:11:11,219 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-28 05:11:11,281 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-28 05:11:11,309 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-28 05:11:11,309 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-28 05:11:11,309 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2024-11-28 05:11:11,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [822255561]
[2024-11-28 05:11:11,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [822255561] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-28 05:11:11,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-28 05:11:11,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-28 05:11:11,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976832790]
[2024-11-28 05:11:11,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-28 05:11:11,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-11-28 05:11:11,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2024-11-28 05:11:11,311 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-11-28 05:11:11,311 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2024-11-28 05:11:11,311 INFO L87 Difference]: Start difference. First operand 771 states and 830 transitions. Second operand has 5 states, 4 states have (on average 15.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-28 05:11:13,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-28 05:11:13,794 INFO L93 Difference]: Finished difference Result 770 states and 829 transitions.
[2024-11-28 05:11:13,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2024-11-28 05:11:13,795 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 15.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60
[2024-11-28 05:11:13,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-28 05:11:13,797 INFO L225 Difference]: With dead ends: 770
[2024-11-28 05:11:13,797 INFO L226 Difference]: Without dead ends: 770
[2024-11-28 05:11:13,797 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2024-11-28 05:11:13,798 INFO L435 NwaCegarLoop]: 732 mSDtfsCounter, 1 mSDsluCounter, 1197 mSDsCounter, 0 mSdLazyCounter, 1003 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1929 SdHoareTripleChecker+Invalid, 1004 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1003 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time
[2024-11-28 05:11:13,798 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1929 Invalid, 1004 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1003 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time]
[2024-11-28 05:11:13,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 770 states.
[2024-11-28 05:11:13,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 770 to 770.
[2024-11-28 05:11:13,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 770 states, 482 states have (on average 1.66597510373444) internal successors, (803), 764 states have internal predecessors, (803), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13)
[2024-11-28 05:11:13,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 770 states to 770 states and 829 transitions.
[2024-11-28 05:11:13,811 INFO L78 Accepts]: Start accepts. Automaton has 770 states and 829 transitions. Word has length 60
[2024-11-28 05:11:13,811 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-28 05:11:13,811 INFO L471 AbstractCegarLoop]: Abstraction has 770 states and 829 transitions.
[2024-11-28 05:11:13,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 15.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-28 05:11:13,812 INFO L276 IsEmpty]: Start isEmpty. Operand 770 states and 829 transitions.
[2024-11-28 05:11:13,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69
[2024-11-28 05:11:13,812 INFO L210 NwaCegarLoop]: Found error trace
[2024-11-28 05:11:13,813 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-28 05:11:13,826 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0
[2024-11-28 05:11:14,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-28 05:11:14,013 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] ===
[2024-11-28 05:11:14,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-28 05:11:14,014 INFO L85 PathProgramCache]: Analyzing trace with hash 610113022, now seen corresponding path program 1 times
[2024-11-28 05:11:14,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX
[2024-11-28 05:11:14,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [310579186]
[2024-11-28 05:11:14,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-28 05:11:14,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-28 05:11:14,014 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/z3
[2024-11-28 05:11:14,016 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-28 05:11:14,017 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process
[2024-11-28 05:11:14,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-28 05:11:14,280 INFO L256 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 9 conjuncts are in the unsatisfiable core
[2024-11-28 05:11:14,282 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2024-11-28 05:11:14,295 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-28 05:11:14,389 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-28 05:11:14,406 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-28 05:11:14,406 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-28 05:11:14,406 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2024-11-28 05:11:14,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [310579186]
[2024-11-28 05:11:14,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [310579186] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-28 05:11:14,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-28 05:11:14,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-11-28 05:11:14,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166416827]
[2024-11-28 05:11:14,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-28 05:11:14,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-11-28 05:11:14,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2024-11-28 05:11:14,408 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-11-28 05:11:14,408 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2024-11-28 05:11:14,409 INFO L87 Difference]: Start difference. First operand 770 states and 829 transitions. Second operand has 7 states, 5 states have (on average 13.2) internal successors, (66), 6 states have internal predecessors, (66), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2024-11-28 05:11:17,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-28 05:11:17,426 INFO L93 Difference]: Finished difference Result 782 states and 844 transitions.
[2024-11-28 05:11:17,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2024-11-28 05:11:17,427 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 13.2) internal successors, (66), 6 states have internal predecessors, (66), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 68
[2024-11-28 05:11:17,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-28 05:11:17,428 INFO L225 Difference]: With dead ends: 782
[2024-11-28 05:11:17,428 INFO L226 Difference]: Without dead ends: 782
[2024-11-28 05:11:17,428 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-11-28 05:11:17,429 INFO L435 NwaCegarLoop]: 718 mSDtfsCounter, 12 mSDsluCounter, 2208 mSDsCounter, 0 mSdLazyCounter, 1460 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 2926 SdHoareTripleChecker+Invalid, 1474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time
[2024-11-28 05:11:17,429 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 2926 Invalid, 1474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1460 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time]
[2024-11-28 05:11:17,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 782 states.
[2024-11-28 05:11:17,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 782 to 776.
[2024-11-28 05:11:17,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 776 states, 487 states have (on average 1.6632443531827514) internal successors, (810), 769 states have internal predecessors, (810), 13 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (16), 5 states have call predecessors, (16), 13 states have call successors, (16)
[2024-11-28 05:11:17,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 839 transitions.
[2024-11-28 05:11:17,443 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 839 transitions. Word has length 68
[2024-11-28 05:11:17,443 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-28 05:11:17,443 INFO L471 AbstractCegarLoop]: Abstraction has 776 states and 839 transitions.
[2024-11-28 05:11:17,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 13.2) internal successors, (66), 6 states have internal predecessors, (66), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2024-11-28 05:11:17,444 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 839 transitions.
[2024-11-28 05:11:17,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69
[2024-11-28 05:11:17,444 INFO L210 NwaCegarLoop]: Found error trace
[2024-11-28 05:11:17,445 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-28 05:11:17,458 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0
[2024-11-28 05:11:17,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-28 05:11:17,645 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] ===
[2024-11-28 05:11:17,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-28 05:11:17,645 INFO L85 PathProgramCache]: Analyzing trace with hash 610113023, now seen corresponding path program 1 times
[2024-11-28 05:11:17,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX
[2024-11-28 05:11:17,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1753501567]
[2024-11-28 05:11:17,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-28 05:11:17,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-28 05:11:17,646 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/z3
[2024-11-28 05:11:17,650 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-28 05:11:17,652 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process
[2024-11-28 05:11:17,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-28 05:11:17,883 INFO L256 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 3 conjuncts are in the unsatisfiable core
[2024-11-28 05:11:17,885 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2024-11-28 05:11:17,909 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-28 05:11:17,909 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-28 05:11:17,909 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2024-11-28 05:11:17,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1753501567]
[2024-11-28 05:11:17,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1753501567] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-28 05:11:17,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-28 05:11:17,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-28 05:11:17,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250374760]
[2024-11-28 05:11:17,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-28 05:11:17,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-28 05:11:17,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2024-11-28 05:11:17,911 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-28 05:11:17,911 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-28 05:11:17,911 INFO L87 Difference]: Start difference. First operand 776 states and 839 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2024-11-28 05:11:17,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-28 05:11:17,959 INFO L93 Difference]: Finished difference Result 773 states and 833 transitions.
[2024-11-28 05:11:17,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2024-11-28 05:11:17,960 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 68
[2024-11-28 05:11:17,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-28 05:11:17,963 INFO L225 Difference]: With dead ends: 773
[2024-11-28 05:11:17,963 INFO L226 Difference]: Without dead ends: 773
[2024-11-28 05:11:17,963 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-28 05:11:17,964 INFO L435 NwaCegarLoop]: 732 mSDtfsCounter, 0 mSDsluCounter, 1459 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2191 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-28 05:11:17,964 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2191 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-28 05:11:17,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 773 states.
[2024-11-28 05:11:17,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 773 to 773.
[2024-11-28 05:11:17,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 773 states, 484 states have (on average 1.665289256198347) internal successors, (806), 767 states have internal predecessors, (806), 13 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (14), 4 states have call predecessors, (14), 13 states have call successors, (14)
[2024-11-28 05:11:17,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 833 transitions.
[2024-11-28 05:11:17,978 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 833 transitions. Word has length 68
[2024-11-28 05:11:17,978 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-28 05:11:17,978 INFO L471 AbstractCegarLoop]: Abstraction has 773 states and 833 transitions.
[2024-11-28 05:11:17,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2024-11-28 05:11:17,979 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 833 transitions.
[2024-11-28 05:11:17,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70
[2024-11-28 05:11:17,979 INFO L210 NwaCegarLoop]: Found error trace
[2024-11-28 05:11:17,979 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-28 05:11:17,993 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0
[2024-11-28 05:11:18,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-28 05:11:18,180 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] ===
[2024-11-28 05:11:18,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-28 05:11:18,181 INFO L85 PathProgramCache]: Analyzing trace with hash -1266022057, now seen corresponding path program 1 times
[2024-11-28 05:11:18,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX
[2024-11-28 05:11:18,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2114625817]
[2024-11-28 05:11:18,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-28 05:11:18,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-28 05:11:18,181 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/z3
[2024-11-28 05:11:18,183 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-28 05:11:18,184 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process
[2024-11-28 05:11:18,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-28 05:11:18,416 INFO L256 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 4 conjuncts are in the unsatisfiable core
[2024-11-28 05:11:18,418 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2024-11-28 05:11:18,449 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-28 05:11:18,449 INFO L312 TraceCheckSpWp]: Computing backward predicates...
[2024-11-28 05:11:18,531 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-28 05:11:18,532 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2024-11-28 05:11:18,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2114625817]
[2024-11-28 05:11:18,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2114625817] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-28 05:11:18,533 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2024-11-28 05:11:18,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8
[2024-11-28 05:11:18,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837453285]
[2024-11-28 05:11:18,533 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2024-11-28 05:11:18,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-11-28 05:11:18,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2024-11-28 05:11:18,534 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-11-28 05:11:18,534 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56
[2024-11-28 05:11:18,535 INFO L87 Difference]: Start difference. First operand 773 states and 833 transitions. Second operand has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)
[2024-11-28 05:11:18,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-28 05:11:18,736 INFO L93 Difference]: Finished difference Result 785 states and 850 transitions.
[2024-11-28 05:11:18,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2024-11-28 05:11:18,737 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 69
[2024-11-28 05:11:18,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-28 05:11:18,740 INFO L225 Difference]: With dead ends: 785
[2024-11-28 05:11:18,740 INFO L226 Difference]: Without dead ends: 785
[2024-11-28 05:11:18,740 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 130 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-28 05:11:18,741 INFO L435 NwaCegarLoop]: 732 mSDtfsCounter, 5 mSDsluCounter, 4367 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 5099 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-11-28 05:11:18,741 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 5099 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-11-28 05:11:18,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 785 states.
[2024-11-28 05:11:18,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 785 to 783.
[2024-11-28 05:11:18,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 783 states, 493 states have (on average 1.6653144016227182) internal successors, (821), 776 states have internal predecessors, (821), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 4 states have call predecessors, (14), 13 states have call successors, (14)
[2024-11-28 05:11:18,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 848 transitions.
[2024-11-28 05:11:18,755 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 848 transitions. Word has length 69
[2024-11-28 05:11:18,755 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-28 05:11:18,755 INFO L471 AbstractCegarLoop]: Abstraction has 783 states and 848 transitions.
[2024-11-28 05:11:18,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)
[2024-11-28 05:11:18,755 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 848 transitions.
[2024-11-28 05:11:18,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73
[2024-11-28 05:11:18,756 INFO L210 NwaCegarLoop]: Found error trace
[2024-11-28 05:11:18,756 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-28 05:11:18,771 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0
[2024-11-28 05:11:18,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-28 05:11:18,957 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] ===
[2024-11-28 05:11:18,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-28 05:11:18,957 INFO L85 PathProgramCache]: Analyzing trace with hash 93070398, now seen corresponding path program 2 times
[2024-11-28 05:11:18,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX
[2024-11-28 05:11:18,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1283375639]
[2024-11-28 05:11:18,957 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-11-28 05:11:18,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-28 05:11:18,958 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/z3
[2024-11-28 05:11:18,960 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-28 05:11:18,962 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process
[2024-11-28 05:11:36,241 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2024-11-28 05:11:36,241 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat
[2024-11-28 05:11:36,254 INFO L256 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 16 conjuncts are in the unsatisfiable core
[2024-11-28 05:11:36,257 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2024-11-28 05:11:36,375 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size
[2024-11-28 05:11:36,375 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-28 05:11:36,400 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-28 05:11:36,609 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size
[2024-11-28 05:11:36,609 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-28 05:11:36,656 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15
[2024-11-28 05:11:36,680 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-28 05:11:36,680 INFO L312 TraceCheckSpWp]: Computing backward predicates...
[2024-11-28 05:11:36,792 INFO L349 Elim1Store]: treesize reduction 7, result has 63.2 percent of original size
[2024-11-28 05:11:36,792 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-28 05:11:36,804 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_849 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_#t~mem32#1.base| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_849) |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-28 05:11:36,807 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2024-11-28 05:11:36,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1283375639]
[2024-11-28 05:11:36,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1283375639] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-28 05:11:36,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1118958615]
[2024-11-28 05:11:36,808 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-11-28 05:11:36,808 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt
[2024-11-28 05:11:36,808 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/cvc4
[2024-11-28 05:11:36,810 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null)
[2024-11-28 05:11:36,811 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (18)] Waiting until timeout for monitored process
[2024-11-28 05:11:37,851 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2024-11-28 05:11:37,851 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat
[2024-11-28 05:11:37,858 INFO L256 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 9 conjuncts are in the unsatisfiable core
[2024-11-28 05:11:37,859 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2024-11-28 05:11:38,075 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-28 05:11:38,075 INFO L312 TraceCheckSpWp]: Computing backward predicates...
[2024-11-28 05:11:38,445 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-28 05:11:38,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1118958615] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-28 05:11:38,445 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-28 05:11:38,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 24
[2024-11-28 05:11:38,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777303057]
[2024-11-28 05:11:38,446 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-28 05:11:38,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states
[2024-11-28 05:11:38,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2024-11-28 05:11:38,447 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants.
[2024-11-28 05:11:38,447 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=513, Unknown=1, NotChecked=46, Total=650
[2024-11-28 05:11:38,447 INFO L87 Difference]: Start difference. First operand 783 states and 848 transitions. Second operand has 24 states, 23 states have (on average 5.913043478260869) internal successors, (136), 23 states have internal predecessors, (136), 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-28 05:11:47,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-28 05:11:47,649 INFO L93 Difference]: Finished difference Result 799 states and 870 transitions.
[2024-11-28 05:11:47,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states.
[2024-11-28 05:11:47,650 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 5.913043478260869) internal successors, (136), 23 states have internal predecessors, (136), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 72
[2024-11-28 05:11:47,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-28 05:11:47,651 INFO L225 Difference]: With dead ends: 799
[2024-11-28 05:11:47,651 INFO L226 Difference]: Without dead ends: 793
[2024-11-28 05:11:47,652 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 450 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=392, Invalid=2161, Unknown=1, NotChecked=98, Total=2652
[2024-11-28 05:11:47,653 INFO L435 NwaCegarLoop]: 496 mSDtfsCounter, 495 mSDsluCounter, 6226 mSDsCounter, 0 mSdLazyCounter, 4788 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 508 SdHoareTripleChecker+Valid, 6722 SdHoareTripleChecker+Invalid, 4820 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 4788 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.2s IncrementalHoareTripleChecker+Time
[2024-11-28 05:11:47,653 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [508 Valid, 6722 Invalid, 4820 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 4788 Invalid, 0 Unknown, 0 Unchecked, 8.2s Time]
[2024-11-28 05:11:47,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 793 states.
[2024-11-28 05:11:47,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 793 to 791.
[2024-11-28 05:11:47,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 791 states, 502 states have (on average 1.655378486055777) internal successors, (831), 784 states have internal predecessors, (831), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 4 states have call predecessors, (14), 13 states have call successors, (14)
[2024-11-28 05:11:47,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 858 transitions.
[2024-11-28 05:11:47,667 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 858 transitions. Word has length 72
[2024-11-28 05:11:47,667 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-28 05:11:47,667 INFO L471 AbstractCegarLoop]: Abstraction has 791 states and 858 transitions.
[2024-11-28 05:11:47,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 5.913043478260869) internal successors, (136), 23 states have internal predecessors, (136), 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-28 05:11:47,668 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 858 transitions.
[2024-11-28 05:11:47,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79
[2024-11-28 05:11:47,668 INFO L210 NwaCegarLoop]: Found error trace
[2024-11-28 05:11:47,668 INFO L218 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-28 05:11:47,676 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (18)] Ended with exit code 0
[2024-11-28 05:11:47,898 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0
[2024-11-28 05:11:48,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-28 05:11:48,069 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] ===
[2024-11-28 05:11:48,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-28 05:11:48,070 INFO L85 PathProgramCache]: Analyzing trace with hash 785046943, now seen corresponding path program 1 times
[2024-11-28 05:11:48,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX
[2024-11-28 05:11:48,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1212864673]
[2024-11-28 05:11:48,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-28 05:11:48,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-28 05:11:48,070 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/z3
[2024-11-28 05:11:48,072 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-28 05:11:48,074 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process
[2024-11-28 05:11:48,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-28 05:11:48,351 INFO L256 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 14 conjuncts are in the unsatisfiable core
[2024-11-28 05:11:48,353 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2024-11-28 05:11:48,506 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-28 05:11:48,506 INFO L312 TraceCheckSpWp]: Computing backward predicates...
[2024-11-28 05:11:49,148 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-28 05:11:49,148 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2024-11-28 05:11:49,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1212864673]
[2024-11-28 05:11:49,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1212864673] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-28 05:11:49,148 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2024-11-28 05:11:49,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26
[2024-11-28 05:11:49,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983199714]
[2024-11-28 05:11:49,149 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2024-11-28 05:11:49,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states
[2024-11-28 05:11:49,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2024-11-28 05:11:49,150 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants.
[2024-11-28 05:11:49,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650
[2024-11-28 05:11:49,150 INFO L87 Difference]: Start difference. First operand 791 states and 858 transitions. Second operand has 26 states, 26 states have (on average 3.423076923076923) internal successors, (89), 26 states have internal predecessors, (89), 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-28 05:11:51,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-28 05:11:51,109 INFO L93 Difference]: Finished difference Result 815 states and 897 transitions.
[2024-11-28 05:11:51,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states.
[2024-11-28 05:11:51,110 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.423076923076923) internal successors, (89), 26 states have internal predecessors, (89), 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 78
[2024-11-28 05:11:51,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-28 05:11:51,113 INFO L225 Difference]: With dead ends: 815
[2024-11-28 05:11:51,113 INFO L226 Difference]: Without dead ends: 809
[2024-11-28 05:11:51,114 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=728, Invalid=1434, Unknown=0, NotChecked=0, Total=2162
[2024-11-28 05:11:51,114 INFO L435 NwaCegarLoop]: 732 mSDtfsCounter, 18 mSDsluCounter, 8746 mSDsCounter, 0 mSdLazyCounter, 566 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 9478 SdHoareTripleChecker+Invalid, 579 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 566 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time
[2024-11-28 05:11:51,115 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 9478 Invalid, 579 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 566 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time]
[2024-11-28 05:11:51,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 809 states.
[2024-11-28 05:11:51,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 809 to 809.
[2024-11-28 05:11:51,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 809 states, 520 states have (on average 1.6423076923076922) internal successors, (854), 802 states have internal predecessors, (854), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 4 states have call predecessors, (14), 13 states have call successors, (14)
[2024-11-28 05:11:51,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 809 states to 809 states and 881 transitions.
[2024-11-28 05:11:51,141 INFO L78 Accepts]: Start accepts. Automaton has 809 states and 881 transitions. Word has length 78
[2024-11-28 05:11:51,141 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-28 05:11:51,141 INFO L471 AbstractCegarLoop]: Abstraction has 809 states and 881 transitions.
[2024-11-28 05:11:51,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.423076923076923) internal successors, (89), 26 states have internal predecessors, (89), 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-28 05:11:51,141 INFO L276 IsEmpty]: Start isEmpty. Operand 809 states and 881 transitions.
[2024-11-28 05:11:51,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91
[2024-11-28 05:11:51,142 INFO L210 NwaCegarLoop]: Found error trace
[2024-11-28 05:11:51,142 INFO L218 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-28 05:11:51,156 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0
[2024-11-28 05:11:51,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-28 05:11:51,343 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] ===
[2024-11-28 05:11:51,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-28 05:11:51,343 INFO L85 PathProgramCache]: Analyzing trace with hash -2050705313, now seen corresponding path program 2 times
[2024-11-28 05:11:51,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX
[2024-11-28 05:11:51,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1726106291]
[2024-11-28 05:11:51,344 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-11-28 05:11:51,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-28 05:11:51,344 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/z3
[2024-11-28 05:11:51,345 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-28 05:11:51,346 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process
[2024-11-28 05:12:10,509 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2024-11-28 05:12:10,509 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat
[2024-11-28 05:12:10,527 INFO L256 TraceCheckSpWp]: Trace formula consists of 523 conjuncts, 64 conjuncts are in the unsatisfiable core
[2024-11-28 05:12:10,534 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2024-11-28 05:12:10,641 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size
[2024-11-28 05:12:10,641 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-28 05:12:10,649 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-28 05:12:10,684 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-28 05:12:10,697 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-28 05:12:10,804 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-28 05:12:10,809 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-28 05:12:11,340 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size
[2024-11-28 05:12:11,340 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-28 05:12:11,354 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-28 05:12:11,397 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-28 05:12:11,402 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-28 05:12:11,428 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-28 05:12:11,428 INFO L312 TraceCheckSpWp]: Computing backward predicates...
[2024-11-28 05:12:11,959 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_1424 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_1424) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv16 32) .cse0) (bvadd (_ bv20 32) .cse0)))) (forall ((v_ArrVal_1424 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1425 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv20 32) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_1424) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_1425) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false
[2024-11-28 05:12:11,963 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2024-11-28 05:12:11,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1726106291]
[2024-11-28 05:12:11,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1726106291] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-28 05:12:11,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [517815670]
[2024-11-28 05:12:11,963 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-11-28 05:12:11,963 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt
[2024-11-28 05:12:11,963 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/cvc4
[2024-11-28 05:12:11,965 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null)
[2024-11-28 05:12:11,966 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (21)] Waiting until timeout for monitored process
[2024-11-28 05:12:13,204 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2024-11-28 05:12:13,204 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat
[2024-11-28 05:12:13,256 INFO L256 TraceCheckSpWp]: Trace formula consists of 523 conjuncts, 45 conjuncts are in the unsatisfiable core
[2024-11-28 05:12:13,258 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2024-11-28 05:12:14,625 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-28 05:12:14,626 INFO L312 TraceCheckSpWp]: Computing backward predicates...
[2024-11-28 05:12:18,072 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-28 05:12:18,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [517815670] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-28 05:12:18,072 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-28 05:12:18,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 26, 26] total 58
[2024-11-28 05:12:18,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602021321]
[2024-11-28 05:12:18,073 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-28 05:12:18,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 58 states
[2024-11-28 05:12:18,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2024-11-28 05:12:18,074 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants.
[2024-11-28 05:12:18,075 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=699, Invalid=2844, Unknown=1, NotChecked=116, Total=3660
[2024-11-28 05:12:18,075 INFO L87 Difference]: Start difference. First operand 809 states and 881 transitions. Second operand has 58 states, 57 states have (on average 3.017543859649123) internal successors, (172), 58 states have internal predecessors, (172), 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-28 05:12:52,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-28 05:12:52,157 INFO L93 Difference]: Finished difference Result 856 states and 958 transitions.
[2024-11-28 05:12:52,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states.
[2024-11-28 05:12:52,157 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 57 states have (on average 3.017543859649123) internal successors, (172), 58 states have internal predecessors, (172), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 90
[2024-11-28 05:12:52,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-28 05:12:52,160 INFO L225 Difference]: With dead ends: 856
[2024-11-28 05:12:52,160 INFO L226 Difference]: Without dead ends: 844
[2024-11-28 05:12:52,164 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 351 GetRequests, 214 SyntacticMatches, 1 SemanticMatches, 136 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 3244 ImplicationChecksByTransitivity, 14.3s TimeCoverageRelationStatistics Valid=3205, Invalid=15430, Unknown=1, NotChecked=270, Total=18906
[2024-11-28 05:12:52,165 INFO L435 NwaCegarLoop]: 502 mSDtfsCounter, 508 mSDsluCounter, 13485 mSDsCounter, 0 mSdLazyCounter, 10589 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 520 SdHoareTripleChecker+Valid, 13987 SdHoareTripleChecker+Invalid, 10618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 10589 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 23.6s IncrementalHoareTripleChecker+Time
[2024-11-28 05:12:52,165 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [520 Valid, 13987 Invalid, 10618 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [29 Valid, 10589 Invalid, 0 Unknown, 0 Unchecked, 23.6s Time]
[2024-11-28 05:12:52,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 844 states.
[2024-11-28 05:12:52,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 844 to 844.
[2024-11-28 05:12:52,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 844 states, 556 states have (on average 1.6133093525179856) internal successors, (897), 837 states have internal predecessors, (897), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 4 states have call predecessors, (14), 13 states have call successors, (14)
[2024-11-28 05:12:52,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 844 states to 844 states and 924 transitions.
[2024-11-28 05:12:52,179 INFO L78 Accepts]: Start accepts. Automaton has 844 states and 924 transitions. Word has length 90
[2024-11-28 05:12:52,179 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-28 05:12:52,179 INFO L471 AbstractCegarLoop]: Abstraction has 844 states and 924 transitions.
[2024-11-28 05:12:52,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 57 states have (on average 3.017543859649123) internal successors, (172), 58 states have internal predecessors, (172), 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-28 05:12:52,180 INFO L276 IsEmpty]: Start isEmpty. Operand 844 states and 924 transitions.
[2024-11-28 05:12:52,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116
[2024-11-28 05:12:52,181 INFO L210 NwaCegarLoop]: Found error trace
[2024-11-28 05:12:52,181 INFO L218 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-28 05:12:52,212 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0
[2024-11-28 05:12:52,387 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (21)] Ended with exit code 0
[2024-11-28 05:12:52,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt
[2024-11-28 05:12:52,582 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr74REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] ===
[2024-11-28 05:12:52,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-28 05:12:52,582 INFO L85 PathProgramCache]: Analyzing trace with hash -2037270199, now seen corresponding path program 1 times
[2024-11-28 05:12:52,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX
[2024-11-28 05:12:52,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1561857866]
[2024-11-28 05:12:52,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-28 05:12:52,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-28 05:12:52,583 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/z3
[2024-11-28 05:12:52,585 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-28 05:12:52,586 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process
[2024-11-28 05:12:53,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-28 05:12:53,070 INFO L256 TraceCheckSpWp]: Trace formula consists of 785 conjuncts, 58 conjuncts are in the unsatisfiable core
[2024-11-28 05:12:53,078 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2024-11-28 05:12:53,081 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-28 05:12:53,197 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size
[2024-11-28 05:12:53,197 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-28 05:12:53,212 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-28 05:12:53,766 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size
[2024-11-28 05:12:53,766 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43
[2024-11-28 05:12:53,879 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size
[2024-11-28 05:12:53,879 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-28 05:12:53,899 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-28 05:12:53,919 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-28 05:12:53,919 INFO L312 TraceCheckSpWp]: Computing backward predicates...
[2024-11-28 05:12:54,025 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2050 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_2050) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false
[2024-11-28 05:12:54,451 INFO L349 Elim1Store]: treesize reduction 7, result has 77.4 percent of original size
[2024-11-28 05:12:54,451 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-28 05:12:54,460 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2096 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2050 (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$#1.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_2096))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2050)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |c_ULTIMATE.start_main_#t~mem32#1.base|)) is different from false
[2024-11-28 05:12:54,462 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2024-11-28 05:12:54,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1561857866]
[2024-11-28 05:12:54,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1561857866] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-28 05:12:54,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [68415766]
[2024-11-28 05:12:54,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-28 05:12:54,462 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt
[2024-11-28 05:12:54,462 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/cvc4
[2024-11-28 05:12:54,464 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null)
[2024-11-28 05:12:54,465 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (23)] Waiting until timeout for monitored process
[2024-11-28 05:12:57,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-28 05:12:57,384 INFO L256 TraceCheckSpWp]: Trace formula consists of 785 conjuncts, 62 conjuncts are in the unsatisfiable core
[2024-11-28 05:12:57,392 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2024-11-28 05:12:57,428 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size
[2024-11-28 05:12:57,428 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-28 05:12:57,806 INFO L349 Elim1Store]: treesize reduction 54, result has 29.9 percent of original size
[2024-11-28 05:12:57,806 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-28 05:12:57,877 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1
[2024-11-28 05:12:58,135 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-28 05:12:59,729 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size
[2024-11-28 05:12:59,729 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-28 05:12:59,931 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size
[2024-11-28 05:12:59,931 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-28 05:12:59,981 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-28 05:13:00,070 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-28 05:13:00,070 INFO L312 TraceCheckSpWp]: Computing backward predicates...
[2024-11-28 05:13:00,566 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2050 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2548 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_2548))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2050)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false
[2024-11-28 05:13:00,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [68415766] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-28 05:13:00,569 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2024-11-28 05:13:00,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 20
[2024-11-28 05:13:00,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38113861]
[2024-11-28 05:13:00,569 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2024-11-28 05:13:00,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states
[2024-11-28 05:13:00,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2024-11-28 05:13:00,570 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants.
[2024-11-28 05:13:00,571 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=414, Unknown=11, NotChecked=132, Total=650
[2024-11-28 05:13:00,571 INFO L87 Difference]: Start difference. First operand 844 states and 924 transitions. Second operand has 21 states, 18 states have (on average 7.888888888888889) internal successors, (142), 20 states have internal predecessors, (142), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)
[2024-11-28 05:13:10,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-28 05:13:10,564 INFO L93 Difference]: Finished difference Result 1544 states and 1694 transitions.
[2024-11-28 05:13:10,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states.
[2024-11-28 05:13:10,564 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 18 states have (on average 7.888888888888889) internal successors, (142), 20 states have internal predecessors, (142), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 115
[2024-11-28 05:13:10,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-28 05:13:10,569 INFO L225 Difference]: With dead ends: 1544
[2024-11-28 05:13:10,570 INFO L226 Difference]: Without dead ends: 1544
[2024-11-28 05:13:10,570 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 216 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 314 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=202, Invalid=1056, Unknown=14, NotChecked=210, Total=1482
[2024-11-28 05:13:10,571 INFO L435 NwaCegarLoop]: 392 mSDtfsCounter, 1005 mSDsluCounter, 4560 mSDsCounter, 0 mSdLazyCounter, 5028 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1031 SdHoareTripleChecker+Valid, 4952 SdHoareTripleChecker+Invalid, 5078 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 5028 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.5s IncrementalHoareTripleChecker+Time
[2024-11-28 05:13:10,571 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1031 Valid, 4952 Invalid, 5078 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 5028 Invalid, 0 Unknown, 0 Unchecked, 9.5s Time]
[2024-11-28 05:13:10,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1544 states.
[2024-11-28 05:13:10,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1544 to 843.
[2024-11-28 05:13:10,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 843 states, 556 states have (on average 1.6115107913669064) internal successors, (896), 836 states have internal predecessors, (896), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 4 states have call predecessors, (14), 13 states have call successors, (14)
[2024-11-28 05:13:10,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 843 states to 843 states and 923 transitions.
[2024-11-28 05:13:10,591 INFO L78 Accepts]: Start accepts. Automaton has 843 states and 923 transitions. Word has length 115
[2024-11-28 05:13:10,591 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-28 05:13:10,591 INFO L471 AbstractCegarLoop]: Abstraction has 843 states and 923 transitions.
[2024-11-28 05:13:10,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 18 states have (on average 7.888888888888889) internal successors, (142), 20 states have internal predecessors, (142), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)
[2024-11-28 05:13:10,592 INFO L276 IsEmpty]: Start isEmpty. Operand 843 states and 923 transitions.
[2024-11-28 05:13:10,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116
[2024-11-28 05:13:10,592 INFO L210 NwaCegarLoop]: Found error trace
[2024-11-28 05:13:10,593 INFO L218 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-28 05:13:10,610 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0
[2024-11-28 05:13:10,803 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (23)] Ended with exit code 0
[2024-11-28 05:13:10,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt
[2024-11-28 05:13:10,993 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] ===
[2024-11-28 05:13:10,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-28 05:13:10,994 INFO L85 PathProgramCache]: Analyzing trace with hash -2037270198, now seen corresponding path program 1 times
[2024-11-28 05:13:10,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX
[2024-11-28 05:13:10,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1973036235]
[2024-11-28 05:13:10,995 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-28 05:13:10,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-28 05:13:10,995 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/z3
[2024-11-28 05:13:10,996 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-28 05:13:10,998 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process
[2024-11-28 05:13:11,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-28 05:13:11,561 INFO L256 TraceCheckSpWp]: Trace formula consists of 785 conjuncts, 111 conjuncts are in the unsatisfiable core
[2024-11-28 05:13:11,573 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2024-11-28 05:13:11,577 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-28 05:13:11,714 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-28 05:13:11,729 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size
[2024-11-28 05:13:11,729 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-28 05:13:11,752 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-28 05:13:11,760 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-28 05:13:11,859 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-28 05:13:11,865 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-28 05:13:12,655 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size
[2024-11-28 05:13:12,655 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-28 05:13:12,669 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-28 05:13:12,796 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size
[2024-11-28 05:13:12,796 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-28 05:13:12,806 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-28 05:13:12,838 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-28 05:13:12,847 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-28 05:13:12,877 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-28 05:13:12,877 INFO L312 TraceCheckSpWp]: Computing backward predicates...
[2024-11-28 05:13:13,051 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_3001 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3000 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_3000) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_3001) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_3000 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_3000) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv4 32) .cse1) (bvadd (_ bv8 32) .cse1)))))) is different from false
[2024-11-28 05:13:13,086 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_3000 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_3000) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_3001 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3000 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_3000) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_3001) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false
[2024-11-28 05:13:14,466 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_3093 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3092 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3000 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_3092) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_3093) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3000) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_3093 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3092 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3001 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3000 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_3093))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_3092) .cse2 v_ArrVal_3000) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_3001) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false
[2024-11-28 05:13:14,475 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2024-11-28 05:13:14,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1973036235]
[2024-11-28 05:13:14,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1973036235] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-28 05:13:14,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [692529671]
[2024-11-28 05:13:14,476 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-28 05:13:14,476 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt
[2024-11-28 05:13:14,476 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/cvc4
[2024-11-28 05:13:14,478 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null)
[2024-11-28 05:13:14,482 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (25)] Waiting until timeout for monitored process
[2024-11-28 05:13:17,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-28 05:13:17,410 INFO L256 TraceCheckSpWp]: Trace formula consists of 785 conjuncts, 112 conjuncts are in the unsatisfiable core
[2024-11-28 05:13:17,424 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2024-11-28 05:13:17,428 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-28 05:13:17,566 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size
[2024-11-28 05:13:17,566 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-28 05:13:17,574 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-28 05:13:17,592 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-28 05:13:17,602 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-28 05:13:17,672 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-28 05:13:17,679 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-28 05:13:18,456 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size
[2024-11-28 05:13:18,456 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-28 05:13:18,463 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-28 05:13:18,529 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size
[2024-11-28 05:13:18,530 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-28 05:13:18,538 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-28 05:13:18,563 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-28 05:13:18,575 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-28 05:13:18,577 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-28 05:13:18,577 INFO L312 TraceCheckSpWp]: Computing backward predicates...
[2024-11-28 05:13:18,645 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_3545 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3546 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_3546) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_3545) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_3546 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_3546) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv4 32) .cse1) (bvadd (_ bv8 32) .cse1)))))) is different from false
[2024-11-28 05:13:18,679 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_3545 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3546 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_3546) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_3545) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_3546 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_3546) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse2 (_ bv4 32)) (bvadd .cse2 (_ bv8 32)))))))) is different from false
[2024-11-28 05:13:20,080 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_3637 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3638 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3545 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3546 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_3638))) (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$#1.offset| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_3637) .cse0 v_ArrVal_3546) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_3545) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_3637 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3638 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3546 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_3637) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_3638) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3546) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse3) (bvadd (_ bv8 32) .cse3)))))) is different from false
[2024-11-28 05:13:20,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [692529671] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-28 05:13:20,087 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2024-11-28 05:13:20,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9
[2024-11-28 05:13:20,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751362898]
[2024-11-28 05:13:20,087 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2024-11-28 05:13:20,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-11-28 05:13:20,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2024-11-28 05:13:20,088 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-11-28 05:13:20,088 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=110, Unknown=6, NotChecked=150, Total=306
[2024-11-28 05:13:20,088 INFO L87 Difference]: Start difference. First operand 843 states and 923 transitions. Second operand has 10 states, 8 states have (on average 8.875) internal successors, (71), 10 states have internal predecessors, (71), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2024-11-28 05:13:25,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-28 05:13:25,696 INFO L93 Difference]: Finished difference Result 842 states and 922 transitions.
[2024-11-28 05:13:25,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2024-11-28 05:13:25,697 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 8.875) internal successors, (71), 10 states have internal predecessors, (71), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 115
[2024-11-28 05:13:25,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-28 05:13:25,702 INFO L225 Difference]: With dead ends: 842
[2024-11-28 05:13:25,703 INFO L226 Difference]: Without dead ends: 842
[2024-11-28 05:13:25,703 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 223 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=71, Invalid=219, Unknown=6, NotChecked=210, Total=506
[2024-11-28 05:13:25,703 INFO L435 NwaCegarLoop]: 502 mSDtfsCounter, 414 mSDsluCounter, 1616 mSDsCounter, 0 mSdLazyCounter, 2528 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 426 SdHoareTripleChecker+Valid, 2118 SdHoareTripleChecker+Invalid, 2535 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 2528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time
[2024-11-28 05:13:25,704 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [426 Valid, 2118 Invalid, 2535 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 2528 Invalid, 0 Unknown, 0 Unchecked, 5.4s Time]
[2024-11-28 05:13:25,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 842 states.
[2024-11-28 05:13:25,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 842 to 842.
[2024-11-28 05:13:25,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 842 states, 556 states have (on average 1.6097122302158273) internal successors, (895), 835 states have internal predecessors, (895), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 4 states have call predecessors, (14), 13 states have call successors, (14)
[2024-11-28 05:13:25,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 842 states to 842 states and 922 transitions.
[2024-11-28 05:13:25,717 INFO L78 Accepts]: Start accepts. Automaton has 842 states and 922 transitions. Word has length 115
[2024-11-28 05:13:25,717 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-28 05:13:25,717 INFO L471 AbstractCegarLoop]: Abstraction has 842 states and 922 transitions.
[2024-11-28 05:13:25,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 8.875) internal successors, (71), 10 states have internal predecessors, (71), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2024-11-28 05:13:25,717 INFO L276 IsEmpty]: Start isEmpty. Operand 842 states and 922 transitions.
[2024-11-28 05:13:25,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119
[2024-11-28 05:13:25,718 INFO L210 NwaCegarLoop]: Found error trace
[2024-11-28 05:13:25,719 INFO L218 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-28 05:13:25,736 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0
[2024-11-28 05:13:25,929 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (25)] Ended with exit code 0
[2024-11-28 05:13:26,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt
[2024-11-28 05:13:26,119 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] ===
[2024-11-28 05:13:26,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-28 05:13:26,120 INFO L85 PathProgramCache]: Analyzing trace with hash -133341691, now seen corresponding path program 1 times
[2024-11-28 05:13:26,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX
[2024-11-28 05:13:26,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1995850271]
[2024-11-28 05:13:26,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-28 05:13:26,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-28 05:13:26,121 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/z3
[2024-11-28 05:13:26,123 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-28 05:13:26,125 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process
[2024-11-28 05:13:26,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-28 05:13:26,691 INFO L256 TraceCheckSpWp]: Trace formula consists of 814 conjuncts, 59 conjuncts are in the unsatisfiable core
[2024-11-28 05:13:26,698 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2024-11-28 05:13:26,799 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size
[2024-11-28 05:13:26,799 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-28 05:13:26,813 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-28 05:13:27,323 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size
[2024-11-28 05:13:27,323 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-28 05:13:27,413 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size
[2024-11-28 05:13:27,413 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-28 05:13:27,483 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size
[2024-11-28 05:13:27,484 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-28 05:13:27,498 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-28 05:13:27,519 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-28 05:13:27,520 INFO L312 TraceCheckSpWp]: Computing backward predicates...
[2024-11-28 05:13:27,561 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4058 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4058) |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-28 05:13:27,579 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4058 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_4058) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false
[2024-11-28 05:13:27,592 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4058 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4057 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_4057))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4058)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false
[2024-11-28 05:13:27,601 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4058 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4057 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4057))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4058)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false
[2024-11-28 05:13:28,031 INFO L349 Elim1Store]: treesize reduction 7, result has 87.3 percent of original size
[2024-11-28 05:13:28,031 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-28 05:13:28,042 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4058 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4057 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4104 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_#t~mem32#1.base| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_4104))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4057)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4058)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) is different from false
[2024-11-28 05:13:28,044 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2024-11-28 05:13:28,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1995850271]
[2024-11-28 05:13:28,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1995850271] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-28 05:13:28,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [399434319]
[2024-11-28 05:13:28,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-28 05:13:28,045 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt
[2024-11-28 05:13:28,045 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/cvc4
[2024-11-28 05:13:28,046 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null)
[2024-11-28 05:13:28,047 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (27)] Waiting until timeout for monitored process
[2024-11-28 05:13:38,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-28 05:13:38,497 INFO L256 TraceCheckSpWp]: Trace formula consists of 814 conjuncts, 64 conjuncts are in the unsatisfiable core
[2024-11-28 05:13:38,504 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2024-11-28 05:13:38,540 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size
[2024-11-28 05:13:38,541 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-28 05:13:38,847 INFO L349 Elim1Store]: treesize reduction 54, result has 29.9 percent of original size
[2024-11-28 05:13:38,847 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-28 05:13:38,910 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-28 05:13:39,113 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-28 05:13:40,474 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size
[2024-11-28 05:13:40,474 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-28 05:13:40,673 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size
[2024-11-28 05:13:40,673 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-28 05:13:40,808 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size
[2024-11-28 05:13:40,809 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-28 05:13:40,846 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-28 05:13:40,919 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-28 05:13:40,919 INFO L312 TraceCheckSpWp]: Computing backward predicates...
[2024-11-28 05:13:40,933 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4526 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4526) |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-28 05:13:40,940 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4526 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_4526) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false
[2024-11-28 05:13:40,953 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4526 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4525 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_4525))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4526)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false
[2024-11-28 05:13:40,963 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4526 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4525 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4525))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4526)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false
[2024-11-28 05:13:41,367 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4526 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4525 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4572 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_4572))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4525)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4526)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false
[2024-11-28 05:13:41,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [399434319] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-28 05:13:41,370 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2024-11-28 05:13:41,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 22
[2024-11-28 05:13:41,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351075079]
[2024-11-28 05:13:41,371 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2024-11-28 05:13:41,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states
[2024-11-28 05:13:41,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2024-11-28 05:13:41,371 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants.
[2024-11-28 05:13:41,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=464, Unknown=10, NotChecked=530, Total=1122
[2024-11-28 05:13:41,374 INFO L87 Difference]: Start difference. First operand 842 states and 922 transitions. Second operand has 23 states, 20 states have (on average 7.4) internal successors, (148), 22 states have internal predecessors, (148), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)
[2024-11-28 05:13:49,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-28 05:13:49,072 INFO L93 Difference]: Finished difference Result 1540 states and 1690 transitions.
[2024-11-28 05:13:49,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states.
[2024-11-28 05:13:49,072 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 20 states have (on average 7.4) internal successors, (148), 22 states have internal predecessors, (148), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 118
[2024-11-28 05:13:49,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-28 05:13:49,075 INFO L225 Difference]: With dead ends: 1540
[2024-11-28 05:13:49,075 INFO L226 Difference]: Without dead ends: 1540
[2024-11-28 05:13:49,076 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 221 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 359 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=238, Invalid=1198, Unknown=10, NotChecked=810, Total=2256
[2024-11-28 05:13:49,076 INFO L435 NwaCegarLoop]: 391 mSDtfsCounter, 1698 mSDsluCounter, 3299 mSDsCounter, 0 mSdLazyCounter, 3753 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1724 SdHoareTripleChecker+Valid, 3690 SdHoareTripleChecker+Invalid, 3834 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 3753 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.2s IncrementalHoareTripleChecker+Time
[2024-11-28 05:13:49,076 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1724 Valid, 3690 Invalid, 3834 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 3753 Invalid, 0 Unknown, 0 Unchecked, 7.2s Time]
[2024-11-28 05:13:49,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1540 states.
[2024-11-28 05:13:49,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1540 to 841.
[2024-11-28 05:13:49,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 841 states, 556 states have (on average 1.6079136690647482) internal successors, (894), 834 states have internal predecessors, (894), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 4 states have call predecessors, (14), 13 states have call successors, (14)
[2024-11-28 05:13:49,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 841 states and 921 transitions.
[2024-11-28 05:13:49,092 INFO L78 Accepts]: Start accepts. Automaton has 841 states and 921 transitions. Word has length 118
[2024-11-28 05:13:49,092 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-28 05:13:49,092 INFO L471 AbstractCegarLoop]: Abstraction has 841 states and 921 transitions.
[2024-11-28 05:13:49,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 20 states have (on average 7.4) internal successors, (148), 22 states have internal predecessors, (148), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)
[2024-11-28 05:13:49,093 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 921 transitions.
[2024-11-28 05:13:49,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119
[2024-11-28 05:13:49,094 INFO L210 NwaCegarLoop]: Found error trace
[2024-11-28 05:13:49,095 INFO L218 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-28 05:13:49,116 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0
[2024-11-28 05:13:49,313 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (27)] Ended with exit code 0
[2024-11-28 05:13:49,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt
[2024-11-28 05:13:49,495 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] ===
[2024-11-28 05:13:49,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-28 05:13:49,496 INFO L85 PathProgramCache]: Analyzing trace with hash -133341690, now seen corresponding path program 1 times
[2024-11-28 05:13:49,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX
[2024-11-28 05:13:49,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [635110086]
[2024-11-28 05:13:49,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-28 05:13:49,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-28 05:13:49,496 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/z3
[2024-11-28 05:13:49,498 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-28 05:13:49,499 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process
[2024-11-28 05:13:50,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-28 05:13:50,114 INFO L256 TraceCheckSpWp]: Trace formula consists of 814 conjuncts, 114 conjuncts are in the unsatisfiable core
[2024-11-28 05:13:50,123 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2024-11-28 05:13:50,127 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-28 05:13:50,235 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size
[2024-11-28 05:13:50,236 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-28 05:13:50,241 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-28 05:13:50,266 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-28 05:13:50,276 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-28 05:13:50,371 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-28 05:13:50,375 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-28 05:13:51,006 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size
[2024-11-28 05:13:51,007 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-28 05:13:51,015 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-28 05:13:51,125 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size
[2024-11-28 05:13:51,126 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57
[2024-11-28 05:13:51,134 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-28 05:13:51,221 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size
[2024-11-28 05:13:51,222 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57
[2024-11-28 05:13:51,230 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13
[2024-11-28 05:13:51,253 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-28 05:13:51,259 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-28 05:13:51,286 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-28 05:13:51,286 INFO L312 TraceCheckSpWp]: Computing backward predicates...
[2024-11-28 05:13:51,417 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5041 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5042 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_5041) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_5042) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_5041 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_5041) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd .cse1 (_ bv8 32)) (bvadd .cse1 (_ bv12 32))))))) is different from false
[2024-11-28 05:13:51,439 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_5041 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_5041) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd (_ bv12 32) .cse0)))) (forall ((v_ArrVal_5041 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5042 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv12 32) (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_5041) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_5042) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false
[2024-11-28 05:13:51,545 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5040 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5041 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5042 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5039 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_5039))) (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$#1.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_5040) .cse0 v_ArrVal_5041) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_5042) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_5040 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5041 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5039 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_5040) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_5039) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5041) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse3) (bvadd (_ bv12 32) .cse3)))))) is different from false
[2024-11-28 05:13:53,263 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5040 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5041 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5039 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5133 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5134 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_5133))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_5134) .cse1 v_ArrVal_5040) (select (select (store .cse2 .cse1 v_ArrVal_5039) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_5041))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd (_ bv12 32) .cse0)))) (forall ((v_ArrVal_5040 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5041 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5042 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5039 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5133 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5134 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_5133))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_5039))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv12 32) (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_5134) .cse4 v_ArrVal_5040) .cse5 v_ArrVal_5041) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_5042) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) is different from false
[2024-11-28 05:13:53,271 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2024-11-28 05:13:53,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [635110086]
[2024-11-28 05:13:53,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [635110086] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-28 05:13:53,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1912637799]
[2024-11-28 05:13:53,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-28 05:13:53,271 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt
[2024-11-28 05:13:53,271 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/cvc4
[2024-11-28 05:13:53,273 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null)
[2024-11-28 05:13:53,274 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (29)] Waiting until timeout for monitored process
[2024-11-28 05:14:05,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-28 05:14:05,216 INFO L256 TraceCheckSpWp]: Trace formula consists of 814 conjuncts, 116 conjuncts are in the unsatisfiable core
[2024-11-28 05:14:05,226 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2024-11-28 05:14:05,229 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-28 05:14:05,327 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-28 05:14:05,340 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size
[2024-11-28 05:14:05,341 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-28 05:14:05,358 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1
[2024-11-28 05:14:05,364 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-28 05:14:05,441 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-28 05:14:05,445 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-28 05:14:06,142 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size
[2024-11-28 05:14:06,142 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-28 05:14:06,156 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-28 05:14:06,234 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size
[2024-11-28 05:14:06,234 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-28 05:14:06,244 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13
[2024-11-28 05:14:06,299 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size
[2024-11-28 05:14:06,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 62 treesize of output 57
[2024-11-28 05:14:06,307 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13
[2024-11-28 05:14:06,331 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-28 05:14:06,337 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-28 05:14:06,342 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-28 05:14:06,342 INFO L312 TraceCheckSpWp]: Computing backward predicates...
[2024-11-28 05:14:06,391 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5603 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5604 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv12 32) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_5604) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_5603) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_5604 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_5604) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv8 32) .cse1) (bvadd (_ bv12 32) .cse1)))))) is different from false
[2024-11-28 05:14:06,413 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_5604 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_5604) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_5603 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5604 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_5604) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_5603) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false
[2024-11-28 05:14:06,480 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5601 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5602 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5603 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5604 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_5601))) (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$#1.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_5602) .cse0 v_ArrVal_5604) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_5603) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_5601 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5602 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5604 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_5602) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_5601) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5604) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse3) (bvadd (_ bv12 32) .cse3)))))) is different from false
[2024-11-28 05:14:06,546 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_5601 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5602 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5604 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_5602) (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_5601) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_5604) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_5601 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5602 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5603 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5604 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_5601))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_5602) .cse3 v_ArrVal_5604) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_5603) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false
[2024-11-28 05:14:07,982 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5601 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5602 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5603 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5604 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5696 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5695 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_5696))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_5601))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv12 32) (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_5695) .cse0 v_ArrVal_5602) .cse1 v_ArrVal_5604) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_5603) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_5601 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5602 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5604 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5696 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5695 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_5696))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_5695) .cse6 v_ArrVal_5602) (select (select (store .cse7 .cse6 v_ArrVal_5601) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_5604))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse5) (bvadd (_ bv12 32) .cse5)))))) is different from false
[2024-11-28 05:14:07,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1912637799] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-28 05:14:07,991 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2024-11-28 05:14:07,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10
[2024-11-28 05:14:07,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586002579]
[2024-11-28 05:14:07,991 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2024-11-28 05:14:07,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-11-28 05:14:07,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2024-11-28 05:14:07,992 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-11-28 05:14:07,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=146, Unknown=16, NotChecked=288, Total=506
[2024-11-28 05:14:07,992 INFO L87 Difference]: Start difference. First operand 841 states and 921 transitions. Second operand has 11 states, 9 states have (on average 8.222222222222221) internal successors, (74), 11 states have internal predecessors, (74), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2024-11-28 05:14:13,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-28 05:14:13,956 INFO L93 Difference]: Finished difference Result 840 states and 920 transitions.
[2024-11-28 05:14:13,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states.
[2024-11-28 05:14:13,958 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 8.222222222222221) internal successors, (74), 11 states have internal predecessors, (74), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 118
[2024-11-28 05:14:13,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-28 05:14:13,960 INFO L225 Difference]: With dead ends: 840
[2024-11-28 05:14:13,960 INFO L226 Difference]: Without dead ends: 840
[2024-11-28 05:14:13,960 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 230 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=99, Invalid=300, Unknown=17, NotChecked=396, Total=812
[2024-11-28 05:14:13,962 INFO L435 NwaCegarLoop]: 501 mSDtfsCounter, 412 mSDsluCounter, 1620 mSDsCounter, 0 mSdLazyCounter, 2526 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 424 SdHoareTripleChecker+Valid, 2121 SdHoareTripleChecker+Invalid, 2533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 2526 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time
[2024-11-28 05:14:13,962 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [424 Valid, 2121 Invalid, 2533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 2526 Invalid, 0 Unknown, 0 Unchecked, 5.7s Time]
[2024-11-28 05:14:13,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 840 states.
[2024-11-28 05:14:13,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 840 to 840.
[2024-11-28 05:14:13,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 840 states, 556 states have (on average 1.606115107913669) internal successors, (893), 833 states have internal predecessors, (893), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 4 states have call predecessors, (14), 13 states have call successors, (14)
[2024-11-28 05:14:13,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 840 states to 840 states and 920 transitions.
[2024-11-28 05:14:13,971 INFO L78 Accepts]: Start accepts. Automaton has 840 states and 920 transitions. Word has length 118
[2024-11-28 05:14:13,971 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-28 05:14:13,971 INFO L471 AbstractCegarLoop]: Abstraction has 840 states and 920 transitions.
[2024-11-28 05:14:13,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 8.222222222222221) internal successors, (74), 11 states have internal predecessors, (74), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2024-11-28 05:14:13,971 INFO L276 IsEmpty]: Start isEmpty. Operand 840 states and 920 transitions.
[2024-11-28 05:14:13,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122
[2024-11-28 05:14:13,972 INFO L210 NwaCegarLoop]: Found error trace
[2024-11-28 05:14:13,972 INFO L218 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-28 05:14:13,992 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0
[2024-11-28 05:14:14,191 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (29)] Ended with exit code 0
[2024-11-28 05:14:14,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt
[2024-11-28 05:14:14,373 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] ===
[2024-11-28 05:14:14,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-28 05:14:14,374 INFO L85 PathProgramCache]: Analyzing trace with hash 462736112, now seen corresponding path program 1 times
[2024-11-28 05:14:14,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX
[2024-11-28 05:14:14,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [627329989]
[2024-11-28 05:14:14,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-28 05:14:14,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-28 05:14:14,374 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/z3
[2024-11-28 05:14:14,376 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-28 05:14:14,379 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process
[2024-11-28 05:14:15,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-28 05:14:15,034 INFO L256 TraceCheckSpWp]: Trace formula consists of 843 conjuncts, 62 conjuncts are in the unsatisfiable core
[2024-11-28 05:14:15,040 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2024-11-28 05:14:15,043 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-28 05:14:15,148 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size
[2024-11-28 05:14:15,148 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-28 05:14:15,162 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-28 05:14:15,446 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size
[2024-11-28 05:14:15,447 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-28 05:14:15,515 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size
[2024-11-28 05:14:15,516 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32
[2024-11-28 05:14:15,569 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size
[2024-11-28 05:14:15,569 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-28 05:14:15,627 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size
[2024-11-28 05:14:15,627 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-28 05:14:15,671 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-28 05:14:15,692 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-28 05:14:15,692 INFO L312 TraceCheckSpWp]: Computing backward predicates...
[2024-11-28 05:14:15,738 INFO L349 Elim1Store]: treesize reduction 7, result has 63.2 percent of original size
[2024-11-28 05:14:15,738 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-28 05:14:15,744 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6133 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_#t~mem36#1.base| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_6133) |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-28 05:14:15,752 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6133 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (= .cse0 (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_6133) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) is different from false
[2024-11-28 05:14:15,765 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6132 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6133 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_6132)) (.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= (select (select (store .cse0 .cse1 v_ArrVal_6133) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) .cse1)))) is different from false
[2024-11-28 05:14:15,775 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6132 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6133 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_6132))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_6133) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) is different from false
[2024-11-28 05:14:15,790 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6131 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6132 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6133 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_6131))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_6132)))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= (select (select (store .cse0 .cse1 v_ArrVal_6133) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) .cse1))))) is different from false
[2024-11-28 05:14:15,802 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6131 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6132 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6133 (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$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_6131))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_6132)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_6133) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) is different from false
[2024-11-28 05:14:16,205 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6131 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6132 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6133 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6179 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (let ((.cse3 (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_6179))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_6131)))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_6132)))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= (select (select (store .cse0 .cse1 v_ArrVal_6133) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) .cse1))))) is different from false
[2024-11-28 05:14:16,208 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2024-11-28 05:14:16,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [627329989]
[2024-11-28 05:14:16,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [627329989] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-28 05:14:16,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [161398955]
[2024-11-28 05:14:16,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-28 05:14:16,208 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt
[2024-11-28 05:14:16,208 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/cvc4
[2024-11-28 05:14:16,210 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null)
[2024-11-28 05:14:16,211 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (31)] Waiting until timeout for monitored process
[2024-11-28 05:14:32,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-28 05:14:32,352 INFO L256 TraceCheckSpWp]: Trace formula consists of 843 conjuncts, 66 conjuncts are in the unsatisfiable core
[2024-11-28 05:14:32,358 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2024-11-28 05:14:32,395 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size
[2024-11-28 05:14:32,395 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-28 05:14:32,692 INFO L349 Elim1Store]: treesize reduction 54, result has 29.9 percent of original size
[2024-11-28 05:14:32,693 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-28 05:14:32,765 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-28 05:14:32,964 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-28 05:14:34,446 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size
[2024-11-28 05:14:34,446 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-28 05:14:34,658 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size
[2024-11-28 05:14:34,658 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 51
[2024-11-28 05:14:34,825 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size
[2024-11-28 05:14:34,825 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-28 05:14:35,006 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size
[2024-11-28 05:14:35,007 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-28 05:14:35,047 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-28 05:14:35,121 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-28 05:14:35,121 INFO L312 TraceCheckSpWp]: Computing backward predicates...
[2024-11-28 05:14:35,136 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6617 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_6617) |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-28 05:14:35,144 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6617 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_6617) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false
[2024-11-28 05:14:35,160 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6617 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6616 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_6616))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6617)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false
[2024-11-28 05:14:35,173 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6617 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6616 (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$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6616))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6617)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (_ bv0 1))) is different from false
[2024-11-28 05:14:35,195 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6617 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6615 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6616 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_6615))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6616)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6617)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false
[2024-11-28 05:14:35,212 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6617 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6615 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6616 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6615))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6616)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6617)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false
[2024-11-28 05:14:35,621 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6617 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6615 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6616 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6663 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_6663))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6615)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6616)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6617)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false
[2024-11-28 05:14:35,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [161398955] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-28 05:14:35,625 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2024-11-28 05:14:35,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 23
[2024-11-28 05:14:35,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476487904]
[2024-11-28 05:14:35,625 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2024-11-28 05:14:35,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states
[2024-11-28 05:14:35,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2024-11-28 05:14:35,626 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants.
[2024-11-28 05:14:35,627 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=508, Unknown=14, NotChecked=826, Total=1482
[2024-11-28 05:14:35,627 INFO L87 Difference]: Start difference. First operand 840 states and 920 transitions. Second operand has 24 states, 21 states have (on average 7.333333333333333) internal successors, (154), 24 states have internal predecessors, (154), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)
[2024-11-28 05:14:47,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-28 05:14:47,591 INFO L93 Difference]: Finished difference Result 1536 states and 1686 transitions.
[2024-11-28 05:14:47,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states.
[2024-11-28 05:14:47,592 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 7.333333333333333) internal successors, (154), 24 states have internal predecessors, (154), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 121
[2024-11-28 05:14:47,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-28 05:14:47,595 INFO L225 Difference]: With dead ends: 1536
[2024-11-28 05:14:47,595 INFO L226 Difference]: Without dead ends: 1536
[2024-11-28 05:14:47,595 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 228 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=230, Invalid=1072, Unknown=14, NotChecked=1134, Total=2450
[2024-11-28 05:14:47,596 INFO L435 NwaCegarLoop]: 391 mSDtfsCounter, 1336 mSDsluCounter, 5109 mSDsCounter, 0 mSdLazyCounter, 5536 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1362 SdHoareTripleChecker+Valid, 5500 SdHoareTripleChecker+Invalid, 5600 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 5536 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.5s IncrementalHoareTripleChecker+Time
[2024-11-28 05:14:47,596 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1362 Valid, 5500 Invalid, 5600 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 5536 Invalid, 0 Unknown, 0 Unchecked, 11.5s Time]
[2024-11-28 05:14:47,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1536 states.
[2024-11-28 05:14:47,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1536 to 839.
[2024-11-28 05:14:47,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 839 states, 556 states have (on average 1.60431654676259) internal successors, (892), 832 states have internal predecessors, (892), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 4 states have call predecessors, (14), 13 states have call successors, (14)
[2024-11-28 05:14:47,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 839 states to 839 states and 919 transitions.
[2024-11-28 05:14:47,607 INFO L78 Accepts]: Start accepts. Automaton has 839 states and 919 transitions. Word has length 121
[2024-11-28 05:14:47,607 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-28 05:14:47,608 INFO L471 AbstractCegarLoop]: Abstraction has 839 states and 919 transitions.
[2024-11-28 05:14:47,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 7.333333333333333) internal successors, (154), 24 states have internal predecessors, (154), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)
[2024-11-28 05:14:47,608 INFO L276 IsEmpty]: Start isEmpty. Operand 839 states and 919 transitions.
[2024-11-28 05:14:47,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122
[2024-11-28 05:14:47,609 INFO L210 NwaCegarLoop]: Found error trace
[2024-11-28 05:14:47,609 INFO L218 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-28 05:14:47,635 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (31)] Ended with exit code 0
[2024-11-28 05:14:47,822 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0
[2024-11-28 05:14:48,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt,30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-28 05:14:48,010 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr83REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] ===
[2024-11-28 05:14:48,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-28 05:14:48,010 INFO L85 PathProgramCache]: Analyzing trace with hash 462736113, now seen corresponding path program 1 times
[2024-11-28 05:14:48,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX
[2024-11-28 05:14:48,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1709119117]
[2024-11-28 05:14:48,010 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-28 05:14:48,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-28 05:14:48,011 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/z3
[2024-11-28 05:14:48,012 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-28 05:14:48,013 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process
[2024-11-28 05:14:48,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-28 05:14:48,741 INFO L256 TraceCheckSpWp]: Trace formula consists of 843 conjuncts, 116 conjuncts are in the unsatisfiable core
[2024-11-28 05:14:48,751 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2024-11-28 05:14:48,910 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size
[2024-11-28 05:14:48,911 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-28 05:14:48,921 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-28 05:14:48,954 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-28 05:14:48,960 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-28 05:14:49,105 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-28 05:14:49,111 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-28 05:14:49,823 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size
[2024-11-28 05:14:49,823 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-28 05:14:49,831 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-28 05:14:49,938 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size
[2024-11-28 05:14:49,938 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57
[2024-11-28 05:14:49,947 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-28 05:14:50,040 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size
[2024-11-28 05:14:50,041 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-28 05:14:50,049 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-28 05:14:50,146 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size
[2024-11-28 05:14:50,147 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-28 05:14:50,155 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-28 05:14:50,181 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-28 05:14:50,188 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-28 05:14:50,217 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-28 05:14:50,218 INFO L312 TraceCheckSpWp]: Computing backward predicates...
[2024-11-28 05:14:50,358 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7148 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7148) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv20 32) .cse0) (bvadd (_ bv24 32) .cse0)))) (forall ((v_ArrVal_7148 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7149 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv24 32) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7148) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7149) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false
[2024-11-28 05:14:50,383 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_7148 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7149 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv24 32) (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_7148) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_7149) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_7148 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_7148) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv20 32) .cse2) (bvadd (_ bv24 32) .cse2))))))) is different from false
[2024-11-28 05:14:50,425 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7148 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7149 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7146 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7147 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7146))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv24 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7147) .cse0 v_ArrVal_7148) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_7149) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_7148 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7146 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7147 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7147) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7146) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7148) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv20 32) .cse3) (bvadd (_ bv24 32) .cse3)))))) is different from false
[2024-11-28 05:14:50,467 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_7148 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7149 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7146 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7147 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_7146))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_7147) .cse1 v_ArrVal_7148) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_7149) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_7148 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7146 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7147 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_7147) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_7146) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_7148) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse4 (_ bv20 32)) (bvadd .cse4 (_ bv24 32)))))))) is different from false
[2024-11-28 05:14:50,525 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7148 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7149 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7144 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7145 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7146 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7147 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_7145))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_7146))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv24 32) (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_7144) .cse0 v_ArrVal_7147) .cse1 v_ArrVal_7148) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_7149) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_7148 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7144 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7145 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7146 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7147 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_7145))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_7144) .cse6 v_ArrVal_7147) (select (select (store .cse7 .cse6 v_ArrVal_7146) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_7148))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv20 32) .cse5) (bvadd (_ bv24 32) .cse5)))))) is different from false
[2024-11-28 05:14:50,570 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (and (forall ((v_ArrVal_7148 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7144 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7145 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7146 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7147 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_7145))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_7144) .cse2 v_ArrVal_7147) (select (select (store .cse3 .cse2 v_ArrVal_7146) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_7148))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (_ bv20 32) .cse0) (bvadd (_ bv24 32) .cse0)))) (forall ((v_ArrVal_7148 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7149 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7144 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7145 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7146 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7147 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_7145))) (let ((.cse5 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse7 (store .cse8 .cse5 v_ArrVal_7146))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (_ bv24 32) (select (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_7144) .cse5 v_ArrVal_7147) .cse6 v_ArrVal_7148) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (select |c_#length| (select (select (store .cse7 .cse6 v_ArrVal_7149) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))))))))))) is different from false
[2024-11-28 05:14:56,175 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7240 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7241 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7148 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7144 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7145 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7146 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7147 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse5 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_7240))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_ArrVal_7145))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_7241) .cse1 v_ArrVal_7144) .cse2 v_ArrVal_7147) (select (select (store .cse3 .cse2 v_ArrVal_7146) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_7148))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (_ bv20 32) .cse0) (bvadd (_ bv24 32) .cse0)))) (forall ((v_ArrVal_7240 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7241 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7148 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7149 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7144 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7145 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7146 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7147 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse11 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_7240))) (let ((.cse6 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse10 (store .cse11 .cse6 v_ArrVal_7145))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_7146))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (_ bv24 32) (select (select (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_7241) .cse6 v_ArrVal_7144) .cse7 v_ArrVal_7147) .cse8 v_ArrVal_7148) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (select |c_#length| (select (select (store .cse9 .cse8 v_ArrVal_7149) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))))))) is different from false
[2024-11-28 05:14:56,206 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2024-11-28 05:14:56,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1709119117]
[2024-11-28 05:14:56,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1709119117] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-28 05:14:56,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1254745331]
[2024-11-28 05:14:56,206 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-28 05:14:56,206 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt
[2024-11-28 05:14:56,206 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/cvc4
[2024-11-28 05:14:56,208 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null)
[2024-11-28 05:14:56,210 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (33)] Waiting until timeout for monitored process
[2024-11-28 05:15:12,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-28 05:15:12,663 INFO L256 TraceCheckSpWp]: Trace formula consists of 843 conjuncts, 118 conjuncts are in the unsatisfiable core
[2024-11-28 05:15:12,674 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2024-11-28 05:15:12,701 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-28 05:15:14,326 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size
[2024-11-28 05:15:14,326 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-28 05:15:14,384 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-28 05:15:14,475 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-28 05:15:14,536 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1
[2024-11-28 05:15:15,028 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-28 05:15:15,058 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-28 05:15:21,287 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size
[2024-11-28 05:15:21,287 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57
[2024-11-28 05:15:21,354 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-28 05:15:21,985 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size
[2024-11-28 05:15:21,986 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57
[2024-11-28 05:15:22,050 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-28 05:15:22,531 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size
[2024-11-28 05:15:22,531 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-28 05:15:22,596 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-28 05:15:23,078 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size
[2024-11-28 05:15:23,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 62 treesize of output 57
[2024-11-28 05:15:23,143 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-28 05:15:23,370 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-28 05:15:23,435 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-28 05:15:23,436 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-28 05:15:23,436 INFO L312 TraceCheckSpWp]: Computing backward predicates...
[2024-11-28 05:15:23,748 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7728 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7728) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv20 32) .cse0) (bvadd (_ bv24 32) .cse0)))) (forall ((v_ArrVal_7728 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7727 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv24 32) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7728) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7727) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false
[2024-11-28 05:15:23,864 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_7728 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7727 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv24 32) (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_7728) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_7727) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_7728 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_7728) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv20 32) .cse2) (bvadd (_ bv24 32) .cse2))))))) is different from false
[2024-11-28 05:15:24,067 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7728 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7726 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7725 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7725) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7726) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7728) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv20 32) .cse0) (bvadd (_ bv24 32) .cse0)))) (forall ((v_ArrVal_7728 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7727 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7726 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7725 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7726))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv24 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7725) .cse2 v_ArrVal_7728) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_7727) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false
[2024-11-28 05:15:24,201 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_7728 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7727 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7726 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7725 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_7726))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv24 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_7725) .cse1 v_ArrVal_7728) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_7727) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_7728 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7726 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7725 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_7725) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_7726) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_7728) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv20 32) .cse4) (bvadd (_ bv24 32) .cse4))))))) is different from false
[2024-11-28 05:15:24,414 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7728 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7726 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7725 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7724 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7723 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_7723))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_7724) .cse1 v_ArrVal_7725) (select (select (store .cse2 .cse1 v_ArrVal_7726) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_7728))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv20 32) .cse0) (bvadd (_ bv24 32) .cse0)))) (forall ((v_ArrVal_7728 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7727 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7726 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7725 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7724 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7723 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_7723))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_7726))) (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$#1.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_7724) .cse4 v_ArrVal_7725) .cse5 v_ArrVal_7728) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_7727) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) is different from false
[2024-11-28 05:15:24,565 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (and (forall ((v_ArrVal_7728 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7727 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7726 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7725 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7724 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7723 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_7723))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_7726))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_7724) .cse1 v_ArrVal_7725) .cse2 v_ArrVal_7728) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv24 32)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_7727) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))) (forall ((v_ArrVal_7728 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7726 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7725 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7724 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7723 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (select (select (let ((.cse8 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_7723))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_7724) .cse7 v_ArrVal_7725) (select (select (store .cse8 .cse7 v_ArrVal_7726) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_7728))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd .cse6 (_ bv20 32)) (bvadd .cse6 (_ bv24 32)))))))) is different from false
[2024-11-28 05:15:28,957 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7819 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7728 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7727 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7726 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7725 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7724 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7723 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7820 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_7819))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_7723))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_7726))) (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$#1.offset| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_7820) .cse0 v_ArrVal_7724) .cse1 v_ArrVal_7725) .cse2 v_ArrVal_7728) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv24 32)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_7727) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) (forall ((v_ArrVal_7819 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7728 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7726 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7725 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7724 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7723 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7820 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (select (select (let ((.cse11 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_7819))) (let ((.cse8 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse10 (store .cse11 .cse8 v_ArrVal_7723))) (let ((.cse9 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_7820) .cse8 v_ArrVal_7724) .cse9 v_ArrVal_7725) (select (select (store .cse10 .cse9 v_ArrVal_7726) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_7728))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd .cse7 (_ bv20 32)) (bvadd .cse7 (_ bv24 32))))))) is different from false
[2024-11-28 05:15:28,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1254745331] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-28 05:15:28,985 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2024-11-28 05:15:28,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11
[2024-11-28 05:15:28,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162359287]
[2024-11-28 05:15:28,985 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2024-11-28 05:15:28,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states
[2024-11-28 05:15:28,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2024-11-28 05:15:28,985 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2024-11-28 05:15:28,986 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=160, Unknown=14, NotChecked=518, Total=756
[2024-11-28 05:15:28,986 INFO L87 Difference]: Start difference. First operand 839 states and 919 transitions. Second operand has 12 states, 10 states have (on average 8.0) internal successors, (80), 12 states have internal predecessors, (80), 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-28 05:16:15,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-28 05:16:15,556 INFO L93 Difference]: Finished difference Result 838 states and 918 transitions.
[2024-11-28 05:16:15,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states.
[2024-11-28 05:16:15,557 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 8.0) internal successors, (80), 12 states have internal predecessors, (80), 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-28 05:16:15,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-28 05:16:15,559 INFO L225 Difference]: With dead ends: 838
[2024-11-28 05:16:15,559 INFO L226 Difference]: Without dead ends: 838
[2024-11-28 05:16:15,559 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 237 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=109, Invalid=353, Unknown=14, NotChecked=714, Total=1190
[2024-11-28 05:16:15,560 INFO L435 NwaCegarLoop]: 500 mSDtfsCounter, 410 mSDsluCounter, 1913 mSDsCounter, 0 mSdLazyCounter, 2953 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 43.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 422 SdHoareTripleChecker+Valid, 2413 SdHoareTripleChecker+Invalid, 2960 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 2953 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 44.5s IncrementalHoareTripleChecker+Time
[2024-11-28 05:16:15,560 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [422 Valid, 2413 Invalid, 2960 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 2953 Invalid, 0 Unknown, 0 Unchecked, 44.5s Time]
[2024-11-28 05:16:15,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states.
[2024-11-28 05:16:15,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 838.
[2024-11-28 05:16:15,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 838 states, 556 states have (on average 1.6025179856115108) internal successors, (891), 831 states have internal predecessors, (891), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 4 states have call predecessors, (14), 13 states have call successors, (14)
[2024-11-28 05:16:15,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 918 transitions.
[2024-11-28 05:16:15,570 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 918 transitions. Word has length 121
[2024-11-28 05:16:15,570 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-28 05:16:15,570 INFO L471 AbstractCegarLoop]: Abstraction has 838 states and 918 transitions.
[2024-11-28 05:16:15,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 8.0) internal successors, (80), 12 states have internal predecessors, (80), 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-28 05:16:15,570 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 918 transitions.
[2024-11-28 05:16:15,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126
[2024-11-28 05:16:15,571 INFO L210 NwaCegarLoop]: Found error trace
[2024-11-28 05:16:15,571 INFO L218 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-28 05:16:15,603 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (33)] Ended with exit code 0
[2024-11-28 05:16:15,784 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Ended with exit code 0
[2024-11-28 05:16:15,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt,32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-28 05:16:15,971 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr86REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] ===
[2024-11-28 05:16:15,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-28 05:16:15,972 INFO L85 PathProgramCache]: Analyzing trace with hash 1575542130, now seen corresponding path program 1 times
[2024-11-28 05:16:15,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX
[2024-11-28 05:16:15,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1243543054]
[2024-11-28 05:16:15,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-28 05:16:15,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-28 05:16:15,973 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/z3
[2024-11-28 05:16:15,974 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-28 05:16:15,975 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process
[2024-11-28 05:16:16,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-28 05:16:16,768 INFO L256 TraceCheckSpWp]: Trace formula consists of 880 conjuncts, 66 conjuncts are in the unsatisfiable core
[2024-11-28 05:16:16,774 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2024-11-28 05:16:16,800 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-28 05:16:18,287 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size
[2024-11-28 05:16:18,288 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-28 05:16:18,448 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-28 05:16:21,389 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size
[2024-11-28 05:16:21,389 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-28 05:16:21,904 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size
[2024-11-28 05:16:21,904 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-28 05:16:22,449 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size
[2024-11-28 05:16:22,449 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-28 05:16:23,021 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size
[2024-11-28 05:16:23,022 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-28 05:16:23,608 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size
[2024-11-28 05:16:23,609 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-28 05:16:24,085 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-28 05:16:24,676 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size
[2024-11-28 05:16:24,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 21 treesize of output 20
[2024-11-28 05:16:24,705 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked.
[2024-11-28 05:16:24,705 INFO L312 TraceCheckSpWp]: Computing backward predicates...
[2024-11-28 05:16:25,644 INFO L349 Elim1Store]: treesize reduction 7, result has 63.2 percent of original size
[2024-11-28 05:16:25,645 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-28 05:16:26,263 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8275 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (= (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_8275) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) .cse0)))) is different from false
[2024-11-28 05:16:26,361 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8275 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8274 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_8274)) (.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= (select (select (store .cse0 .cse1 v_ArrVal_8275) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) .cse1)))) is different from false
[2024-11-28 05:16:26,429 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8275 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8274 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_8274))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= (select (select (store .cse0 .cse1 v_ArrVal_8275) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) .cse1))))) is different from false
[2024-11-28 05:16:26,532 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8275 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8274 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8273 (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$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_8273))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_8274)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_8275) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) is different from false
[2024-11-28 05:16:26,604 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8275 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8274 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8273 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (let ((.cse3 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_8273))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_8274)))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= (select (select (store .cse0 .cse1 v_ArrVal_8275) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) .cse1))))) is different from false
[2024-11-28 05:16:26,709 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8275 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8274 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8273 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8272 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (let ((.cse3 (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_8272))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_8273)))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_8274)))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= (select (select (store .cse0 .cse1 v_ArrVal_8275) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) .cse1))))) is different from false
[2024-11-28 05:16:26,785 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8275 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8274 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8273 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8272 (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$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_8272))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_8273)))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_8274)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_8275) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) is different from false
[2024-11-28 05:16:28,702 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8275 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8274 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8273 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8272 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8322 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (let ((.cse3 (let ((.cse4 (let ((.cse5 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_8322))) (store .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_8272)))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_8273)))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_8274)))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= (select (select (store .cse0 .cse1 v_ArrVal_8275) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) .cse1))))) is different from false
[2024-11-28 05:16:28,723 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2024-11-28 05:16:28,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1243543054]
[2024-11-28 05:16:28,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1243543054] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-28 05:16:28,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [585792593]
[2024-11-28 05:16:28,724 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-28 05:16:28,724 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt
[2024-11-28 05:16:28,724 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/cvc4
[2024-11-28 05:16:28,726 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null)
[2024-11-28 05:16:28,727 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (35)] Waiting until timeout for monitored process
[2024-11-28 05:16:38,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-28 05:16:38,581 INFO L256 TraceCheckSpWp]: Trace formula consists of 880 conjuncts, 70 conjuncts are in the unsatisfiable core
[2024-11-28 05:16:38,590 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2024-11-28 05:16:39,238 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size
[2024-11-28 05:16:39,239 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-28 05:16:43,218 INFO L349 Elim1Store]: treesize reduction 54, result has 29.9 percent of original size
[2024-11-28 05:16:43,219 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-28 05:16:43,970 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-28 05:16:45,754 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-28 05:16:58,652 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size
[2024-11-28 05:16:58,652 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-28 05:17:00,370 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size
[2024-11-28 05:17:00,370 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-28 05:17:01,689 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size
[2024-11-28 05:17:01,689 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 51
[2024-11-28 05:17:02,946 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size
[2024-11-28 05:17:02,946 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-28 05:17:04,247 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size
[2024-11-28 05:17:04,247 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-28 05:17:04,549 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-28 05:17:05,996 INFO L349 Elim1Store]: treesize reduction 82, result has 29.3 percent of original size
[2024-11-28 05:17:05,997 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 35 treesize of output 52
[2024-11-28 05:17:06,105 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-28 05:17:06,106 INFO L312 TraceCheckSpWp]: Computing backward predicates...
[2024-11-28 05:17:06,659 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8778 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_8778) |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-28 05:17:06,722 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8778 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_8778) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false
[2024-11-28 05:17:06,818 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8778 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8777 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_8777))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8778)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false
[2024-11-28 05:17:06,881 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8778 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8777 (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$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8777))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8778)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (_ bv0 1))) is different from false
[2024-11-28 05:17:06,978 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8778 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8777 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8776 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_8776))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8777)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8778)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false
[2024-11-28 05:17:07,044 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8778 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8777 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8776 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8776))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8777)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8778)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false
[2024-11-28 05:17:07,144 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8778 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8777 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8776 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8775 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_8775))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8776)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8777)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8778)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false
[2024-11-28 05:17:10,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [585792593] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-28 05:17:10,338 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2024-11-28 05:17:10,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 26
[2024-11-28 05:17:10,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322628263]
[2024-11-28 05:17:10,338 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2024-11-28 05:17:10,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states
[2024-11-28 05:17:10,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2024-11-28 05:17:10,339 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants.
[2024-11-28 05:17:10,339 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=782, Unknown=36, NotChecked=1080, Total=2070
[2024-11-28 05:17:10,339 INFO L87 Difference]: Start difference. First operand 838 states and 918 transitions. Second operand has 27 states, 24 states have (on average 6.75) internal successors, (162), 26 states have internal predecessors, (162), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)
[2024-11-28 05:18:32,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-28 05:18:32,681 INFO L93 Difference]: Finished difference Result 1532 states and 1682 transitions.
[2024-11-28 05:18:32,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states.
[2024-11-28 05:18:32,681 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 24 states have (on average 6.75) internal successors, (162), 26 states have internal predecessors, (162), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 125
[2024-11-28 05:18:32,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-28 05:18:32,686 INFO L225 Difference]: With dead ends: 1532
[2024-11-28 05:18:32,686 INFO L226 Difference]: Without dead ends: 1532
[2024-11-28 05:18:32,687 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 235 SyntacticMatches, 3 SemanticMatches, 56 ConstructedPredicates, 15 IntricatePredicates, 0 DeprecatedPredicates, 479 ImplicationChecksByTransitivity, 16.8s TimeCoverageRelationStatistics Valid=290, Invalid=1537, Unknown=39, NotChecked=1440, Total=3306
[2024-11-28 05:18:32,688 INFO L435 NwaCegarLoop]: 390 mSDtfsCounter, 1663 mSDsluCounter, 4675 mSDsCounter, 0 mSdLazyCounter, 5194 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 76.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1689 SdHoareTripleChecker+Valid, 5065 SdHoareTripleChecker+Invalid, 5276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 5194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 78.4s IncrementalHoareTripleChecker+Time
[2024-11-28 05:18:32,688 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1689 Valid, 5065 Invalid, 5276 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [82 Valid, 5194 Invalid, 0 Unknown, 0 Unchecked, 78.4s Time]
[2024-11-28 05:18:32,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1532 states.
[2024-11-28 05:18:32,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1532 to 837.
[2024-11-28 05:18:32,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 837 states, 556 states have (on average 1.6007194244604317) internal successors, (890), 830 states have internal predecessors, (890), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 4 states have call predecessors, (14), 13 states have call successors, (14)
[2024-11-28 05:18:32,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 917 transitions.
[2024-11-28 05:18:32,702 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 917 transitions. Word has length 125
[2024-11-28 05:18:32,703 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-28 05:18:32,703 INFO L471 AbstractCegarLoop]: Abstraction has 837 states and 917 transitions.
[2024-11-28 05:18:32,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 24 states have (on average 6.75) internal successors, (162), 26 states have internal predecessors, (162), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)
[2024-11-28 05:18:32,703 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 917 transitions.
[2024-11-28 05:18:32,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126
[2024-11-28 05:18:32,703 INFO L210 NwaCegarLoop]: Found error trace
[2024-11-28 05:18:32,704 INFO L218 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-28 05:18:32,723 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (35)] Ended with exit code 0
[2024-11-28 05:18:32,918 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0
[2024-11-28 05:18:33,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt,34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-28 05:18:33,104 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr87REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] ===
[2024-11-28 05:18:33,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-28 05:18:33,105 INFO L85 PathProgramCache]: Analyzing trace with hash 1575542131, now seen corresponding path program 1 times
[2024-11-28 05:18:33,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX
[2024-11-28 05:18:33,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1246254252]
[2024-11-28 05:18:33,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-28 05:18:33,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-28 05:18:33,106 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/z3
[2024-11-28 05:18:33,107 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-28 05:18:33,108 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process
[2024-11-28 05:18:33,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-28 05:18:33,952 INFO L256 TraceCheckSpWp]: Trace formula consists of 880 conjuncts, 122 conjuncts are in the unsatisfiable core
[2024-11-28 05:18:33,963 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2024-11-28 05:18:35,554 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size
[2024-11-28 05:18:35,555 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-28 05:18:35,615 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-28 05:18:35,884 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-28 05:18:35,946 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1
[2024-11-28 05:18:36,870 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-28 05:18:36,900 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-28 05:18:45,051 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size
[2024-11-28 05:18:45,052 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 68
[2024-11-28 05:18:45,116 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-28 05:18:46,549 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size
[2024-11-28 05:18:46,549 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 68
[2024-11-28 05:18:46,614 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-28 05:18:47,741 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size
[2024-11-28 05:18:47,741 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 68
[2024-11-28 05:18:47,806 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-28 05:18:48,953 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size
[2024-11-28 05:18:48,954 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 68
[2024-11-28 05:18:49,017 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-28 05:18:50,199 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size
[2024-11-28 05:18:50,199 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 68
[2024-11-28 05:18:50,264 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-28 05:18:50,612 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 20
[2024-11-28 05:18:50,705 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-28 05:18:51,195 INFO L190 IndexEqualityManager]: detected not equals via solver
[2024-11-28 05:18:51,428 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size
[2024-11-28 05:18:51,428 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 21
[2024-11-28 05:18:51,581 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size
[2024-11-28 05:18:51,582 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-28 05:18:51,959 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-28 05:18:51,959 INFO L312 TraceCheckSpWp]: Computing backward predicates...
[2024-11-28 05:19:00,261 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_9330 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9329 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc39#1.base_8| (_ BitVec 32))) (or (forall ((v_ArrVal_9331 (_ BitVec 32))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_9330) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc39#1.base_8| v_ArrVal_9331) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_9329) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc39#1.base_8|))))) (or (forall ((v_ArrVal_9330 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_9330) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule .cse2 (bvadd (_ bv4 32) .cse2)))) (forall ((|v_ULTIMATE.start_main_#t~malloc39#1.base_8| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc39#1.base_8|)))))))) is different from false
[2024-11-28 05:19:00,603 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9330 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9329 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc39#1.base_8| (_ BitVec 32)) (v_ArrVal_9328 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9327 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_9331 (_ BitVec 32))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_9327))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_9328) .cse0 v_ArrVal_9330) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc39#1.base_8| v_ArrVal_9331) (select (select (store .cse2 .cse0 v_ArrVal_9329) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc39#1.base_8|))))) (or (forall ((v_ArrVal_9330 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9328 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9327 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_9328) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_9327) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9330) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule .cse3 (bvadd (_ bv4 32) .cse3)))) (forall ((|v_ULTIMATE.start_main_#t~malloc39#1.base_8| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc39#1.base_8|))))))) is different from false
[2024-11-28 05:19:00,796 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (or (forall ((|v_ULTIMATE.start_main_#t~malloc39#1.base_8| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc39#1.base_8|)))) (forall ((v_ArrVal_9330 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9328 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9327 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_9328) (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_9327) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_9330) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule .cse0 (bvadd .cse0 (_ bv4 32)))))) (forall ((v_ArrVal_9330 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9329 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc39#1.base_8| (_ BitVec 32)) (v_ArrVal_9328 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9327 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_9331 (_ BitVec 32))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_9327))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_9328) .cse3 v_ArrVal_9330) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv4 32)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc39#1.base_8| v_ArrVal_9331) (select (select (store .cse4 .cse3 v_ArrVal_9329) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc39#1.base_8|)))))))) is different from false
[2024-11-28 05:19:01,161 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9330 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9329 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc39#1.base_8| (_ BitVec 32)) (v_ArrVal_9328 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9327 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9326 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9325 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc39#1.base_8|))) (forall ((v_ArrVal_9331 (_ BitVec 32))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_9325))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_9327))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_9326) .cse0 v_ArrVal_9328) .cse1 v_ArrVal_9330) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv4 32)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc39#1.base_8| v_ArrVal_9331) (select (select (store .cse3 .cse1 v_ArrVal_9329) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc39#1.base_8| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc39#1.base_8|)))) (forall ((v_ArrVal_9330 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9328 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9327 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9326 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9325 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_9325))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_9326) .cse6 v_ArrVal_9328) (select (select (store .cse7 .cse6 v_ArrVal_9327) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_9330))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule .cse5 (bvadd .cse5 (_ bv4 32)))))))) is different from false
[2024-11-28 05:19:01,392 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (and (forall ((v_ArrVal_9330 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9329 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc39#1.base_8| (_ BitVec 32)) (v_ArrVal_9328 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9327 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9326 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9325 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_9331 (_ BitVec 32))) (let ((.cse5 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_9325))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_9327))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv4 32) (select (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_9326) .cse1 v_ArrVal_9328) .cse2 v_ArrVal_9330) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc39#1.base_8| v_ArrVal_9331) (select (select (store .cse4 .cse2 v_ArrVal_9329) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc39#1.base_8|))))) (or (forall ((v_ArrVal_9330 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9328 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9327 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9326 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9325 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (select (select (let ((.cse8 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_9325))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_9326) .cse7 v_ArrVal_9328) (select (select (store .cse8 .cse7 v_ArrVal_9327) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_9330))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule .cse6 (bvadd (_ bv4 32) .cse6)))) (forall ((|v_ULTIMATE.start_main_#t~malloc39#1.base_8| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc39#1.base_8|)))))))) is different from false
[2024-11-28 05:19:04,997 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (or (forall ((|v_ULTIMATE.start_main_#t~malloc39#1.base_8| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc39#1.base_8|)))) (forall ((v_ArrVal_9330 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9328 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9327 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9326 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9325 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9324 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9323 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse5 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_9324))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_ArrVal_9325))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_9323) .cse1 v_ArrVal_9326) .cse2 v_ArrVal_9328) (select (select (store .cse3 .cse2 v_ArrVal_9327) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_9330))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule .cse0 (bvadd (_ bv4 32) .cse0))))) (forall ((v_ArrVal_9330 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9329 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc39#1.base_8| (_ BitVec 32)) (v_ArrVal_9328 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9327 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9326 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9325 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9324 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9323 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_9331 (_ BitVec 32))) (let ((.cse11 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_9324))) (let ((.cse6 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse10 (store .cse11 .cse6 v_ArrVal_9325))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_9327))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (_ bv4 32) (select (select (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_9323) .cse6 v_ArrVal_9326) .cse7 v_ArrVal_9328) .cse8 v_ArrVal_9330) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc39#1.base_8| v_ArrVal_9331) (select (select (store .cse9 .cse8 v_ArrVal_9329) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc39#1.base_8|))))))) is different from false
[2024-11-28 05:19:05,510 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (and (forall ((v_ArrVal_9330 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9329 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc39#1.base_8| (_ BitVec 32)) (v_ArrVal_9328 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9327 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9326 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9325 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9324 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9323 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc39#1.base_8|))) (forall ((v_ArrVal_9331 (_ BitVec 32))) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_9324))) (let ((.cse1 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse6 (store .cse7 .cse1 v_ArrVal_9325))) (let ((.cse2 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse5 (store .cse6 .cse2 v_ArrVal_9327))) (let ((.cse3 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (_ bv4 32) (select (select (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_9323) .cse1 v_ArrVal_9326) .cse2 v_ArrVal_9328) .cse3 v_ArrVal_9330) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc39#1.base_8| v_ArrVal_9331) (select (select (store .cse5 .cse3 v_ArrVal_9329) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))))))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc39#1.base_8| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc39#1.base_8|)))) (forall ((v_ArrVal_9330 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9328 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9327 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9326 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9325 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9324 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9323 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (select (select (let ((.cse12 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_9324))) (let ((.cse9 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse11 (store .cse12 .cse9 v_ArrVal_9325))) (let ((.cse10 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_9323) .cse9 v_ArrVal_9326) .cse10 v_ArrVal_9328) (select (select (store .cse11 .cse10 v_ArrVal_9327) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_9330))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule .cse8 (bvadd (_ bv4 32) .cse8)))))))) is different from false
[2024-11-28 05:19:12,721 WARN L286 SmtUtils]: Spent 6.81s on a formula simplification that was a NOOP. DAG size: 362 (called from [L 276] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition)
[2024-11-28 05:19:14,638 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-11-28 05:19:14,638 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 795 treesize of output 819
[2024-11-28 05:19:21,296 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_prenex_33 (_ BitVec 32))) (or (= v_prenex_33 |c_ULTIMATE.start_main_#t~mem32#1.base|) (forall ((v_prenex_39 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_37 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_38 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_35 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_36 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_34 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9329 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_32 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_40 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9331 (_ BitVec 32)) (v_prenex_41 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_prenex_40))) (let ((.cse0 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse7 (store .cse8 .cse0 v_prenex_39))) (let ((.cse1 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse6 (store .cse7 .cse1 v_prenex_37))) (let ((.cse2 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse5 (store .cse6 .cse2 v_prenex_35))) (let ((.cse3 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (_ bv4 32) (select (select (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem32#1.base| v_prenex_38) .cse0 v_prenex_41) .cse1 v_prenex_36) .cse2 v_prenex_34) .cse3 v_prenex_32) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (select (store |c_#length| v_prenex_33 v_ArrVal_9331) (select (select (store .cse5 .cse3 v_ArrVal_9329) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))))))))) (forall ((v_ArrVal_9330 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9328 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9327 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9326 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9325 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9423 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9324 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9422 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9323 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse9 (select (select (let ((.cse15 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_9422))) (let ((.cse10 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse14 (store .cse15 .cse10 v_ArrVal_9324))) (let ((.cse11 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse13 (store .cse14 .cse11 v_ArrVal_9325))) (let ((.cse12 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_9423) .cse10 v_ArrVal_9323) .cse11 v_ArrVal_9326) .cse12 v_ArrVal_9328) (select (select (store .cse13 .cse12 v_ArrVal_9327) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_9330))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule .cse9 (bvadd (_ bv4 32) .cse9)))))) is different from false
[2024-11-28 05:19:21,377 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2024-11-28 05:19:21,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1246254252]
[2024-11-28 05:19:21,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1246254252] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-28 05:19:21,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [70329232]
[2024-11-28 05:19:21,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-28 05:19:21,378 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt
[2024-11-28 05:19:21,378 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/cvc4
[2024-11-28 05:19:21,379 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null)
[2024-11-28 05:19:21,381 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1682541b-0eff-4d05-b723-796784a4a434/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (37)] Waiting until timeout for monitored process
[2024-11-28 05:20:54,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-28 05:20:54,423 INFO L256 TraceCheckSpWp]: Trace formula consists of 880 conjuncts, 125 conjuncts are in the unsatisfiable core
[2024-11-28 05:20:54,434 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2024-11-28 05:20:54,566 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-28 05:21:01,728 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size
[2024-11-28 05:21:01,728 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-28 05:21:02,327 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-28 05:21:04,702 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-28 05:21:04,928 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-28 05:21:12,511 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 17
[2024-11-28 05:21:12,626 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-28 05:21:56,134 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size
[2024-11-28 05:21:56,134 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 68
[2024-11-28 05:21:56,353 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-28 05:22:02,586 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size
[2024-11-28 05:22:02,586 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 68
[2024-11-28 05:22:02,803 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-28 05:22:07,569 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size
[2024-11-28 05:22:07,569 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 68
[2024-11-28 05:22:07,809 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13
[2024-11-28 05:22:12,898 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size
[2024-11-28 05:22:12,898 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 68
[2024-11-28 05:22:13,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-28 05:22:18,133 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size
[2024-11-28 05:22:18,134 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 68
[2024-11-28 05:22:18,355 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-28 05:22:19,534 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 20
[2024-11-28 05:22:19,655 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-28 05:22:22,908 INFO L190 IndexEqualityManager]: detected not equals via solver
[2024-11-28 05:22:22,909 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9
[2024-11-28 05:22:23,995 INFO L349 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size
[2024-11-28 05:22:23,996 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22
[2024-11-28 05:22:24,104 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-28 05:22:24,104 INFO L312 TraceCheckSpWp]: Computing backward predicates...
[2024-11-28 05:22:34,680 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9330 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9928 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9927 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9329 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc39#1.base_8| (_ BitVec 32))) (or (forall ((v_ArrVal_9331 (_ BitVec 32))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_9928))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_9927) .cse0 v_ArrVal_9330) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc39#1.base_8| v_ArrVal_9331) (select (select (store .cse2 .cse0 v_ArrVal_9329) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc39#1.base_8|))))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc39#1.base_8| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc39#1.base_8|)))) (forall ((v_ArrVal_9330 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9928 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9927 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_9927) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_9928) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9330) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule .cse3 (bvadd (_ bv4 32) .cse3))))))) is different from false
[2024-11-28 05:22:35,441 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_9330 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9928 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9927 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9329 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc39#1.base_8| (_ BitVec 32))) (or (forall ((v_ArrVal_9331 (_ BitVec 32))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_9928))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_9927) .cse1 v_ArrVal_9330) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc39#1.base_8| v_ArrVal_9331) (select (select (store .cse3 .cse1 v_ArrVal_9329) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc39#1.base_8|))))) (or (forall ((v_ArrVal_9330 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9928 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9927 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_9927) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_9928) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_9330) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule .cse4 (bvadd (_ bv4 32) .cse4)))) (forall ((|v_ULTIMATE.start_main_#t~malloc39#1.base_8| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc39#1.base_8|)))))))) is different from false
[2024-11-28 05:22:36,767 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9330 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9928 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9927 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9926 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9925 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9329 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc39#1.base_8| (_ BitVec 32))) (or (forall ((v_ArrVal_9331 (_ BitVec 32))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_9925))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_9928))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv4 32) (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_9926) .cse0 v_ArrVal_9927) .cse1 v_ArrVal_9330) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc39#1.base_8| v_ArrVal_9331) (select (select (store .cse3 .cse1 v_ArrVal_9329) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc39#1.base_8|))))) (or (forall ((v_ArrVal_9330 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9928 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9927 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9926 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9925 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_9925))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_9926) .cse6 v_ArrVal_9927) (select (select (store .cse7 .cse6 v_ArrVal_9928) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_9330))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule .cse5 (bvadd (_ bv4 32) .cse5)))) (forall ((|v_ULTIMATE.start_main_#t~malloc39#1.base_8| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc39#1.base_8|))))))) is different from false
[2024-11-28 05:22:47,440 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (or (forall ((v_ArrVal_9330 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9928 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9927 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9926 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9925 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9924 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9923 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse5 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_9924))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_ArrVal_9925))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_9923) .cse1 v_ArrVal_9926) .cse2 v_ArrVal_9927) (select (select (store .cse3 .cse2 v_ArrVal_9928) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_9330))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule .cse0 (bvadd .cse0 (_ bv4 32))))) (forall ((|v_ULTIMATE.start_main_#t~malloc39#1.base_8| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc39#1.base_8|))))) (forall ((v_ArrVal_9330 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9928 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9927 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9926 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9925 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9924 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9923 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9329 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc39#1.base_8| (_ BitVec 32))) (or (forall ((v_ArrVal_9331 (_ BitVec 32))) (let ((.cse11 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_9924))) (let ((.cse6 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse10 (store .cse11 .cse6 v_ArrVal_9925))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_9928))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (select (select (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_9923) .cse6 v_ArrVal_9926) .cse7 v_ArrVal_9927) .cse8 v_ArrVal_9330) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) (_ bv4 32)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc39#1.base_8| v_ArrVal_9331) (select (select (store .cse9 .cse8 v_ArrVal_9329) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc39#1.base_8|))))))) is different from false
[2024-11-28 05:22:48,256 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (and (forall ((v_ArrVal_9330 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9928 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9927 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9926 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9925 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9924 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9923 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9329 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc39#1.base_8| (_ BitVec 32))) (or (forall ((v_ArrVal_9331 (_ BitVec 32))) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_9924))) (let ((.cse1 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse6 (store .cse7 .cse1 v_ArrVal_9925))) (let ((.cse2 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse5 (store .cse6 .cse2 v_ArrVal_9928))) (let ((.cse3 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (_ bv4 32) (select (select (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_9923) .cse1 v_ArrVal_9926) .cse2 v_ArrVal_9927) .cse3 v_ArrVal_9330) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc39#1.base_8| v_ArrVal_9331) (select (select (store .cse5 .cse3 v_ArrVal_9329) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc39#1.base_8|))))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc39#1.base_8| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc39#1.base_8|)))) (forall ((v_ArrVal_9330 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9928 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9927 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9926 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9925 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9924 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9923 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (select (select (let ((.cse12 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_9924))) (let ((.cse9 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse11 (store .cse12 .cse9 v_ArrVal_9925))) (let ((.cse10 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_9923) .cse9 v_ArrVal_9926) .cse10 v_ArrVal_9927) (select (select (store .cse11 .cse10 v_ArrVal_9928) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_9330))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule .cse8 (bvadd (_ bv4 32) .cse8)))))))) is different from false
[2024-11-28 05:23:00,354 WARN L286 SmtUtils]: Spent 11.45s on a formula simplification that was a NOOP. DAG size: 356 (called from [L 276] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition)
[2024-11-28 05:23:03,036 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (or (forall ((|v_ULTIMATE.start_main_#t~malloc39#1.base_8| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc39#1.base_8|)))) (forall ((v_ArrVal_10022 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9330 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9928 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9927 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9926 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10023 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9925 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9924 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9923 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_10022))) (let ((.cse1 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse6 (store .cse7 .cse1 v_ArrVal_9924))) (let ((.cse2 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse4 (store .cse6 .cse2 v_ArrVal_9925))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_10023) .cse1 v_ArrVal_9923) .cse2 v_ArrVal_9926) .cse3 v_ArrVal_9927) (select (select (store .cse4 .cse3 v_ArrVal_9928) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_ArrVal_9330))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (bvule .cse0 (bvadd (_ bv4 32) .cse0))))) (forall ((v_ArrVal_10022 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9330 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9928 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9927 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9926 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10023 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9925 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9924 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9923 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9329 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc39#1.base_8| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc39#1.base_8|))) (forall ((v_ArrVal_9331 (_ BitVec 32))) (let ((.cse15 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_10022))) (let ((.cse8 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse14 (store .cse15 .cse8 v_ArrVal_9924))) (let ((.cse9 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse13 (store .cse14 .cse9 v_ArrVal_9925))) (let ((.cse10 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse12 (store .cse13 .cse10 v_ArrVal_9928))) (let ((.cse11 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (bvule (bvadd (_ bv4 32) (select (select (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_10023) .cse8 v_ArrVal_9923) .cse9 v_ArrVal_9926) .cse10 v_ArrVal_9927) .cse11 v_ArrVal_9330) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc39#1.base_8| v_ArrVal_9331) (select (select (store .cse12 .cse11 v_ArrVal_9329) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)))))))))))))))) is different from false
[2024-11-28 05:23:03,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [70329232] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-28 05:23:03,234 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2024-11-28 05:23:03,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 25
[2024-11-28 05:23:03,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571896384]
[2024-11-28 05:23:03,234 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2024-11-28 05:23:03,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states
[2024-11-28 05:23:03,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2024-11-28 05:23:03,235 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants.
[2024-11-28 05:23:03,235 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=789, Unknown=34, NotChecked=994, Total=1980
[2024-11-28 05:23:03,235 INFO L87 Difference]: Start difference. First operand 837 states and 917 transitions. Second operand has 26 states, 23 states have (on average 4.826086956521739) internal successors, (111), 25 states have internal predecessors, (111), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)