./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test2-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_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/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_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test2-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/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_81df7705-fb17-4c78-aaf0-d247e2bacd70/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 b879d991ca85089954916015c9838d386a5c85365dad0e09e537aeb772eaaaf8 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-27 20:11:13,213 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-27 20:11:13,313 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-27 20:11:13,323 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-27 20:11:13,323 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-27 20:11:13,356 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-27 20:11:13,357 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-27 20:11:13,357 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-27 20:11:13,358 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-27 20:11:13,358 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-27 20:11:13,358 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-27 20:11:13,358 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-27 20:11:13,359 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-27 20:11:13,359 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-27 20:11:13,359 INFO L153 SettingsManager]: * Use SBE=true [2024-11-27 20:11:13,359 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-27 20:11:13,359 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-27 20:11:13,360 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-27 20:11:13,360 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-27 20:11:13,360 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-27 20:11:13,360 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-27 20:11:13,360 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-27 20:11:13,360 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-27 20:11:13,361 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-27 20:11:13,361 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-27 20:11:13,361 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-27 20:11:13,361 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-27 20:11:13,361 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-27 20:11:13,361 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-27 20:11:13,362 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-27 20:11:13,362 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-27 20:11:13,362 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-27 20:11:13,362 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-27 20:11:13,362 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 20:11:13,362 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-27 20:11:13,362 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-27 20:11:13,363 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-27 20:11:13,363 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-27 20:11:13,363 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 20:11:13,363 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-27 20:11:13,363 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-27 20:11:13,363 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-27 20:11:13,363 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-27 20:11:13,363 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-27 20:11:13,363 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-27 20:11:13,364 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-27 20:11:13,364 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-27 20:11:13,364 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_81df7705-fb17-4c78-aaf0-d247e2bacd70/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 -> b879d991ca85089954916015c9838d386a5c85365dad0e09e537aeb772eaaaf8 [2024-11-27 20:11:13,745 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-27 20:11:13,759 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-27 20:11:13,765 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-27 20:11:13,768 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-27 20:11:13,769 INFO L274 PluginConnector]: CDTParser initialized [2024-11-27 20:11:13,771 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test2-2.i [2024-11-27 20:11:16,969 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/data/15c131031/1080ff969a95429f883f5f3cc0ff0a1f/FLAG21bf7f66a [2024-11-27 20:11:17,391 INFO L384 CDTParser]: Found 1 translation units. [2024-11-27 20:11:17,392 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test2-2.i [2024-11-27 20:11:17,413 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/data/15c131031/1080ff969a95429f883f5f3cc0ff0a1f/FLAG21bf7f66a [2024-11-27 20:11:17,568 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/data/15c131031/1080ff969a95429f883f5f3cc0ff0a1f [2024-11-27 20:11:17,571 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-27 20:11:17,572 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-27 20:11:17,576 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-27 20:11:17,577 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-27 20:11:17,587 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-27 20:11:17,588 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 08:11:17" (1/1) ... [2024-11-27 20:11:17,589 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4164bb46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:11:17, skipping insertion in model container [2024-11-27 20:11:17,589 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 08:11:17" (1/1) ... [2024-11-27 20:11:17,655 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-27 20:11:18,295 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-27 20:11:18,363 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-27 20:11:18,372 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-27 20:11:18,385 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-27 20:11:18,394 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-27 20:11:18,459 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-27 20:11:18,462 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-27 20:11:18,466 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-27 20:11:18,469 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-27 20:11:18,472 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-27 20:11:18,479 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-27 20:11:18,480 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-27 20:11:18,482 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-27 20:11:18,483 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-27 20:11:18,488 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-27 20:11:18,496 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-27 20:11:18,519 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-27 20:11:18,520 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@efdd093 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:11:18, skipping insertion in model container [2024-11-27 20:11:18,520 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-27 20:11:18,520 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-27 20:11:18,523 INFO L158 Benchmark]: Toolchain (without parser) took 949.36ms. Allocated memory is still 117.4MB. Free memory was 90.5MB in the beginning and 70.4MB in the end (delta: 20.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-27 20:11:18,525 INFO L158 Benchmark]: CDTParser took 0.53ms. Allocated memory is still 117.4MB. Free memory is still 74.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-27 20:11:18,525 INFO L158 Benchmark]: CACSL2BoogieTranslator took 944.73ms. Allocated memory is still 117.4MB. Free memory was 90.3MB in the beginning and 70.4MB in the end (delta: 19.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-27 20:11:18,527 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.53ms. Allocated memory is still 117.4MB. Free memory is still 74.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 944.73ms. Allocated memory is still 117.4MB. Free memory was 90.3MB in the beginning and 70.4MB in the end (delta: 19.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 833]: 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_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/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_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test2-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/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_81df7705-fb17-4c78-aaf0-d247e2bacd70/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 b879d991ca85089954916015c9838d386a5c85365dad0e09e537aeb772eaaaf8 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-27 20:11:21,462 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-27 20:11:21,550 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-27 20:11:21,557 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-27 20:11:21,557 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-27 20:11:21,609 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-27 20:11:21,611 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-27 20:11:21,611 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-27 20:11:21,612 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-27 20:11:21,612 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-27 20:11:21,613 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-27 20:11:21,613 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-27 20:11:21,614 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-27 20:11:21,614 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-27 20:11:21,615 INFO L153 SettingsManager]: * Use SBE=true [2024-11-27 20:11:21,616 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-27 20:11:21,616 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-27 20:11:21,616 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-27 20:11:21,616 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-27 20:11:21,616 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-27 20:11:21,616 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-27 20:11:21,616 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-27 20:11:21,616 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-27 20:11:21,617 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-27 20:11:21,617 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-27 20:11:21,617 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-27 20:11:21,617 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-27 20:11:21,617 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-27 20:11:21,617 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-27 20:11:21,617 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-27 20:11:21,617 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-27 20:11:21,617 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-27 20:11:21,617 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-27 20:11:21,617 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-27 20:11:21,618 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-27 20:11:21,618 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 20:11:21,618 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-27 20:11:21,618 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-27 20:11:21,619 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-27 20:11:21,619 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-27 20:11:21,620 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 20:11:21,620 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-27 20:11:21,620 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-27 20:11:21,620 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-27 20:11:21,621 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-27 20:11:21,621 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-27 20:11:21,621 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-27 20:11:21,622 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-27 20:11:21,622 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-27 20:11:21,622 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_81df7705-fb17-4c78-aaf0-d247e2bacd70/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 -> b879d991ca85089954916015c9838d386a5c85365dad0e09e537aeb772eaaaf8 [2024-11-27 20:11:22,064 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-27 20:11:22,078 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-27 20:11:22,080 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-27 20:11:22,082 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-27 20:11:22,082 INFO L274 PluginConnector]: CDTParser initialized [2024-11-27 20:11:22,083 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test2-2.i [2024-11-27 20:11:25,337 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/data/f3bba10df/a027098053c642818757afc55da74463/FLAG95ea968a8 [2024-11-27 20:11:25,778 INFO L384 CDTParser]: Found 1 translation units. [2024-11-27 20:11:25,779 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test2-2.i [2024-11-27 20:11:25,806 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/data/f3bba10df/a027098053c642818757afc55da74463/FLAG95ea968a8 [2024-11-27 20:11:25,917 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/data/f3bba10df/a027098053c642818757afc55da74463 [2024-11-27 20:11:25,920 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-27 20:11:25,922 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-27 20:11:25,925 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-27 20:11:25,925 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-27 20:11:25,931 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-27 20:11:25,932 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 08:11:25" (1/1) ... [2024-11-27 20:11:25,933 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5aad33ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:11:25, skipping insertion in model container [2024-11-27 20:11:25,935 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 08:11:25" (1/1) ... [2024-11-27 20:11:26,015 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-27 20:11:26,482 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-27 20:11:26,518 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-27 20:11:26,523 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-27 20:11:26,528 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-27 20:11:26,538 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-27 20:11:26,602 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-27 20:11:26,602 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-27 20:11:26,607 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-27 20:11:26,607 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-27 20:11:26,611 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-27 20:11:26,616 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-27 20:11:26,620 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-27 20:11:26,621 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-27 20:11:26,624 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-27 20:11:26,636 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-27 20:11:26,646 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-27 20:11:26,664 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-27 20:11:26,681 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-27 20:11:26,728 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-27 20:11:26,751 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-27 20:11:26,754 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-27 20:11:26,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-27 20:11:26,771 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-27 20:11:26,840 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-27 20:11:26,840 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-27 20:11:26,843 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-27 20:11:26,843 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-27 20:11:26,845 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-27 20:11:26,847 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-27 20:11:26,852 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-27 20:11:26,853 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-27 20:11:26,853 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-27 20:11:26,857 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-27 20:11:26,861 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-27 20:11:26,870 INFO L200 MainTranslator]: Completed pre-run [2024-11-27 20:11:26,984 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-27 20:11:27,036 INFO L204 MainTranslator]: Completed translation [2024-11-27 20:11:27,037 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:11:27 WrapperNode [2024-11-27 20:11:27,037 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-27 20:11:27,037 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-27 20:11:27,038 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-27 20:11:27,038 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-27 20:11:27,044 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:11:27" (1/1) ... [2024-11-27 20:11:27,074 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:11:27" (1/1) ... [2024-11-27 20:11:27,125 INFO L138 Inliner]: procedures = 211, calls = 280, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1047 [2024-11-27 20:11:27,126 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-27 20:11:27,126 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-27 20:11:27,126 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-27 20:11:27,126 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-27 20:11:27,140 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:11:27" (1/1) ... [2024-11-27 20:11:27,140 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:11:27" (1/1) ... [2024-11-27 20:11:27,165 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:11:27" (1/1) ... [2024-11-27 20:11:27,262 INFO L175 MemorySlicer]: Split 256 memory accesses to 3 slices as follows [2, 220, 34]. 86 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 54 writes are split as follows [0, 50, 4]. [2024-11-27 20:11:27,262 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:11:27" (1/1) ... [2024-11-27 20:11:27,262 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:11:27" (1/1) ... [2024-11-27 20:11:27,320 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:11:27" (1/1) ... [2024-11-27 20:11:27,324 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:11:27" (1/1) ... [2024-11-27 20:11:27,342 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:11:27" (1/1) ... [2024-11-27 20:11:27,351 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:11:27" (1/1) ... [2024-11-27 20:11:27,360 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:11:27" (1/1) ... [2024-11-27 20:11:27,378 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-27 20:11:27,379 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-27 20:11:27,379 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-27 20:11:27,380 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-27 20:11:27,381 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:11:27" (1/1) ... [2024-11-27 20:11:27,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 20:11:27,400 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:11:27,416 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-27 20:11:27,420 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-27 20:11:27,448 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-11-27 20:11:27,448 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-11-27 20:11:27,448 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-27 20:11:27,448 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-27 20:11:27,448 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-27 20:11:27,449 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-27 20:11:27,449 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-27 20:11:27,449 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-27 20:11:27,449 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-27 20:11:27,449 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-27 20:11:27,450 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-11-27 20:11:27,450 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-27 20:11:27,450 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-27 20:11:27,450 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-11-27 20:11:27,450 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-27 20:11:27,450 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-27 20:11:27,450 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-27 20:11:27,450 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-27 20:11:27,451 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-27 20:11:27,451 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-27 20:11:27,451 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-27 20:11:27,451 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-27 20:11:27,452 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-27 20:11:27,452 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-27 20:11:27,452 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-27 20:11:27,452 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-27 20:11:27,452 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-27 20:11:27,452 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-27 20:11:27,452 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-27 20:11:27,452 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-27 20:11:27,452 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-27 20:11:27,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-27 20:11:27,454 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-27 20:11:27,454 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-27 20:11:27,732 INFO L234 CfgBuilder]: Building ICFG [2024-11-27 20:11:27,735 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-27 20:11:27,764 WARN L773 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-27 20:11:27,819 WARN L773 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-27 20:11:27,850 WARN L773 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-27 20:11:33,753 INFO L? ?]: Removed 1100 outVars from TransFormulas that were not future-live. [2024-11-27 20:11:33,754 INFO L283 CfgBuilder]: Performing block encoding [2024-11-27 20:11:33,801 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-27 20:11:33,804 INFO L312 CfgBuilder]: Removed 36 assume(true) statements. [2024-11-27 20:11:33,805 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 08:11:33 BoogieIcfgContainer [2024-11-27 20:11:33,805 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-27 20:11:33,807 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-27 20:11:33,807 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-27 20:11:33,812 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-27 20:11:33,813 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 08:11:25" (1/3) ... [2024-11-27 20:11:33,813 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27ca6e9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 08:11:33, skipping insertion in model container [2024-11-27 20:11:33,813 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:11:27" (2/3) ... [2024-11-27 20:11:33,814 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27ca6e9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 08:11:33, skipping insertion in model container [2024-11-27 20:11:33,814 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 08:11:33" (3/3) ... [2024-11-27 20:11:33,815 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_FNV_test2-2.i [2024-11-27 20:11:33,830 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-27 20:11:33,831 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_FNV_test2-2.i that has 6 procedures, 1093 locations, 1 initial locations, 38 loop locations, and 529 error locations. [2024-11-27 20:11:33,902 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-27 20:11:33,921 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;@1e451b81, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-27 20:11:33,922 INFO L334 AbstractCegarLoop]: Starting to check reachability of 529 error locations. [2024-11-27 20:11:33,931 INFO L276 IsEmpty]: Start isEmpty. Operand has 1083 states, 543 states have (on average 2.2099447513812156) internal successors, (1200), 1076 states have internal predecessors, (1200), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 6 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-27 20:11:33,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-27 20:11:33,940 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:11:33,940 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-27 20:11:33,941 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-27 20:11:33,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:11:33,945 INFO L85 PathProgramCache]: Analyzing trace with hash 65605, now seen corresponding path program 1 times [2024-11-27 20:11:33,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:11:33,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1669203109] [2024-11-27 20:11:33,957 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:11:33,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:11:33,958 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:11:33,960 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:11:33,964 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-27 20:11:34,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:11:34,205 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-27 20:11:34,210 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:11:34,246 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-27 20:11:34,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:11:34,270 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 20:11:34,270 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 20:11:34,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1669203109] [2024-11-27 20:11:34,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1669203109] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:11:34,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:11:34,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 20:11:34,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043039918] [2024-11-27 20:11:34,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:11:34,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 20:11:34,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 20:11:34,313 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 20:11:34,313 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:11:34,320 INFO L87 Difference]: Start difference. First operand has 1083 states, 543 states have (on average 2.2099447513812156) internal successors, (1200), 1076 states have internal predecessors, (1200), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 6 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-27 20:11:36,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:11:36,918 INFO L93 Difference]: Finished difference Result 1248 states and 1325 transitions. [2024-11-27 20:11:36,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 20:11:36,920 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 3 [2024-11-27 20:11:36,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:11:36,939 INFO L225 Difference]: With dead ends: 1248 [2024-11-27 20:11:36,939 INFO L226 Difference]: Without dead ends: 1246 [2024-11-27 20:11:36,942 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-27 20:11:36,945 INFO L435 NwaCegarLoop]: 660 mSDtfsCounter, 984 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 645 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 992 SdHoareTripleChecker+Valid, 815 SdHoareTripleChecker+Invalid, 661 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 645 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-27 20:11:36,946 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [992 Valid, 815 Invalid, 661 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 645 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-27 20:11:36,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1246 states. [2024-11-27 20:11:37,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1246 to 1067. [2024-11-27 20:11:37,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1067 states, 545 states have (on average 2.0495412844036696) internal successors, (1117), 1060 states have internal predecessors, (1117), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-27 20:11:37,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1067 states to 1067 states and 1135 transitions. [2024-11-27 20:11:37,043 INFO L78 Accepts]: Start accepts. Automaton has 1067 states and 1135 transitions. Word has length 3 [2024-11-27 20:11:37,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:11:37,044 INFO L471 AbstractCegarLoop]: Abstraction has 1067 states and 1135 transitions. [2024-11-27 20:11:37,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-27 20:11:37,044 INFO L276 IsEmpty]: Start isEmpty. Operand 1067 states and 1135 transitions. [2024-11-27 20:11:37,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-27 20:11:37,045 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:11:37,045 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-27 20:11:37,056 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-27 20:11:37,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:11:37,246 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-27 20:11:37,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:11:37,246 INFO L85 PathProgramCache]: Analyzing trace with hash 65606, now seen corresponding path program 1 times [2024-11-27 20:11:37,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:11:37,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [122202707] [2024-11-27 20:11:37,247 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:11:37,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:11:37,247 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:11:37,250 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:11:37,251 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-27 20:11:37,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:11:37,409 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-27 20:11:37,412 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:11:37,431 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-27 20:11:37,449 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-27 20:11:37,450 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 20:11:37,450 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 20:11:37,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [122202707] [2024-11-27 20:11:37,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [122202707] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:11:37,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:11:37,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 20:11:37,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313889867] [2024-11-27 20:11:37,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:11:37,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 20:11:37,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 20:11:37,452 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 20:11:37,454 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:11:37,454 INFO L87 Difference]: Start difference. First operand 1067 states and 1135 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-27 20:11:41,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:11:41,102 INFO L93 Difference]: Finished difference Result 1494 states and 1605 transitions. [2024-11-27 20:11:41,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 20:11:41,103 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 3 [2024-11-27 20:11:41,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:11:41,109 INFO L225 Difference]: With dead ends: 1494 [2024-11-27 20:11:41,109 INFO L226 Difference]: Without dead ends: 1494 [2024-11-27 20:11:41,110 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-27 20:11:41,111 INFO L435 NwaCegarLoop]: 933 mSDtfsCounter, 459 mSDsluCounter, 602 mSDsCounter, 0 mSdLazyCounter, 714 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 464 SdHoareTripleChecker+Valid, 1535 SdHoareTripleChecker+Invalid, 720 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 714 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-11-27 20:11:41,111 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [464 Valid, 1535 Invalid, 720 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 714 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-11-27 20:11:41,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1494 states. [2024-11-27 20:11:41,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1494 to 1205. [2024-11-27 20:11:41,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1205 states, 679 states have (on average 2.007363770250368) internal successors, (1363), 1198 states have internal predecessors, (1363), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-27 20:11:41,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1205 states to 1205 states and 1391 transitions. [2024-11-27 20:11:41,164 INFO L78 Accepts]: Start accepts. Automaton has 1205 states and 1391 transitions. Word has length 3 [2024-11-27 20:11:41,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:11:41,165 INFO L471 AbstractCegarLoop]: Abstraction has 1205 states and 1391 transitions. [2024-11-27 20:11:41,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-27 20:11:41,166 INFO L276 IsEmpty]: Start isEmpty. Operand 1205 states and 1391 transitions. [2024-11-27 20:11:41,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-27 20:11:41,166 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:11:41,166 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:11:41,177 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-27 20:11:41,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:11:41,367 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-27 20:11:41,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:11:41,368 INFO L85 PathProgramCache]: Analyzing trace with hash 1329215633, now seen corresponding path program 1 times [2024-11-27 20:11:41,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:11:41,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2037002561] [2024-11-27 20:11:41,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:11:41,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:11:41,369 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:11:41,371 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:11:41,374 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-27 20:11:41,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:11:41,512 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-27 20:11:41,514 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:11:41,522 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-27 20:11:41,609 INFO L349 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2024-11-27 20:11:41,609 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2024-11-27 20:11:41,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:11:41,700 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 20:11:41,700 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 20:11:41,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2037002561] [2024-11-27 20:11:41,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2037002561] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:11:41,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:11:41,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-27 20:11:41,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148045520] [2024-11-27 20:11:41,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:11:41,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-27 20:11:41,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 20:11:41,702 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-27 20:11:41,702 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 20:11:41,702 INFO L87 Difference]: Start difference. First operand 1205 states and 1391 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:11:48,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:11:48,681 INFO L93 Difference]: Finished difference Result 2207 states and 2377 transitions. [2024-11-27 20:11:48,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-27 20:11:48,683 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-27 20:11:48,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:11:48,693 INFO L225 Difference]: With dead ends: 2207 [2024-11-27 20:11:48,693 INFO L226 Difference]: Without dead ends: 2207 [2024-11-27 20:11:48,694 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 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-27 20:11:48,695 INFO L435 NwaCegarLoop]: 1074 mSDtfsCounter, 1212 mSDsluCounter, 1194 mSDsCounter, 0 mSdLazyCounter, 1591 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1222 SdHoareTripleChecker+Valid, 2268 SdHoareTripleChecker+Invalid, 1602 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1591 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.9s IncrementalHoareTripleChecker+Time [2024-11-27 20:11:48,695 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1222 Valid, 2268 Invalid, 1602 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1591 Invalid, 0 Unknown, 0 Unchecked, 6.9s Time] [2024-11-27 20:11:48,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2207 states. [2024-11-27 20:11:48,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2207 to 1354. [2024-11-27 20:11:48,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1354 states, 828 states have (on average 1.9927536231884058) internal successors, (1650), 1347 states have internal predecessors, (1650), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-27 20:11:48,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1354 states to 1354 states and 1678 transitions. [2024-11-27 20:11:48,785 INFO L78 Accepts]: Start accepts. Automaton has 1354 states and 1678 transitions. Word has length 8 [2024-11-27 20:11:48,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:11:48,785 INFO L471 AbstractCegarLoop]: Abstraction has 1354 states and 1678 transitions. [2024-11-27 20:11:48,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:11:48,786 INFO L276 IsEmpty]: Start isEmpty. Operand 1354 states and 1678 transitions. [2024-11-27 20:11:48,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-27 20:11:48,786 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:11:48,786 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:11:48,798 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-27 20:11:48,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:11:48,991 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-27 20:11:48,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:11:48,992 INFO L85 PathProgramCache]: Analyzing trace with hash -1743988334, now seen corresponding path program 1 times [2024-11-27 20:11:48,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:11:48,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [46633573] [2024-11-27 20:11:48,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:11:48,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:11:48,993 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:11:48,995 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:11:48,997 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-27 20:11:49,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:11:49,165 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-27 20:11:49,168 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:11:49,177 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-27 20:11:49,199 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-27 20:11:49,199 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 20:11:49,199 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 20:11:49,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [46633573] [2024-11-27 20:11:49,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [46633573] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:11:49,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:11:49,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 20:11:49,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241030140] [2024-11-27 20:11:49,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:11:49,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 20:11:49,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 20:11:49,200 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 20:11:49,201 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:11:49,201 INFO L87 Difference]: Start difference. First operand 1354 states and 1678 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:11:51,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:11:51,829 INFO L93 Difference]: Finished difference Result 1535 states and 1880 transitions. [2024-11-27 20:11:51,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 20:11:51,830 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-27 20:11:51,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:11:51,838 INFO L225 Difference]: With dead ends: 1535 [2024-11-27 20:11:51,839 INFO L226 Difference]: Without dead ends: 1535 [2024-11-27 20:11:51,839 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:11:51,840 INFO L435 NwaCegarLoop]: 930 mSDtfsCounter, 776 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 672 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 784 SdHoareTripleChecker+Valid, 1210 SdHoareTripleChecker+Invalid, 722 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 672 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-27 20:11:51,841 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [784 Valid, 1210 Invalid, 722 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 672 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-27 20:11:51,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1535 states. [2024-11-27 20:11:51,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1535 to 1307. [2024-11-27 20:11:51,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1307 states, 828 states have (on average 1.922705314009662) internal successors, (1592), 1300 states have internal predecessors, (1592), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-27 20:11:51,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1307 states to 1307 states and 1620 transitions. [2024-11-27 20:11:51,890 INFO L78 Accepts]: Start accepts. Automaton has 1307 states and 1620 transitions. Word has length 9 [2024-11-27 20:11:51,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:11:51,890 INFO L471 AbstractCegarLoop]: Abstraction has 1307 states and 1620 transitions. [2024-11-27 20:11:51,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:11:51,890 INFO L276 IsEmpty]: Start isEmpty. Operand 1307 states and 1620 transitions. [2024-11-27 20:11:51,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-27 20:11:51,891 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:11:51,891 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:11:51,905 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-27 20:11:52,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:11:52,092 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-27 20:11:52,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:11:52,092 INFO L85 PathProgramCache]: Analyzing trace with hash -1743988333, now seen corresponding path program 1 times [2024-11-27 20:11:52,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:11:52,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1201096194] [2024-11-27 20:11:52,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:11:52,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:11:52,093 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:11:52,095 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:11:52,097 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-27 20:11:52,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:11:52,234 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-27 20:11:52,236 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:11:52,265 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-27 20:11:52,311 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-27 20:11:52,311 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 20:11:52,311 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 20:11:52,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1201096194] [2024-11-27 20:11:52,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1201096194] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:11:52,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:11:52,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 20:11:52,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532375735] [2024-11-27 20:11:52,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:11:52,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 20:11:52,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 20:11:52,312 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 20:11:52,312 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:11:52,312 INFO L87 Difference]: Start difference. First operand 1307 states and 1620 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:11:55,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:11:55,524 INFO L93 Difference]: Finished difference Result 1759 states and 2214 transitions. [2024-11-27 20:11:55,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 20:11:55,524 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-27 20:11:55,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:11:55,533 INFO L225 Difference]: With dead ends: 1759 [2024-11-27 20:11:55,533 INFO L226 Difference]: Without dead ends: 1759 [2024-11-27 20:11:55,533 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:11:55,534 INFO L435 NwaCegarLoop]: 1105 mSDtfsCounter, 527 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 668 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 532 SdHoareTripleChecker+Valid, 1554 SdHoareTripleChecker+Invalid, 681 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 668 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-11-27 20:11:55,534 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [532 Valid, 1554 Invalid, 681 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 668 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-11-27 20:11:55,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1759 states. [2024-11-27 20:11:55,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1759 to 1334. [2024-11-27 20:11:55,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1334 states, 865 states have (on average 1.9017341040462428) internal successors, (1645), 1327 states have internal predecessors, (1645), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-27 20:11:55,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1334 states to 1334 states and 1673 transitions. [2024-11-27 20:11:55,585 INFO L78 Accepts]: Start accepts. Automaton has 1334 states and 1673 transitions. Word has length 9 [2024-11-27 20:11:55,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:11:55,586 INFO L471 AbstractCegarLoop]: Abstraction has 1334 states and 1673 transitions. [2024-11-27 20:11:55,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:11:55,587 INFO L276 IsEmpty]: Start isEmpty. Operand 1334 states and 1673 transitions. [2024-11-27 20:11:55,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-27 20:11:55,587 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:11:55,587 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:11:55,600 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-27 20:11:55,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:11:55,788 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr422REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-27 20:11:55,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:11:55,789 INFO L85 PathProgramCache]: Analyzing trace with hash 2051350030, now seen corresponding path program 1 times [2024-11-27 20:11:55,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:11:55,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1785964868] [2024-11-27 20:11:55,789 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:11:55,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:11:55,789 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:11:55,791 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:11:55,792 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-27 20:11:55,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:11:55,950 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-27 20:11:55,952 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:11:56,036 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-27 20:11:56,037 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 20:11:56,037 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 20:11:56,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1785964868] [2024-11-27 20:11:56,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1785964868] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:11:56,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:11:56,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-27 20:11:56,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384263211] [2024-11-27 20:11:56,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:11:56,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 20:11:56,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 20:11:56,038 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 20:11:56,038 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:11:56,038 INFO L87 Difference]: Start difference. First operand 1334 states and 1673 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) 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-27 20:11:56,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:11:56,458 INFO L93 Difference]: Finished difference Result 1602 states and 1847 transitions. [2024-11-27 20:11:56,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 20:11:56,459 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) 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-27 20:11:56,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:11:56,466 INFO L225 Difference]: With dead ends: 1602 [2024-11-27 20:11:56,467 INFO L226 Difference]: Without dead ends: 1602 [2024-11-27 20:11:56,467 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-27 20:11:56,468 INFO L435 NwaCegarLoop]: 1137 mSDtfsCounter, 484 mSDsluCounter, 984 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 489 SdHoareTripleChecker+Valid, 2121 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-27 20:11:56,469 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [489 Valid, 2121 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-27 20:11:56,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1602 states. [2024-11-27 20:11:56,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1602 to 1332. [2024-11-27 20:11:56,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1332 states, 858 states have (on average 1.8752913752913754) internal successors, (1609), 1325 states have internal predecessors, (1609), 20 states have call successors, (20), 3 states have call predecessors, (20), 2 states have return successors, (18), 6 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-27 20:11:56,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1332 states to 1332 states and 1647 transitions. [2024-11-27 20:11:56,515 INFO L78 Accepts]: Start accepts. Automaton has 1332 states and 1647 transitions. Word has length 11 [2024-11-27 20:11:56,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:11:56,515 INFO L471 AbstractCegarLoop]: Abstraction has 1332 states and 1647 transitions. [2024-11-27 20:11:56,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) 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-27 20:11:56,516 INFO L276 IsEmpty]: Start isEmpty. Operand 1332 states and 1647 transitions. [2024-11-27 20:11:56,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-27 20:11:56,516 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:11:56,516 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:11:56,531 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-27 20:11:56,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:11:56,720 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr330REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-27 20:11:56,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:11:56,721 INFO L85 PathProgramCache]: Analyzing trace with hash -549267329, now seen corresponding path program 1 times [2024-11-27 20:11:56,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:11:56,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1540061402] [2024-11-27 20:11:56,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:11:56,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:11:56,722 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:11:56,724 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:11:56,728 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-27 20:11:56,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:11:56,916 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-27 20:11:56,918 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:11:56,989 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-27 20:11:56,989 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 20:11:56,989 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 20:11:56,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1540061402] [2024-11-27 20:11:56,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1540061402] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:11:56,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:11:56,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-27 20:11:56,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160264144] [2024-11-27 20:11:56,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:11:56,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-27 20:11:56,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 20:11:56,991 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-27 20:11:56,991 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 20:11:56,991 INFO L87 Difference]: Start difference. First operand 1332 states and 1647 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:12:00,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:12:00,398 INFO L93 Difference]: Finished difference Result 1500 states and 1778 transitions. [2024-11-27 20:12:00,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-27 20:12:00,399 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-27 20:12:00,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:12:00,414 INFO L225 Difference]: With dead ends: 1500 [2024-11-27 20:12:00,414 INFO L226 Difference]: Without dead ends: 1500 [2024-11-27 20:12:00,414 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 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-27 20:12:00,415 INFO L435 NwaCegarLoop]: 616 mSDtfsCounter, 982 mSDsluCounter, 657 mSDsCounter, 0 mSdLazyCounter, 1072 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 990 SdHoareTripleChecker+Valid, 1273 SdHoareTripleChecker+Invalid, 1101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1072 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-11-27 20:12:00,416 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [990 Valid, 1273 Invalid, 1101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1072 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-11-27 20:12:00,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1500 states. [2024-11-27 20:12:00,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1500 to 1309. [2024-11-27 20:12:00,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1309 states, 858 states have (on average 1.794871794871795) internal successors, (1540), 1302 states have internal predecessors, (1540), 20 states have call successors, (20), 3 states have call predecessors, (20), 2 states have return successors, (18), 6 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-27 20:12:00,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1309 states to 1309 states and 1578 transitions. [2024-11-27 20:12:00,449 INFO L78 Accepts]: Start accepts. Automaton has 1309 states and 1578 transitions. Word has length 13 [2024-11-27 20:12:00,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:12:00,449 INFO L471 AbstractCegarLoop]: Abstraction has 1309 states and 1578 transitions. [2024-11-27 20:12:00,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:12:00,450 INFO L276 IsEmpty]: Start isEmpty. Operand 1309 states and 1578 transitions. [2024-11-27 20:12:00,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-27 20:12:00,450 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:12:00,450 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:12:00,462 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-27 20:12:00,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:12:00,654 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr331REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-27 20:12:00,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:12:00,655 INFO L85 PathProgramCache]: Analyzing trace with hash -549267328, now seen corresponding path program 1 times [2024-11-27 20:12:00,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:12:00,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [912659117] [2024-11-27 20:12:00,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:12:00,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:12:00,656 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:12:00,657 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:12:00,659 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-27 20:12:00,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:12:00,821 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-27 20:12:00,823 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:12:00,838 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-27 20:12:00,998 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-27 20:12:00,998 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 20:12:00,998 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 20:12:00,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [912659117] [2024-11-27 20:12:00,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [912659117] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:12:00,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:12:00,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-27 20:12:00,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806561009] [2024-11-27 20:12:00,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:12:00,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-27 20:12:01,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 20:12:01,000 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-27 20:12:01,001 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 20:12:01,001 INFO L87 Difference]: Start difference. First operand 1309 states and 1578 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:12:05,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:12:05,038 INFO L93 Difference]: Finished difference Result 1504 states and 1748 transitions. [2024-11-27 20:12:05,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-27 20:12:05,038 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-27 20:12:05,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:12:05,043 INFO L225 Difference]: With dead ends: 1504 [2024-11-27 20:12:05,043 INFO L226 Difference]: Without dead ends: 1504 [2024-11-27 20:12:05,043 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-27 20:12:05,045 INFO L435 NwaCegarLoop]: 922 mSDtfsCounter, 352 mSDsluCounter, 1059 mSDsCounter, 0 mSdLazyCounter, 1152 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 1981 SdHoareTripleChecker+Invalid, 1167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2024-11-27 20:12:05,045 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [357 Valid, 1981 Invalid, 1167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1152 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2024-11-27 20:12:05,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1504 states. [2024-11-27 20:12:05,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1504 to 1290. [2024-11-27 20:12:05,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1290 states, 839 states have (on average 1.7854588796185935) internal successors, (1498), 1283 states have internal predecessors, (1498), 20 states have call successors, (20), 3 states have call predecessors, (20), 2 states have return successors, (18), 6 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-27 20:12:05,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1290 states to 1290 states and 1536 transitions. [2024-11-27 20:12:05,072 INFO L78 Accepts]: Start accepts. Automaton has 1290 states and 1536 transitions. Word has length 13 [2024-11-27 20:12:05,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:12:05,073 INFO L471 AbstractCegarLoop]: Abstraction has 1290 states and 1536 transitions. [2024-11-27 20:12:05,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:12:05,073 INFO L276 IsEmpty]: Start isEmpty. Operand 1290 states and 1536 transitions. [2024-11-27 20:12:05,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-27 20:12:05,074 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:12:05,074 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:12:05,084 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-27 20:12:05,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:12:05,278 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr527ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-27 20:12:05,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:12:05,279 INFO L85 PathProgramCache]: Analyzing trace with hash -1313719467, now seen corresponding path program 1 times [2024-11-27 20:12:05,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:12:05,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [887553892] [2024-11-27 20:12:05,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:12:05,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:12:05,279 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:12:05,281 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:12:05,282 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-27 20:12:05,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:12:05,428 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-27 20:12:05,430 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:12:05,440 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-27 20:12:05,441 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-27 20:12:05,442 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-27 20:12:05,449 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 39 [2024-11-27 20:12:05,511 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 20:12:05,512 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 26 [2024-11-27 20:12:05,529 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-27 20:12:05,529 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 20:12:05,529 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 20:12:05,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [887553892] [2024-11-27 20:12:05,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [887553892] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:12:05,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:12:05,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-27 20:12:05,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977063508] [2024-11-27 20:12:05,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:12:05,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-27 20:12:05,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 20:12:05,530 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-27 20:12:05,530 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 20:12:05,530 INFO L87 Difference]: Start difference. First operand 1290 states and 1536 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:12:06,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:12:06,221 INFO L93 Difference]: Finished difference Result 2059 states and 2310 transitions. [2024-11-27 20:12:06,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-27 20:12:06,222 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-11-27 20:12:06,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:12:06,229 INFO L225 Difference]: With dead ends: 2059 [2024-11-27 20:12:06,229 INFO L226 Difference]: Without dead ends: 2059 [2024-11-27 20:12:06,230 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-27 20:12:06,231 INFO L435 NwaCegarLoop]: 1002 mSDtfsCounter, 954 mSDsluCounter, 1985 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 962 SdHoareTripleChecker+Valid, 2987 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-27 20:12:06,231 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [962 Valid, 2987 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-27 20:12:06,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2059 states. [2024-11-27 20:12:06,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2059 to 1210. [2024-11-27 20:12:06,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1210 states, 764 states have (on average 1.831151832460733) internal successors, (1399), 1203 states have internal predecessors, (1399), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-27 20:12:06,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1210 states to 1210 states and 1427 transitions. [2024-11-27 20:12:06,265 INFO L78 Accepts]: Start accepts. Automaton has 1210 states and 1427 transitions. Word has length 14 [2024-11-27 20:12:06,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:12:06,265 INFO L471 AbstractCegarLoop]: Abstraction has 1210 states and 1427 transitions. [2024-11-27 20:12:06,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:12:06,265 INFO L276 IsEmpty]: Start isEmpty. Operand 1210 states and 1427 transitions. [2024-11-27 20:12:06,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-27 20:12:06,266 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:12:06,266 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:12:06,278 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-27 20:12:06,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:12:06,467 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-27 20:12:06,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:12:06,468 INFO L85 PathProgramCache]: Analyzing trace with hash 495195041, now seen corresponding path program 1 times [2024-11-27 20:12:06,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:12:06,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [633763414] [2024-11-27 20:12:06,468 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:12:06,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:12:06,469 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:12:06,471 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:12:06,475 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-27 20:12:06,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:12:06,670 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-27 20:12:06,672 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:12:06,680 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-27 20:12:06,753 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-27 20:12:06,753 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 20:12:06,753 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 20:12:06,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [633763414] [2024-11-27 20:12:06,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [633763414] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:12:06,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:12:06,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-27 20:12:06,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655793477] [2024-11-27 20:12:06,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:12:06,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-27 20:12:06,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 20:12:06,754 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-27 20:12:06,754 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 20:12:06,755 INFO L87 Difference]: Start difference. First operand 1210 states and 1427 transitions. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:12:09,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:12:09,619 INFO L93 Difference]: Finished difference Result 1195 states and 1389 transitions. [2024-11-27 20:12:09,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-27 20:12:09,619 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-11-27 20:12:09,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:12:09,622 INFO L225 Difference]: With dead ends: 1195 [2024-11-27 20:12:09,622 INFO L226 Difference]: Without dead ends: 1195 [2024-11-27 20:12:09,622 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 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-27 20:12:09,623 INFO L435 NwaCegarLoop]: 651 mSDtfsCounter, 800 mSDsluCounter, 586 mSDsCounter, 0 mSdLazyCounter, 1018 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 808 SdHoareTripleChecker+Valid, 1237 SdHoareTripleChecker+Invalid, 1045 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1018 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-27 20:12:09,623 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [808 Valid, 1237 Invalid, 1045 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1018 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-27 20:12:09,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1195 states. [2024-11-27 20:12:09,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1195 to 1187. [2024-11-27 20:12:09,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1187 states, 764 states have (on average 1.7709424083769634) internal successors, (1353), 1180 states have internal predecessors, (1353), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-27 20:12:09,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1187 states to 1187 states and 1381 transitions. [2024-11-27 20:12:09,646 INFO L78 Accepts]: Start accepts. Automaton has 1187 states and 1381 transitions. Word has length 19 [2024-11-27 20:12:09,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:12:09,647 INFO L471 AbstractCegarLoop]: Abstraction has 1187 states and 1381 transitions. [2024-11-27 20:12:09,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:12:09,647 INFO L276 IsEmpty]: Start isEmpty. Operand 1187 states and 1381 transitions. [2024-11-27 20:12:09,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-27 20:12:09,648 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:12:09,648 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:12:09,662 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-27 20:12:09,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:12:09,849 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-27 20:12:09,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:12:09,849 INFO L85 PathProgramCache]: Analyzing trace with hash 495195042, now seen corresponding path program 1 times [2024-11-27 20:12:09,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:12:09,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [494717649] [2024-11-27 20:12:09,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:12:09,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:12:09,850 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:12:09,851 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:12:09,853 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-27 20:12:10,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:12:10,035 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-27 20:12:10,038 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:12:10,048 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-27 20:12:10,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:12:10,214 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 20:12:10,214 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 20:12:10,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [494717649] [2024-11-27 20:12:10,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [494717649] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:12:10,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:12:10,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-27 20:12:10,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454174072] [2024-11-27 20:12:10,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:12:10,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-27 20:12:10,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 20:12:10,216 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-27 20:12:10,216 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 20:12:10,216 INFO L87 Difference]: Start difference. First operand 1187 states and 1381 transitions. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:12:14,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:12:14,800 INFO L93 Difference]: Finished difference Result 1680 states and 1950 transitions. [2024-11-27 20:12:14,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-27 20:12:14,801 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-11-27 20:12:14,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:12:14,805 INFO L225 Difference]: With dead ends: 1680 [2024-11-27 20:12:14,805 INFO L226 Difference]: Without dead ends: 1680 [2024-11-27 20:12:14,805 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 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-27 20:12:14,806 INFO L435 NwaCegarLoop]: 1125 mSDtfsCounter, 625 mSDsluCounter, 1119 mSDsCounter, 0 mSdLazyCounter, 1331 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 630 SdHoareTripleChecker+Valid, 2244 SdHoareTripleChecker+Invalid, 1353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2024-11-27 20:12:14,806 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [630 Valid, 2244 Invalid, 1353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1331 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2024-11-27 20:12:14,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1680 states. [2024-11-27 20:12:14,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1680 to 1303. [2024-11-27 20:12:14,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1303 states, 880 states have (on average 1.696590909090909) internal successors, (1493), 1296 states have internal predecessors, (1493), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-27 20:12:14,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1303 states to 1303 states and 1521 transitions. [2024-11-27 20:12:14,831 INFO L78 Accepts]: Start accepts. Automaton has 1303 states and 1521 transitions. Word has length 19 [2024-11-27 20:12:14,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:12:14,832 INFO L471 AbstractCegarLoop]: Abstraction has 1303 states and 1521 transitions. [2024-11-27 20:12:14,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:12:14,832 INFO L276 IsEmpty]: Start isEmpty. Operand 1303 states and 1521 transitions. [2024-11-27 20:12:14,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-27 20:12:14,833 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:12:14,833 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:12:14,846 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-27 20:12:15,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:12:15,034 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-27 20:12:15,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:12:15,034 INFO L85 PathProgramCache]: Analyzing trace with hash 1991006148, now seen corresponding path program 1 times [2024-11-27 20:12:15,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:12:15,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [525729374] [2024-11-27 20:12:15,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:12:15,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:12:15,035 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:12:15,040 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:12:15,042 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-27 20:12:15,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:12:15,287 INFO L256 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-27 20:12:15,298 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:12:15,316 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-27 20:12:15,614 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-27 20:12:15,614 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 20:12:16,245 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-27 20:12:16,246 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 20:12:16,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [525729374] [2024-11-27 20:12:16,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [525729374] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-27 20:12:16,246 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-27 20:12:16,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2024-11-27 20:12:16,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170781903] [2024-11-27 20:12:16,246 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-27 20:12:16,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-27 20:12:16,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 20:12:16,248 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-27 20:12:16,248 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-27 20:12:16,249 INFO L87 Difference]: Start difference. First operand 1303 states and 1521 transitions. Second operand has 8 states, 7 states have (on average 10.142857142857142) internal successors, (71), 8 states have internal predecessors, (71), 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-27 20:12:29,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:12:29,004 INFO L93 Difference]: Finished difference Result 2042 states and 2446 transitions. [2024-11-27 20:12:29,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-27 20:12:29,005 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 10.142857142857142) internal successors, (71), 8 states have internal predecessors, (71), 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 38 [2024-11-27 20:12:29,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:12:29,011 INFO L225 Difference]: With dead ends: 2042 [2024-11-27 20:12:29,011 INFO L226 Difference]: Without dead ends: 2042 [2024-11-27 20:12:29,011 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2024-11-27 20:12:29,012 INFO L435 NwaCegarLoop]: 1152 mSDtfsCounter, 1283 mSDsluCounter, 2320 mSDsCounter, 0 mSdLazyCounter, 2511 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1289 SdHoareTripleChecker+Valid, 3472 SdHoareTripleChecker+Invalid, 2538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 2511 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.4s IncrementalHoareTripleChecker+Time [2024-11-27 20:12:29,012 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1289 Valid, 3472 Invalid, 2538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 2511 Invalid, 0 Unknown, 0 Unchecked, 12.4s Time] [2024-11-27 20:12:29,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2042 states. [2024-11-27 20:12:29,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2042 to 1469. [2024-11-27 20:12:29,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1469 states, 1046 states have (on average 1.6510516252390057) internal successors, (1727), 1462 states have internal predecessors, (1727), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-27 20:12:29,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1469 states to 1469 states and 1755 transitions. [2024-11-27 20:12:29,059 INFO L78 Accepts]: Start accepts. Automaton has 1469 states and 1755 transitions. Word has length 38 [2024-11-27 20:12:29,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:12:29,059 INFO L471 AbstractCegarLoop]: Abstraction has 1469 states and 1755 transitions. [2024-11-27 20:12:29,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 10.142857142857142) internal successors, (71), 8 states have internal predecessors, (71), 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-27 20:12:29,060 INFO L276 IsEmpty]: Start isEmpty. Operand 1469 states and 1755 transitions. [2024-11-27 20:12:29,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-27 20:12:29,065 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:12:29,066 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] [2024-11-27 20:12:29,083 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-11-27 20:12:29,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:12:29,267 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-27 20:12:29,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:12:29,267 INFO L85 PathProgramCache]: Analyzing trace with hash -1728836185, now seen corresponding path program 1 times [2024-11-27 20:12:29,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:12:29,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [416928654] [2024-11-27 20:12:29,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:12:29,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:12:29,268 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:12:29,272 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:12:29,274 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-27 20:12:29,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:12:29,537 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-27 20:12:29,539 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:12:29,604 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-27 20:12:29,605 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 20:12:29,605 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 20:12:29,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [416928654] [2024-11-27 20:12:29,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [416928654] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:12:29,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:12:29,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-27 20:12:29,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031757862] [2024-11-27 20:12:29,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:12:29,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-27 20:12:29,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 20:12:29,606 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-27 20:12:29,607 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 20:12:29,607 INFO L87 Difference]: Start difference. First operand 1469 states and 1755 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:12:29,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:12:29,745 INFO L93 Difference]: Finished difference Result 1154 states and 1315 transitions. [2024-11-27 20:12:29,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-27 20:12:29,746 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2024-11-27 20:12:29,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:12:29,749 INFO L225 Difference]: With dead ends: 1154 [2024-11-27 20:12:29,749 INFO L226 Difference]: Without dead ends: 1154 [2024-11-27 20:12:29,749 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-27 20:12:29,750 INFO L435 NwaCegarLoop]: 960 mSDtfsCounter, 56 mSDsluCounter, 1847 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 2807 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-27 20:12:29,750 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 2807 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-27 20:12:29,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1154 states. [2024-11-27 20:12:29,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1154 to 1152. [2024-11-27 20:12:29,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1152 states, 752 states have (on average 1.7087765957446808) internal successors, (1285), 1145 states have internal predecessors, (1285), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-27 20:12:29,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1152 states to 1152 states and 1313 transitions. [2024-11-27 20:12:29,769 INFO L78 Accepts]: Start accepts. Automaton has 1152 states and 1313 transitions. Word has length 54 [2024-11-27 20:12:29,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:12:29,769 INFO L471 AbstractCegarLoop]: Abstraction has 1152 states and 1313 transitions. [2024-11-27 20:12:29,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:12:29,770 INFO L276 IsEmpty]: Start isEmpty. Operand 1152 states and 1313 transitions. [2024-11-27 20:12:29,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-27 20:12:29,771 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:12:29,771 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] [2024-11-27 20:12:29,784 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2024-11-27 20:12:29,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:12:29,972 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-27 20:12:29,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:12:29,972 INFO L85 PathProgramCache]: Analyzing trace with hash 199933403, now seen corresponding path program 1 times [2024-11-27 20:12:29,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:12:29,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [262118192] [2024-11-27 20:12:29,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:12:29,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:12:29,973 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:12:29,975 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:12:29,978 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-27 20:12:30,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:12:30,300 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-27 20:12:30,304 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:12:30,316 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-27 20:12:31,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 20:12:31,050 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-27 20:12:31,073 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-27 20:12:31,074 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-27 20:12:31,086 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-27 20:12:31,087 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 20:12:31,088 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 20:12:31,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [262118192] [2024-11-27 20:12:31,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [262118192] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:12:31,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:12:31,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-27 20:12:31,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937654962] [2024-11-27 20:12:31,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:12:31,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-27 20:12:31,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 20:12:31,089 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-27 20:12:31,089 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-27 20:12:31,090 INFO L87 Difference]: Start difference. First operand 1152 states and 1313 transitions. Second operand has 5 states, 4 states have (on average 15.5) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:12:34,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:12:34,584 INFO L93 Difference]: Finished difference Result 1114 states and 1275 transitions. [2024-11-27 20:12:34,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-27 20:12:34,585 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 15.5) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2024-11-27 20:12:34,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:12:34,588 INFO L225 Difference]: With dead ends: 1114 [2024-11-27 20:12:34,588 INFO L226 Difference]: Without dead ends: 1114 [2024-11-27 20:12:34,588 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-27 20:12:34,589 INFO L435 NwaCegarLoop]: 501 mSDtfsCounter, 1327 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 1000 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1335 SdHoareTripleChecker+Valid, 832 SdHoareTripleChecker+Invalid, 1052 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 1000 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-11-27 20:12:34,589 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1335 Valid, 832 Invalid, 1052 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 1000 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-11-27 20:12:34,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1114 states. [2024-11-27 20:12:34,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1114 to 1077. [2024-11-27 20:12:34,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1077 states, 715 states have (on average 1.6405594405594406) internal successors, (1173), 1070 states have internal predecessors, (1173), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-27 20:12:34,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1077 states to 1077 states and 1201 transitions. [2024-11-27 20:12:34,608 INFO L78 Accepts]: Start accepts. Automaton has 1077 states and 1201 transitions. Word has length 62 [2024-11-27 20:12:34,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:12:34,609 INFO L471 AbstractCegarLoop]: Abstraction has 1077 states and 1201 transitions. [2024-11-27 20:12:34,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 15.5) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:12:34,609 INFO L276 IsEmpty]: Start isEmpty. Operand 1077 states and 1201 transitions. [2024-11-27 20:12:34,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-27 20:12:34,610 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:12:34,611 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] [2024-11-27 20:12:34,628 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-11-27 20:12:34,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:12:34,811 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-27 20:12:34,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:12:34,812 INFO L85 PathProgramCache]: Analyzing trace with hash -543313183, now seen corresponding path program 1 times [2024-11-27 20:12:34,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:12:34,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [161457171] [2024-11-27 20:12:34,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:12:34,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:12:34,813 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:12:34,815 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:12:34,816 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-27 20:12:35,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:12:35,136 INFO L256 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-27 20:12:35,138 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:12:35,148 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-27 20:12:35,168 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-27 20:12:35,209 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-27 20:12:35,222 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-27 20:12:35,222 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 20:12:35,222 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 20:12:35,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [161457171] [2024-11-27 20:12:35,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [161457171] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:12:35,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:12:35,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-27 20:12:35,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216686850] [2024-11-27 20:12:35,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:12:35,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-27 20:12:35,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 20:12:35,224 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-27 20:12:35,224 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-27 20:12:35,224 INFO L87 Difference]: Start difference. First operand 1077 states and 1201 transitions. Second operand has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:12:38,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:12:38,627 INFO L93 Difference]: Finished difference Result 1076 states and 1200 transitions. [2024-11-27 20:12:38,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-27 20:12:38,628 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2024-11-27 20:12:38,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:12:38,630 INFO L225 Difference]: With dead ends: 1076 [2024-11-27 20:12:38,630 INFO L226 Difference]: Without dead ends: 1076 [2024-11-27 20:12:38,631 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 63 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-27 20:12:38,633 INFO L435 NwaCegarLoop]: 933 mSDtfsCounter, 2 mSDsluCounter, 1565 mSDsCounter, 0 mSdLazyCounter, 1241 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2498 SdHoareTripleChecker+Invalid, 1242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-11-27 20:12:38,634 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2498 Invalid, 1242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1241 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-11-27 20:12:38,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1076 states. [2024-11-27 20:12:38,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1076 to 1076. [2024-11-27 20:12:38,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1076 states, 715 states have (on average 1.6391608391608392) internal successors, (1172), 1069 states have internal predecessors, (1172), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-27 20:12:38,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1076 states to 1076 states and 1200 transitions. [2024-11-27 20:12:38,648 INFO L78 Accepts]: Start accepts. Automaton has 1076 states and 1200 transitions. Word has length 67 [2024-11-27 20:12:38,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:12:38,648 INFO L471 AbstractCegarLoop]: Abstraction has 1076 states and 1200 transitions. [2024-11-27 20:12:38,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:12:38,648 INFO L276 IsEmpty]: Start isEmpty. Operand 1076 states and 1200 transitions. [2024-11-27 20:12:38,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-27 20:12:38,649 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:12:38,649 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] [2024-11-27 20:12:38,663 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2024-11-27 20:12:38,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:12:38,854 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-27 20:12:38,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:12:38,855 INFO L85 PathProgramCache]: Analyzing trace with hash -543313182, now seen corresponding path program 1 times [2024-11-27 20:12:38,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:12:38,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [619835731] [2024-11-27 20:12:38,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:12:38,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:12:38,856 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:12:38,859 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:12:38,862 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-11-27 20:12:39,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:12:39,243 INFO L256 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-27 20:12:39,250 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:12:39,265 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-27 20:12:39,298 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-27 20:12:39,306 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-27 20:12:39,391 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-27 20:12:39,425 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-27 20:12:39,425 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 20:12:39,426 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 20:12:39,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [619835731] [2024-11-27 20:12:39,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [619835731] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:12:39,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:12:39,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-27 20:12:39,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489662580] [2024-11-27 20:12:39,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:12:39,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-27 20:12:39,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 20:12:39,427 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-27 20:12:39,428 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-27 20:12:39,428 INFO L87 Difference]: Start difference. First operand 1076 states and 1200 transitions. Second operand has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:12:43,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:12:43,870 INFO L93 Difference]: Finished difference Result 1075 states and 1199 transitions. [2024-11-27 20:12:43,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-27 20:12:43,871 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2024-11-27 20:12:43,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:12:43,874 INFO L225 Difference]: With dead ends: 1075 [2024-11-27 20:12:43,874 INFO L226 Difference]: Without dead ends: 1075 [2024-11-27 20:12:43,874 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-27 20:12:43,875 INFO L435 NwaCegarLoop]: 933 mSDtfsCounter, 1 mSDsluCounter, 1496 mSDsCounter, 0 mSdLazyCounter, 1307 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2429 SdHoareTripleChecker+Invalid, 1308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2024-11-27 20:12:43,875 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2429 Invalid, 1308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1307 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2024-11-27 20:12:43,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1075 states. [2024-11-27 20:12:43,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1075 to 1075. [2024-11-27 20:12:43,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1075 states, 714 states have (on average 1.6400560224089635) internal successors, (1171), 1068 states have internal predecessors, (1171), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-27 20:12:43,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1075 states to 1075 states and 1199 transitions. [2024-11-27 20:12:43,889 INFO L78 Accepts]: Start accepts. Automaton has 1075 states and 1199 transitions. Word has length 67 [2024-11-27 20:12:43,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:12:43,889 INFO L471 AbstractCegarLoop]: Abstraction has 1075 states and 1199 transitions. [2024-11-27 20:12:43,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:12:43,889 INFO L276 IsEmpty]: Start isEmpty. Operand 1075 states and 1199 transitions. [2024-11-27 20:12:43,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-27 20:12:43,890 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:12:43,890 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, 1, 1, 1, 1, 1, 1] [2024-11-27 20:12:43,900 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2024-11-27 20:12:44,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:12:44,091 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-27 20:12:44,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:12:44,091 INFO L85 PathProgramCache]: Analyzing trace with hash -1357033752, now seen corresponding path program 1 times [2024-11-27 20:12:44,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:12:44,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [726098464] [2024-11-27 20:12:44,092 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:12:44,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:12:44,092 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:12:44,094 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:12:44,095 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-11-27 20:12:44,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:12:44,383 INFO L256 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-27 20:12:44,385 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:12:44,394 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-27 20:12:44,515 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-27 20:12:44,540 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-27 20:12:44,540 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 20:12:44,540 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 20:12:44,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [726098464] [2024-11-27 20:12:44,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [726098464] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:12:44,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:12:44,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-27 20:12:44,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104674104] [2024-11-27 20:12:44,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:12:44,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-27 20:12:44,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 20:12:44,544 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-27 20:12:44,544 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-27 20:12:44,545 INFO L87 Difference]: Start difference. First operand 1075 states and 1199 transitions. Second operand has 7 states, 5 states have (on average 14.6) internal successors, (73), 6 states have internal predecessors, (73), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-27 20:12:49,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:12:49,004 INFO L93 Difference]: Finished difference Result 1087 states and 1214 transitions. [2024-11-27 20:12:49,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-27 20:12:49,005 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 14.6) internal successors, (73), 6 states have internal predecessors, (73), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 75 [2024-11-27 20:12:49,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:12:49,009 INFO L225 Difference]: With dead ends: 1087 [2024-11-27 20:12:49,009 INFO L226 Difference]: Without dead ends: 1087 [2024-11-27 20:12:49,009 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 69 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-27 20:12:49,010 INFO L435 NwaCegarLoop]: 918 mSDtfsCounter, 13 mSDsluCounter, 3017 mSDsCounter, 0 mSdLazyCounter, 1660 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 3935 SdHoareTripleChecker+Invalid, 1670 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1660 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2024-11-27 20:12:49,010 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 3935 Invalid, 1670 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1660 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2024-11-27 20:12:49,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1087 states. [2024-11-27 20:12:49,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1087 to 1081. [2024-11-27 20:12:49,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1081 states, 719 states have (on average 1.6383866481223923) internal successors, (1178), 1073 states have internal predecessors, (1178), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (16), 6 states have call predecessors, (16), 13 states have call successors, (16) [2024-11-27 20:12:49,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1081 states to 1081 states and 1209 transitions. [2024-11-27 20:12:49,031 INFO L78 Accepts]: Start accepts. Automaton has 1081 states and 1209 transitions. Word has length 75 [2024-11-27 20:12:49,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:12:49,031 INFO L471 AbstractCegarLoop]: Abstraction has 1081 states and 1209 transitions. [2024-11-27 20:12:49,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 14.6) internal successors, (73), 6 states have internal predecessors, (73), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-27 20:12:49,032 INFO L276 IsEmpty]: Start isEmpty. Operand 1081 states and 1209 transitions. [2024-11-27 20:12:49,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-27 20:12:49,032 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:12:49,033 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, 1, 1, 1, 1, 1, 1] [2024-11-27 20:12:49,050 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2024-11-27 20:12:49,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:12:49,233 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-27 20:12:49,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:12:49,234 INFO L85 PathProgramCache]: Analyzing trace with hash -1357033751, now seen corresponding path program 1 times [2024-11-27 20:12:49,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:12:49,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1997593741] [2024-11-27 20:12:49,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:12:49,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:12:49,235 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:12:49,236 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:12:49,238 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-11-27 20:12:49,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:12:49,581 INFO L256 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-27 20:12:49,583 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:12:49,604 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-27 20:12:49,604 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 20:12:49,604 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 20:12:49,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1997593741] [2024-11-27 20:12:49,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1997593741] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:12:49,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:12:49,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-27 20:12:49,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125368460] [2024-11-27 20:12:49,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:12:49,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-27 20:12:49,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 20:12:49,606 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-27 20:12:49,606 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 20:12:49,607 INFO L87 Difference]: Start difference. First operand 1081 states and 1209 transitions. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-27 20:12:49,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:12:49,674 INFO L93 Difference]: Finished difference Result 1078 states and 1203 transitions. [2024-11-27 20:12:49,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-27 20:12:49,675 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 75 [2024-11-27 20:12:49,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:12:49,684 INFO L225 Difference]: With dead ends: 1078 [2024-11-27 20:12:49,684 INFO L226 Difference]: Without dead ends: 1078 [2024-11-27 20:12:49,684 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 20:12:49,688 INFO L435 NwaCegarLoop]: 933 mSDtfsCounter, 0 mSDsluCounter, 1861 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2794 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-27 20:12:49,689 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2794 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 20:12:49,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1078 states. [2024-11-27 20:12:49,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1078 to 1078. [2024-11-27 20:12:49,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1078 states, 716 states have (on average 1.6396648044692737) internal successors, (1174), 1071 states have internal predecessors, (1174), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-27 20:12:49,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1078 states to 1078 states and 1203 transitions. [2024-11-27 20:12:49,718 INFO L78 Accepts]: Start accepts. Automaton has 1078 states and 1203 transitions. Word has length 75 [2024-11-27 20:12:49,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:12:49,720 INFO L471 AbstractCegarLoop]: Abstraction has 1078 states and 1203 transitions. [2024-11-27 20:12:49,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-27 20:12:49,720 INFO L276 IsEmpty]: Start isEmpty. Operand 1078 states and 1203 transitions. [2024-11-27 20:12:49,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-27 20:12:49,721 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:12:49,721 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:12:49,738 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2024-11-27 20:12:49,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:12:49,922 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-27 20:12:49,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:12:49,923 INFO L85 PathProgramCache]: Analyzing trace with hash 1796327608, now seen corresponding path program 1 times [2024-11-27 20:12:49,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:12:49,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2096593209] [2024-11-27 20:12:49,924 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:12:49,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:12:49,924 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:12:49,926 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:12:49,929 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2024-11-27 20:12:50,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:12:50,258 INFO L256 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-27 20:12:50,260 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:12:50,289 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-27 20:12:50,289 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 20:12:50,377 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-27 20:12:50,377 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 20:12:50,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2096593209] [2024-11-27 20:12:50,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2096593209] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-27 20:12:50,377 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-27 20:12:50,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-27 20:12:50,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331316055] [2024-11-27 20:12:50,378 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-27 20:12:50,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-27 20:12:50,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 20:12:50,379 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-27 20:12:50,379 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-27 20:12:50,379 INFO L87 Difference]: Start difference. First operand 1078 states and 1203 transitions. Second operand has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-27 20:12:50,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:12:50,623 INFO L93 Difference]: Finished difference Result 1090 states and 1220 transitions. [2024-11-27 20:12:50,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-27 20:12:50,624 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 76 [2024-11-27 20:12:50,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:12:50,629 INFO L225 Difference]: With dead ends: 1090 [2024-11-27 20:12:50,629 INFO L226 Difference]: Without dead ends: 1090 [2024-11-27 20:12:50,629 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 144 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-27 20:12:50,630 INFO L435 NwaCegarLoop]: 933 mSDtfsCounter, 7 mSDsluCounter, 1864 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 2797 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-27 20:12:50,631 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 2797 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-27 20:12:50,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1090 states. [2024-11-27 20:12:50,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1090 to 1088. [2024-11-27 20:12:50,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1088 states, 725 states have (on average 1.64) internal successors, (1189), 1080 states have internal predecessors, (1189), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-27 20:12:50,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1218 transitions. [2024-11-27 20:12:50,668 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1218 transitions. Word has length 76 [2024-11-27 20:12:50,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:12:50,668 INFO L471 AbstractCegarLoop]: Abstraction has 1088 states and 1218 transitions. [2024-11-27 20:12:50,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-27 20:12:50,669 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1218 transitions. [2024-11-27 20:12:50,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-27 20:12:50,669 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:12:50,670 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:12:50,686 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2024-11-27 20:12:50,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:12:50,871 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-27 20:12:50,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:12:50,872 INFO L85 PathProgramCache]: Analyzing trace with hash 1163215592, now seen corresponding path program 2 times [2024-11-27 20:12:50,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:12:50,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [806022924] [2024-11-27 20:12:50,872 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-27 20:12:50,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:12:50,873 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:12:50,875 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:12:50,879 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2024-11-27 20:13:11,714 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-27 20:13:11,714 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-27 20:13:11,728 INFO L256 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-27 20:13:11,732 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:13:11,904 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-27 20:13:11,905 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-27 20:13:11,934 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-27 20:13:12,171 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:13:12,171 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-27 20:13:12,229 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-27 20:13:12,260 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-27 20:13:12,260 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 20:13:12,377 INFO L349 Elim1Store]: treesize reduction 7, result has 63.2 percent of original size [2024-11-27 20:13:12,377 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-27 20:13:12,442 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 20:13:12,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [806022924] [2024-11-27 20:13:12,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [806022924] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 20:13:12,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2049243947] [2024-11-27 20:13:12,442 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-27 20:13:12,443 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-27 20:13:12,443 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 [2024-11-27 20:13:12,454 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-27 20:13:12,455 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (22)] Waiting until timeout for monitored process [2024-11-27 20:13:14,215 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-27 20:13:14,215 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-27 20:13:14,254 INFO L256 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-27 20:13:14,257 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:13:14,535 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-27 20:13:14,535 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 20:13:14,957 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-27 20:13:14,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2049243947] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-27 20:13:14,957 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-27 20:13:14,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 24 [2024-11-27 20:13:14,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259778534] [2024-11-27 20:13:14,957 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-27 20:13:14,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-27 20:13:14,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 20:13:14,959 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-27 20:13:14,959 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=552, Unknown=7, NotChecked=0, Total=650 [2024-11-27 20:13:14,959 INFO L87 Difference]: Start difference. First operand 1088 states and 1218 transitions. Second operand has 24 states, 23 states have (on average 6.217391304347826) internal successors, (143), 23 states have internal predecessors, (143), 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-27 20:13:27,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:13:27,093 INFO L93 Difference]: Finished difference Result 1104 states and 1241 transitions. [2024-11-27 20:13:27,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-11-27 20:13:27,094 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 6.217391304347826) internal successors, (143), 23 states have internal predecessors, (143), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 79 [2024-11-27 20:13:27,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:13:27,097 INFO L225 Difference]: With dead ends: 1104 [2024-11-27 20:13:27,097 INFO L226 Difference]: Without dead ends: 1100 [2024-11-27 20:13:27,098 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 215 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 488 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=416, Invalid=2332, Unknown=8, NotChecked=0, Total=2756 [2024-11-27 20:13:27,099 INFO L435 NwaCegarLoop]: 626 mSDtfsCounter, 718 mSDsluCounter, 7117 mSDsCounter, 0 mSdLazyCounter, 4894 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 727 SdHoareTripleChecker+Valid, 7743 SdHoareTripleChecker+Invalid, 4928 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 4894 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.7s IncrementalHoareTripleChecker+Time [2024-11-27 20:13:27,099 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [727 Valid, 7743 Invalid, 4928 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [34 Valid, 4894 Invalid, 0 Unknown, 0 Unchecked, 10.7s Time] [2024-11-27 20:13:27,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1100 states. [2024-11-27 20:13:27,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1100 to 1096. [2024-11-27 20:13:27,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1096 states, 734 states have (on average 1.6348773841961852) internal successors, (1200), 1088 states have internal predecessors, (1200), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-27 20:13:27,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1096 states to 1096 states and 1229 transitions. [2024-11-27 20:13:27,121 INFO L78 Accepts]: Start accepts. Automaton has 1096 states and 1229 transitions. Word has length 79 [2024-11-27 20:13:27,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:13:27,121 INFO L471 AbstractCegarLoop]: Abstraction has 1096 states and 1229 transitions. [2024-11-27 20:13:27,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 6.217391304347826) internal successors, (143), 23 states have internal predecessors, (143), 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-27 20:13:27,122 INFO L276 IsEmpty]: Start isEmpty. Operand 1096 states and 1229 transitions. [2024-11-27 20:13:27,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-27 20:13:27,123 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:13:27,123 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:13:27,133 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (22)] Ended with exit code 0 [2024-11-27 20:13:27,347 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2024-11-27 20:13:27,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt,21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:13:27,524 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-27 20:13:27,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:13:27,525 INFO L85 PathProgramCache]: Analyzing trace with hash 1462268137, now seen corresponding path program 1 times [2024-11-27 20:13:27,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:13:27,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1362404263] [2024-11-27 20:13:27,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:13:27,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:13:27,526 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:13:27,530 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:13:27,532 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2024-11-27 20:13:27,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:13:27,926 INFO L256 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-27 20:13:27,929 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:13:28,134 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-27 20:13:28,134 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 20:13:28,986 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-27 20:13:28,987 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 20:13:28,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1362404263] [2024-11-27 20:13:28,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1362404263] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-27 20:13:28,987 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-27 20:13:28,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-11-27 20:13:28,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412407828] [2024-11-27 20:13:28,987 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-27 20:13:28,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-27 20:13:28,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 20:13:28,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-27 20:13:28,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-11-27 20:13:28,989 INFO L87 Difference]: Start difference. First operand 1096 states and 1229 transitions. Second operand has 26 states, 26 states have (on average 3.6923076923076925) internal successors, (96), 26 states have internal predecessors, (96), 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-27 20:13:31,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:13:31,658 INFO L93 Difference]: Finished difference Result 1120 states and 1268 transitions. [2024-11-27 20:13:31,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-11-27 20:13:31,659 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.6923076923076925) internal successors, (96), 26 states have internal predecessors, (96), 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 85 [2024-11-27 20:13:31,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:13:31,663 INFO L225 Difference]: With dead ends: 1120 [2024-11-27 20:13:31,663 INFO L226 Difference]: Without dead ends: 1114 [2024-11-27 20:13:31,664 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=728, Invalid=1434, Unknown=0, NotChecked=0, Total=2162 [2024-11-27 20:13:31,664 INFO L435 NwaCegarLoop]: 933 mSDtfsCounter, 22 mSDsluCounter, 13012 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 13945 SdHoareTripleChecker+Invalid, 602 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-27 20:13:31,665 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 13945 Invalid, 602 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 583 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-27 20:13:31,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1114 states. [2024-11-27 20:13:31,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1114 to 1114. [2024-11-27 20:13:31,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1114 states, 752 states have (on average 1.6263297872340425) internal successors, (1223), 1106 states have internal predecessors, (1223), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-27 20:13:31,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1114 states to 1114 states and 1252 transitions. [2024-11-27 20:13:31,689 INFO L78 Accepts]: Start accepts. Automaton has 1114 states and 1252 transitions. Word has length 85 [2024-11-27 20:13:31,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:13:31,690 INFO L471 AbstractCegarLoop]: Abstraction has 1114 states and 1252 transitions. [2024-11-27 20:13:31,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.6923076923076925) internal successors, (96), 26 states have internal predecessors, (96), 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-27 20:13:31,694 INFO L276 IsEmpty]: Start isEmpty. Operand 1114 states and 1252 transitions. [2024-11-27 20:13:31,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-27 20:13:31,695 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:13:31,695 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:13:31,715 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2024-11-27 20:13:31,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:13:31,896 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-27 20:13:31,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:13:31,896 INFO L85 PathProgramCache]: Analyzing trace with hash 1440697577, now seen corresponding path program 2 times [2024-11-27 20:13:31,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:13:31,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1615507227] [2024-11-27 20:13:31,897 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-27 20:13:31,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:13:31,897 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:13:31,899 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:13:31,900 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2024-11-27 20:13:54,594 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-27 20:13:54,595 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-27 20:13:54,617 INFO L256 TraceCheckSpWp]: Trace formula consists of 574 conjuncts, 65 conjuncts are in the unsatisfiable core [2024-11-27 20:13:54,626 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:13:54,767 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-27 20:13:54,787 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-27 20:13:54,787 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-27 20:13:54,824 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-27 20:13:54,838 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-27 20:13:54,988 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-27 20:13:54,998 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-27 20:13:55,708 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:13:55,708 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-27 20:13:55,724 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-27 20:13:55,777 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-27 20:13:55,786 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-27 20:13:55,816 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-27 20:13:55,817 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 20:13:56,520 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_1859 (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_1859) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv16 32) .cse0) (bvadd (_ bv20 32) .cse0)))) (forall ((v_ArrVal_1858 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1859 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv20 32) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_1859) |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_1858) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-27 20:13:56,527 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 20:13:56,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1615507227] [2024-11-27 20:13:56,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1615507227] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 20:13:56,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1968130227] [2024-11-27 20:13:56,527 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-27 20:13:56,527 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-27 20:13:56,527 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 [2024-11-27 20:13:56,530 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-27 20:13:56,533 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (25)] Waiting until timeout for monitored process [2024-11-27 20:13:58,657 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-27 20:13:58,657 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-27 20:13:58,706 INFO L256 TraceCheckSpWp]: Trace formula consists of 574 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-27 20:13:58,709 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:14:00,084 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-27 20:14:00,084 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 20:14:02,914 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-27 20:14:02,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1968130227] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-27 20:14:02,915 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-27 20:14:02,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 26, 26] total 58 [2024-11-27 20:14:02,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670785098] [2024-11-27 20:14:02,915 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-27 20:14:02,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2024-11-27 20:14:02,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 20:14:02,918 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2024-11-27 20:14:02,919 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=699, Invalid=2844, Unknown=1, NotChecked=116, Total=3660 [2024-11-27 20:14:02,919 INFO L87 Difference]: Start difference. First operand 1114 states and 1252 transitions. Second operand has 58 states, 57 states have (on average 3.1403508771929824) internal successors, (179), 58 states have internal predecessors, (179), 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-27 20:14:45,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:14:45,346 INFO L93 Difference]: Finished difference Result 1157 states and 1325 transitions. [2024-11-27 20:14:45,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2024-11-27 20:14:45,350 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 57 states have (on average 3.1403508771929824) internal successors, (179), 58 states have internal predecessors, (179), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 97 [2024-11-27 20:14:45,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:14:45,354 INFO L225 Difference]: With dead ends: 1157 [2024-11-27 20:14:45,354 INFO L226 Difference]: Without dead ends: 1149 [2024-11-27 20:14:45,358 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 370 GetRequests, 235 SyntacticMatches, 1 SemanticMatches, 134 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 3089 ImplicationChecksByTransitivity, 13.7s TimeCoverageRelationStatistics Valid=3106, Invalid=14987, Unknown=1, NotChecked=266, Total=18360 [2024-11-27 20:14:45,360 INFO L435 NwaCegarLoop]: 633 mSDtfsCounter, 736 mSDsluCounter, 18344 mSDsCounter, 0 mSdLazyCounter, 13505 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 28.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 744 SdHoareTripleChecker+Valid, 18977 SdHoareTripleChecker+Invalid, 13576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 13505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 32.3s IncrementalHoareTripleChecker+Time [2024-11-27 20:14:45,361 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [744 Valid, 18977 Invalid, 13576 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [71 Valid, 13505 Invalid, 0 Unknown, 0 Unchecked, 32.3s Time] [2024-11-27 20:14:45,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1149 states. [2024-11-27 20:14:45,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1149 to 1147. [2024-11-27 20:14:45,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1147 states, 786 states have (on average 1.6081424936386768) internal successors, (1264), 1139 states have internal predecessors, (1264), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-27 20:14:45,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1147 states to 1147 states and 1293 transitions. [2024-11-27 20:14:45,380 INFO L78 Accepts]: Start accepts. Automaton has 1147 states and 1293 transitions. Word has length 97 [2024-11-27 20:14:45,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:14:45,384 INFO L471 AbstractCegarLoop]: Abstraction has 1147 states and 1293 transitions. [2024-11-27 20:14:45,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 57 states have (on average 3.1403508771929824) internal successors, (179), 58 states have internal predecessors, (179), 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-27 20:14:45,388 INFO L276 IsEmpty]: Start isEmpty. Operand 1147 states and 1293 transitions. [2024-11-27 20:14:45,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-27 20:14:45,389 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:14:45,389 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] [2024-11-27 20:14:45,402 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (25)] Ended with exit code 0 [2024-11-27 20:14:45,614 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2024-11-27 20:14:45,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt,24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:14:45,790 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr84REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-27 20:14:45,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:14:45,791 INFO L85 PathProgramCache]: Analyzing trace with hash 1905483938, now seen corresponding path program 1 times [2024-11-27 20:14:45,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:14:45,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [881846324] [2024-11-27 20:14:45,791 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:14:45,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:14:45,791 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:14:45,793 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:14:45,794 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2024-11-27 20:14:46,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:14:46,355 INFO L256 TraceCheckSpWp]: Trace formula consists of 836 conjuncts, 59 conjuncts are in the unsatisfiable core [2024-11-27 20:14:46,365 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:14:46,563 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-27 20:14:46,564 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-27 20:14:46,595 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-27 20:14:47,438 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:14:47,439 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-27 20:14:47,608 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:14:47,608 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2024-11-27 20:14:47,631 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-27 20:14:47,660 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-27 20:14:47,660 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 20:14:47,793 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2518 (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_2518) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-27 20:14:48,372 INFO L349 Elim1Store]: treesize reduction 7, result has 77.4 percent of original size [2024-11-27 20:14:48,372 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-27 20:14:48,387 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2518 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2564 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_#t~mem36#1.base| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_2564))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2518)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) is different from false [2024-11-27 20:14:48,391 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 20:14:48,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [881846324] [2024-11-27 20:14:48,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [881846324] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 20:14:48,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1461739989] [2024-11-27 20:14:48,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:14:48,391 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-27 20:14:48,391 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 [2024-11-27 20:14:48,396 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-27 20:14:48,397 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (27)] Waiting until timeout for monitored process [2024-11-27 20:14:51,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:14:51,916 INFO L256 TraceCheckSpWp]: Trace formula consists of 836 conjuncts, 63 conjuncts are in the unsatisfiable core [2024-11-27 20:14:51,926 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:14:51,931 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-27 20:14:52,092 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-27 20:14:52,092 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-27 20:14:52,169 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-27 20:14:52,354 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2024-11-27 20:14:53,654 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:14:53,654 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-27 20:14:53,897 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:14:53,897 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-27 20:14:53,925 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-27 20:14:54,001 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-27 20:14:54,001 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 20:14:54,019 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2988 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_2988) |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-27 20:14:54,029 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2988 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_2988) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (_ bv0 1))) is different from false [2024-11-27 20:14:54,458 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3034 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2988 (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_3034))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2988)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-27 20:14:54,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1461739989] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 20:14:54,462 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-27 20:14:54,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 19 [2024-11-27 20:14:54,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79464380] [2024-11-27 20:14:54,462 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-27 20:14:54,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-27 20:14:54,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 20:14:54,463 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-27 20:14:54,463 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=388, Unknown=12, NotChecked=220, Total=702 [2024-11-27 20:14:54,464 INFO L87 Difference]: Start difference. First operand 1147 states and 1293 transitions. Second operand has 20 states, 17 states have (on average 7.411764705882353) internal successors, (126), 19 states have internal predecessors, (126), 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-27 20:15:07,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:15:07,691 INFO L93 Difference]: Finished difference Result 1148 states and 1294 transitions. [2024-11-27 20:15:07,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-27 20:15:07,692 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 7.411764705882353) internal successors, (126), 19 states have internal predecessors, (126), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 122 [2024-11-27 20:15:07,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:15:07,694 INFO L225 Difference]: With dead ends: 1148 [2024-11-27 20:15:07,694 INFO L226 Difference]: Without dead ends: 1148 [2024-11-27 20:15:07,695 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 230 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=107, Invalid=551, Unknown=12, NotChecked=260, Total=930 [2024-11-27 20:15:07,695 INFO L435 NwaCegarLoop]: 625 mSDtfsCounter, 662 mSDsluCounter, 6878 mSDsCounter, 0 mSdLazyCounter, 5775 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 670 SdHoareTripleChecker+Valid, 7503 SdHoareTripleChecker+Invalid, 5788 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 5775 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.9s IncrementalHoareTripleChecker+Time [2024-11-27 20:15:07,695 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [670 Valid, 7503 Invalid, 5788 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [13 Valid, 5775 Invalid, 0 Unknown, 0 Unchecked, 12.9s Time] [2024-11-27 20:15:07,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1148 states. [2024-11-27 20:15:07,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1148 to 1146. [2024-11-27 20:15:07,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1146 states, 786 states have (on average 1.6068702290076335) internal successors, (1263), 1138 states have internal predecessors, (1263), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-27 20:15:07,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1146 states to 1146 states and 1292 transitions. [2024-11-27 20:15:07,710 INFO L78 Accepts]: Start accepts. Automaton has 1146 states and 1292 transitions. Word has length 122 [2024-11-27 20:15:07,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:15:07,711 INFO L471 AbstractCegarLoop]: Abstraction has 1146 states and 1292 transitions. [2024-11-27 20:15:07,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 17 states have (on average 7.411764705882353) internal successors, (126), 19 states have internal predecessors, (126), 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-27 20:15:07,711 INFO L276 IsEmpty]: Start isEmpty. Operand 1146 states and 1292 transitions. [2024-11-27 20:15:07,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-27 20:15:07,712 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:15:07,712 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] [2024-11-27 20:15:07,731 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2024-11-27 20:15:07,924 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (27)] Ended with exit code 0 [2024-11-27 20:15:08,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt [2024-11-27 20:15:08,113 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr85REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-27 20:15:08,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:15:08,113 INFO L85 PathProgramCache]: Analyzing trace with hash 1905483939, now seen corresponding path program 1 times [2024-11-27 20:15:08,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:15:08,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1211918924] [2024-11-27 20:15:08,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:15:08,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:15:08,114 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:15:08,116 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:15:08,117 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2024-11-27 20:15:08,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:15:08,686 INFO L256 TraceCheckSpWp]: Trace formula consists of 836 conjuncts, 112 conjuncts are in the unsatisfiable core [2024-11-27 20:15:08,698 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:15:08,816 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-27 20:15:08,833 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-27 20:15:08,833 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-27 20:15:08,865 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-27 20:15:08,874 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-27 20:15:09,004 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-27 20:15:09,009 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-27 20:15:09,937 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:15:09,937 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-27 20:15:09,951 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-27 20:15:10,076 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:15:10,076 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-27 20:15:10,088 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-27 20:15:10,126 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-27 20:15:10,137 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-27 20:15:10,179 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-27 20:15:10,179 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 20:15:10,403 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_3504 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3503 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_3503) |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~mem38#1.base| v_ArrVal_3504) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_3503 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_3503) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv4 32) .cse1) (bvadd (_ bv8 32) .cse1)))))) is different from false [2024-11-27 20:15:10,444 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_3503 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_3503) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_3504 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3503 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_3503) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_3504) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2024-11-27 20:15:12,110 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_3503 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3596 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3595 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_3595) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_3596) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3503) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_3504 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3503 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3596 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3595 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_3596))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_3595) .cse2 v_ArrVal_3503) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv8 32)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_3504) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2024-11-27 20:15:12,123 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 20:15:12,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1211918924] [2024-11-27 20:15:12,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1211918924] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 20:15:12,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1761437050] [2024-11-27 20:15:12,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:15:12,123 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-27 20:15:12,123 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 [2024-11-27 20:15:12,128 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-27 20:15:12,130 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (29)] Waiting until timeout for monitored process [2024-11-27 20:15:16,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:15:16,057 INFO L256 TraceCheckSpWp]: Trace formula consists of 836 conjuncts, 114 conjuncts are in the unsatisfiable core [2024-11-27 20:15:16,070 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:15:16,074 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-27 20:15:16,224 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-27 20:15:16,239 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-27 20:15:16,240 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-27 20:15:16,256 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-27 20:15:16,266 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-27 20:15:16,334 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-27 20:15:16,340 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-27 20:15:17,281 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:15:17,281 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-27 20:15:17,291 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-27 20:15:17,382 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:15:17,382 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-27 20:15:17,397 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-27 20:15:17,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 31 treesize of output 13 [2024-11-27 20:15:17,452 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-27 20:15:17,457 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-27 20:15:17,457 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 20:15:17,516 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4068 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4067 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_4068) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_4067) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_4068 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_4068) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd .cse1 (_ bv4 32)) (bvadd .cse1 (_ bv8 32))))))) is different from false [2024-11-27 20:15:17,548 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_4068 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_4068) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_4068 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4067 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_4068) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_4067) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2024-11-27 20:15:19,236 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4160 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4068 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4159 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4067 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_4159))) (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~mem36#1.base| v_ArrVal_4160) .cse0 v_ArrVal_4068) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_4067) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_4160 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4068 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4159 (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_4160) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_4159) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4068) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse3) (bvadd (_ bv8 32) .cse3)))))) is different from false [2024-11-27 20:15:19,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1761437050] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 20:15:19,244 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-27 20:15:19,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 10 [2024-11-27 20:15:19,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516620460] [2024-11-27 20:15:19,244 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-27 20:15:19,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-27 20:15:19,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 20:15:19,245 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-27 20:15:19,245 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=132, Unknown=6, NotChecked=162, Total=342 [2024-11-27 20:15:19,246 INFO L87 Difference]: Start difference. First operand 1146 states and 1292 transitions. Second operand has 11 states, 9 states have (on average 12.0) internal successors, (108), 11 states have internal predecessors, (108), 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-27 20:15:29,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:15:29,347 INFO L93 Difference]: Finished difference Result 1145 states and 1291 transitions. [2024-11-27 20:15:29,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-27 20:15:29,348 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 12.0) internal successors, (108), 11 states have internal predecessors, (108), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 122 [2024-11-27 20:15:29,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:15:29,351 INFO L225 Difference]: With dead ends: 1145 [2024-11-27 20:15:29,351 INFO L226 Difference]: Without dead ends: 1145 [2024-11-27 20:15:29,351 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 236 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=77, Invalid=283, Unknown=6, NotChecked=234, Total=600 [2024-11-27 20:15:29,351 INFO L435 NwaCegarLoop]: 633 mSDtfsCounter, 660 mSDsluCounter, 2602 mSDsCounter, 0 mSdLazyCounter, 3504 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 667 SdHoareTripleChecker+Valid, 3235 SdHoareTripleChecker+Invalid, 3510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 3504 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.7s IncrementalHoareTripleChecker+Time [2024-11-27 20:15:29,352 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [667 Valid, 3235 Invalid, 3510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 3504 Invalid, 0 Unknown, 0 Unchecked, 9.7s Time] [2024-11-27 20:15:29,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1145 states. [2024-11-27 20:15:29,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1145 to 1145. [2024-11-27 20:15:29,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1145 states, 786 states have (on average 1.6055979643765903) internal successors, (1262), 1137 states have internal predecessors, (1262), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-27 20:15:29,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1145 states to 1145 states and 1291 transitions. [2024-11-27 20:15:29,371 INFO L78 Accepts]: Start accepts. Automaton has 1145 states and 1291 transitions. Word has length 122 [2024-11-27 20:15:29,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:15:29,372 INFO L471 AbstractCegarLoop]: Abstraction has 1145 states and 1291 transitions. [2024-11-27 20:15:29,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 12.0) internal successors, (108), 11 states have internal predecessors, (108), 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-27 20:15:29,372 INFO L276 IsEmpty]: Start isEmpty. Operand 1145 states and 1291 transitions. [2024-11-27 20:15:29,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-27 20:15:29,373 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:15:29,373 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-27 20:15:29,397 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2024-11-27 20:15:29,587 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (29)] Forceful destruction successful, exit code 0 [2024-11-27 20:15:29,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt [2024-11-27 20:15:29,774 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr88REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-27 20:15:29,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:15:29,775 INFO L85 PathProgramCache]: Analyzing trace with hash -310422577, now seen corresponding path program 1 times [2024-11-27 20:15:29,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:15:29,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [451540510] [2024-11-27 20:15:29,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:15:29,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:15:29,776 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:15:29,777 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:15:29,779 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2024-11-27 20:15:30,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:15:30,442 INFO L256 TraceCheckSpWp]: Trace formula consists of 865 conjuncts, 61 conjuncts are in the unsatisfiable core [2024-11-27 20:15:30,449 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:15:30,565 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-27 20:15:30,565 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-27 20:15:30,584 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-27 20:15:30,959 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:15:30,959 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-27 20:15:31,038 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:15:31,038 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-11-27 20:15:31,104 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:15:31,104 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2024-11-27 20:15:31,154 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-27 20:15:31,179 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-27 20:15:31,180 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 20:15:31,240 INFO L349 Elim1Store]: treesize reduction 7, result has 63.2 percent of original size [2024-11-27 20:15:31,241 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-27 20:15:31,248 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4598 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_4598) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)) |c_ULTIMATE.start_main_#t~mem39#1.base|)) is different from false [2024-11-27 20:15:31,257 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4598 (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_4598) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) is different from false [2024-11-27 20:15:31,272 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4597 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4598 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_4597)) (.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_4598) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) .cse1)))) is different from false [2024-11-27 20:15:31,283 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4597 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4598 (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_4597))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_4598) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) is different from false [2024-11-27 20:15:31,727 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4644 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4597 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4598 (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~mem36#1.base| v_ArrVal_4644))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_4597)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_4598) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) is different from false [2024-11-27 20:15:31,730 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 20:15:31,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [451540510] [2024-11-27 20:15:31,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [451540510] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 20:15:31,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [432407059] [2024-11-27 20:15:31,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:15:31,731 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-27 20:15:31,731 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 [2024-11-27 20:15:31,734 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-27 20:15:31,736 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (31)] Waiting until timeout for monitored process [2024-11-27 20:15:44,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:15:45,041 INFO L256 TraceCheckSpWp]: Trace formula consists of 865 conjuncts, 66 conjuncts are in the unsatisfiable core [2024-11-27 20:15:45,051 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:15:45,057 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-27 20:15:45,204 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-27 20:15:45,204 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-27 20:15:45,263 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-27 20:15:45,417 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2024-11-27 20:15:46,496 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:15:46,496 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-27 20:15:46,682 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:15:46,682 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-27 20:15:46,803 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:15:46,804 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-27 20:15:46,830 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-27 20:15:46,891 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-27 20:15:46,891 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 20:15:46,997 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5085 (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_5085) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-27 20:15:47,012 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5084 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5085 (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~mem38#1.base| v_ArrVal_5084))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5085)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-27 20:15:47,023 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5084 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5085 (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_5084))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5085)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-27 20:15:47,470 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5084 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5085 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5131 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_5131))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5084)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5085)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-27 20:15:47,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [432407059] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 20:15:47,473 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-27 20:15:47,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 20 [2024-11-27 20:15:47,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307368866] [2024-11-27 20:15:47,473 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-27 20:15:47,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-27 20:15:47,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 20:15:47,474 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-27 20:15:47,474 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=425, Unknown=20, NotChecked=450, Total=992 [2024-11-27 20:15:47,474 INFO L87 Difference]: Start difference. First operand 1145 states and 1291 transitions. Second operand has 21 states, 18 states have (on average 7.333333333333333) internal successors, (132), 21 states have internal predecessors, (132), 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-27 20:15:57,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:15:57,092 INFO L93 Difference]: Finished difference Result 1146 states and 1292 transitions. [2024-11-27 20:15:57,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-27 20:15:57,092 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 18 states have (on average 7.333333333333333) internal successors, (132), 21 states have internal predecessors, (132), 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-27 20:15:57,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:15:57,095 INFO L225 Difference]: With dead ends: 1146 [2024-11-27 20:15:57,095 INFO L226 Difference]: Without dead ends: 1146 [2024-11-27 20:15:57,095 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 237 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=110, Invalid=506, Unknown=20, NotChecked=486, Total=1122 [2024-11-27 20:15:57,095 INFO L435 NwaCegarLoop]: 626 mSDtfsCounter, 657 mSDsluCounter, 4972 mSDsCounter, 0 mSdLazyCounter, 3933 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 665 SdHoareTripleChecker+Valid, 5598 SdHoareTripleChecker+Invalid, 3946 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 3933 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.4s IncrementalHoareTripleChecker+Time [2024-11-27 20:15:57,096 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [665 Valid, 5598 Invalid, 3946 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 3933 Invalid, 0 Unknown, 0 Unchecked, 9.4s Time] [2024-11-27 20:15:57,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1146 states. [2024-11-27 20:15:57,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1146 to 1144. [2024-11-27 20:15:57,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1144 states, 786 states have (on average 1.604325699745547) internal successors, (1261), 1136 states have internal predecessors, (1261), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-27 20:15:57,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1144 states to 1144 states and 1290 transitions. [2024-11-27 20:15:57,112 INFO L78 Accepts]: Start accepts. Automaton has 1144 states and 1290 transitions. Word has length 125 [2024-11-27 20:15:57,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:15:57,113 INFO L471 AbstractCegarLoop]: Abstraction has 1144 states and 1290 transitions. [2024-11-27 20:15:57,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 18 states have (on average 7.333333333333333) internal successors, (132), 21 states have internal predecessors, (132), 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-27 20:15:57,113 INFO L276 IsEmpty]: Start isEmpty. Operand 1144 states and 1290 transitions. [2024-11-27 20:15:57,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-27 20:15:57,114 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:15:57,115 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-27 20:15:57,140 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2024-11-27 20:15:57,337 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (31)] Ended with exit code 0 [2024-11-27 20:15:57,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt [2024-11-27 20:15:57,516 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr89REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-27 20:15:57,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:15:57,516 INFO L85 PathProgramCache]: Analyzing trace with hash -310422576, now seen corresponding path program 1 times [2024-11-27 20:15:57,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:15:57,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1288936395] [2024-11-27 20:15:57,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:15:57,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:15:57,517 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:15:57,519 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:15:57,520 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2024-11-27 20:15:58,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:15:58,333 INFO L256 TraceCheckSpWp]: Trace formula consists of 865 conjuncts, 115 conjuncts are in the unsatisfiable core [2024-11-27 20:15:58,346 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:15:58,481 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-27 20:15:58,481 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-27 20:15:58,489 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-27 20:15:58,521 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-27 20:15:58,536 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-27 20:15:58,721 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-27 20:15:58,744 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-27 20:15:59,655 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:15:59,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-27 20:15:59,665 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-27 20:15:59,799 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:15:59,800 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-27 20:15:59,810 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-27 20:15:59,913 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:15:59,914 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-27 20:15:59,928 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-27 20:15:59,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 31 treesize of output 13 [2024-11-27 20:15:59,973 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-27 20:16:00,011 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-27 20:16:00,012 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 20:16:00,193 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5617 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5618 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_5618) |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~mem39#1.base| v_ArrVal_5617) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_5618 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_5618) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd .cse1 (_ bv8 32)) (bvadd .cse1 (_ bv12 32))))))) is different from false [2024-11-27 20:16:00,221 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_5618 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_5618) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd (_ bv12 32) .cse0)))) (forall ((v_ArrVal_5617 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5618 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv12 32) (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_5618) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_5617) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2024-11-27 20:16:00,361 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5616 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5618 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5615 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5616) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5615) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5618) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd (_ bv12 32) .cse0)))) (forall ((v_ArrVal_5616 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5617 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5618 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5615 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5615))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv12 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5616) .cse2 v_ArrVal_5618) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_5617) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2024-11-27 20:16:00,431 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_5616 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5617 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5618 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5615 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_5615))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv12 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_5616) .cse1 v_ArrVal_5618) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_5617) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_5616 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5618 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5615 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_5616) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_5615) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_5618) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse4) (bvadd (_ bv12 32) .cse4))))))) is different from false [2024-11-27 20:16:02,170 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5616 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5617 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5618 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5615 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5710 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5709 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_5709))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_5615))) (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~mem36#1.base| v_ArrVal_5710) .cse0 v_ArrVal_5616) .cse1 v_ArrVal_5618) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_5617) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_5616 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5618 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5615 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5710 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5709 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_5709))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_5710) .cse6 v_ArrVal_5616) (select (select (store .cse7 .cse6 v_ArrVal_5615) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_5618))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse5) (bvadd (_ bv12 32) .cse5)))))) is different from false [2024-11-27 20:16:02,183 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 20:16:02,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1288936395] [2024-11-27 20:16:02,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1288936395] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 20:16:02,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1437464297] [2024-11-27 20:16:02,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:16:02,183 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-27 20:16:02,183 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 [2024-11-27 20:16:02,185 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-27 20:16:02,200 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (33)] Waiting until timeout for monitored process [2024-11-27 20:16:17,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:16:17,614 INFO L256 TraceCheckSpWp]: Trace formula consists of 865 conjuncts, 118 conjuncts are in the unsatisfiable core [2024-11-27 20:16:17,629 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:16:17,634 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-27 20:16:17,792 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-27 20:16:17,809 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-27 20:16:17,809 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-27 20:16:17,825 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-27 20:16:17,831 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-27 20:16:17,909 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-27 20:16:17,914 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-27 20:16:18,845 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:16:18,845 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-27 20:16:18,860 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-27 20:16:18,950 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:16:18,951 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-27 20:16:18,964 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-27 20:16:19,041 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:16:19,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-27 20:16:19,052 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-27 20:16:19,088 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-27 20:16:19,097 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-27 20:16:19,099 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-27 20:16:19,099 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 20:16:19,368 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_6198 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_6198) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd (_ bv12 32) .cse0)))) (forall ((v_ArrVal_6198 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6199 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv12 32) (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_6198) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_6199) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2024-11-27 20:16:19,445 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_6196 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6197 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6198 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6199 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_6197))) (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~mem38#1.base| v_ArrVal_6196) .cse0 v_ArrVal_6198) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_6199) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_6196 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6197 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6198 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_6196) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_6197) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6198) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse3) (bvadd (_ bv12 32) .cse3)))))) is different from false [2024-11-27 20:16:19,565 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_6196 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6197 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6198 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6199 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_6197))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv12 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_6196) .cse1 v_ArrVal_6198) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_6199) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_6196 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6197 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6198 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_6196) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_6197) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_6198) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse4) (bvadd (_ bv12 32) .cse4))))))) is different from false [2024-11-27 20:16:21,633 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_6196 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6197 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6290 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6291 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6198 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_6290))) (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~mem36#1.base| v_ArrVal_6291) .cse1 v_ArrVal_6196) (select (select (store .cse2 .cse1 v_ArrVal_6197) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_6198))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_6196 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6197 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6290 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6291 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6198 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6199 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_6290))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_6197))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_6291) .cse4 v_ArrVal_6196) .cse5 v_ArrVal_6198) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv12 32)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_6199) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) is different from false [2024-11-27 20:16:21,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1437464297] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 20:16:21,645 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-27 20:16:21,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 11 [2024-11-27 20:16:21,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139211927] [2024-11-27 20:16:21,645 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-27 20:16:21,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-27 20:16:21,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 20:16:21,646 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-27 20:16:21,646 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=174, Unknown=17, NotChecked=306, Total=552 [2024-11-27 20:16:21,647 INFO L87 Difference]: Start difference. First operand 1144 states and 1290 transitions. Second operand has 12 states, 10 states have (on average 11.1) internal successors, (111), 12 states have internal predecessors, (111), 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-27 20:16:42,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:16:42,603 INFO L93 Difference]: Finished difference Result 1143 states and 1289 transitions. [2024-11-27 20:16:42,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-27 20:16:42,604 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 11.1) internal successors, (111), 12 states have internal predecessors, (111), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 125 [2024-11-27 20:16:42,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:16:42,606 INFO L225 Difference]: With dead ends: 1143 [2024-11-27 20:16:42,606 INFO L226 Difference]: Without dead ends: 1143 [2024-11-27 20:16:42,607 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 243 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=98, Invalid=382, Unknown=18, NotChecked=432, Total=930 [2024-11-27 20:16:42,607 INFO L435 NwaCegarLoop]: 632 mSDtfsCounter, 658 mSDsluCounter, 3345 mSDsCounter, 0 mSdLazyCounter, 4592 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 665 SdHoareTripleChecker+Valid, 3977 SdHoareTripleChecker+Invalid, 4598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 4592 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.2s IncrementalHoareTripleChecker+Time [2024-11-27 20:16:42,607 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [665 Valid, 3977 Invalid, 4598 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [6 Valid, 4592 Invalid, 0 Unknown, 0 Unchecked, 20.2s Time] [2024-11-27 20:16:42,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1143 states. [2024-11-27 20:16:42,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1143 to 1143. [2024-11-27 20:16:42,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1143 states, 786 states have (on average 1.6030534351145038) internal successors, (1260), 1135 states have internal predecessors, (1260), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-27 20:16:42,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1143 states to 1143 states and 1289 transitions. [2024-11-27 20:16:42,622 INFO L78 Accepts]: Start accepts. Automaton has 1143 states and 1289 transitions. Word has length 125 [2024-11-27 20:16:42,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:16:42,622 INFO L471 AbstractCegarLoop]: Abstraction has 1143 states and 1289 transitions. [2024-11-27 20:16:42,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 11.1) internal successors, (111), 12 states have internal predecessors, (111), 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-27 20:16:42,622 INFO L276 IsEmpty]: Start isEmpty. Operand 1143 states and 1289 transitions. [2024-11-27 20:16:42,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-27 20:16:42,624 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:16:42,624 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, 1, 1, 1] [2024-11-27 20:16:42,644 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Ended with exit code 0 [2024-11-27 20:16:42,852 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (33)] Ended with exit code 0 [2024-11-27 20:16:43,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt [2024-11-27 20:16:43,026 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr92REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-27 20:16:43,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:16:43,026 INFO L85 PathProgramCache]: Analyzing trace with hash -734064471, now seen corresponding path program 1 times [2024-11-27 20:16:43,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:16:43,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [713415181] [2024-11-27 20:16:43,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:16:43,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:16:43,027 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:16:43,030 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:16:43,032 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2024-11-27 20:16:43,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:16:44,012 INFO L256 TraceCheckSpWp]: Trace formula consists of 894 conjuncts, 63 conjuncts are in the unsatisfiable core [2024-11-27 20:16:44,021 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:16:44,451 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-27 20:16:44,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 13 treesize of output 13 [2024-11-27 20:16:44,510 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-27 20:16:45,285 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:16:45,286 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-11-27 20:16:45,416 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:16:45,416 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-11-27 20:16:45,556 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:16:45,557 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-27 20:16:45,825 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:16:45,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 44 treesize of output 43 [2024-11-27 20:16:45,869 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-27 20:16:45,942 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-27 20:16:45,942 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 20:16:46,176 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6745 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_6745) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (_ bv0 1))) is different from false [2024-11-27 20:16:46,222 INFO L349 Elim1Store]: treesize reduction 7, result has 77.4 percent of original size [2024-11-27 20:16:46,222 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-27 20:16:46,238 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6745 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6744 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_#t~mem39#1.base| (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~mem39#1.base| v_ArrVal_6744))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6745)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) is different from false [2024-11-27 20:16:46,257 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6745 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6744 (Array (_ BitVec 32) (_ BitVec 32)))) (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))) (= .cse0 (select (select (let ((.cse1 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_6744))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_6745)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))) is different from false [2024-11-27 20:16:46,288 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6745 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6743 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6744 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_6743)) (.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (let ((.cse1 (store .cse3 .cse0 v_ArrVal_6744))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_6745)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))) is different from false [2024-11-27 20:16:46,310 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6745 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6743 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6744 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (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_6743))) (let ((.cse0 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (let ((.cse1 (store .cse3 .cse0 v_ArrVal_6744))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_6745)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) is different from false [2024-11-27 20:16:47,025 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6791 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6745 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6743 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6744 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse3 (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_6791))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_6743)))) (let ((.cse0 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (let ((.cse1 (store .cse3 .cse0 v_ArrVal_6744))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_6745)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) is different from false [2024-11-27 20:16:47,029 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 20:16:47,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [713415181] [2024-11-27 20:16:47,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [713415181] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 20:16:47,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1654975156] [2024-11-27 20:16:47,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:16:47,029 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-27 20:16:47,030 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 [2024-11-27 20:16:47,032 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-27 20:16:47,034 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (35)] Waiting until timeout for monitored process [2024-11-27 20:17:06,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:17:06,714 INFO L256 TraceCheckSpWp]: Trace formula consists of 894 conjuncts, 68 conjuncts are in the unsatisfiable core [2024-11-27 20:17:06,723 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:17:06,734 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-27 20:17:07,214 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-27 20:17:07,214 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-27 20:17:07,402 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-27 20:17:07,764 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2024-11-27 20:17:09,838 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:17:09,838 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-27 20:17:10,186 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:17:10,186 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-27 20:17:10,434 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:17:10,435 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2024-11-27 20:17:10,690 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:17:10,690 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-27 20:17:10,744 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2024-11-27 20:17:10,888 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-27 20:17:10,888 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 20:17:10,922 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7248 (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~mem40#1.base| v_ArrVal_7248) |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-27 20:17:10,939 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7248 (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_7248) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-27 20:17:10,974 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7247 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7248 (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~mem39#1.base| v_ArrVal_7247))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7248)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-27 20:17:11,000 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7247 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7248 (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_7247))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7248)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-27 20:17:11,030 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7247 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7248 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7246 (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~mem38#1.base| v_ArrVal_7246))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7247)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7248)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-27 20:17:11,053 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7247 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7248 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7246 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7246))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7247)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7248)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-27 20:17:11,803 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7294 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7247 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7248 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7246 (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~mem36#1.base| v_ArrVal_7294))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7246)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7247)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7248)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-27 20:17:11,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1654975156] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 20:17:11,811 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-27 20:17:11,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 22 [2024-11-27 20:17:11,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909651930] [2024-11-27 20:17:11,811 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-27 20:17:11,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-27 20:17:11,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 20:17:11,812 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-27 20:17:11,812 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=509, Unknown=24, NotChecked=754, Total=1406 [2024-11-27 20:17:11,812 INFO L87 Difference]: Start difference. First operand 1143 states and 1289 transitions. Second operand has 23 states, 20 states have (on average 6.9) internal successors, (138), 23 states have internal predecessors, (138), 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-27 20:17:29,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:17:29,542 INFO L93 Difference]: Finished difference Result 1144 states and 1290 transitions. [2024-11-27 20:17:29,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-27 20:17:29,543 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 20 states have (on average 6.9) internal successors, (138), 23 states have internal predecessors, (138), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 128 [2024-11-27 20:17:29,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:17:29,545 INFO L225 Difference]: With dead ends: 1144 [2024-11-27 20:17:29,545 INFO L226 Difference]: Without dead ends: 1144 [2024-11-27 20:17:29,546 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 243 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=132, Invalid=597, Unknown=25, NotChecked=806, Total=1560 [2024-11-27 20:17:29,546 INFO L435 NwaCegarLoop]: 625 mSDtfsCounter, 652 mSDsluCounter, 5046 mSDsCounter, 0 mSdLazyCounter, 3876 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 660 SdHoareTripleChecker+Valid, 5671 SdHoareTripleChecker+Invalid, 3888 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 3876 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.4s IncrementalHoareTripleChecker+Time [2024-11-27 20:17:29,547 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [660 Valid, 5671 Invalid, 3888 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [12 Valid, 3876 Invalid, 0 Unknown, 0 Unchecked, 17.4s Time] [2024-11-27 20:17:29,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1144 states. [2024-11-27 20:17:29,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1144 to 1142. [2024-11-27 20:17:29,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1142 states, 786 states have (on average 1.6017811704834606) internal successors, (1259), 1134 states have internal predecessors, (1259), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-27 20:17:29,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1142 states to 1142 states and 1288 transitions. [2024-11-27 20:17:29,560 INFO L78 Accepts]: Start accepts. Automaton has 1142 states and 1288 transitions. Word has length 128 [2024-11-27 20:17:29,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:17:29,560 INFO L471 AbstractCegarLoop]: Abstraction has 1142 states and 1288 transitions. [2024-11-27 20:17:29,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 20 states have (on average 6.9) internal successors, (138), 23 states have internal predecessors, (138), 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-27 20:17:29,560 INFO L276 IsEmpty]: Start isEmpty. Operand 1142 states and 1288 transitions. [2024-11-27 20:17:29,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-27 20:17:29,561 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:17:29,561 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, 1, 1, 1] [2024-11-27 20:17:29,582 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Ended with exit code 0 [2024-11-27 20:17:29,790 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (35)] Forceful destruction successful, exit code 0 [2024-11-27 20:17:29,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,35 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt [2024-11-27 20:17:29,962 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr93REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-27 20:17:29,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:17:29,962 INFO L85 PathProgramCache]: Analyzing trace with hash -734064470, now seen corresponding path program 1 times [2024-11-27 20:17:29,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:17:29,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1730858066] [2024-11-27 20:17:29,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:17:29,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:17:29,963 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:17:29,967 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:17:29,968 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2024-11-27 20:17:30,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:17:30,970 INFO L256 TraceCheckSpWp]: Trace formula consists of 894 conjuncts, 118 conjuncts are in the unsatisfiable core [2024-11-27 20:17:30,986 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:17:31,444 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-27 20:17:31,479 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-27 20:17:31,479 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-27 20:17:31,544 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-27 20:17:31,569 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-27 20:17:31,830 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-27 20:17:31,840 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-27 20:17:33,534 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:17:33,534 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-27 20:17:33,553 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-27 20:17:33,805 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:17:33,805 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-27 20:17:33,822 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-27 20:17:34,041 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:17:34,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-27 20:17:34,058 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-27 20:17:34,312 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:17:34,312 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-27 20:17:34,329 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-27 20:17:34,388 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-27 20:17:34,397 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-27 20:17:34,480 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-27 20:17:34,481 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 20:17:34,792 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7798 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7797 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv24 32) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_7797) |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~mem40#1.base| v_ArrVal_7798) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_7797 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_7797) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv20 32) .cse1) (bvadd (_ bv24 32) .cse1)))))) is different from false [2024-11-27 20:17:34,837 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_7798 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7797 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv24 32) (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_7797) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_7798) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_7797 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_7797) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv20 32) .cse2) (bvadd (_ bv24 32) .cse2))))))) is different from false [2024-11-27 20:17:34,924 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7798 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7797 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7796 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7795 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_7795))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_7796) .cse0 v_ArrVal_7797) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_7798) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_7797 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7796 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7795 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_7796) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_7795) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7797) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse3 (_ bv20 32)) (bvadd .cse3 (_ bv24 32))))))) is different from false [2024-11-27 20:17:35,010 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_7798 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7797 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7796 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7795 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_7795))) (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_7796) .cse1 v_ArrVal_7797) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_7798) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_7797 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7796 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7795 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_7796) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_7795) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_7797) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse4 (_ bv20 32)) (bvadd .cse4 (_ bv24 32)))))))) is different from false [2024-11-27 20:17:35,235 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7798 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7797 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7796 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7795 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7793 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_7794))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_7795))) (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~mem38#1.base| v_ArrVal_7793) .cse0 v_ArrVal_7796) .cse1 v_ArrVal_7797) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_7798) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_7797 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7796 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7795 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7793 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_7794))) (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~mem38#1.base| v_ArrVal_7793) .cse6 v_ArrVal_7796) (select (select (store .cse7 .cse6 v_ArrVal_7795) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_7797))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv20 32) .cse5) (bvadd (_ bv24 32) .cse5)))))) is different from false [2024-11-27 20:17:35,477 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_7798 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7797 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7796 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7795 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7793 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_7794))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_7795))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv24 32) (select (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_7793) .cse1 v_ArrVal_7796) .cse2 v_ArrVal_7797) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_7798) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))) (forall ((v_ArrVal_7797 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7796 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7795 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7793 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (select (select (let ((.cse8 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_7794))) (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_7793) .cse7 v_ArrVal_7796) (select (select (store .cse8 .cse7 v_ArrVal_7795) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_7797))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv20 32) .cse6) (bvadd (_ bv24 32) .cse6))))))) is different from false [2024-11-27 20:17:42,170 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7890 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7889 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7797 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7796 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7795 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7793 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse5 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7889))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_ArrVal_7794))) (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~mem36#1.base| v_ArrVal_7890) .cse1 v_ArrVal_7793) .cse2 v_ArrVal_7796) (select (select (store .cse3 .cse2 v_ArrVal_7795) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_7797))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (_ bv20 32) .cse0) (bvadd (_ bv24 32) .cse0)))) (forall ((v_ArrVal_7890 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7889 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7798 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7797 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7796 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7795 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7793 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse11 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7889))) (let ((.cse6 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse10 (store .cse11 .cse6 v_ArrVal_7794))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_7795))) (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~mem36#1.base| v_ArrVal_7890) .cse6 v_ArrVal_7793) .cse7 v_ArrVal_7796) .cse8 v_ArrVal_7797) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (select |c_#length| (select (select (store .cse9 .cse8 v_ArrVal_7798) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))))))) is different from false [2024-11-27 20:17:42,233 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 20:17:42,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1730858066] [2024-11-27 20:17:42,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1730858066] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 20:17:42,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1571563983] [2024-11-27 20:17:42,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:17:42,234 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-27 20:17:42,234 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 [2024-11-27 20:17:42,236 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-27 20:17:42,237 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (37)] Waiting until timeout for monitored process [2024-11-27 20:18:02,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:18:02,348 INFO L256 TraceCheckSpWp]: Trace formula consists of 894 conjuncts, 120 conjuncts are in the unsatisfiable core [2024-11-27 20:18:02,363 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:18:02,415 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-27 20:18:04,955 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-27 20:18:05,199 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-27 20:18:05,200 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-27 20:18:05,340 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-27 20:18:05,387 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-27 20:18:06,170 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-27 20:18:06,217 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-27 20:18:15,523 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:18:15,524 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-27 20:18:15,615 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-27 20:18:16,541 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:18:16,541 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-27 20:18:16,633 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-27 20:18:17,331 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:18:17,331 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-27 20:18:17,423 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-27 20:18:18,166 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:18:18,166 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-27 20:18:18,304 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-27 20:18:18,580 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-27 20:18:18,635 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-27 20:18:18,681 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-27 20:18:18,681 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 20:18:19,129 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8396 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8395 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv24 32) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_8395) |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~mem40#1.base| v_ArrVal_8396) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_8395 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_8395) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv20 32) .cse1) (bvadd (_ bv24 32) .cse1)))))) is different from false [2024-11-27 20:18:19,296 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_8395 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_8395) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv20 32) .cse0) (bvadd (_ bv24 32) .cse0)))) (forall ((v_ArrVal_8396 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8395 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv24 32) (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_8395) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_8396) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2024-11-27 20:18:19,626 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8395 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8394 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8393 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_8394) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_8393) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8395) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv20 32) .cse0) (bvadd (_ bv24 32) .cse0)))) (forall ((v_ArrVal_8396 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8395 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8394 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8393 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_8393))) (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~mem39#1.base| v_ArrVal_8394) .cse2 v_ArrVal_8395) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_8396) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2024-11-27 20:18:19,833 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_8396 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8395 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8394 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8393 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_8393))) (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_8394) .cse1 v_ArrVal_8395) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_8396) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_8395 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8394 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8393 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_8394) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_8393) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_8395) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse4 (_ bv20 32)) (bvadd .cse4 (_ bv24 32)))))))) is different from false [2024-11-27 20:18:20,301 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8396 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8395 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8394 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8393 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8392 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8391 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_8392))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_8393))) (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~mem38#1.base| v_ArrVal_8391) .cse0 v_ArrVal_8394) .cse1 v_ArrVal_8395) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_8396) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_8395 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8394 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8393 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8392 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8391 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_8392))) (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~mem38#1.base| v_ArrVal_8391) .cse6 v_ArrVal_8394) (select (select (store .cse7 .cse6 v_ArrVal_8393) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_8395))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv20 32) .cse5) (bvadd (_ bv24 32) .cse5)))))) is different from false [2024-11-27 20:18:20,736 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_8396 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8395 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8394 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8393 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8392 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8391 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_8392))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_8393))) (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_8391) .cse1 v_ArrVal_8394) .cse2 v_ArrVal_8395) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv24 32)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_8396) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))) (forall ((v_ArrVal_8395 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8394 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8393 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8392 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8391 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (select (select (let ((.cse8 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_8392))) (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_8391) .cse7 v_ArrVal_8394) (select (select (store .cse8 .cse7 v_ArrVal_8393) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_8395))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd .cse6 (_ bv20 32)) (bvadd .cse6 (_ bv24 32)))))))) is different from false [2024-11-27 20:18:26,301 WARN L286 SmtUtils]: Spent 5.40s 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-27 20:18:28,908 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8396 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8395 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8394 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8393 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8392 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8391 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8488 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8487 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_8488))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_8392))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_8393))) (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~mem36#1.base| v_ArrVal_8487) .cse0 v_ArrVal_8391) .cse1 v_ArrVal_8394) .cse2 v_ArrVal_8395) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv24 32)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_8396) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) (forall ((v_ArrVal_8395 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8394 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8393 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8392 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8391 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8488 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8487 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (select (select (let ((.cse11 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_8488))) (let ((.cse8 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse10 (store .cse11 .cse8 v_ArrVal_8392))) (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~mem36#1.base| v_ArrVal_8487) .cse8 v_ArrVal_8391) .cse9 v_ArrVal_8394) (select (select (store .cse10 .cse9 v_ArrVal_8393) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_8395))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd .cse7 (_ bv20 32)) (bvadd .cse7 (_ bv24 32))))))) is different from false [2024-11-27 20:18:28,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1571563983] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 20:18:28,949 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-27 20:18:28,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 12 [2024-11-27 20:18:28,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481237547] [2024-11-27 20:18:28,949 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-27 20:18:28,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-27 20:18:28,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 20:18:28,950 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-27 20:18:28,950 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=186, Unknown=14, NotChecked=546, Total=812 [2024-11-27 20:18:28,950 INFO L87 Difference]: Start difference. First operand 1142 states and 1288 transitions. Second operand has 13 states, 11 states have (on average 10.363636363636363) internal successors, (114), 13 states have internal predecessors, (114), 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-27 20:20:14,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:20:14,757 INFO L93 Difference]: Finished difference Result 1141 states and 1287 transitions. [2024-11-27 20:20:14,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-27 20:20:14,758 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 10.363636363636363) internal successors, (114), 13 states have internal predecessors, (114), 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 128 [2024-11-27 20:20:14,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:20:14,761 INFO L225 Difference]: With dead ends: 1141 [2024-11-27 20:20:14,761 INFO L226 Difference]: Without dead ends: 1141 [2024-11-27 20:20:14,761 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 250 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 13.1s TimeCoverageRelationStatistics Valid=115, Invalid=433, Unknown=14, NotChecked=770, Total=1332 [2024-11-27 20:20:14,762 INFO L435 NwaCegarLoop]: 631 mSDtfsCounter, 656 mSDsluCounter, 2984 mSDsCounter, 0 mSdLazyCounter, 4048 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 100.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 663 SdHoareTripleChecker+Valid, 3615 SdHoareTripleChecker+Invalid, 4054 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 4048 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 101.7s IncrementalHoareTripleChecker+Time [2024-11-27 20:20:14,762 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [663 Valid, 3615 Invalid, 4054 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [6 Valid, 4048 Invalid, 0 Unknown, 0 Unchecked, 101.7s Time] [2024-11-27 20:20:14,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1141 states. [2024-11-27 20:20:14,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1141 to 1141. [2024-11-27 20:20:14,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1141 states, 786 states have (on average 1.6005089058524173) internal successors, (1258), 1133 states have internal predecessors, (1258), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-27 20:20:14,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1141 states to 1141 states and 1287 transitions. [2024-11-27 20:20:14,776 INFO L78 Accepts]: Start accepts. Automaton has 1141 states and 1287 transitions. Word has length 128 [2024-11-27 20:20:14,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:20:14,776 INFO L471 AbstractCegarLoop]: Abstraction has 1141 states and 1287 transitions. [2024-11-27 20:20:14,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 10.363636363636363) internal successors, (114), 13 states have internal predecessors, (114), 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-27 20:20:14,776 INFO L276 IsEmpty]: Start isEmpty. Operand 1141 states and 1287 transitions. [2024-11-27 20:20:14,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-27 20:20:14,777 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:20:14,777 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:20:14,796 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Ended with exit code 0 [2024-11-27 20:20:15,006 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (37)] Ended with exit code 0 [2024-11-27 20:20:15,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,37 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt [2024-11-27 20:20:15,178 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr96REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-27 20:20:15,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:20:15,179 INFO L85 PathProgramCache]: Analyzing trace with hash -2010640533, now seen corresponding path program 1 times [2024-11-27 20:20:15,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:20:15,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1250191207] [2024-11-27 20:20:15,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:20:15,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:20:15,181 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:20:15,185 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:20:15,186 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2024-11-27 20:20:16,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:20:16,263 INFO L256 TraceCheckSpWp]: Trace formula consists of 931 conjuncts, 67 conjuncts are in the unsatisfiable core [2024-11-27 20:20:16,271 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:20:18,746 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-27 20:20:18,747 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-27 20:20:19,101 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-27 20:20:24,102 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:20:24,103 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-27 20:20:24,976 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:20:24,976 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-11-27 20:20:25,900 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:20:25,900 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-27 20:20:26,886 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:20:26,886 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-27 20:20:28,785 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:20:28,786 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-27 20:20:29,018 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2024-11-27 20:20:30,040 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2024-11-27 20:20:30,040 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-27 20:20:30,096 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-27 20:20:30,097 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 20:20:32,586 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8960 (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_8960) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-27 20:20:32,869 INFO L349 Elim1Store]: treesize reduction 7, result has 77.4 percent of original size [2024-11-27 20:20:32,869 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-27 20:20:32,954 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8959 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8960 (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~mem40#1.base| v_ArrVal_8959))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8960)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |c_ULTIMATE.start_main_#t~mem40#1.base|)) is different from false [2024-11-27 20:20:33,061 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8959 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8960 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| .cse2 v_ArrVal_8959))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8960)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) .cse2)))) is different from false [2024-11-27 20:20:33,220 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8959 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8958 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8960 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_8958)) (.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (let ((.cse1 (store .cse3 .cse0 v_ArrVal_8959))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_8960)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))) is different from false [2024-11-27 20:20:33,331 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8959 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8958 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8960 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (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_8958))) (let ((.cse0 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (let ((.cse1 (store .cse3 .cse0 v_ArrVal_8959))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_8960)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) is different from false [2024-11-27 20:20:33,495 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8959 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8958 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8957 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8960 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse3 (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_8957))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_8958)))) (let ((.cse0 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (let ((.cse1 (store .cse3 .cse0 v_ArrVal_8959))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_8960)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) is different from false [2024-11-27 20:20:33,609 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8959 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8958 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8957 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8960 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (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_8957))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_8958)))) (let ((.cse0 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (let ((.cse1 (store .cse3 .cse0 v_ArrVal_8959))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_8960)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) is different from false [2024-11-27 20:20:36,539 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8959 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8958 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8957 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9007 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8960 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse2 (let ((.cse4 (let ((.cse5 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_9007))) (store .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8957)))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8958)))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (= (select (select (let ((.cse0 (store .cse2 .cse3 v_ArrVal_8959))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8960)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) .cse3))))) is different from false [2024-11-27 20:20:36,568 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 20:20:36,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1250191207] [2024-11-27 20:20:36,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1250191207] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 20:20:36,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [283843624] [2024-11-27 20:20:36,568 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:20:36,568 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-27 20:20:36,568 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 [2024-11-27 20:20:36,570 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-27 20:20:36,572 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (39)] Waiting until timeout for monitored process [2024-11-27 20:20:45,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:20:46,000 INFO L256 TraceCheckSpWp]: Trace formula consists of 931 conjuncts, 72 conjuncts are in the unsatisfiable core [2024-11-27 20:20:46,009 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:20:46,077 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-27 20:20:49,055 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-27 20:20:49,055 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-27 20:20:49,862 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-27 20:20:52,164 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2024-11-27 20:21:07,197 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:21:07,198 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-27 20:21:09,690 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:21:09,690 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-27 20:21:11,252 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:21:11,252 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2024-11-27 20:21:12,817 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:21:12,817 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-27 20:21:14,408 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:21:14,409 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2024-11-27 20:21:14,737 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-27 20:21:16,674 INFO L349 Elim1Store]: treesize reduction 48, result has 32.4 percent of original size [2024-11-27 20:21:16,674 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 36 [2024-11-27 20:21:16,810 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-27 20:21:16,810 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 20:21:17,909 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9481 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_9481) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))) (_ bv0 1))) is different from false [2024-11-27 20:21:18,016 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9481 (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_9481) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-27 20:21:18,168 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9481 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9480 (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~mem40#1.base| v_ArrVal_9480))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9481)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-27 20:21:18,275 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9481 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9480 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9480))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9481)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2024-11-27 20:21:18,431 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9481 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9480 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9479 (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~mem39#1.base| v_ArrVal_9479))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9480)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9481)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-27 20:21:18,542 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9481 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9480 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9479 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9479))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9480)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9481)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-27 20:21:18,704 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9481 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9480 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9479 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9478 (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~mem38#1.base| v_ArrVal_9478))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9479)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9480)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9481)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-27 20:21:18,821 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9481 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9480 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9479 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9478 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9478))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9479)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9480)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9481)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-27 20:21:22,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [283843624] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 20:21:22,814 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-27 20:21:22,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 25 [2024-11-27 20:21:22,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555751124] [2024-11-27 20:21:22,814 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-27 20:21:22,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-27 20:21:22,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 20:21:22,815 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-27 20:21:22,815 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=704, Unknown=27, NotChecked=1104, Total=1980 [2024-11-27 20:21:22,816 INFO L87 Difference]: Start difference. First operand 1141 states and 1287 transitions. Second operand has 26 states, 23 states have (on average 6.3478260869565215) internal successors, (146), 25 states have internal predecessors, (146), 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-27 20:22:52,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:22:52,036 INFO L93 Difference]: Finished difference Result 1142 states and 1288 transitions. [2024-11-27 20:22:52,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-27 20:22:52,036 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 23 states have (on average 6.3478260869565215) internal successors, (146), 25 states have internal predecessors, (146), 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 132 [2024-11-27 20:22:52,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:22:52,039 INFO L225 Difference]: With dead ends: 1142 [2024-11-27 20:22:52,039 INFO L226 Difference]: Without dead ends: 1142 [2024-11-27 20:22:52,040 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 250 SyntacticMatches, 3 SemanticMatches, 45 ConstructedPredicates, 16 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 19.8s TimeCoverageRelationStatistics Valid=158, Invalid=809, Unknown=27, NotChecked=1168, Total=2162 [2024-11-27 20:22:52,040 INFO L435 NwaCegarLoop]: 624 mSDtfsCounter, 655 mSDsluCounter, 4416 mSDsCounter, 0 mSdLazyCounter, 3657 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 86.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 663 SdHoareTripleChecker+Valid, 5040 SdHoareTripleChecker+Invalid, 3681 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 3657 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 88.1s IncrementalHoareTripleChecker+Time [2024-11-27 20:22:52,040 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [663 Valid, 5040 Invalid, 3681 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 3657 Invalid, 0 Unknown, 0 Unchecked, 88.1s Time] [2024-11-27 20:22:52,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1142 states. [2024-11-27 20:22:52,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1142 to 1140. [2024-11-27 20:22:52,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1140 states, 786 states have (on average 1.599236641221374) internal successors, (1257), 1132 states have internal predecessors, (1257), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-27 20:22:52,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1140 states to 1140 states and 1286 transitions. [2024-11-27 20:22:52,058 INFO L78 Accepts]: Start accepts. Automaton has 1140 states and 1286 transitions. Word has length 132 [2024-11-27 20:22:52,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:22:52,059 INFO L471 AbstractCegarLoop]: Abstraction has 1140 states and 1286 transitions. [2024-11-27 20:22:52,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 23 states have (on average 6.3478260869565215) internal successors, (146), 25 states have internal predecessors, (146), 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-27 20:22:52,059 INFO L276 IsEmpty]: Start isEmpty. Operand 1140 states and 1286 transitions. [2024-11-27 20:22:52,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-27 20:22:52,060 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:22:52,060 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:22:52,091 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Ended with exit code 0 [2024-11-27 20:22:52,286 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (39)] Ended with exit code 0 [2024-11-27 20:22:52,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,39 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt [2024-11-27 20:22:52,461 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr97REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-27 20:22:52,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:22:52,462 INFO L85 PathProgramCache]: Analyzing trace with hash -2010640532, now seen corresponding path program 1 times [2024-11-27 20:22:52,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:22:52,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1982084096] [2024-11-27 20:22:52,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:22:52,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:22:52,463 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:22:52,465 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:22:52,467 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2024-11-27 20:22:53,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:22:53,655 INFO L256 TraceCheckSpWp]: Trace formula consists of 931 conjuncts, 124 conjuncts are in the unsatisfiable core [2024-11-27 20:22:53,672 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:22:56,272 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-27 20:22:56,538 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-27 20:22:56,538 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-27 20:22:56,950 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-27 20:22:57,089 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-27 20:22:58,508 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-27 20:22:58,557 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-27 20:23:12,360 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:23:12,360 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-27 20:23:12,470 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-27 20:23:14,803 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:23:14,804 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-27 20:23:14,899 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-27 20:23:16,602 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:23:16,603 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 68 [2024-11-27 20:23:16,700 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-27 20:23:18,471 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:23:18,472 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-27 20:23:18,562 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-27 20:23:20,315 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:23:20,315 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 68 [2024-11-27 20:23:20,458 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-27 20:23:20,890 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-27 20:23:21,028 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-27 20:23:21,872 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 20:23:22,228 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-11-27 20:23:22,228 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-27 20:23:22,516 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-27 20:23:22,517 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-27 20:23:23,176 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-27 20:23:23,176 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 20:23:36,182 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (or (forall ((|v_ULTIMATE.start_main_#t~malloc43#1.base_8| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc43#1.base_8|)))) (forall ((v_ArrVal_10051 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_10051) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule .cse0 (bvadd (_ bv4 32) .cse0))))) (forall ((|v_ULTIMATE.start_main_#t~malloc43#1.base_8| (_ BitVec 32)) (v_ArrVal_10050 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10051 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc43#1.base_8|))) (forall ((v_ArrVal_10052 (_ BitVec 32))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_10051) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc43#1.base_8| v_ArrVal_10052) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_10050) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2024-11-27 20:23:36,485 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((|v_ULTIMATE.start_main_#t~malloc43#1.base_8| (_ BitVec 32)) (v_ArrVal_10050 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10051 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_10052 (_ BitVec 32))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_10051) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc43#1.base_8| v_ArrVal_10052) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_10050) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc43#1.base_8|))))) (or (forall ((v_ArrVal_10051 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_10051) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule .cse2 (bvadd (_ bv4 32) .cse2)))) (forall ((|v_ULTIMATE.start_main_#t~malloc43#1.base_8| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc43#1.base_8|)))))))) is different from false [2024-11-27 20:23:37,020 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (or (forall ((|v_ULTIMATE.start_main_#t~malloc43#1.base_8| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc43#1.base_8|)))) (forall ((v_ArrVal_10048 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10049 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10051 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_10048) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_10049) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10051) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule .cse0 (bvadd (_ bv4 32) .cse0))))) (forall ((v_ArrVal_10048 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10049 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc43#1.base_8| (_ BitVec 32)) (v_ArrVal_10050 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10051 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc43#1.base_8|))) (forall ((v_ArrVal_10052 (_ BitVec 32))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_10049))) (let ((.cse2 (select (select .cse3 |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~mem40#1.base| v_ArrVal_10048) .cse2 v_ArrVal_10051) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc43#1.base_8| v_ArrVal_10052) (select (select (store .cse3 .cse2 v_ArrVal_10050) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))))) is different from false [2024-11-27 20:23:37,607 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_10048 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10049 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc43#1.base_8| (_ BitVec 32)) (v_ArrVal_10050 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10051 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_10052 (_ BitVec 32))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_10049))) (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_10048) .cse1 v_ArrVal_10051) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc43#1.base_8| v_ArrVal_10052) (select (select (store .cse3 .cse1 v_ArrVal_10050) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc43#1.base_8|))))) (or (forall ((v_ArrVal_10048 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10049 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10051 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_10048) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_10049) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_10051) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule .cse4 (bvadd (_ bv4 32) .cse4)))) (forall ((|v_ULTIMATE.start_main_#t~malloc43#1.base_8| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc43#1.base_8|)))))))) is different from false [2024-11-27 20:23:38,197 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_10047 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10048 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10046 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10049 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc43#1.base_8| (_ BitVec 32)) (v_ArrVal_10050 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10051 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_10052 (_ BitVec 32))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_10047))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_10049))) (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~mem39#1.base| v_ArrVal_10046) .cse0 v_ArrVal_10048) .cse1 v_ArrVal_10051) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv4 32)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc43#1.base_8| v_ArrVal_10052) (select (select (store .cse3 .cse1 v_ArrVal_10050) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc43#1.base_8|))))) (or (forall ((v_ArrVal_10047 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10048 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10046 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10049 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10051 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_10047))) (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~mem39#1.base| v_ArrVal_10046) .cse6 v_ArrVal_10048) (select (select (store .cse7 .cse6 v_ArrVal_10049) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_10051))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule .cse5 (bvadd .cse5 (_ bv4 32))))) (forall ((|v_ULTIMATE.start_main_#t~malloc43#1.base_8| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc43#1.base_8|))))))) is different from false [2024-11-27 20:23:38,516 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (and (or (forall ((v_ArrVal_10047 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10048 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10046 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10049 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10051 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_10047))) (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_10046) .cse2 v_ArrVal_10048) (select (select (store .cse3 .cse2 v_ArrVal_10049) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_10051))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule .cse0 (bvadd .cse0 (_ bv4 32))))) (forall ((|v_ULTIMATE.start_main_#t~malloc43#1.base_8| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc43#1.base_8|))))) (forall ((v_ArrVal_10047 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10048 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10046 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10049 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc43#1.base_8| (_ BitVec 32)) (v_ArrVal_10050 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10051 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc43#1.base_8|))) (forall ((v_ArrVal_10052 (_ BitVec 32))) (let ((.cse8 (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_10047))) (let ((.cse5 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse7 (store .cse8 .cse5 v_ArrVal_10049))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_10046) .cse5 v_ArrVal_10048) .cse6 v_ArrVal_10051) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) (_ bv4 32)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc43#1.base_8| v_ArrVal_10052) (select (select (store .cse7 .cse6 v_ArrVal_10050) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))))))))))))) is different from false [2024-11-27 20:23:39,126 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_10044 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10047 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10048 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10045 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10046 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10049 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc43#1.base_8| (_ BitVec 32)) (v_ArrVal_10050 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10051 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc43#1.base_8|))) (forall ((v_ArrVal_10052 (_ BitVec 32))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_10045))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_10047))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_10049))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv4 32) (select (select (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_10044) .cse0 v_ArrVal_10046) .cse1 v_ArrVal_10048) .cse2 v_ArrVal_10051) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc43#1.base_8| v_ArrVal_10052) (select (select (store .cse4 .cse2 v_ArrVal_10050) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc43#1.base_8| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc43#1.base_8|)))) (forall ((v_ArrVal_10044 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10047 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10048 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10045 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10046 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10049 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10051 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (select (select (let ((.cse11 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_10045))) (let ((.cse8 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse10 (store .cse11 .cse8 v_ArrVal_10047))) (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~mem38#1.base| v_ArrVal_10044) .cse8 v_ArrVal_10046) .cse9 v_ArrVal_10048) (select (select (store .cse10 .cse9 v_ArrVal_10049) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_10051))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule .cse7 (bvadd (_ bv4 32) .cse7))))))) is different from false [2024-11-27 20:23:44,502 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_10044 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10047 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10048 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10045 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10046 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10049 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc43#1.base_8| (_ BitVec 32)) (v_ArrVal_10050 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10051 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_10052 (_ BitVec 32))) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_10045))) (let ((.cse1 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse6 (store .cse7 .cse1 v_ArrVal_10047))) (let ((.cse2 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse5 (store .cse6 .cse2 v_ArrVal_10049))) (let ((.cse3 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (select (select (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_10044) .cse1 v_ArrVal_10046) .cse2 v_ArrVal_10048) .cse3 v_ArrVal_10051) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) (_ bv4 32)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc43#1.base_8| v_ArrVal_10052) (select (select (store .cse5 .cse3 v_ArrVal_10050) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc43#1.base_8|))))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc43#1.base_8| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc43#1.base_8|)))) (forall ((v_ArrVal_10044 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10047 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10048 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10045 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10046 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10049 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10051 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (select (select (let ((.cse12 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_10045))) (let ((.cse9 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse11 (store .cse12 .cse9 v_ArrVal_10047))) (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_10044) .cse9 v_ArrVal_10046) .cse10 v_ArrVal_10048) (select (select (store .cse11 .cse10 v_ArrVal_10049) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_10051))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule .cse8 (bvadd .cse8 (_ bv4 32))))))))) is different from false [2024-11-27 20:23:55,451 WARN L286 SmtUtils]: Spent 10.35s 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-27 20:23:58,427 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 20:23:58,428 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-27 20:24:04,019 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 101 [2024-11-27 20:24:04,019 WARN L249 Executor]: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2024-11-27 20:24:04,020 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 20:24:04,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1982084096] [2024-11-27 20:24:04,020 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2024-11-27 20:24:04,036 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Ended with exit code 0 [2024-11-27 20:24:04,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:24:04,221 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:281) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.checkSat(ManagedScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:85) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:842) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:786) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:374) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:323) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:555) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:416) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:360) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:267) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:325) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:181) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:210) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:317) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:428) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:314) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:275) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:167) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:132) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 45 more [2024-11-27 20:24:04,226 INFO L158 Benchmark]: Toolchain (without parser) took 758304.56ms. Allocated memory was 83.9MB in the beginning and 285.2MB in the end (delta: 201.3MB). Free memory was 59.8MB in the beginning and 156.5MB in the end (delta: -96.6MB). Peak memory consumption was 104.6MB. Max. memory is 16.1GB. [2024-11-27 20:24:04,226 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 83.9MB. Free memory is still 48.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-27 20:24:04,226 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1112.57ms. Allocated memory is still 83.9MB. Free memory was 59.6MB in the beginning and 41.6MB in the end (delta: 18.1MB). Peak memory consumption was 37.4MB. Max. memory is 16.1GB. [2024-11-27 20:24:04,227 INFO L158 Benchmark]: Boogie Procedure Inliner took 88.23ms. Allocated memory is still 83.9MB. Free memory was 41.6MB in the beginning and 35.1MB in the end (delta: 6.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-27 20:24:04,227 INFO L158 Benchmark]: Boogie Preprocessor took 252.40ms. Allocated memory was 83.9MB in the beginning and 192.9MB in the end (delta: 109.1MB). Free memory was 35.1MB in the beginning and 156.6MB in the end (delta: -121.6MB). Peak memory consumption was 11.6MB. Max. memory is 16.1GB. [2024-11-27 20:24:04,227 INFO L158 Benchmark]: RCFGBuilder took 6425.57ms. Allocated memory is still 192.9MB. Free memory was 156.6MB in the beginning and 93.2MB in the end (delta: 63.5MB). Peak memory consumption was 115.2MB. Max. memory is 16.1GB. [2024-11-27 20:24:04,227 INFO L158 Benchmark]: TraceAbstraction took 750419.12ms. Allocated memory was 192.9MB in the beginning and 285.2MB in the end (delta: 92.3MB). Free memory was 93.2MB in the beginning and 156.5MB in the end (delta: -63.3MB). Peak memory consumption was 26.4MB. Max. memory is 16.1GB. [2024-11-27 20:24:04,229 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.33ms. Allocated memory is still 83.9MB. Free memory is still 48.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1112.57ms. Allocated memory is still 83.9MB. Free memory was 59.6MB in the beginning and 41.6MB in the end (delta: 18.1MB). Peak memory consumption was 37.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 88.23ms. Allocated memory is still 83.9MB. Free memory was 41.6MB in the beginning and 35.1MB in the end (delta: 6.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 252.40ms. Allocated memory was 83.9MB in the beginning and 192.9MB in the end (delta: 109.1MB). Free memory was 35.1MB in the beginning and 156.6MB in the end (delta: -121.6MB). Peak memory consumption was 11.6MB. Max. memory is 16.1GB. * RCFGBuilder took 6425.57ms. Allocated memory is still 192.9MB. Free memory was 156.6MB in the beginning and 93.2MB in the end (delta: 63.5MB). Peak memory consumption was 115.2MB. Max. memory is 16.1GB. * TraceAbstraction took 750419.12ms. Allocated memory was 192.9MB in the beginning and 285.2MB in the end (delta: 92.3MB). Free memory was 93.2MB in the beginning and 156.5MB in the end (delta: -63.3MB). Peak memory consumption was 26.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81df7705-fb17-4c78-aaf0-d247e2bacd70/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory")