./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test5-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_74e2201e-ae81-4b52-ac26-bd25afdac78a/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e2201e-ae81-4b52-ac26-bd25afdac78a/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_74e2201e-ae81-4b52-ac26-bd25afdac78a/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e2201e-ae81-4b52-ac26-bd25afdac78a/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test5-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e2201e-ae81-4b52-ac26-bd25afdac78a/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_74e2201e-ae81-4b52-ac26-bd25afdac78a/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 0f3b69410d84404822a26401b92e2c10c65259dbe30a6f843124f3a9a51940ad --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-28 04:33:29,834 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-28 04:33:29,948 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e2201e-ae81-4b52-ac26-bd25afdac78a/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-28 04:33:29,955 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-28 04:33:29,956 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-28 04:33:30,001 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-28 04:33:30,003 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-28 04:33:30,003 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-28 04:33:30,004 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-28 04:33:30,005 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-28 04:33:30,006 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-28 04:33:30,006 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-28 04:33:30,007 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-28 04:33:30,007 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-28 04:33:30,008 INFO L153 SettingsManager]: * Use SBE=true [2024-11-28 04:33:30,008 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-28 04:33:30,008 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-28 04:33:30,009 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-28 04:33:30,009 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-28 04:33:30,009 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-28 04:33:30,010 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-28 04:33:30,010 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-28 04:33:30,010 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-28 04:33:30,010 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-28 04:33:30,010 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-28 04:33:30,011 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-28 04:33:30,011 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-28 04:33:30,011 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-28 04:33:30,011 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-28 04:33:30,011 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-28 04:33:30,013 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 04:33:30,013 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 04:33:30,013 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 04:33:30,014 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 04:33:30,014 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-28 04:33:30,014 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 04:33:30,014 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 04:33:30,014 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 04:33:30,014 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 04:33:30,015 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-28 04:33:30,015 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-28 04:33:30,015 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-28 04:33:30,015 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-28 04:33:30,015 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-28 04:33:30,015 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-28 04:33:30,015 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-28 04:33:30,015 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-28 04:33:30,016 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_74e2201e-ae81-4b52-ac26-bd25afdac78a/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 -> 0f3b69410d84404822a26401b92e2c10c65259dbe30a6f843124f3a9a51940ad [2024-11-28 04:33:30,431 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-28 04:33:30,449 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-28 04:33:30,453 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-28 04:33:30,456 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-28 04:33:30,457 INFO L274 PluginConnector]: CDTParser initialized [2024-11-28 04:33:30,459 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e2201e-ae81-4b52-ac26-bd25afdac78a/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test5-2.i [2024-11-28 04:33:34,077 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e2201e-ae81-4b52-ac26-bd25afdac78a/bin/uautomizer-verify-aQ6SnzHsRB/data/3f54b89b3/5179746175d5490794a781d2d7510cbd/FLAGab2366858 [2024-11-28 04:33:34,737 INFO L384 CDTParser]: Found 1 translation units. [2024-11-28 04:33:34,740 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e2201e-ae81-4b52-ac26-bd25afdac78a/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test5-2.i [2024-11-28 04:33:34,772 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e2201e-ae81-4b52-ac26-bd25afdac78a/bin/uautomizer-verify-aQ6SnzHsRB/data/3f54b89b3/5179746175d5490794a781d2d7510cbd/FLAGab2366858 [2024-11-28 04:33:34,799 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e2201e-ae81-4b52-ac26-bd25afdac78a/bin/uautomizer-verify-aQ6SnzHsRB/data/3f54b89b3/5179746175d5490794a781d2d7510cbd [2024-11-28 04:33:34,803 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-28 04:33:34,805 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-28 04:33:34,809 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-28 04:33:34,809 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-28 04:33:34,815 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-28 04:33:34,817 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 04:33:34" (1/1) ... [2024-11-28 04:33:34,820 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@267ac070 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:33:34, skipping insertion in model container [2024-11-28 04:33:34,821 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 04:33:34" (1/1) ... [2024-11-28 04:33:34,894 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-28 04:33:35,412 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:33:35,451 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:33:35,456 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:33:35,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-28 04:33:35,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-28 04:33:35,548 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:33:35,551 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:33:35,555 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:33:35,565 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:33:35,600 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:33:35,600 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:33:35,603 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:33:35,603 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:33:35,605 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:33:35,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-28 04:33:35,609 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:33:35,610 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:33:35,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-28 04:33:35,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-28 04:33:35,634 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 04:33:35,655 ERROR L321 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2024-11-28 04:33:35,656 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@26242d1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:33:35, skipping insertion in model container [2024-11-28 04:33:35,656 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-28 04:33:35,657 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-28 04:33:35,660 INFO L158 Benchmark]: Toolchain (without parser) took 854.07ms. Allocated memory is still 142.6MB. Free memory was 102.6MB in the beginning and 80.0MB in the end (delta: 22.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-28 04:33:35,662 INFO L158 Benchmark]: CDTParser took 2.17ms. Allocated memory is still 167.8MB. Free memory is still 104.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 04:33:35,663 INFO L158 Benchmark]: CACSL2BoogieTranslator took 848.03ms. Allocated memory is still 142.6MB. Free memory was 102.6MB in the beginning and 80.0MB in the end (delta: 22.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-28 04:33:35,664 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 2.17ms. Allocated memory is still 167.8MB. Free memory is still 104.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 848.03ms. Allocated memory is still 142.6MB. Free memory was 102.6MB in the beginning and 80.0MB in the end (delta: 22.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 757]: 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_74e2201e-ae81-4b52-ac26-bd25afdac78a/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e2201e-ae81-4b52-ac26-bd25afdac78a/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_74e2201e-ae81-4b52-ac26-bd25afdac78a/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e2201e-ae81-4b52-ac26-bd25afdac78a/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test5-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e2201e-ae81-4b52-ac26-bd25afdac78a/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_74e2201e-ae81-4b52-ac26-bd25afdac78a/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 0f3b69410d84404822a26401b92e2c10c65259dbe30a6f843124f3a9a51940ad --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-28 04:33:38,683 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-28 04:33:38,817 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e2201e-ae81-4b52-ac26-bd25afdac78a/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-28 04:33:38,828 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-28 04:33:38,832 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-28 04:33:38,899 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-28 04:33:38,900 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-28 04:33:38,900 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-28 04:33:38,901 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-28 04:33:38,904 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-28 04:33:38,904 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-28 04:33:38,905 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-28 04:33:38,905 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-28 04:33:38,905 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-28 04:33:38,905 INFO L153 SettingsManager]: * Use SBE=true [2024-11-28 04:33:38,906 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-28 04:33:38,906 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-28 04:33:38,906 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-28 04:33:38,906 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-28 04:33:38,906 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-28 04:33:38,906 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-28 04:33:38,906 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-28 04:33:38,907 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-28 04:33:38,907 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-28 04:33:38,907 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-28 04:33:38,907 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-28 04:33:38,907 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-28 04:33:38,907 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-28 04:33:38,907 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-28 04:33:38,907 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-28 04:33:38,908 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-28 04:33:38,908 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-28 04:33:38,908 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 04:33:38,922 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 04:33:38,922 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 04:33:38,922 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 04:33:38,922 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-28 04:33:38,922 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 04:33:38,922 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 04:33:38,923 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 04:33:38,923 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 04:33:38,923 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-28 04:33:38,923 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-28 04:33:38,923 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-28 04:33:38,923 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-28 04:33:38,923 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-28 04:33:38,923 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-28 04:33:38,924 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-28 04:33:38,924 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-28 04:33:38,924 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_74e2201e-ae81-4b52-ac26-bd25afdac78a/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 -> 0f3b69410d84404822a26401b92e2c10c65259dbe30a6f843124f3a9a51940ad [2024-11-28 04:33:39,342 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-28 04:33:39,352 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-28 04:33:39,355 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-28 04:33:39,357 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-28 04:33:39,357 INFO L274 PluginConnector]: CDTParser initialized [2024-11-28 04:33:39,359 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e2201e-ae81-4b52-ac26-bd25afdac78a/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test5-2.i [2024-11-28 04:33:42,837 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e2201e-ae81-4b52-ac26-bd25afdac78a/bin/uautomizer-verify-aQ6SnzHsRB/data/22d0fcdc6/3d1c607e250546c4a8bdd28dcabd65d0/FLAG14aef8a5c [2024-11-28 04:33:43,318 INFO L384 CDTParser]: Found 1 translation units. [2024-11-28 04:33:43,319 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e2201e-ae81-4b52-ac26-bd25afdac78a/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test5-2.i [2024-11-28 04:33:43,341 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e2201e-ae81-4b52-ac26-bd25afdac78a/bin/uautomizer-verify-aQ6SnzHsRB/data/22d0fcdc6/3d1c607e250546c4a8bdd28dcabd65d0/FLAG14aef8a5c [2024-11-28 04:33:43,361 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e2201e-ae81-4b52-ac26-bd25afdac78a/bin/uautomizer-verify-aQ6SnzHsRB/data/22d0fcdc6/3d1c607e250546c4a8bdd28dcabd65d0 [2024-11-28 04:33:43,364 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-28 04:33:43,366 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-28 04:33:43,368 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-28 04:33:43,368 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-28 04:33:43,375 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-28 04:33:43,376 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 04:33:43" (1/1) ... [2024-11-28 04:33:43,377 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a4b6946 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:33:43, skipping insertion in model container [2024-11-28 04:33:43,377 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 04:33:43" (1/1) ... [2024-11-28 04:33:43,435 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-28 04:33:44,010 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:33:44,072 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:33:44,078 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:33:44,084 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:33:44,094 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:33:44,141 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:33:44,145 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:33:44,149 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:33:44,158 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:33:44,199 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:33:44,199 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:33:44,204 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:33:44,204 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:33:44,207 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:33:44,211 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:33:44,213 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:33:44,214 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:33:44,215 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:33:44,221 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:33:44,230 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 04:33:44,265 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-28 04:33:44,292 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-28 04:33:44,328 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:33:44,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-28 04:33:44,370 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:33:44,377 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:33:44,392 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:33:44,457 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:33:44,464 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:33:44,470 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:33:44,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-28 04:33:44,513 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:33:44,513 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:33:44,516 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:33:44,516 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:33:44,519 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:33:44,521 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:33:44,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-28 04:33:44,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-28 04:33:44,529 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:33:44,537 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:33:44,544 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 04:33:44,554 INFO L200 MainTranslator]: Completed pre-run [2024-11-28 04:33:44,736 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 04:33:44,783 INFO L204 MainTranslator]: Completed translation [2024-11-28 04:33:44,784 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:33:44 WrapperNode [2024-11-28 04:33:44,784 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-28 04:33:44,786 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-28 04:33:44,786 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-28 04:33:44,786 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-28 04:33:44,795 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:33:44" (1/1) ... [2024-11-28 04:33:44,834 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:33:44" (1/1) ... [2024-11-28 04:33:44,916 INFO L138 Inliner]: procedures = 180, calls = 426, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1561 [2024-11-28 04:33:44,916 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-28 04:33:44,917 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-28 04:33:44,917 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-28 04:33:44,917 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-28 04:33:44,929 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:33:44" (1/1) ... [2024-11-28 04:33:44,929 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:33:44" (1/1) ... [2024-11-28 04:33:44,947 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:33:44" (1/1) ... [2024-11-28 04:33:45,170 INFO L175 MemorySlicer]: Split 397 memory accesses to 3 slices as follows [371, 2, 24]. 93 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [0, 2, 0]. The 91 writes are split as follows [90, 0, 1]. [2024-11-28 04:33:45,174 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:33:44" (1/1) ... [2024-11-28 04:33:45,174 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:33:44" (1/1) ... [2024-11-28 04:33:45,279 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:33:44" (1/1) ... [2024-11-28 04:33:45,284 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:33:44" (1/1) ... [2024-11-28 04:33:45,304 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:33:44" (1/1) ... [2024-11-28 04:33:45,316 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:33:44" (1/1) ... [2024-11-28 04:33:45,327 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:33:44" (1/1) ... [2024-11-28 04:33:45,415 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-28 04:33:45,416 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-28 04:33:45,419 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-28 04:33:45,419 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-28 04:33:45,420 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:33:44" (1/1) ... [2024-11-28 04:33:45,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 04:33:45,449 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e2201e-ae81-4b52-ac26-bd25afdac78a/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:33:45,468 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e2201e-ae81-4b52-ac26-bd25afdac78a/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-28 04:33:45,474 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e2201e-ae81-4b52-ac26-bd25afdac78a/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-28 04:33:45,515 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-11-28 04:33:45,517 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-11-28 04:33:45,518 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-28 04:33:45,518 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-28 04:33:45,518 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-28 04:33:45,518 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-28 04:33:45,518 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-28 04:33:45,518 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-28 04:33:45,519 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-28 04:33:45,519 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-28 04:33:45,519 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-28 04:33:45,519 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-28 04:33:45,519 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-11-28 04:33:45,519 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-28 04:33:45,519 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-28 04:33:45,519 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-11-28 04:33:45,520 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-28 04:33:45,520 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-28 04:33:45,520 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-28 04:33:45,520 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-28 04:33:45,520 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-28 04:33:45,522 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-28 04:33:45,523 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-28 04:33:45,523 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-28 04:33:45,523 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-28 04:33:45,523 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-28 04:33:45,523 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-28 04:33:45,523 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-28 04:33:45,523 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-28 04:33:45,523 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-28 04:33:45,523 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-28 04:33:45,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-28 04:33:45,524 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-28 04:33:45,524 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-28 04:33:45,953 INFO L234 CfgBuilder]: Building ICFG [2024-11-28 04:33:45,956 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-28 04:33:45,990 WARN L773 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-28 04:33:46,050 WARN L773 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-28 04:33:46,087 WARN L773 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-28 04:33:54,715 INFO L? ?]: Removed 1704 outVars from TransFormulas that were not future-live. [2024-11-28 04:33:54,715 INFO L283 CfgBuilder]: Performing block encoding [2024-11-28 04:33:54,793 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-28 04:33:54,794 INFO L312 CfgBuilder]: Removed 52 assume(true) statements. [2024-11-28 04:33:54,794 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:33:54 BoogieIcfgContainer [2024-11-28 04:33:54,794 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-28 04:33:54,797 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-28 04:33:54,797 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-28 04:33:54,810 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-28 04:33:54,810 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 04:33:43" (1/3) ... [2024-11-28 04:33:54,811 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fec66b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 04:33:54, skipping insertion in model container [2024-11-28 04:33:54,812 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:33:44" (2/3) ... [2024-11-28 04:33:54,812 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fec66b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 04:33:54, skipping insertion in model container [2024-11-28 04:33:54,813 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:33:54" (3/3) ... [2024-11-28 04:33:54,816 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_BER_test5-2.i [2024-11-28 04:33:54,834 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-28 04:33:54,837 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_BER_test5-2.i that has 6 procedures, 1654 locations, 1 initial locations, 54 loop locations, and 817 error locations. [2024-11-28 04:33:54,970 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-28 04:33:54,991 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;@281608be, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-28 04:33:54,991 INFO L334 AbstractCegarLoop]: Starting to check reachability of 817 error locations. [2024-11-28 04:33:55,006 INFO L276 IsEmpty]: Start isEmpty. Operand has 1644 states, 816 states have (on average 2.221813725490196) internal successors, (1813), 1634 states have internal predecessors, (1813), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 9 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-28 04:33:55,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-28 04:33:55,014 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:33:55,015 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-28 04:33:55,015 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr620REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 814 more)] === [2024-11-28 04:33:55,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:33:55,024 INFO L85 PathProgramCache]: Analyzing trace with hash 2009152842, now seen corresponding path program 1 times [2024-11-28 04:33:55,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 04:33:55,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1934291709] [2024-11-28 04:33:55,036 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:33:55,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:33:55,036 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e2201e-ae81-4b52-ac26-bd25afdac78a/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:33:55,042 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e2201e-ae81-4b52-ac26-bd25afdac78a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:33:55,045 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e2201e-ae81-4b52-ac26-bd25afdac78a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-28 04:33:55,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:33:55,315 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-28 04:33:55,320 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:33:55,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:33:55,332 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 04:33:55,333 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 04:33:55,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1934291709] [2024-11-28 04:33:55,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1934291709] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:33:55,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:33:55,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 04:33:55,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721145075] [2024-11-28 04:33:55,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:33:55,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-28 04:33:55,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 04:33:55,371 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-28 04:33:55,371 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-28 04:33:55,377 INFO L87 Difference]: Start difference. First operand has 1644 states, 816 states have (on average 2.221813725490196) internal successors, (1813), 1634 states have internal predecessors, (1813), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 9 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:33:55,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:33:55,487 INFO L93 Difference]: Finished difference Result 1624 states and 1717 transitions. [2024-11-28 04:33:55,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-28 04:33:55,489 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-28 04:33:55,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:33:55,538 INFO L225 Difference]: With dead ends: 1624 [2024-11-28 04:33:55,538 INFO L226 Difference]: Without dead ends: 1622 [2024-11-28 04:33:55,541 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-28 04:33:55,546 INFO L435 NwaCegarLoop]: 1717 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1717 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 04:33:55,547 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1717 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 04:33:55,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1622 states. [2024-11-28 04:33:55,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1622 to 1622. [2024-11-28 04:33:55,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1622 states, 806 states have (on average 2.098014888337469) internal successors, (1691), 1612 states have internal predecessors, (1691), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-28 04:33:55,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1622 states to 1622 states and 1715 transitions. [2024-11-28 04:33:55,687 INFO L78 Accepts]: Start accepts. Automaton has 1622 states and 1715 transitions. Word has length 6 [2024-11-28 04:33:55,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:33:55,688 INFO L471 AbstractCegarLoop]: Abstraction has 1622 states and 1715 transitions. [2024-11-28 04:33:55,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:33:55,692 INFO L276 IsEmpty]: Start isEmpty. Operand 1622 states and 1715 transitions. [2024-11-28 04:33:55,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-28 04:33:55,693 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:33:55,693 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-28 04:33:55,707 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e2201e-ae81-4b52-ac26-bd25afdac78a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-28 04:33:55,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e2201e-ae81-4b52-ac26-bd25afdac78a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:33:55,894 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 814 more)] === [2024-11-28 04:33:55,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:33:55,895 INFO L85 PathProgramCache]: Analyzing trace with hash 1954605546, now seen corresponding path program 1 times [2024-11-28 04:33:55,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 04:33:55,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [669891793] [2024-11-28 04:33:55,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:33:55,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:33:55,897 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e2201e-ae81-4b52-ac26-bd25afdac78a/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:33:55,899 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e2201e-ae81-4b52-ac26-bd25afdac78a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:33:55,903 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e2201e-ae81-4b52-ac26-bd25afdac78a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-28 04:33:56,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:33:56,157 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-28 04:33:56,161 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:33:56,204 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-28 04:33:56,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:33:56,232 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 04:33:56,232 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 04:33:56,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [669891793] [2024-11-28 04:33:56,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [669891793] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:33:56,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:33:56,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 04:33:56,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930349043] [2024-11-28 04:33:56,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:33:56,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 04:33:56,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 04:33:56,237 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 04:33:56,238 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:33:56,238 INFO L87 Difference]: Start difference. First operand 1622 states and 1715 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:34:00,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:34:00,446 INFO L93 Difference]: Finished difference Result 1759 states and 1884 transitions. [2024-11-28 04:34:00,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 04:34:00,446 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-28 04:34:00,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:34:00,455 INFO L225 Difference]: With dead ends: 1759 [2024-11-28 04:34:00,455 INFO L226 Difference]: Without dead ends: 1759 [2024-11-28 04:34:00,455 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:34:00,456 INFO L435 NwaCegarLoop]: 1183 mSDtfsCounter, 1265 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 1014 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1276 SdHoareTripleChecker+Valid, 1466 SdHoareTripleChecker+Invalid, 1113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 1014 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-11-28 04:34:00,457 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1276 Valid, 1466 Invalid, 1113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 1014 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2024-11-28 04:34:00,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1759 states. [2024-11-28 04:34:00,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1759 to 1530. [2024-11-28 04:34:00,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1530 states, 806 states have (on average 1.9838709677419355) internal successors, (1599), 1520 states have internal predecessors, (1599), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-28 04:34:00,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1530 states to 1530 states and 1623 transitions. [2024-11-28 04:34:00,549 INFO L78 Accepts]: Start accepts. Automaton has 1530 states and 1623 transitions. Word has length 6 [2024-11-28 04:34:00,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:34:00,549 INFO L471 AbstractCegarLoop]: Abstraction has 1530 states and 1623 transitions. [2024-11-28 04:34:00,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:34:00,551 INFO L276 IsEmpty]: Start isEmpty. Operand 1530 states and 1623 transitions. [2024-11-28 04:34:00,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-28 04:34:00,552 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:34:00,552 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-28 04:34:00,564 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e2201e-ae81-4b52-ac26-bd25afdac78a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-28 04:34:00,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e2201e-ae81-4b52-ac26-bd25afdac78a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:34:00,757 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 814 more)] === [2024-11-28 04:34:00,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:34:00,757 INFO L85 PathProgramCache]: Analyzing trace with hash 1954605547, now seen corresponding path program 1 times [2024-11-28 04:34:00,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 04:34:00,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1349896199] [2024-11-28 04:34:00,758 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:34:00,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:34:00,758 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e2201e-ae81-4b52-ac26-bd25afdac78a/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:34:00,762 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e2201e-ae81-4b52-ac26-bd25afdac78a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:34:00,765 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e2201e-ae81-4b52-ac26-bd25afdac78a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-28 04:34:00,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:34:00,966 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-28 04:34:00,969 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:34:00,989 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 04:34:01,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:34:01,022 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 04:34:01,022 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 04:34:01,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1349896199] [2024-11-28 04:34:01,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1349896199] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:34:01,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:34:01,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 04:34:01,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928232160] [2024-11-28 04:34:01,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:34:01,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 04:34:01,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 04:34:01,023 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 04:34:01,024 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:34:01,024 INFO L87 Difference]: Start difference. First operand 1530 states and 1623 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:34:06,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:34:06,482 INFO L93 Difference]: Finished difference Result 2077 states and 2221 transitions. [2024-11-28 04:34:06,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 04:34:06,483 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-28 04:34:06,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:34:06,494 INFO L225 Difference]: With dead ends: 2077 [2024-11-28 04:34:06,494 INFO L226 Difference]: Without dead ends: 2077 [2024-11-28 04:34:06,494 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:34:06,496 INFO L435 NwaCegarLoop]: 1545 mSDtfsCounter, 769 mSDsluCounter, 712 mSDsCounter, 0 mSdLazyCounter, 1057 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 774 SdHoareTripleChecker+Valid, 2257 SdHoareTripleChecker+Invalid, 1082 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1057 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2024-11-28 04:34:06,497 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [774 Valid, 2257 Invalid, 1082 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1057 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2024-11-28 04:34:06,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2077 states. [2024-11-28 04:34:06,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2077 to 1697. [2024-11-28 04:34:06,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1697 states, 983 states have (on average 1.9521871820956256) internal successors, (1919), 1687 states have internal predecessors, (1919), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-28 04:34:06,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1697 states to 1697 states and 1943 transitions. [2024-11-28 04:34:06,552 INFO L78 Accepts]: Start accepts. Automaton has 1697 states and 1943 transitions. Word has length 6 [2024-11-28 04:34:06,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:34:06,552 INFO L471 AbstractCegarLoop]: Abstraction has 1697 states and 1943 transitions. [2024-11-28 04:34:06,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:34:06,553 INFO L276 IsEmpty]: Start isEmpty. Operand 1697 states and 1943 transitions. [2024-11-28 04:34:06,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-28 04:34:06,553 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:34:06,553 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-28 04:34:06,565 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e2201e-ae81-4b52-ac26-bd25afdac78a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-28 04:34:06,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e2201e-ae81-4b52-ac26-bd25afdac78a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:34:06,754 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr620REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 814 more)] === [2024-11-28 04:34:06,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:34:06,756 INFO L85 PathProgramCache]: Analyzing trace with hash 1956422772, now seen corresponding path program 1 times [2024-11-28 04:34:06,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 04:34:06,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1598235463] [2024-11-28 04:34:06,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:34:06,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:34:06,757 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e2201e-ae81-4b52-ac26-bd25afdac78a/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:34:06,761 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e2201e-ae81-4b52-ac26-bd25afdac78a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:34:06,763 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e2201e-ae81-4b52-ac26-bd25afdac78a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-28 04:34:06,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:34:06,947 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-28 04:34:06,950 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:34:06,958 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-28 04:34:07,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:34:07,013 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 04:34:07,013 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 04:34:07,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1598235463] [2024-11-28 04:34:07,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1598235463] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:34:07,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:34:07,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 04:34:07,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496614423] [2024-11-28 04:34:07,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:34:07,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 04:34:07,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 04:34:07,017 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 04:34:07,017 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:34:07,017 INFO L87 Difference]: Start difference. First operand 1697 states and 1943 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:34:11,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:34:11,722 INFO L93 Difference]: Finished difference Result 3012 states and 3472 transitions. [2024-11-28 04:34:11,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 04:34:11,723 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-28 04:34:11,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:34:11,736 INFO L225 Difference]: With dead ends: 3012 [2024-11-28 04:34:11,736 INFO L226 Difference]: Without dead ends: 3012 [2024-11-28 04:34:11,736 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:34:11,737 INFO L435 NwaCegarLoop]: 978 mSDtfsCounter, 1410 mSDsluCounter, 729 mSDsCounter, 0 mSdLazyCounter, 1281 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1421 SdHoareTripleChecker+Valid, 1707 SdHoareTripleChecker+Invalid, 1290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2024-11-28 04:34:11,737 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1421 Valid, 1707 Invalid, 1290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1281 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2024-11-28 04:34:11,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3012 states. [2024-11-28 04:34:11,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3012 to 2226. [2024-11-28 04:34:11,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2226 states, 1513 states have (on average 1.9220092531394581) internal successors, (2908), 2212 states have internal predecessors, (2908), 17 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 11 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-28 04:34:11,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2226 states to 2226 states and 2940 transitions. [2024-11-28 04:34:11,819 INFO L78 Accepts]: Start accepts. Automaton has 2226 states and 2940 transitions. Word has length 6 [2024-11-28 04:34:11,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:34:11,819 INFO L471 AbstractCegarLoop]: Abstraction has 2226 states and 2940 transitions. [2024-11-28 04:34:11,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:34:11,819 INFO L276 IsEmpty]: Start isEmpty. Operand 2226 states and 2940 transitions. [2024-11-28 04:34:11,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-28 04:34:11,820 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:34:11,820 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-28 04:34:11,832 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e2201e-ae81-4b52-ac26-bd25afdac78a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-28 04:34:12,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e2201e-ae81-4b52-ac26-bd25afdac78a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:34:12,021 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr621REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 814 more)] === [2024-11-28 04:34:12,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:34:12,022 INFO L85 PathProgramCache]: Analyzing trace with hash 1956422773, now seen corresponding path program 1 times [2024-11-28 04:34:12,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 04:34:12,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [846044104] [2024-11-28 04:34:12,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:34:12,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:34:12,024 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e2201e-ae81-4b52-ac26-bd25afdac78a/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:34:12,026 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e2201e-ae81-4b52-ac26-bd25afdac78a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:34:12,030 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e2201e-ae81-4b52-ac26-bd25afdac78a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-28 04:34:12,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:34:12,209 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-28 04:34:12,211 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:34:12,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:34:12,225 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 04:34:12,225 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 04:34:12,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [846044104] [2024-11-28 04:34:12,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [846044104] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:34:12,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:34:12,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 04:34:12,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668747881] [2024-11-28 04:34:12,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:34:12,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 04:34:12,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 04:34:12,227 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 04:34:12,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:34:12,227 INFO L87 Difference]: Start difference. First operand 2226 states and 2940 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:34:12,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:34:12,445 INFO L93 Difference]: Finished difference Result 3884 states and 4992 transitions. [2024-11-28 04:34:12,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 04:34:12,449 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-28 04:34:12,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:34:12,469 INFO L225 Difference]: With dead ends: 3884 [2024-11-28 04:34:12,469 INFO L226 Difference]: Without dead ends: 3884 [2024-11-28 04:34:12,470 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:34:12,472 INFO L435 NwaCegarLoop]: 1608 mSDtfsCounter, 1357 mSDsluCounter, 1600 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1368 SdHoareTripleChecker+Valid, 3208 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-28 04:34:12,473 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1368 Valid, 3208 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-28 04:34:12,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3884 states. [2024-11-28 04:34:12,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3884 to 2228. [2024-11-28 04:34:12,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2228 states, 1515 states have (on average 1.9201320132013202) internal successors, (2909), 2214 states have internal predecessors, (2909), 17 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 11 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-28 04:34:12,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2228 states to 2228 states and 2941 transitions. [2024-11-28 04:34:12,590 INFO L78 Accepts]: Start accepts. Automaton has 2228 states and 2941 transitions. Word has length 6 [2024-11-28 04:34:12,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:34:12,590 INFO L471 AbstractCegarLoop]: Abstraction has 2228 states and 2941 transitions. [2024-11-28 04:34:12,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:34:12,591 INFO L276 IsEmpty]: Start isEmpty. Operand 2228 states and 2941 transitions. [2024-11-28 04:34:12,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-28 04:34:12,591 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:34:12,591 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:34:12,603 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e2201e-ae81-4b52-ac26-bd25afdac78a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-28 04:34:12,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e2201e-ae81-4b52-ac26-bd25afdac78a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:34:12,796 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 814 more)] === [2024-11-28 04:34:12,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:34:12,796 INFO L85 PathProgramCache]: Analyzing trace with hash 748226775, now seen corresponding path program 1 times [2024-11-28 04:34:12,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 04:34:12,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1013464878] [2024-11-28 04:34:12,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:34:12,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:34:12,797 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e2201e-ae81-4b52-ac26-bd25afdac78a/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:34:12,799 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e2201e-ae81-4b52-ac26-bd25afdac78a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:34:12,800 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e2201e-ae81-4b52-ac26-bd25afdac78a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-28 04:34:13,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:34:13,010 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-28 04:34:13,013 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:34:13,019 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-28 04:34:13,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:34:13,078 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 04:34:13,078 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 04:34:13,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1013464878] [2024-11-28 04:34:13,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1013464878] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:34:13,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:34:13,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 04:34:13,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901527445] [2024-11-28 04:34:13,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:34:13,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 04:34:13,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 04:34:13,079 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 04:34:13,079 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 04:34:13,079 INFO L87 Difference]: Start difference. First operand 2228 states and 2941 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:34:17,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:34:17,720 INFO L93 Difference]: Finished difference Result 2214 states and 2904 transitions. [2024-11-28 04:34:17,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 04:34:17,720 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-11-28 04:34:17,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:34:17,729 INFO L225 Difference]: With dead ends: 2214 [2024-11-28 04:34:17,729 INFO L226 Difference]: Without dead ends: 2214 [2024-11-28 04:34:17,729 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-28 04:34:17,732 INFO L435 NwaCegarLoop]: 901 mSDtfsCounter, 1315 mSDsluCounter, 830 mSDsCounter, 0 mSdLazyCounter, 1705 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1326 SdHoareTripleChecker+Valid, 1731 SdHoareTripleChecker+Invalid, 1736 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1705 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2024-11-28 04:34:17,732 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1326 Valid, 1731 Invalid, 1736 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1705 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2024-11-28 04:34:17,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2214 states. [2024-11-28 04:34:17,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2214 to 2205. [2024-11-28 04:34:17,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2205 states, 1515 states have (on average 1.8897689768976897) internal successors, (2863), 2191 states have internal predecessors, (2863), 17 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 11 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-28 04:34:17,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2205 states to 2205 states and 2895 transitions. [2024-11-28 04:34:17,795 INFO L78 Accepts]: Start accepts. Automaton has 2205 states and 2895 transitions. Word has length 12 [2024-11-28 04:34:17,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:34:17,796 INFO L471 AbstractCegarLoop]: Abstraction has 2205 states and 2895 transitions. [2024-11-28 04:34:17,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:34:17,796 INFO L276 IsEmpty]: Start isEmpty. Operand 2205 states and 2895 transitions. [2024-11-28 04:34:17,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-28 04:34:17,798 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:34:17,799 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:34:17,812 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e2201e-ae81-4b52-ac26-bd25afdac78a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-28 04:34:17,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e2201e-ae81-4b52-ac26-bd25afdac78a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:34:17,999 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 814 more)] === [2024-11-28 04:34:18,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:34:18,000 INFO L85 PathProgramCache]: Analyzing trace with hash 748226776, now seen corresponding path program 1 times [2024-11-28 04:34:18,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 04:34:18,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1549476492] [2024-11-28 04:34:18,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:34:18,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:34:18,000 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e2201e-ae81-4b52-ac26-bd25afdac78a/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:34:18,002 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e2201e-ae81-4b52-ac26-bd25afdac78a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:34:18,004 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e2201e-ae81-4b52-ac26-bd25afdac78a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-28 04:34:18,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:34:18,229 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-28 04:34:18,232 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:34:18,249 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 04:34:18,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:34:18,360 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 04:34:18,360 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 04:34:18,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1549476492] [2024-11-28 04:34:18,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1549476492] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:34:18,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:34:18,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 04:34:18,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044136946] [2024-11-28 04:34:18,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:34:18,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 04:34:18,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 04:34:18,361 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 04:34:18,362 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 04:34:18,362 INFO L87 Difference]: Start difference. First operand 2205 states and 2895 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:34:25,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:34:25,527 INFO L93 Difference]: Finished difference Result 2731 states and 3345 transitions. [2024-11-28 04:34:25,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 04:34:25,528 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-11-28 04:34:25,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:34:25,534 INFO L225 Difference]: With dead ends: 2731 [2024-11-28 04:34:25,534 INFO L226 Difference]: Without dead ends: 2731 [2024-11-28 04:34:25,534 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 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-28 04:34:25,535 INFO L435 NwaCegarLoop]: 1263 mSDtfsCounter, 893 mSDsluCounter, 1496 mSDsCounter, 0 mSdLazyCounter, 1857 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 898 SdHoareTripleChecker+Valid, 2759 SdHoareTripleChecker+Invalid, 1879 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1857 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.0s IncrementalHoareTripleChecker+Time [2024-11-28 04:34:25,535 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [898 Valid, 2759 Invalid, 1879 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1857 Invalid, 0 Unknown, 0 Unchecked, 7.0s Time] [2024-11-28 04:34:25,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2731 states. [2024-11-28 04:34:25,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2731 to 2321. [2024-11-28 04:34:25,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2321 states, 1631 states have (on average 1.8412017167381973) internal successors, (3003), 2307 states have internal predecessors, (3003), 17 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 11 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-28 04:34:25,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2321 states to 2321 states and 3035 transitions. [2024-11-28 04:34:25,590 INFO L78 Accepts]: Start accepts. Automaton has 2321 states and 3035 transitions. Word has length 12 [2024-11-28 04:34:25,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:34:25,590 INFO L471 AbstractCegarLoop]: Abstraction has 2321 states and 3035 transitions. [2024-11-28 04:34:25,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:34:25,590 INFO L276 IsEmpty]: Start isEmpty. Operand 2321 states and 3035 transitions. [2024-11-28 04:34:25,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-28 04:34:25,591 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:34:25,591 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:34:25,603 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e2201e-ae81-4b52-ac26-bd25afdac78a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-28 04:34:25,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e2201e-ae81-4b52-ac26-bd25afdac78a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:34:25,795 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 814 more)] === [2024-11-28 04:34:25,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:34:25,796 INFO L85 PathProgramCache]: Analyzing trace with hash -1395848739, now seen corresponding path program 1 times [2024-11-28 04:34:25,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 04:34:25,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [292093635] [2024-11-28 04:34:25,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:34:25,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:34:25,797 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e2201e-ae81-4b52-ac26-bd25afdac78a/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:34:25,800 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e2201e-ae81-4b52-ac26-bd25afdac78a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:34:25,802 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e2201e-ae81-4b52-ac26-bd25afdac78a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-28 04:34:26,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:34:26,093 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-28 04:34:26,096 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:34:26,106 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 04:34:26,459 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:34:26,459 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:34:27,168 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:34:27,169 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 04:34:27,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [292093635] [2024-11-28 04:34:27,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [292093635] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 04:34:27,169 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 04:34:27,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2024-11-28 04:34:27,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003610047] [2024-11-28 04:34:27,170 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 04:34:27,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-28 04:34:27,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 04:34:27,171 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-28 04:34:27,171 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-28 04:34:27,171 INFO L87 Difference]: Start difference. First operand 2321 states and 3035 transitions. Second operand has 8 states, 7 states have (on average 8.428571428571429) internal successors, (59), 8 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:34:44,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:34:44,484 INFO L93 Difference]: Finished difference Result 3145 states and 3921 transitions. [2024-11-28 04:34:44,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-28 04:34:44,485 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 8.428571428571429) internal successors, (59), 8 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2024-11-28 04:34:44,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:34:44,494 INFO L225 Difference]: With dead ends: 3145 [2024-11-28 04:34:44,495 INFO L226 Difference]: Without dead ends: 3145 [2024-11-28 04:34:44,495 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 54 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-28 04:34:44,496 INFO L435 NwaCegarLoop]: 1265 mSDtfsCounter, 2618 mSDsluCounter, 3126 mSDsCounter, 0 mSdLazyCounter, 3586 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2625 SdHoareTripleChecker+Valid, 4391 SdHoareTripleChecker+Invalid, 3619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 3586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.0s IncrementalHoareTripleChecker+Time [2024-11-28 04:34:44,497 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2625 Valid, 4391 Invalid, 3619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 3586 Invalid, 0 Unknown, 0 Unchecked, 17.0s Time] [2024-11-28 04:34:44,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3145 states. [2024-11-28 04:34:44,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3145 to 2487. [2024-11-28 04:34:44,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2487 states, 1797 states have (on average 1.8013355592654423) internal successors, (3237), 2473 states have internal predecessors, (3237), 17 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 11 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-28 04:34:44,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2487 states to 2487 states and 3269 transitions. [2024-11-28 04:34:44,555 INFO L78 Accepts]: Start accepts. Automaton has 2487 states and 3269 transitions. Word has length 31 [2024-11-28 04:34:44,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:34:44,556 INFO L471 AbstractCegarLoop]: Abstraction has 2487 states and 3269 transitions. [2024-11-28 04:34:44,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 8.428571428571429) internal successors, (59), 8 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:34:44,556 INFO L276 IsEmpty]: Start isEmpty. Operand 2487 states and 3269 transitions. [2024-11-28 04:34:44,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-28 04:34:44,559 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:34:44,559 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] [2024-11-28 04:34:44,575 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e2201e-ae81-4b52-ac26-bd25afdac78a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-28 04:34:44,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e2201e-ae81-4b52-ac26-bd25afdac78a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:34:44,760 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr107REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 814 more)] === [2024-11-28 04:34:44,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:34:44,761 INFO L85 PathProgramCache]: Analyzing trace with hash -1652938312, now seen corresponding path program 1 times [2024-11-28 04:34:44,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 04:34:44,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1328849626] [2024-11-28 04:34:44,761 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:34:44,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:34:44,762 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e2201e-ae81-4b52-ac26-bd25afdac78a/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:34:44,765 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e2201e-ae81-4b52-ac26-bd25afdac78a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:34:44,768 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e2201e-ae81-4b52-ac26-bd25afdac78a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-28 04:34:45,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:34:45,051 INFO L256 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-28 04:34:45,054 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:34:45,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:34:45,372 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 04:34:45,372 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 04:34:45,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1328849626] [2024-11-28 04:34:45,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1328849626] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:34:45,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:34:45,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 04:34:45,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045584613] [2024-11-28 04:34:45,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:34:45,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 04:34:45,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 04:34:45,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 04:34:45,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:34:45,374 INFO L87 Difference]: Start difference. First operand 2487 states and 3269 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:34:45,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:34:45,644 INFO L93 Difference]: Finished difference Result 2901 states and 3770 transitions. [2024-11-28 04:34:45,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 04:34:45,645 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2024-11-28 04:34:45,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:34:45,651 INFO L225 Difference]: With dead ends: 2901 [2024-11-28 04:34:45,651 INFO L226 Difference]: Without dead ends: 2901 [2024-11-28 04:34:45,652 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:34:45,652 INFO L435 NwaCegarLoop]: 1660 mSDtfsCounter, 252 mSDsluCounter, 1523 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 3183 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-28 04:34:45,653 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 3183 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-28 04:34:45,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2901 states. [2024-11-28 04:34:45,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2901 to 2708. [2024-11-28 04:34:45,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2708 states, 2018 states have (on average 1.7537165510406343) internal successors, (3539), 2694 states have internal predecessors, (3539), 17 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 11 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-28 04:34:45,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2708 states to 2708 states and 3571 transitions. [2024-11-28 04:34:45,710 INFO L78 Accepts]: Start accepts. Automaton has 2708 states and 3571 transitions. Word has length 44 [2024-11-28 04:34:45,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:34:45,711 INFO L471 AbstractCegarLoop]: Abstraction has 2708 states and 3571 transitions. [2024-11-28 04:34:45,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:34:45,711 INFO L276 IsEmpty]: Start isEmpty. Operand 2708 states and 3571 transitions. [2024-11-28 04:34:45,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-28 04:34:45,713 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:34:45,713 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:34:45,727 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e2201e-ae81-4b52-ac26-bd25afdac78a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-28 04:34:45,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e2201e-ae81-4b52-ac26-bd25afdac78a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:34:45,914 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 814 more)] === [2024-11-28 04:34:45,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:34:45,915 INFO L85 PathProgramCache]: Analyzing trace with hash -994558784, now seen corresponding path program 1 times [2024-11-28 04:34:45,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 04:34:45,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1286381226] [2024-11-28 04:34:45,915 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:34:45,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:34:45,916 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e2201e-ae81-4b52-ac26-bd25afdac78a/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:34:45,917 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e2201e-ae81-4b52-ac26-bd25afdac78a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:34:45,919 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e2201e-ae81-4b52-ac26-bd25afdac78a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-28 04:34:46,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:34:46,219 INFO L256 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-28 04:34:46,223 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:34:46,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:34:46,298 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 04:34:46,298 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 04:34:46,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1286381226] [2024-11-28 04:34:46,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1286381226] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:34:46,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:34:46,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 04:34:46,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931945157] [2024-11-28 04:34:46,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:34:46,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 04:34:46,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 04:34:46,300 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 04:34:46,300 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 04:34:46,301 INFO L87 Difference]: Start difference. First operand 2708 states and 3571 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:34:46,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:34:46,462 INFO L93 Difference]: Finished difference Result 2247 states and 2911 transitions. [2024-11-28 04:34:46,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 04:34:46,463 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2024-11-28 04:34:46,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:34:46,471 INFO L225 Difference]: With dead ends: 2247 [2024-11-28 04:34:46,472 INFO L226 Difference]: Without dead ends: 2247 [2024-11-28 04:34:46,472 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-28 04:34:46,473 INFO L435 NwaCegarLoop]: 1527 mSDtfsCounter, 56 mSDsluCounter, 2981 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 4508 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 04:34:46,473 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 4508 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 04:34:46,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2247 states. [2024-11-28 04:34:46,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2247 to 2244. [2024-11-28 04:34:46,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2244 states, 1577 states have (on average 1.823715916296766) internal successors, (2876), 2230 states have internal predecessors, (2876), 17 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 11 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-28 04:34:46,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2244 states to 2244 states and 2908 transitions. [2024-11-28 04:34:46,512 INFO L78 Accepts]: Start accepts. Automaton has 2244 states and 2908 transitions. Word has length 47 [2024-11-28 04:34:46,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:34:46,512 INFO L471 AbstractCegarLoop]: Abstraction has 2244 states and 2908 transitions. [2024-11-28 04:34:46,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:34:46,513 INFO L276 IsEmpty]: Start isEmpty. Operand 2244 states and 2908 transitions. [2024-11-28 04:34:46,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-28 04:34:46,514 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:34:46,514 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:34:46,530 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e2201e-ae81-4b52-ac26-bd25afdac78a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-11-28 04:34:46,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e2201e-ae81-4b52-ac26-bd25afdac78a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:34:46,715 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 814 more)] === [2024-11-28 04:34:46,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:34:46,716 INFO L85 PathProgramCache]: Analyzing trace with hash -1215894668, now seen corresponding path program 1 times [2024-11-28 04:34:46,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 04:34:46,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [25058398] [2024-11-28 04:34:46,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:34:46,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:34:46,718 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e2201e-ae81-4b52-ac26-bd25afdac78a/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:34:46,721 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e2201e-ae81-4b52-ac26-bd25afdac78a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:34:46,728 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e2201e-ae81-4b52-ac26-bd25afdac78a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-28 04:34:47,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:34:47,090 INFO L256 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-28 04:34:47,093 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:34:47,114 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-28 04:34:47,122 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 04:34:47,937 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:34:47,939 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-28 04:34:47,968 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-28 04:34:47,968 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-28 04:34:47,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:34:47,996 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 04:34:47,996 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 04:34:47,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [25058398] [2024-11-28 04:34:47,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [25058398] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:34:47,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:34:47,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 04:34:47,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342521037] [2024-11-28 04:34:47,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:34:47,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 04:34:47,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 04:34:47,997 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 04:34:47,997 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-28 04:34:47,998 INFO L87 Difference]: Start difference. First operand 2244 states and 2908 transitions. Second operand has 4 states, 3 states have (on average 18.333333333333332) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:34:52,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:34:52,205 INFO L93 Difference]: Finished difference Result 2160 states and 2788 transitions. [2024-11-28 04:34:52,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 04:34:52,205 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 18.333333333333332) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2024-11-28 04:34:52,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:34:52,213 INFO L225 Difference]: With dead ends: 2160 [2024-11-28 04:34:52,213 INFO L226 Difference]: Without dead ends: 2160 [2024-11-28 04:34:52,214 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-28 04:34:52,214 INFO L435 NwaCegarLoop]: 653 mSDtfsCounter, 1149 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 1110 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1160 SdHoareTripleChecker+Valid, 837 SdHoareTripleChecker+Invalid, 1201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 1110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-11-28 04:34:52,214 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1160 Valid, 837 Invalid, 1201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 1110 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2024-11-28 04:34:52,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2160 states. [2024-11-28 04:34:52,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2160 to 1810. [2024-11-28 04:34:52,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1810 states, 1227 states have (on average 1.7114914425427872) internal successors, (2100), 1796 states have internal predecessors, (2100), 17 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 11 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-28 04:34:52,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1810 states to 1810 states and 2132 transitions. [2024-11-28 04:34:52,244 INFO L78 Accepts]: Start accepts. Automaton has 1810 states and 2132 transitions. Word has length 55 [2024-11-28 04:34:52,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:34:52,244 INFO L471 AbstractCegarLoop]: Abstraction has 1810 states and 2132 transitions. [2024-11-28 04:34:52,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 18.333333333333332) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:34:52,244 INFO L276 IsEmpty]: Start isEmpty. Operand 1810 states and 2132 transitions. [2024-11-28 04:34:52,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-28 04:34:52,245 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:34:52,245 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:34:52,262 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e2201e-ae81-4b52-ac26-bd25afdac78a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-11-28 04:34:52,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e2201e-ae81-4b52-ac26-bd25afdac78a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:34:52,446 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 814 more)] === [2024-11-28 04:34:52,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:34:52,447 INFO L85 PathProgramCache]: Analyzing trace with hash -474771177, now seen corresponding path program 1 times [2024-11-28 04:34:52,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 04:34:52,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1088678087] [2024-11-28 04:34:52,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:34:52,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:34:52,450 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e2201e-ae81-4b52-ac26-bd25afdac78a/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:34:52,452 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e2201e-ae81-4b52-ac26-bd25afdac78a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:34:52,457 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e2201e-ae81-4b52-ac26-bd25afdac78a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-28 04:34:52,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:34:52,793 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-28 04:34:52,797 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:34:52,804 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-28 04:34:52,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 19 treesize of output 1 [2024-11-28 04:34:52,887 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-28 04:34:52,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:34:52,903 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 04:34:52,903 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 04:34:52,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1088678087] [2024-11-28 04:34:52,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1088678087] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:34:52,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:34:52,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 04:34:52,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004465812] [2024-11-28 04:34:52,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:34:52,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 04:34:52,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 04:34:52,904 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 04:34:52,905 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 04:34:52,905 INFO L87 Difference]: Start difference. First operand 1810 states and 2132 transitions. Second operand has 5 states, 4 states have (on average 15.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:34:57,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:34:57,914 INFO L93 Difference]: Finished difference Result 1809 states and 2130 transitions. [2024-11-28 04:34:57,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 04:34:57,915 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 15.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2024-11-28 04:34:57,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:34:57,923 INFO L225 Difference]: With dead ends: 1809 [2024-11-28 04:34:57,923 INFO L226 Difference]: Without dead ends: 1809 [2024-11-28 04:34:57,924 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-28 04:34:57,924 INFO L435 NwaCegarLoop]: 1454 mSDtfsCounter, 2 mSDsluCounter, 2316 mSDsCounter, 0 mSdLazyCounter, 2053 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 3770 SdHoareTripleChecker+Invalid, 2054 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2053 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2024-11-28 04:34:57,925 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 3770 Invalid, 2054 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2053 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2024-11-28 04:34:57,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1809 states. [2024-11-28 04:34:57,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1809 to 1809. [2024-11-28 04:34:57,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1809 states, 1227 states have (on average 1.7098614506927465) internal successors, (2098), 1795 states have internal predecessors, (2098), 17 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 11 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-28 04:34:57,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1809 states to 1809 states and 2130 transitions. [2024-11-28 04:34:57,954 INFO L78 Accepts]: Start accepts. Automaton has 1809 states and 2130 transitions. Word has length 60 [2024-11-28 04:34:57,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:34:57,955 INFO L471 AbstractCegarLoop]: Abstraction has 1809 states and 2130 transitions. [2024-11-28 04:34:57,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 15.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:34:57,955 INFO L276 IsEmpty]: Start isEmpty. Operand 1809 states and 2130 transitions. [2024-11-28 04:34:57,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-28 04:34:57,956 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:34:57,956 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:34:57,974 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e2201e-ae81-4b52-ac26-bd25afdac78a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-28 04:34:58,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e2201e-ae81-4b52-ac26-bd25afdac78a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:34:58,157 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 814 more)] === [2024-11-28 04:34:58,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:34:58,157 INFO L85 PathProgramCache]: Analyzing trace with hash -474771176, now seen corresponding path program 1 times [2024-11-28 04:34:58,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 04:34:58,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [399942455] [2024-11-28 04:34:58,158 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:34:58,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:34:58,158 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e2201e-ae81-4b52-ac26-bd25afdac78a/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:34:58,160 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e2201e-ae81-4b52-ac26-bd25afdac78a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:34:58,162 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e2201e-ae81-4b52-ac26-bd25afdac78a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-28 04:34:58,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:34:58,508 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-28 04:34:58,511 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:34:58,526 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 04:34:58,556 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-28 04:34:58,574 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-28 04:34:58,641 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-11-28 04:34:58,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:34:58,672 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 04:34:58,672 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 04:34:58,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [399942455] [2024-11-28 04:34:58,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [399942455] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:34:58,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:34:58,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 04:34:58,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177533219] [2024-11-28 04:34:58,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:34:58,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 04:34:58,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 04:34:58,674 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 04:34:58,674 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 04:34:58,674 INFO L87 Difference]: Start difference. First operand 1809 states and 2130 transitions. Second operand has 5 states, 4 states have (on average 15.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:35:05,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:35:05,344 INFO L93 Difference]: Finished difference Result 1808 states and 2128 transitions. [2024-11-28 04:35:05,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 04:35:05,345 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 15.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2024-11-28 04:35:05,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:35:05,351 INFO L225 Difference]: With dead ends: 1808 [2024-11-28 04:35:05,351 INFO L226 Difference]: Without dead ends: 1808 [2024-11-28 04:35:05,351 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-28 04:35:05,352 INFO L435 NwaCegarLoop]: 1454 mSDtfsCounter, 1 mSDsluCounter, 2351 mSDsCounter, 0 mSdLazyCounter, 2015 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 3805 SdHoareTripleChecker+Invalid, 2016 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2015 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2024-11-28 04:35:05,352 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 3805 Invalid, 2016 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2015 Invalid, 0 Unknown, 0 Unchecked, 6.6s Time] [2024-11-28 04:35:05,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1808 states. [2024-11-28 04:35:05,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1808 to 1808. [2024-11-28 04:35:05,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1808 states, 1225 states have (on average 1.7110204081632654) internal successors, (2096), 1794 states have internal predecessors, (2096), 17 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 11 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-28 04:35:05,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1808 states to 1808 states and 2128 transitions. [2024-11-28 04:35:05,383 INFO L78 Accepts]: Start accepts. Automaton has 1808 states and 2128 transitions. Word has length 60 [2024-11-28 04:35:05,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:35:05,383 INFO L471 AbstractCegarLoop]: Abstraction has 1808 states and 2128 transitions. [2024-11-28 04:35:05,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 15.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:35:05,384 INFO L276 IsEmpty]: Start isEmpty. Operand 1808 states and 2128 transitions. [2024-11-28 04:35:05,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-28 04:35:05,385 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:35:05,385 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:35:05,403 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e2201e-ae81-4b52-ac26-bd25afdac78a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-11-28 04:35:05,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e2201e-ae81-4b52-ac26-bd25afdac78a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:35:05,586 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 814 more)] === [2024-11-28 04:35:05,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:35:05,586 INFO L85 PathProgramCache]: Analyzing trace with hash 1068454494, now seen corresponding path program 1 times [2024-11-28 04:35:05,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 04:35:05,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [411925281] [2024-11-28 04:35:05,587 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:35:05,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:35:05,588 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e2201e-ae81-4b52-ac26-bd25afdac78a/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:35:05,590 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e2201e-ae81-4b52-ac26-bd25afdac78a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:35:05,593 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e2201e-ae81-4b52-ac26-bd25afdac78a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-28 04:35:05,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:35:05,901 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-28 04:35:05,904 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:35:05,918 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-28 04:35:06,055 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-28 04:35:06,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:35:06,082 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 04:35:06,082 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 04:35:06,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [411925281] [2024-11-28 04:35:06,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [411925281] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:35:06,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:35:06,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-28 04:35:06,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71254364] [2024-11-28 04:35:06,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:35:06,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-28 04:35:06,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 04:35:06,086 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-28 04:35:06,087 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-28 04:35:06,087 INFO L87 Difference]: Start difference. First operand 1808 states and 2128 transitions. Second operand has 7 states, 5 states have (on average 13.2) internal successors, (66), 6 states have internal predecessors, (66), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 04:35:12,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:35:12,224 INFO L93 Difference]: Finished difference Result 1826 states and 2159 transitions. [2024-11-28 04:35:12,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-28 04:35:12,225 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 13.2) internal successors, (66), 6 states have internal predecessors, (66), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 68 [2024-11-28 04:35:12,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:35:12,232 INFO L225 Difference]: With dead ends: 1826 [2024-11-28 04:35:12,233 INFO L226 Difference]: Without dead ends: 1826 [2024-11-28 04:35:12,233 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-28 04:35:12,234 INFO L435 NwaCegarLoop]: 1436 mSDtfsCounter, 13 mSDsluCounter, 3850 mSDsCounter, 0 mSdLazyCounter, 1996 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 5286 SdHoareTripleChecker+Invalid, 2009 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1996 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2024-11-28 04:35:12,234 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 5286 Invalid, 2009 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [13 Valid, 1996 Invalid, 0 Unknown, 0 Unchecked, 6.0s Time] [2024-11-28 04:35:12,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1826 states. [2024-11-28 04:35:12,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1826 to 1817. [2024-11-28 04:35:12,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1817 states, 1233 states have (on average 1.7088402270884022) internal successors, (2107), 1801 states have internal predecessors, (2107), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (25), 13 states have call predecessors, (25), 15 states have call successors, (25) [2024-11-28 04:35:12,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1817 states to 1817 states and 2149 transitions. [2024-11-28 04:35:12,273 INFO L78 Accepts]: Start accepts. Automaton has 1817 states and 2149 transitions. Word has length 68 [2024-11-28 04:35:12,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:35:12,274 INFO L471 AbstractCegarLoop]: Abstraction has 1817 states and 2149 transitions. [2024-11-28 04:35:12,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 13.2) internal successors, (66), 6 states have internal predecessors, (66), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 04:35:12,274 INFO L276 IsEmpty]: Start isEmpty. Operand 1817 states and 2149 transitions. [2024-11-28 04:35:12,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-28 04:35:12,275 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:35:12,275 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:35:12,293 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e2201e-ae81-4b52-ac26-bd25afdac78a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2024-11-28 04:35:12,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e2201e-ae81-4b52-ac26-bd25afdac78a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:35:12,476 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 814 more)] === [2024-11-28 04:35:12,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:35:12,476 INFO L85 PathProgramCache]: Analyzing trace with hash 1068454495, now seen corresponding path program 1 times [2024-11-28 04:35:12,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 04:35:12,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1092001394] [2024-11-28 04:35:12,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:35:12,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:35:12,477 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e2201e-ae81-4b52-ac26-bd25afdac78a/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:35:12,479 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e2201e-ae81-4b52-ac26-bd25afdac78a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:35:12,483 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e2201e-ae81-4b52-ac26-bd25afdac78a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-28 04:35:12,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:35:12,834 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-28 04:35:12,836 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:35:12,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:35:12,859 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 04:35:12,859 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 04:35:12,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1092001394] [2024-11-28 04:35:12,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1092001394] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:35:12,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:35:12,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 04:35:12,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29499203] [2024-11-28 04:35:12,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:35:12,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 04:35:12,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 04:35:12,861 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 04:35:12,861 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 04:35:12,861 INFO L87 Difference]: Start difference. First operand 1817 states and 2149 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 04:35:12,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:35:12,954 INFO L93 Difference]: Finished difference Result 1811 states and 2133 transitions. [2024-11-28 04:35:12,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 04:35:12,955 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 68 [2024-11-28 04:35:12,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:35:12,962 INFO L225 Difference]: With dead ends: 1811 [2024-11-28 04:35:12,962 INFO L226 Difference]: Without dead ends: 1811 [2024-11-28 04:35:12,962 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 04:35:12,963 INFO L435 NwaCegarLoop]: 1453 mSDtfsCounter, 0 mSDsluCounter, 2898 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4351 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 04:35:12,963 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4351 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 04:35:12,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1811 states. [2024-11-28 04:35:12,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1811 to 1811. [2024-11-28 04:35:12,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1811 states, 1227 states have (on average 1.7106764466177669) internal successors, (2099), 1797 states have internal predecessors, (2099), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (17), 11 states have call predecessors, (17), 15 states have call successors, (17) [2024-11-28 04:35:12,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1811 states to 1811 states and 2133 transitions. [2024-11-28 04:35:12,999 INFO L78 Accepts]: Start accepts. Automaton has 1811 states and 2133 transitions. Word has length 68 [2024-11-28 04:35:12,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:35:12,999 INFO L471 AbstractCegarLoop]: Abstraction has 1811 states and 2133 transitions. [2024-11-28 04:35:12,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 04:35:12,999 INFO L276 IsEmpty]: Start isEmpty. Operand 1811 states and 2133 transitions. [2024-11-28 04:35:13,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-28 04:35:13,000 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:35:13,001 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:35:13,021 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e2201e-ae81-4b52-ac26-bd25afdac78a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-11-28 04:35:13,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e2201e-ae81-4b52-ac26-bd25afdac78a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:35:13,202 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 814 more)] === [2024-11-28 04:35:13,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:35:13,202 INFO L85 PathProgramCache]: Analyzing trace with hash -1069331825, now seen corresponding path program 1 times [2024-11-28 04:35:13,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 04:35:13,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [619303151] [2024-11-28 04:35:13,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:35:13,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:35:13,203 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e2201e-ae81-4b52-ac26-bd25afdac78a/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:35:13,207 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e2201e-ae81-4b52-ac26-bd25afdac78a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:35:13,212 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e2201e-ae81-4b52-ac26-bd25afdac78a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-11-28 04:35:13,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:35:13,627 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-28 04:35:13,629 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:35:13,678 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:35:13,678 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:35:13,790 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:35:13,790 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 04:35:13,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [619303151] [2024-11-28 04:35:13,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [619303151] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 04:35:13,791 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 04:35:13,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-28 04:35:13,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551281353] [2024-11-28 04:35:13,791 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 04:35:13,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-28 04:35:13,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 04:35:13,792 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-28 04:35:13,793 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-28 04:35:13,794 INFO L87 Difference]: Start difference. First operand 1811 states and 2133 transitions. Second operand has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-28 04:35:14,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:35:14,042 INFO L93 Difference]: Finished difference Result 1823 states and 2151 transitions. [2024-11-28 04:35:14,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-28 04:35:14,043 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 69 [2024-11-28 04:35:14,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:35:14,048 INFO L225 Difference]: With dead ends: 1823 [2024-11-28 04:35:14,049 INFO L226 Difference]: Without dead ends: 1823 [2024-11-28 04:35:14,049 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2024-11-28 04:35:14,049 INFO L435 NwaCegarLoop]: 1452 mSDtfsCounter, 5 mSDsluCounter, 4342 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 5794 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-28 04:35:14,050 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 5794 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-28 04:35:14,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1823 states. [2024-11-28 04:35:14,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1823 to 1821. [2024-11-28 04:35:14,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1821 states, 1236 states have (on average 1.7103559870550162) internal successors, (2114), 1806 states have internal predecessors, (2114), 17 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 11 states have call predecessors, (17), 15 states have call successors, (17) [2024-11-28 04:35:14,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1821 states to 1821 states and 2148 transitions. [2024-11-28 04:35:14,083 INFO L78 Accepts]: Start accepts. Automaton has 1821 states and 2148 transitions. Word has length 69 [2024-11-28 04:35:14,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:35:14,083 INFO L471 AbstractCegarLoop]: Abstraction has 1821 states and 2148 transitions. [2024-11-28 04:35:14,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-28 04:35:14,083 INFO L276 IsEmpty]: Start isEmpty. Operand 1821 states and 2148 transitions. [2024-11-28 04:35:14,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-28 04:35:14,084 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:35:14,084 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:35:14,104 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e2201e-ae81-4b52-ac26-bd25afdac78a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2024-11-28 04:35:14,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e2201e-ae81-4b52-ac26-bd25afdac78a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:35:14,285 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 814 more)] === [2024-11-28 04:35:14,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:35:14,286 INFO L85 PathProgramCache]: Analyzing trace with hash -1056680290, now seen corresponding path program 2 times [2024-11-28 04:35:14,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 04:35:14,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [770608587] [2024-11-28 04:35:14,287 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 04:35:14,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:35:14,287 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e2201e-ae81-4b52-ac26-bd25afdac78a/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:35:14,290 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e2201e-ae81-4b52-ac26-bd25afdac78a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:35:14,293 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e2201e-ae81-4b52-ac26-bd25afdac78a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-11-28 04:35:31,985 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 04:35:31,985 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 04:35:32,001 INFO L256 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-28 04:35:32,004 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:35:32,010 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-28 04:35:32,186 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-28 04:35:32,186 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-28 04:35:32,213 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-28 04:35:32,522 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:35:32,523 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2024-11-28 04:35:32,594 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2024-11-28 04:35:32,638 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-28 04:35:32,638 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:35:32,782 INFO L349 Elim1Store]: treesize reduction 7, result has 63.2 percent of original size [2024-11-28 04:35:32,782 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2024-11-28 04:35:32,874 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 04:35:32,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [770608587] [2024-11-28 04:35:32,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [770608587] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:35:32,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1100620258] [2024-11-28 04:35:32,874 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 04:35:32,874 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-28 04:35:32,874 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e2201e-ae81-4b52-ac26-bd25afdac78a/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 [2024-11-28 04:35:32,879 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e2201e-ae81-4b52-ac26-bd25afdac78a/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-28 04:35:32,881 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e2201e-ae81-4b52-ac26-bd25afdac78a/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (19)] Waiting until timeout for monitored process [2024-11-28 04:35:34,650 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 04:35:34,651 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 04:35:34,709 INFO L256 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-28 04:35:34,712 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:35:34,966 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:35:34,966 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:35:35,462 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:35:35,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1100620258] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 04:35:35,462 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 04:35:35,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 23 [2024-11-28 04:35:35,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213918872] [2024-11-28 04:35:35,463 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 04:35:35,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-28 04:35:35,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 04:35:35,464 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-28 04:35:35,464 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=504, Unknown=7, NotChecked=0, Total=600 [2024-11-28 04:35:35,465 INFO L87 Difference]: Start difference. First operand 1821 states and 2148 transitions. Second operand has 23 states, 22 states have (on average 6.454545454545454) internal successors, (142), 22 states have internal predecessors, (142), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-28 04:35:57,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:35:57,513 INFO L93 Difference]: Finished difference Result 1837 states and 2170 transitions. [2024-11-28 04:35:57,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-11-28 04:35:57,513 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 6.454545454545454) internal successors, (142), 22 states have internal predecessors, (142), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 72 [2024-11-28 04:35:57,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:35:57,517 INFO L225 Difference]: With dead ends: 1837 [2024-11-28 04:35:57,517 INFO L226 Difference]: Without dead ends: 1831 [2024-11-28 04:35:57,518 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 436 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=389, Invalid=2052, Unknown=9, NotChecked=0, Total=2450 [2024-11-28 04:35:57,519 INFO L435 NwaCegarLoop]: 872 mSDtfsCounter, 1168 mSDsluCounter, 10816 mSDsCounter, 0 mSdLazyCounter, 9223 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1180 SdHoareTripleChecker+Valid, 11688 SdHoareTripleChecker+Invalid, 9276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 9223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.5s IncrementalHoareTripleChecker+Time [2024-11-28 04:35:57,519 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1180 Valid, 11688 Invalid, 9276 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [53 Valid, 9223 Invalid, 0 Unknown, 0 Unchecked, 20.5s Time] [2024-11-28 04:35:57,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1831 states. [2024-11-28 04:35:57,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1831 to 1829. [2024-11-28 04:35:57,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1829 states, 1245 states have (on average 1.7052208835341365) internal successors, (2123), 1814 states have internal predecessors, (2123), 17 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 11 states have call predecessors, (17), 15 states have call successors, (17) [2024-11-28 04:35:57,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1829 states to 1829 states and 2157 transitions. [2024-11-28 04:35:57,558 INFO L78 Accepts]: Start accepts. Automaton has 1829 states and 2157 transitions. Word has length 72 [2024-11-28 04:35:57,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:35:57,558 INFO L471 AbstractCegarLoop]: Abstraction has 1829 states and 2157 transitions. [2024-11-28 04:35:57,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 6.454545454545454) internal successors, (142), 22 states have internal predecessors, (142), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-28 04:35:57,559 INFO L276 IsEmpty]: Start isEmpty. Operand 1829 states and 2157 transitions. [2024-11-28 04:35:57,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-28 04:35:57,560 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:35:57,560 INFO L218 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:35:57,595 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e2201e-ae81-4b52-ac26-bd25afdac78a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2024-11-28 04:35:57,767 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e2201e-ae81-4b52-ac26-bd25afdac78a/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (19)] Forceful destruction successful, exit code 0 [2024-11-28 04:35:57,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e2201e-ae81-4b52-ac26-bd25afdac78a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e2201e-ae81-4b52-ac26-bd25afdac78a/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt [2024-11-28 04:35:57,961 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 814 more)] === [2024-11-28 04:35:57,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:35:57,961 INFO L85 PathProgramCache]: Analyzing trace with hash 308551935, now seen corresponding path program 1 times [2024-11-28 04:35:57,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 04:35:57,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [649397505] [2024-11-28 04:35:57,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:35:57,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:35:57,962 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e2201e-ae81-4b52-ac26-bd25afdac78a/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:35:57,964 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e2201e-ae81-4b52-ac26-bd25afdac78a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:35:57,965 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e2201e-ae81-4b52-ac26-bd25afdac78a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2024-11-28 04:35:58,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:35:58,391 INFO L256 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-28 04:35:58,393 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:35:58,607 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:35:58,607 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:35:59,436 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:35:59,437 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 04:35:59,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [649397505] [2024-11-28 04:35:59,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [649397505] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 04:35:59,437 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 04:35:59,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-11-28 04:35:59,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996046985] [2024-11-28 04:35:59,437 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 04:35:59,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-28 04:35:59,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 04:35:59,438 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-28 04:35:59,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-11-28 04:35:59,439 INFO L87 Difference]: Start difference. First operand 1829 states and 2157 transitions. Second operand has 26 states, 26 states have (on average 3.423076923076923) internal successors, (89), 26 states have internal predecessors, (89), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-28 04:36:02,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:36:02,159 INFO L93 Difference]: Finished difference Result 1853 states and 2196 transitions. [2024-11-28 04:36:02,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-11-28 04:36:02,160 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.423076923076923) internal successors, (89), 26 states have internal predecessors, (89), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 78 [2024-11-28 04:36:02,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:36:02,163 INFO L225 Difference]: With dead ends: 1853 [2024-11-28 04:36:02,164 INFO L226 Difference]: Without dead ends: 1847 [2024-11-28 04:36:02,164 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=728, Invalid=1434, Unknown=0, NotChecked=0, Total=2162 [2024-11-28 04:36:02,165 INFO L435 NwaCegarLoop]: 1452 mSDtfsCounter, 24 mSDsluCounter, 18816 mSDsCounter, 0 mSdLazyCounter, 622 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 20268 SdHoareTripleChecker+Invalid, 669 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 622 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-28 04:36:02,165 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 20268 Invalid, 669 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 622 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-28 04:36:02,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1847 states. [2024-11-28 04:36:02,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1847 to 1847. [2024-11-28 04:36:02,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1847 states, 1263 states have (on average 1.6991290577988916) internal successors, (2146), 1832 states have internal predecessors, (2146), 17 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 11 states have call predecessors, (17), 15 states have call successors, (17) [2024-11-28 04:36:02,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1847 states to 1847 states and 2180 transitions. [2024-11-28 04:36:02,193 INFO L78 Accepts]: Start accepts. Automaton has 1847 states and 2180 transitions. Word has length 78 [2024-11-28 04:36:02,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:36:02,194 INFO L471 AbstractCegarLoop]: Abstraction has 1847 states and 2180 transitions. [2024-11-28 04:36:02,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.423076923076923) internal successors, (89), 26 states have internal predecessors, (89), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-28 04:36:02,194 INFO L276 IsEmpty]: Start isEmpty. Operand 1847 states and 2180 transitions. [2024-11-28 04:36:02,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-28 04:36:02,195 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:36:02,195 INFO L218 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:36:02,214 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e2201e-ae81-4b52-ac26-bd25afdac78a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2024-11-28 04:36:02,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e2201e-ae81-4b52-ac26-bd25afdac78a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:36:02,396 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 814 more)] === [2024-11-28 04:36:02,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:36:02,396 INFO L85 PathProgramCache]: Analyzing trace with hash 817749439, now seen corresponding path program 2 times [2024-11-28 04:36:02,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 04:36:02,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1540674878] [2024-11-28 04:36:02,397 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 04:36:02,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:36:02,397 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e2201e-ae81-4b52-ac26-bd25afdac78a/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:36:02,399 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e2201e-ae81-4b52-ac26-bd25afdac78a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:36:02,401 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e2201e-ae81-4b52-ac26-bd25afdac78a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2024-11-28 04:36:14,881 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 04:36:14,881 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 04:36:14,902 INFO L256 TraceCheckSpWp]: Trace formula consists of 533 conjuncts, 64 conjuncts are in the unsatisfiable core [2024-11-28 04:36:14,912 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:36:14,918 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-28 04:36:15,124 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-28 04:36:15,125 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-28 04:36:15,135 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 04:36:15,175 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-28 04:36:15,183 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-28 04:36:15,338 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-28 04:36:15,345 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-28 04:36:15,923 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:36:15,923 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-28 04:36:15,940 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-28 04:36:15,996 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-28 04:36:16,006 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-28 04:36:16,031 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2024-11-28 04:36:16,032 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:36:16,707 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_1534 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1535 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv20 32) (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_1535) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_1534) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_1535 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_1535) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv16 32) .cse1) (bvadd (_ bv20 32) .cse1)))))) is different from false [2024-11-28 04:36:16,716 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 04:36:16,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1540674878] [2024-11-28 04:36:16,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1540674878] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:36:16,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [229250719] [2024-11-28 04:36:16,716 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 04:36:16,716 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-28 04:36:16,716 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e2201e-ae81-4b52-ac26-bd25afdac78a/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 [2024-11-28 04:36:16,722 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e2201e-ae81-4b52-ac26-bd25afdac78a/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-28 04:36:16,723 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e2201e-ae81-4b52-ac26-bd25afdac78a/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (22)] Waiting until timeout for monitored process [2024-11-28 04:36:18,555 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 04:36:18,556 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 04:36:18,602 INFO L256 TraceCheckSpWp]: Trace formula consists of 533 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-11-28 04:36:18,604 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:36:20,161 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:36:20,161 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:36:23,941 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:36:23,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [229250719] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 04:36:23,942 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 04:36:23,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 26, 26] total 57 [2024-11-28 04:36:23,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267093831] [2024-11-28 04:36:23,942 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 04:36:23,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2024-11-28 04:36:23,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 04:36:23,944 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2024-11-28 04:36:23,945 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=697, Invalid=2728, Unknown=1, NotChecked=114, Total=3540 [2024-11-28 04:36:23,946 INFO L87 Difference]: Start difference. First operand 1847 states and 2180 transitions. Second operand has 57 states, 56 states have (on average 3.1785714285714284) internal successors, (178), 57 states have internal predecessors, (178), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-28 04:37:41,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:37:41,334 INFO L93 Difference]: Finished difference Result 1949 states and 2337 transitions. [2024-11-28 04:37:41,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2024-11-28 04:37:41,335 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 56 states have (on average 3.1785714285714284) internal successors, (178), 57 states have internal predecessors, (178), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 90 [2024-11-28 04:37:41,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:37:41,342 INFO L225 Difference]: With dead ends: 1949 [2024-11-28 04:37:41,342 INFO L226 Difference]: Without dead ends: 1933 [2024-11-28 04:37:41,347 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 370 GetRequests, 214 SyntacticMatches, 1 SemanticMatches, 155 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 6022 ImplicationChecksByTransitivity, 24.2s TimeCoverageRelationStatistics Valid=5446, Invalid=18737, Unknown=1, NotChecked=308, Total=24492 [2024-11-28 04:37:41,348 INFO L435 NwaCegarLoop]: 880 mSDtfsCounter, 1186 mSDsluCounter, 24249 mSDsCounter, 0 mSdLazyCounter, 22579 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 51.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1196 SdHoareTripleChecker+Valid, 25129 SdHoareTripleChecker+Invalid, 22655 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.3s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 22579 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 57.0s IncrementalHoareTripleChecker+Time [2024-11-28 04:37:41,348 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1196 Valid, 25129 Invalid, 22655 Unknown, 0 Unchecked, 0.3s Time], IncrementalHoareTripleChecker [76 Valid, 22579 Invalid, 0 Unknown, 0 Unchecked, 57.0s Time] [2024-11-28 04:37:41,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1933 states. [2024-11-28 04:37:41,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1933 to 1933. [2024-11-28 04:37:41,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1933 states, 1349 states have (on average 1.6634544106745737) internal successors, (2244), 1917 states have internal predecessors, (2244), 17 states have call successors, (17), 5 states have call predecessors, (17), 5 states have return successors, (17), 11 states have call predecessors, (17), 15 states have call successors, (17) [2024-11-28 04:37:41,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1933 states to 1933 states and 2278 transitions. [2024-11-28 04:37:41,398 INFO L78 Accepts]: Start accepts. Automaton has 1933 states and 2278 transitions. Word has length 90 [2024-11-28 04:37:41,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:37:41,399 INFO L471 AbstractCegarLoop]: Abstraction has 1933 states and 2278 transitions. [2024-11-28 04:37:41,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 56 states have (on average 3.1785714285714284) internal successors, (178), 57 states have internal predecessors, (178), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-28 04:37:41,399 INFO L276 IsEmpty]: Start isEmpty. Operand 1933 states and 2278 transitions. [2024-11-28 04:37:41,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-28 04:37:41,400 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:37:41,400 INFO L218 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:37:41,430 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e2201e-ae81-4b52-ac26-bd25afdac78a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2024-11-28 04:37:41,613 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e2201e-ae81-4b52-ac26-bd25afdac78a/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (22)] Ended with exit code 0 [2024-11-28 04:37:41,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e2201e-ae81-4b52-ac26-bd25afdac78a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e2201e-ae81-4b52-ac26-bd25afdac78a/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt [2024-11-28 04:37:41,801 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr74REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 814 more)] === [2024-11-28 04:37:41,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:37:41,802 INFO L85 PathProgramCache]: Analyzing trace with hash -1958275909, now seen corresponding path program 1 times [2024-11-28 04:37:41,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 04:37:41,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [636828698] [2024-11-28 04:37:41,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:37:41,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:37:41,803 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e2201e-ae81-4b52-ac26-bd25afdac78a/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:37:41,804 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e2201e-ae81-4b52-ac26-bd25afdac78a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:37:41,805 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e2201e-ae81-4b52-ac26-bd25afdac78a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2024-11-28 04:37:42,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:37:42,354 INFO L256 TraceCheckSpWp]: Trace formula consists of 795 conjuncts, 58 conjuncts are in the unsatisfiable core [2024-11-28 04:37:42,363 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:37:42,367 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-28 04:37:42,506 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-28 04:37:42,506 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-28 04:37:42,528 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-28 04:37:42,949 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:37:42,949 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-11-28 04:37:43,013 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:37:43,013 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2024-11-28 04:37:43,071 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2024-11-28 04:37:43,103 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-28 04:37:43,103 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:37:43,154 INFO L349 Elim1Store]: treesize reduction 7, result has 63.2 percent of original size [2024-11-28 04:37:43,155 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2024-11-28 04:37:43,162 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2164 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_2164) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)) |c_ULTIMATE.start_main_#t~mem34#1.base|)) is different from false [2024-11-28 04:37:43,171 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2164 (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$#0.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (= .cse0 (select (select (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_2164) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) is different from false [2024-11-28 04:37:43,616 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2164 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2210 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_2210)) (.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_2164) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))) is different from false [2024-11-28 04:37:43,618 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 04:37:43,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [636828698] [2024-11-28 04:37:43,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [636828698] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:37:43,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2010091937] [2024-11-28 04:37:43,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:37:43,619 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-28 04:37:43,619 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e2201e-ae81-4b52-ac26-bd25afdac78a/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 [2024-11-28 04:37:43,621 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e2201e-ae81-4b52-ac26-bd25afdac78a/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-28 04:37:43,622 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e2201e-ae81-4b52-ac26-bd25afdac78a/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (24)] Waiting until timeout for monitored process [2024-11-28 04:37:45,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:37:45,790 INFO L256 TraceCheckSpWp]: Trace formula consists of 795 conjuncts, 62 conjuncts are in the unsatisfiable core [2024-11-28 04:37:45,801 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:37:45,811 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-28 04:37:46,020 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-28 04:37:46,021 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2024-11-28 04:37:46,084 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-28 04:37:46,310 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-28 04:37:47,580 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:37:47,580 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2024-11-28 04:37:47,830 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:37:47,830 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2024-11-28 04:37:47,862 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2024-11-28 04:37:47,930 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-28 04:37:47,930 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:37:47,952 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2618 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_2618) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))))) is different from false [2024-11-28 04:37:47,963 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2618 (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$#0.base| (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_2618) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-28 04:37:48,483 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2618 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2664 (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$#0.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_2664))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2618)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-28 04:37:48,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2010091937] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:37:48,485 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 04:37:48,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2024-11-28 04:37:48,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753650964] [2024-11-28 04:37:48,486 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 04:37:48,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-28 04:37:48,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 04:37:48,487 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-28 04:37:48,487 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=285, Unknown=6, NotChecked=234, Total=600 [2024-11-28 04:37:48,487 INFO L87 Difference]: Start difference. First operand 1933 states and 2278 transitions. Second operand has 18 states, 15 states have (on average 5.933333333333334) internal successors, (89), 18 states have internal predecessors, (89), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 04:38:08,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:38:08,516 INFO L93 Difference]: Finished difference Result 1934 states and 2279 transitions. [2024-11-28 04:38:08,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-28 04:38:08,517 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 15 states have (on average 5.933333333333334) internal successors, (89), 18 states have internal predecessors, (89), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 115 [2024-11-28 04:38:08,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:38:08,521 INFO L225 Difference]: With dead ends: 1934 [2024-11-28 04:38:08,521 INFO L226 Difference]: Without dead ends: 1934 [2024-11-28 04:38:08,521 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 218 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=84, Invalid=314, Unknown=6, NotChecked=246, Total=650 [2024-11-28 04:38:08,522 INFO L435 NwaCegarLoop]: 874 mSDtfsCounter, 1150 mSDsluCounter, 8624 mSDsCounter, 0 mSdLazyCounter, 8210 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1162 SdHoareTripleChecker+Valid, 9498 SdHoareTripleChecker+Invalid, 8241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 8210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 19.7s IncrementalHoareTripleChecker+Time [2024-11-28 04:38:08,522 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1162 Valid, 9498 Invalid, 8241 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [31 Valid, 8210 Invalid, 0 Unknown, 0 Unchecked, 19.7s Time] [2024-11-28 04:38:08,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1934 states. [2024-11-28 04:38:08,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1934 to 1932. [2024-11-28 04:38:08,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1932 states, 1349 states have (on average 1.6619718309859155) internal successors, (2242), 1916 states have internal predecessors, (2242), 17 states have call successors, (17), 5 states have call predecessors, (17), 5 states have return successors, (17), 11 states have call predecessors, (17), 15 states have call successors, (17) [2024-11-28 04:38:08,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1932 states to 1932 states and 2276 transitions. [2024-11-28 04:38:08,552 INFO L78 Accepts]: Start accepts. Automaton has 1932 states and 2276 transitions. Word has length 115 [2024-11-28 04:38:08,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:38:08,553 INFO L471 AbstractCegarLoop]: Abstraction has 1932 states and 2276 transitions. [2024-11-28 04:38:08,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 15 states have (on average 5.933333333333334) internal successors, (89), 18 states have internal predecessors, (89), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 04:38:08,553 INFO L276 IsEmpty]: Start isEmpty. Operand 1932 states and 2276 transitions. [2024-11-28 04:38:08,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-28 04:38:08,554 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:38:08,555 INFO L218 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:38:08,571 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e2201e-ae81-4b52-ac26-bd25afdac78a/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (24)] Forceful destruction successful, exit code 0 [2024-11-28 04:38:08,777 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e2201e-ae81-4b52-ac26-bd25afdac78a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2024-11-28 04:38:08,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e2201e-ae81-4b52-ac26-bd25afdac78a/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt,23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e2201e-ae81-4b52-ac26-bd25afdac78a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:38:08,956 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 814 more)] === [2024-11-28 04:38:08,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:38:08,956 INFO L85 PathProgramCache]: Analyzing trace with hash -1958275908, now seen corresponding path program 1 times [2024-11-28 04:38:08,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 04:38:08,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1471476193] [2024-11-28 04:38:08,957 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:38:08,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:38:08,957 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e2201e-ae81-4b52-ac26-bd25afdac78a/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:38:08,958 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e2201e-ae81-4b52-ac26-bd25afdac78a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:38:08,960 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e2201e-ae81-4b52-ac26-bd25afdac78a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2024-11-28 04:38:09,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:38:09,607 INFO L256 TraceCheckSpWp]: Trace formula consists of 795 conjuncts, 111 conjuncts are in the unsatisfiable core [2024-11-28 04:38:09,621 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:38:09,642 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-28 04:38:09,772 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 04:38:09,790 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-28 04:38:09,790 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-28 04:38:09,822 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-28 04:38:09,828 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-28 04:38:09,970 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-28 04:38:09,976 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-28 04:38:10,942 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:38:10,942 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-28 04:38:10,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-28 04:38:11,103 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:38:11,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 62 treesize of output 57 [2024-11-28 04:38:11,112 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-28 04:38:11,161 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-28 04:38:11,172 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-28 04:38:11,211 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-28 04:38:11,211 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:38:11,444 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_3118 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_3118) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_3119 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3118 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_3118) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_3119) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-28 04:38:11,488 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$#0.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_3119 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3118 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_3118) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_3119) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_3118 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_3118) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse2) (bvadd (_ bv8 32) .cse2))))))) is different from false [2024-11-28 04:38:12,926 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_3118 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3211 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3210 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_3211) (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_3210) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3118) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_3119 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3118 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3211 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3210 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_3210))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_3211) .cse2 v_ArrVal_3118) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_3119) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2024-11-28 04:38:12,933 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 04:38:12,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1471476193] [2024-11-28 04:38:12,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1471476193] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:38:12,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1118848477] [2024-11-28 04:38:12,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:38:12,934 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-28 04:38:12,934 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e2201e-ae81-4b52-ac26-bd25afdac78a/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 [2024-11-28 04:38:12,936 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e2201e-ae81-4b52-ac26-bd25afdac78a/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-28 04:38:12,937 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e2201e-ae81-4b52-ac26-bd25afdac78a/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (26)] Waiting until timeout for monitored process [2024-11-28 04:39:37,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:39:37,476 INFO L256 TraceCheckSpWp]: Trace formula consists of 795 conjuncts, 112 conjuncts are in the unsatisfiable core [2024-11-28 04:39:37,489 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:39:37,493 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-28 04:39:37,664 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 04:39:37,682 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-28 04:39:37,682 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-28 04:39:37,695 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-28 04:39:37,706 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-28 04:39:37,798 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-28 04:39:37,806 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-28 04:39:38,827 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:39:38,828 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-28 04:39:38,835 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-28 04:39:38,928 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:39:38,928 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-28 04:39:38,935 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-28 04:39:38,976 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-28 04:39:38,985 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-28 04:39:38,986 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-28 04:39:38,987 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:39:39,056 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_3666 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_3666) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_3666 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3665 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_3666) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_3665) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-28 04:39:39,094 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$#0.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_3666 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3665 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_3666) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_3665) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_3666 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_3666) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse2) (bvadd (_ bv8 32) .cse2))))))) is different from false [2024-11-28 04:39:40,513 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_3758 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3757 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3666 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3665 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_3757))) (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$#0.offset| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_3758) .cse0 v_ArrVal_3666) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_3665) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_3758 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3757 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3666 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_3758) (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_3757) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3666) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse3) (bvadd (_ bv8 32) .cse3)))))) is different from false [2024-11-28 04:39:40,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1118848477] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:39:40,520 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 04:39:40,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2024-11-28 04:39:40,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372027389] [2024-11-28 04:39:40,520 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 04:39:40,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-28 04:39:40,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 04:39:40,521 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-28 04:39:40,521 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=110, Unknown=6, NotChecked=150, Total=306 [2024-11-28 04:39:40,521 INFO L87 Difference]: Start difference. First operand 1932 states and 2276 transitions. Second operand has 10 states, 8 states have (on average 8.875) internal successors, (71), 10 states have internal predecessors, (71), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 04:39:53,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:39:53,236 INFO L93 Difference]: Finished difference Result 1931 states and 2274 transitions. [2024-11-28 04:39:53,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-28 04:39:53,237 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 8.875) internal successors, (71), 10 states have internal predecessors, (71), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 115 [2024-11-28 04:39:53,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:39:53,244 INFO L225 Difference]: With dead ends: 1931 [2024-11-28 04:39:53,244 INFO L226 Difference]: Without dead ends: 1931 [2024-11-28 04:39:53,244 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 223 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=71, Invalid=219, Unknown=6, NotChecked=210, Total=506 [2024-11-28 04:39:53,245 INFO L435 NwaCegarLoop]: 882 mSDtfsCounter, 1142 mSDsluCounter, 2258 mSDsCounter, 0 mSdLazyCounter, 4387 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1152 SdHoareTripleChecker+Valid, 3140 SdHoareTripleChecker+Invalid, 4397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 4387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.4s IncrementalHoareTripleChecker+Time [2024-11-28 04:39:53,245 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1152 Valid, 3140 Invalid, 4397 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [10 Valid, 4387 Invalid, 0 Unknown, 0 Unchecked, 12.4s Time] [2024-11-28 04:39:53,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1931 states. [2024-11-28 04:39:53,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1931 to 1931. [2024-11-28 04:39:53,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1931 states, 1349 states have (on average 1.6604892512972573) internal successors, (2240), 1915 states have internal predecessors, (2240), 17 states have call successors, (17), 5 states have call predecessors, (17), 5 states have return successors, (17), 11 states have call predecessors, (17), 15 states have call successors, (17) [2024-11-28 04:39:53,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1931 states to 1931 states and 2274 transitions. [2024-11-28 04:39:53,300 INFO L78 Accepts]: Start accepts. Automaton has 1931 states and 2274 transitions. Word has length 115 [2024-11-28 04:39:53,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:39:53,300 INFO L471 AbstractCegarLoop]: Abstraction has 1931 states and 2274 transitions. [2024-11-28 04:39:53,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 8.875) internal successors, (71), 10 states have internal predecessors, (71), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 04:39:53,301 INFO L276 IsEmpty]: Start isEmpty. Operand 1931 states and 2274 transitions. [2024-11-28 04:39:53,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-28 04:39:53,302 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:39:53,302 INFO L218 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:39:53,329 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e2201e-ae81-4b52-ac26-bd25afdac78a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2024-11-28 04:39:53,543 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e2201e-ae81-4b52-ac26-bd25afdac78a/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (26)] Ended with exit code 0 [2024-11-28 04:39:53,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e2201e-ae81-4b52-ac26-bd25afdac78a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e2201e-ae81-4b52-ac26-bd25afdac78a/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt [2024-11-28 04:39:53,704 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 814 more)] === [2024-11-28 04:39:53,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:39:53,704 INFO L85 PathProgramCache]: Analyzing trace with hash -456508635, now seen corresponding path program 1 times [2024-11-28 04:39:53,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 04:39:53,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [270909691] [2024-11-28 04:39:53,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:39:53,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:39:53,705 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e2201e-ae81-4b52-ac26-bd25afdac78a/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:39:53,707 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e2201e-ae81-4b52-ac26-bd25afdac78a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:39:53,708 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e2201e-ae81-4b52-ac26-bd25afdac78a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2024-11-28 04:39:54,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:39:54,432 INFO L256 TraceCheckSpWp]: Trace formula consists of 824 conjuncts, 59 conjuncts are in the unsatisfiable core [2024-11-28 04:39:54,440 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:39:54,589 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-28 04:39:54,589 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-28 04:39:54,606 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-28 04:39:55,037 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:39:55,037 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-11-28 04:39:55,117 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:39:55,117 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-11-28 04:39:55,208 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:39:55,208 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2024-11-28 04:39:55,278 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2024-11-28 04:39:55,319 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-28 04:39:55,319 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:39:55,407 INFO L349 Elim1Store]: treesize reduction 7, result has 63.2 percent of original size [2024-11-28 04:39:55,407 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2024-11-28 04:39:55,499 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4180 (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$#0.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (= .cse0 (select (select (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_4180) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) is different from false [2024-11-28 04:39:55,523 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4180 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4179 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_4179)) (.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_4180) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))) is different from false [2024-11-28 04:39:55,540 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4180 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4179 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (store |c_#memory_$Pointer$#0.base| (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_4179))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_4180) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) is different from false [2024-11-28 04:39:56,070 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4226 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4180 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4179 (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$#0.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_4226))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_4179)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_4180) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) is different from false [2024-11-28 04:39:56,072 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 04:39:56,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [270909691] [2024-11-28 04:39:56,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [270909691] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:39:56,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [327300708] [2024-11-28 04:39:56,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:39:56,073 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-28 04:39:56,073 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e2201e-ae81-4b52-ac26-bd25afdac78a/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 [2024-11-28 04:39:56,075 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e2201e-ae81-4b52-ac26-bd25afdac78a/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-28 04:39:56,077 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e2201e-ae81-4b52-ac26-bd25afdac78a/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (28)] Waiting until timeout for monitored process [2024-11-28 04:39:58,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:39:58,840 INFO L256 TraceCheckSpWp]: Trace formula consists of 824 conjuncts, 64 conjuncts are in the unsatisfiable core [2024-11-28 04:39:58,848 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:39:58,854 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-28 04:39:59,035 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-28 04:39:59,035 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2024-11-28 04:39:59,086 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-28 04:39:59,258 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-28 04:40:00,581 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:40:00,581 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2024-11-28 04:40:00,786 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:40:00,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-28 04:40:00,933 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:40:00,933 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2024-11-28 04:40:00,968 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2024-11-28 04:40:01,043 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-28 04:40:01,043 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:40:01,065 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4650 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4650) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))))) is different from false [2024-11-28 04:40:01,076 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4650 (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$#0.base| (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_4650) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-28 04:40:01,093 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4649 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4650 (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$#0.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_4649))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4650)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-28 04:40:01,106 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4649 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4650 (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$#0.base| (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4649))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4650)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-28 04:40:01,634 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4649 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4696 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4650 (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$#0.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_4696))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4649)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4650)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-28 04:40:01,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [327300708] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:40:01,640 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 04:40:01,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2024-11-28 04:40:01,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61960440] [2024-11-28 04:40:01,640 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 04:40:01,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-28 04:40:01,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 04:40:01,641 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-28 04:40:01,641 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=386, Unknown=16, NotChecked=432, Total=930 [2024-11-28 04:40:01,642 INFO L87 Difference]: Start difference. First operand 1931 states and 2274 transitions. Second operand has 20 states, 17 states have (on average 5.764705882352941) internal successors, (98), 20 states have internal predecessors, (98), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 04:40:20,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:40:20,497 INFO L93 Difference]: Finished difference Result 1932 states and 2275 transitions. [2024-11-28 04:40:20,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-28 04:40:20,498 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 5.764705882352941) internal successors, (98), 20 states have internal predecessors, (98), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 118 [2024-11-28 04:40:20,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:40:20,504 INFO L225 Difference]: With dead ends: 1932 [2024-11-28 04:40:20,504 INFO L226 Difference]: Without dead ends: 1932 [2024-11-28 04:40:20,505 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 224 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=105, Invalid=421, Unknown=16, NotChecked=450, Total=992 [2024-11-28 04:40:20,507 INFO L435 NwaCegarLoop]: 873 mSDtfsCounter, 1139 mSDsluCounter, 7879 mSDsCounter, 0 mSdLazyCounter, 7496 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1151 SdHoareTripleChecker+Valid, 8752 SdHoareTripleChecker+Invalid, 7515 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 7496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.6s IncrementalHoareTripleChecker+Time [2024-11-28 04:40:20,507 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1151 Valid, 8752 Invalid, 7515 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [19 Valid, 7496 Invalid, 0 Unknown, 0 Unchecked, 18.6s Time] [2024-11-28 04:40:20,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1932 states. [2024-11-28 04:40:20,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1932 to 1930. [2024-11-28 04:40:20,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1930 states, 1349 states have (on average 1.659006671608599) internal successors, (2238), 1914 states have internal predecessors, (2238), 17 states have call successors, (17), 5 states have call predecessors, (17), 5 states have return successors, (17), 11 states have call predecessors, (17), 15 states have call successors, (17) [2024-11-28 04:40:20,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1930 states to 1930 states and 2272 transitions. [2024-11-28 04:40:20,538 INFO L78 Accepts]: Start accepts. Automaton has 1930 states and 2272 transitions. Word has length 118 [2024-11-28 04:40:20,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:40:20,539 INFO L471 AbstractCegarLoop]: Abstraction has 1930 states and 2272 transitions. [2024-11-28 04:40:20,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 17 states have (on average 5.764705882352941) internal successors, (98), 20 states have internal predecessors, (98), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 04:40:20,539 INFO L276 IsEmpty]: Start isEmpty. Operand 1930 states and 2272 transitions. [2024-11-28 04:40:20,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-28 04:40:20,540 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:40:20,541 INFO L218 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:40:20,565 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e2201e-ae81-4b52-ac26-bd25afdac78a/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (28)] Ended with exit code 0 [2024-11-28 04:40:20,768 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e2201e-ae81-4b52-ac26-bd25afdac78a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2024-11-28 04:40:20,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e2201e-ae81-4b52-ac26-bd25afdac78a/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt,27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e2201e-ae81-4b52-ac26-bd25afdac78a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:40:20,942 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 814 more)] === [2024-11-28 04:40:20,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:40:20,942 INFO L85 PathProgramCache]: Analyzing trace with hash -456508634, now seen corresponding path program 1 times [2024-11-28 04:40:20,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 04:40:20,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [566257944] [2024-11-28 04:40:20,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:40:20,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:40:20,943 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e2201e-ae81-4b52-ac26-bd25afdac78a/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:40:20,945 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e2201e-ae81-4b52-ac26-bd25afdac78a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:40:20,948 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e2201e-ae81-4b52-ac26-bd25afdac78a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2024-11-28 04:40:21,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:40:21,722 INFO L256 TraceCheckSpWp]: Trace formula consists of 824 conjuncts, 114 conjuncts are in the unsatisfiable core [2024-11-28 04:40:21,737 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:40:21,741 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-28 04:40:21,922 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-28 04:40:21,922 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-28 04:40:21,933 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 04:40:21,961 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-28 04:40:21,966 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-28 04:40:22,113 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-28 04:40:22,119 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-28 04:40:23,095 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:40:23,095 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-28 04:40:23,102 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-28 04:40:23,254 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:40:23,254 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-28 04:40:23,263 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-28 04:40:23,370 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:40:23,370 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-28 04:40:23,376 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-28 04:40:23,405 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-28 04:40:23,413 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-28 04:40:23,445 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-28 04:40:23,445 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:40:23,602 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5168 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_5168) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd (_ bv12 32) .cse0)))) (forall ((v_ArrVal_5168 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5167 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv12 32) (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_5168) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_5167) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-28 04:40:23,634 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$#0.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_5168 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5167 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv12 32) (select (select (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_5168) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_5167) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_5168 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_5168) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse2) (bvadd (_ bv12 32) .cse2))))))) is different from false [2024-11-28 04:40:23,769 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5168 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5165 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5166 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_5166) (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_5165) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5168) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd (_ bv12 32) .cse0)))) (forall ((v_ArrVal_5168 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5165 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5166 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5167 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_5165))) (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$#0.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_5166) .cse2 v_ArrVal_5168) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_5167) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2024-11-28 04:40:23,822 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$#0.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_5168 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5165 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5166 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5167 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_5165))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_5166) .cse1 v_ArrVal_5168) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_5167) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_5168 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5165 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5166 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_5166) (select (select (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_5165) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_5168) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse4 (_ bv8 32)) (bvadd .cse4 (_ bv12 32)))))))) is different from false [2024-11-28 04:40:25,591 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5260 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5168 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5259 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5165 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5166 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5167 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_5259))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_5165))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_5260) .cse0 v_ArrVal_5166) .cse1 v_ArrVal_5168) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_5167) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_5260 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5168 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5259 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5165 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5166 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_5259))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_5260) .cse6 v_ArrVal_5166) (select (select (store .cse7 .cse6 v_ArrVal_5165) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_5168))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse5 (_ bv8 32)) (bvadd .cse5 (_ bv12 32))))))) is different from false [2024-11-28 04:40:25,601 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 04:40:25,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [566257944] [2024-11-28 04:40:25,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [566257944] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:40:25,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [651249522] [2024-11-28 04:40:25,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:40:25,601 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-28 04:40:25,601 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e2201e-ae81-4b52-ac26-bd25afdac78a/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 [2024-11-28 04:40:25,603 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e2201e-ae81-4b52-ac26-bd25afdac78a/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-28 04:40:25,604 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e2201e-ae81-4b52-ac26-bd25afdac78a/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (30)] Waiting until timeout for monitored process [2024-11-28 04:40:49,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:40:49,628 INFO L256 TraceCheckSpWp]: Trace formula consists of 824 conjuncts, 116 conjuncts are in the unsatisfiable core [2024-11-28 04:40:49,642 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:40:49,650 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-28 04:40:49,972 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 04:40:50,005 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-28 04:40:50,005 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-28 04:40:50,033 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-28 04:40:50,060 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-28 04:40:50,178 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-28 04:40:50,186 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-28 04:40:51,691 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:40:51,691 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-28 04:40:51,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-28 04:40:51,840 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:40:51,840 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-28 04:40:51,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-28 04:40:51,962 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:40:51,962 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-28 04:40:51,986 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-28 04:40:52,024 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-28 04:40:52,032 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-28 04:40:52,044 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-28 04:40:52,044 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:40:52,132 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5732 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_5732) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd (_ bv12 32) .cse0)))) (forall ((v_ArrVal_5731 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5732 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv12 32) (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_5732) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_5731) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-28 04:40:52,168 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$#0.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_5731 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5732 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_5732) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_5731) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_5732 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_5732) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse2 (_ bv8 32)) (bvadd .cse2 (_ bv12 32)))))))) is different from false [2024-11-28 04:40:52,269 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5729 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5730 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5731 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5732 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_5729))) (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$#0.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_5730) .cse0 v_ArrVal_5732) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_5731) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_5729 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5730 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5732 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_5730) (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_5729) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5732) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse3) (bvadd (_ bv12 32) .cse3)))))) is different from false [2024-11-28 04:40:52,345 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$#0.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_5729 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5730 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5732 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#0.offset| .cse1 v_ArrVal_5730) (select (select (store |c_#memory_$Pointer$#0.base| .cse1 v_ArrVal_5729) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_5732) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd (_ bv12 32) .cse0)))) (forall ((v_ArrVal_5729 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5730 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5731 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5732 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#0.base| .cse1 v_ArrVal_5729))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv12 32) (select (select (store (store |c_#memory_$Pointer$#0.offset| .cse1 v_ArrVal_5730) .cse3 v_ArrVal_5732) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_5731) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false [2024-11-28 04:40:54,571 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5729 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5823 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5824 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5730 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5731 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5732 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_5824))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_5729))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_5823) .cse0 v_ArrVal_5730) .cse1 v_ArrVal_5732) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_5731) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_5729 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5823 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5824 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5730 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5732 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_5824))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_5823) .cse6 v_ArrVal_5730) (select (select (store .cse7 .cse6 v_ArrVal_5729) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_5732))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse5 (_ bv8 32)) (bvadd .cse5 (_ bv12 32))))))) is different from false [2024-11-28 04:40:54,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [651249522] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:40:54,584 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 04:40:54,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2024-11-28 04:40:54,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956209088] [2024-11-28 04:40:54,584 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 04:40:54,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-28 04:40:54,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 04:40:54,585 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-28 04:40:54,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=134, Unknown=10, NotChecked=310, Total=506 [2024-11-28 04:40:54,585 INFO L87 Difference]: Start difference. First operand 1930 states and 2272 transitions. Second operand has 11 states, 9 states have (on average 8.222222222222221) internal successors, (74), 11 states have internal predecessors, (74), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 04:41:23,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:41:23,066 INFO L93 Difference]: Finished difference Result 1929 states and 2270 transitions. [2024-11-28 04:41:23,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-28 04:41:23,067 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 8.222222222222221) internal successors, (74), 11 states have internal predecessors, (74), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 118 [2024-11-28 04:41:23,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:41:23,073 INFO L225 Difference]: With dead ends: 1929 [2024-11-28 04:41:23,073 INFO L226 Difference]: Without dead ends: 1929 [2024-11-28 04:41:23,073 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 230 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=90, Invalid=282, Unknown=10, NotChecked=430, Total=812 [2024-11-28 04:41:23,074 INFO L435 NwaCegarLoop]: 881 mSDtfsCounter, 1140 mSDsluCounter, 3319 mSDsCounter, 0 mSdLazyCounter, 6221 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1150 SdHoareTripleChecker+Valid, 4200 SdHoareTripleChecker+Invalid, 6231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 6221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 27.8s IncrementalHoareTripleChecker+Time [2024-11-28 04:41:23,074 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1150 Valid, 4200 Invalid, 6231 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [10 Valid, 6221 Invalid, 0 Unknown, 0 Unchecked, 27.8s Time] [2024-11-28 04:41:23,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1929 states. [2024-11-28 04:41:23,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1929 to 1929. [2024-11-28 04:41:23,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1929 states, 1349 states have (on average 1.6575240919199408) internal successors, (2236), 1913 states have internal predecessors, (2236), 17 states have call successors, (17), 5 states have call predecessors, (17), 5 states have return successors, (17), 11 states have call predecessors, (17), 15 states have call successors, (17) [2024-11-28 04:41:23,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1929 states to 1929 states and 2270 transitions. [2024-11-28 04:41:23,105 INFO L78 Accepts]: Start accepts. Automaton has 1929 states and 2270 transitions. Word has length 118 [2024-11-28 04:41:23,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:41:23,105 INFO L471 AbstractCegarLoop]: Abstraction has 1929 states and 2270 transitions. [2024-11-28 04:41:23,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 8.222222222222221) internal successors, (74), 11 states have internal predecessors, (74), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 04:41:23,106 INFO L276 IsEmpty]: Start isEmpty. Operand 1929 states and 2270 transitions. [2024-11-28 04:41:23,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-28 04:41:23,108 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:41:23,108 INFO L218 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:41:23,133 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e2201e-ae81-4b52-ac26-bd25afdac78a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2024-11-28 04:41:23,349 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e2201e-ae81-4b52-ac26-bd25afdac78a/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (30)] Ended with exit code 0 [2024-11-28 04:41:23,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e2201e-ae81-4b52-ac26-bd25afdac78a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e2201e-ae81-4b52-ac26-bd25afdac78a/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt [2024-11-28 04:41:23,509 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 814 more)] === [2024-11-28 04:41:23,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:41:23,509 INFO L85 PathProgramCache]: Analyzing trace with hash -1981964382, now seen corresponding path program 1 times [2024-11-28 04:41:23,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 04:41:23,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [581906459] [2024-11-28 04:41:23,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:41:23,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:41:23,510 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e2201e-ae81-4b52-ac26-bd25afdac78a/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:41:23,512 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e2201e-ae81-4b52-ac26-bd25afdac78a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:41:23,513 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e2201e-ae81-4b52-ac26-bd25afdac78a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2024-11-28 04:41:24,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:41:24,311 INFO L256 TraceCheckSpWp]: Trace formula consists of 853 conjuncts, 62 conjuncts are in the unsatisfiable core [2024-11-28 04:41:24,319 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:41:24,328 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-28 04:41:24,823 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-28 04:41:24,823 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-28 04:41:24,870 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-28 04:41:25,660 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:41:25,660 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-11-28 04:41:25,790 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:41:25,791 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-11-28 04:41:25,933 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:41:25,933 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-11-28 04:41:26,085 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:41:26,086 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2024-11-28 04:41:26,206 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2024-11-28 04:41:26,272 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-28 04:41:26,272 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:41:26,398 INFO L349 Elim1Store]: treesize reduction 7, result has 63.2 percent of original size [2024-11-28 04:41:26,398 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2024-11-28 04:41:26,413 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6263 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_6263) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)) |c_ULTIMATE.start_main_#t~mem36#1.base|)) is different from false [2024-11-28 04:41:26,431 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6263 (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$#0.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (= (select (select (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_6263) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) .cse0)))) is different from false [2024-11-28 04:41:26,464 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6262 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6263 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_6262)) (.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_6263) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))) is different from false [2024-11-28 04:41:26,489 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6262 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6263 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (store |c_#memory_$Pointer$#0.base| (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_6262))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_6263) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) is different from false [2024-11-28 04:41:26,531 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6261 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6262 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6263 (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$#0.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_6261))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_6262)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_6263) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) is different from false [2024-11-28 04:41:26,562 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6261 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6262 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6263 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (let ((.cse3 (store |c_#memory_$Pointer$#0.base| (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_6261))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_6262)))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= (select (select (store .cse0 .cse1 v_ArrVal_6263) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) .cse1))))) is different from false [2024-11-28 04:41:27,293 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6309 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6261 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6262 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6263 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (let ((.cse3 (let ((.cse4 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_6309))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_6261)))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_6262)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_6263) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) is different from false [2024-11-28 04:41:27,298 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 04:41:27,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [581906459] [2024-11-28 04:41:27,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [581906459] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:41:27,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [979978683] [2024-11-28 04:41:27,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:41:27,299 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-28 04:41:27,299 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e2201e-ae81-4b52-ac26-bd25afdac78a/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 [2024-11-28 04:41:27,301 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e2201e-ae81-4b52-ac26-bd25afdac78a/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-28 04:41:27,302 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e2201e-ae81-4b52-ac26-bd25afdac78a/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (32)] Waiting until timeout for monitored process [2024-11-28 04:41:33,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:41:33,715 INFO L256 TraceCheckSpWp]: Trace formula consists of 853 conjuncts, 66 conjuncts are in the unsatisfiable core [2024-11-28 04:41:33,725 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:41:33,736 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-28 04:41:34,108 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-28 04:41:34,109 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2024-11-28 04:41:34,220 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-28 04:41:34,573 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-28 04:41:36,674 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:41:36,674 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2024-11-28 04:41:37,015 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:41:37,016 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2024-11-28 04:41:37,271 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:41:37,272 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2024-11-28 04:41:37,517 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:41:37,517 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2024-11-28 04:41:37,572 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2024-11-28 04:41:37,711 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-28 04:41:37,711 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:41:37,945 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6749 (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$#0.base| (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_6749) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-28 04:41:37,982 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6749 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6748 (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$#0.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_6748))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6749)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-28 04:41:38,008 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6749 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6748 (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$#0.base| (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6748))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6749)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-28 04:41:38,043 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6749 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6747 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6748 (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$#0.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_6747))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6748)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6749)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-28 04:41:38,070 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6749 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6747 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6748 (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$#0.base| (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6747))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6748)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6749)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-28 04:41:38,733 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6749 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6747 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6748 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6795 (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$#0.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_6795))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6747)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6748)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6749)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-28 04:41:38,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [979978683] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:41:38,740 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 04:41:38,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 21 [2024-11-28 04:41:38,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889528461] [2024-11-28 04:41:38,740 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 04:41:38,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-28 04:41:38,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 04:41:38,741 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-28 04:41:38,741 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=467, Unknown=23, NotChecked=728, Total=1332 [2024-11-28 04:41:38,742 INFO L87 Difference]: Start difference. First operand 1929 states and 2270 transitions. Second operand has 22 states, 19 states have (on average 5.315789473684211) internal successors, (101), 22 states have internal predecessors, (101), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 04:42:11,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:42:11,335 INFO L93 Difference]: Finished difference Result 1930 states and 2271 transitions. [2024-11-28 04:42:11,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-28 04:42:11,335 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 5.315789473684211) internal successors, (101), 22 states have internal predecessors, (101), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 121 [2024-11-28 04:42:11,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:42:11,339 INFO L225 Difference]: With dead ends: 1930 [2024-11-28 04:42:11,339 INFO L226 Difference]: Without dead ends: 1930 [2024-11-28 04:42:11,339 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 230 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=123, Invalid=506, Unknown=23, NotChecked=754, Total=1406 [2024-11-28 04:42:11,340 INFO L435 NwaCegarLoop]: 872 mSDtfsCounter, 1132 mSDsluCounter, 8810 mSDsCounter, 0 mSdLazyCounter, 7934 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 29.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1144 SdHoareTripleChecker+Valid, 9682 SdHoareTripleChecker+Invalid, 7954 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 7934 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 32.3s IncrementalHoareTripleChecker+Time [2024-11-28 04:42:11,340 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1144 Valid, 9682 Invalid, 7954 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [20 Valid, 7934 Invalid, 0 Unknown, 0 Unchecked, 32.3s Time] [2024-11-28 04:42:11,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1930 states. [2024-11-28 04:42:11,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1930 to 1928. [2024-11-28 04:42:11,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1928 states, 1349 states have (on average 1.6560415122312824) internal successors, (2234), 1912 states have internal predecessors, (2234), 17 states have call successors, (17), 5 states have call predecessors, (17), 5 states have return successors, (17), 11 states have call predecessors, (17), 15 states have call successors, (17) [2024-11-28 04:42:11,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1928 states to 1928 states and 2268 transitions. [2024-11-28 04:42:11,367 INFO L78 Accepts]: Start accepts. Automaton has 1928 states and 2268 transitions. Word has length 121 [2024-11-28 04:42:11,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:42:11,367 INFO L471 AbstractCegarLoop]: Abstraction has 1928 states and 2268 transitions. [2024-11-28 04:42:11,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 5.315789473684211) internal successors, (101), 22 states have internal predecessors, (101), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 04:42:11,368 INFO L276 IsEmpty]: Start isEmpty. Operand 1928 states and 2268 transitions. [2024-11-28 04:42:11,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-28 04:42:11,373 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:42:11,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] [2024-11-28 04:42:11,397 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e2201e-ae81-4b52-ac26-bd25afdac78a/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (32)] Ended with exit code 0 [2024-11-28 04:42:11,597 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e2201e-ae81-4b52-ac26-bd25afdac78a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2024-11-28 04:42:11,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e2201e-ae81-4b52-ac26-bd25afdac78a/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt,31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e2201e-ae81-4b52-ac26-bd25afdac78a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:42:11,774 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr83REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 814 more)] === [2024-11-28 04:42:11,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:42:11,774 INFO L85 PathProgramCache]: Analyzing trace with hash -1981964381, now seen corresponding path program 1 times [2024-11-28 04:42:11,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 04:42:11,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [430778222] [2024-11-28 04:42:11,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:42:11,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:42:11,775 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e2201e-ae81-4b52-ac26-bd25afdac78a/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:42:11,776 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e2201e-ae81-4b52-ac26-bd25afdac78a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:42:11,777 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e2201e-ae81-4b52-ac26-bd25afdac78a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2024-11-28 04:42:12,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:42:12,603 INFO L256 TraceCheckSpWp]: Trace formula consists of 853 conjuncts, 117 conjuncts are in the unsatisfiable core [2024-11-28 04:42:12,634 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:42:12,641 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-28 04:42:12,996 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-28 04:42:12,996 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-28 04:42:13,018 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 04:42:13,070 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-28 04:42:13,102 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-28 04:42:13,338 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-28 04:42:13,347 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-28 04:42:14,964 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:42:14,964 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-28 04:42:14,974 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-28 04:42:15,211 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:42:15,211 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-28 04:42:15,221 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-28 04:42:15,443 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:42:15,443 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-28 04:42:15,465 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-28 04:42:15,702 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:42:15,702 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-28 04:42:15,712 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-28 04:42:15,778 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-28 04:42:15,816 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-28 04:42:15,886 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-28 04:42:15,886 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:42:16,160 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7283 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7284 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv24 32) (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7284) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7283) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_7284 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7284) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv20 32) .cse1) (bvadd (_ bv24 32) .cse1)))))) is different from false [2024-11-28 04:42:16,202 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$#0.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_7283 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7284 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_7284) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_7283) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_7284 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_7284) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse2 (_ bv20 32)) (bvadd .cse2 (_ bv24 32)))))))) is different from false [2024-11-28 04:42:16,268 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7283 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7281 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7282 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7281))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv24 32) (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7282) .cse0 v_ArrVal_7284) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_7283) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_7284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7281 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7282 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7282) (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7281) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7284) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv20 32) .cse3) (bvadd (_ bv24 32) .cse3)))))) is different from false [2024-11-28 04:42:16,354 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$#0.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_7284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7281 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7282 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#0.offset| .cse1 v_ArrVal_7282) (select (select (store |c_#memory_$Pointer$#0.base| .cse1 v_ArrVal_7281) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_7284) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv20 32) .cse0) (bvadd (_ bv24 32) .cse0)))) (forall ((v_ArrVal_7283 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7281 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7282 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#0.base| .cse1 v_ArrVal_7281))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv24 32) (select (select (store (store |c_#memory_$Pointer$#0.offset| .cse1 v_ArrVal_7282) .cse3 v_ArrVal_7284) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_7283) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false [2024-11-28 04:42:16,583 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7283 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7280 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7281 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7282 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7279 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_7279))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_7281))) (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$#0.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_7280) .cse0 v_ArrVal_7282) .cse1 v_ArrVal_7284) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_7283) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_7284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7280 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7281 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7282 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7279 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_7279))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_7280) .cse6 v_ArrVal_7282) (select (select (store .cse7 .cse6 v_ArrVal_7281) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_7284))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv20 32) .cse5) (bvadd (_ bv24 32) .cse5)))))) is different from false [2024-11-28 04:42:16,772 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$#0.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (and (forall ((v_ArrVal_7283 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7280 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7281 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7282 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7279 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_7279))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_7281))) (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$#0.offset| .cse0 v_ArrVal_7280) .cse1 v_ArrVal_7282) .cse2 v_ArrVal_7284) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_7283) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))) (forall ((v_ArrVal_7284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7280 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7281 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7282 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7279 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (select (select (let ((.cse8 (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_7279))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_7280) .cse7 v_ArrVal_7282) (select (select (store .cse8 .cse7 v_ArrVal_7281) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_7284))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv20 32) .cse6) (bvadd (_ bv24 32) .cse6))))))) is different from false [2024-11-28 04:42:22,878 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7283 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7280 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7281 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7282 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7375 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7376 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7279 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_7375))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_7279))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_7281))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv24 32) (select (select (store (store (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_7376) .cse0 v_ArrVal_7280) .cse1 v_ArrVal_7282) .cse2 v_ArrVal_7284) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_7283) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) (forall ((v_ArrVal_7284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7280 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7281 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7282 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7375 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7376 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7279 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (select (select (let ((.cse11 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_7375))) (let ((.cse8 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse10 (store .cse11 .cse8 v_ArrVal_7279))) (let ((.cse9 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_7376) .cse8 v_ArrVal_7280) .cse9 v_ArrVal_7282) (select (select (store .cse10 .cse9 v_ArrVal_7281) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_7284))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv20 32) .cse7) (bvadd (_ bv24 32) .cse7)))))) is different from false [2024-11-28 04:42:22,905 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 04:42:22,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [430778222] [2024-11-28 04:42:22,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [430778222] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:42:22,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [734876259] [2024-11-28 04:42:22,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:42:22,906 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-28 04:42:22,906 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e2201e-ae81-4b52-ac26-bd25afdac78a/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 [2024-11-28 04:42:22,908 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e2201e-ae81-4b52-ac26-bd25afdac78a/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-28 04:42:22,909 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e2201e-ae81-4b52-ac26-bd25afdac78a/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (34)] Waiting until timeout for monitored process [2024-11-28 04:43:05,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:43:06,003 INFO L256 TraceCheckSpWp]: Trace formula consists of 853 conjuncts, 124 conjuncts are in the unsatisfiable core [2024-11-28 04:43:06,016 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:43:06,053 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-28 04:43:08,288 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-28 04:43:08,288 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-28 04:43:08,351 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 04:43:08,751 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-28 04:43:08,795 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-28 04:43:09,860 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2024-11-28 04:43:09,881 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-28 04:43:14,305 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-28 04:43:14,305 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2024-11-28 04:43:14,327 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-28 04:43:15,282 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-28 04:43:15,282 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2024-11-28 04:43:15,344 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-28 04:43:16,001 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-28 04:43:16,002 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2024-11-28 04:43:16,059 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-28 04:43:16,824 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-28 04:43:16,824 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2024-11-28 04:43:16,886 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-28 04:43:17,013 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-28 04:43:17,056 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-28 04:43:17,077 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-28 04:43:17,077 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:43:18,357 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7863 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7862 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7862)) (.cse2 (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7863) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (or (not (bvule (bvadd (_ bv12 32) (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| .cse2))) (forall ((v_ArrVal_7864 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store .cse0 .cse2 v_ArrVal_7864) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv20 32) .cse3) (bvadd (_ bv24 32) .cse3))))))) (forall ((v_ArrVal_7863 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7862 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7863))) (let ((.cse4 (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7862)) (.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (or (not (bvule (bvadd (_ bv12 32) (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| .cse5))) (forall ((v_ArrVal_7865 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7864 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv24 32) (select (select (store .cse4 .cse5 v_ArrVal_7864) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_7865) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))))) is different from false [2024-11-28 04:43:18,529 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse4 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (and (forall ((v_ArrVal_7863 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7862 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store |c_#memory_$Pointer$#0.offset| .cse4 v_ArrVal_7862)) (.cse2 (select (select (store |c_#memory_$Pointer$#0.base| .cse4 v_ArrVal_7863) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (or (forall ((v_ArrVal_7864 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store .cse1 .cse2 v_ArrVal_7864) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (not (bvule (bvadd (_ bv12 32) (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select |c_#length| .cse2)))))) (forall ((v_ArrVal_7863 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7862 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$#0.base| .cse4 v_ArrVal_7863))) (let ((.cse5 (store |c_#memory_$Pointer$#0.offset| .cse4 v_ArrVal_7862)) (.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (or (forall ((v_ArrVal_7865 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7864 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store .cse5 .cse6 v_ArrVal_7864) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv24 32)) (select |c_#length| (select (select (store .cse7 .cse6 v_ArrVal_7865) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))) (not (bvule (bvadd (_ bv12 32) (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select |c_#length| .cse6)))))))))) is different from false [2024-11-28 04:43:18,853 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7863 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7862 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7861 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7860 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_7861))) (let ((.cse5 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse0 (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_7860) .cse5 v_ArrVal_7862)) (.cse2 (select (select (store .cse4 .cse5 v_ArrVal_7863) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (or (not (bvule (bvadd (_ bv12 32) (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| .cse2))) (forall ((v_ArrVal_7864 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store .cse0 .cse2 v_ArrVal_7864) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv20 32) .cse3) (bvadd (_ bv24 32) .cse3))))))))) (forall ((v_ArrVal_7863 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7862 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7861 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7860 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse10 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_7861))) (let ((.cse9 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse8 (store .cse10 .cse9 v_ArrVal_7863))) (let ((.cse6 (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_7860) .cse9 v_ArrVal_7862)) (.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (or (not (bvule (bvadd (_ bv12 32) (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| .cse7))) (forall ((v_ArrVal_7865 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7864 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv24 32) (select (select (store .cse6 .cse7 v_ArrVal_7864) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse8 .cse7 v_ArrVal_7865) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))))))) is different from false [2024-11-28 04:43:19,063 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse4 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_7863 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7862 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7861 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7860 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store |c_#memory_$Pointer$#0.base| .cse4 v_ArrVal_7861))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse6 .cse5 v_ArrVal_7863))) (let ((.cse0 (store (store |c_#memory_$Pointer$#0.offset| .cse4 v_ArrVal_7860) .cse5 v_ArrVal_7862)) (.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (or (forall ((v_ArrVal_7865 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7864 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store .cse0 .cse1 v_ArrVal_7864) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_7865) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))) (not (bvule (bvadd (_ bv12 32) (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| .cse1))))))))) (forall ((v_ArrVal_7863 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7862 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7861 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7860 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse10 (store |c_#memory_$Pointer$#0.base| .cse4 v_ArrVal_7861))) (let ((.cse11 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse8 (store (store |c_#memory_$Pointer$#0.offset| .cse4 v_ArrVal_7860) .cse11 v_ArrVal_7862)) (.cse9 (select (select (store .cse10 .cse11 v_ArrVal_7863) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (or (forall ((v_ArrVal_7864 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (select (select (store .cse8 .cse9 v_ArrVal_7864) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse7 (_ bv20 32)) (bvadd .cse7 (_ bv24 32))))) (not (bvule (bvadd (_ bv12 32) (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| .cse9))))))))))) is different from false [2024-11-28 04:43:23,087 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7957 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7956 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7863 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7862 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7861 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7860 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_7956))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse7 .cse6 v_ArrVal_7861))) (let ((.cse5 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse1 (store (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_7957) .cse6 v_ArrVal_7860) .cse5 v_ArrVal_7862)) (.cse2 (select (select (store .cse4 .cse5 v_ArrVal_7863) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (or (forall ((v_ArrVal_7864 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store .cse1 .cse2 v_ArrVal_7864) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv20 32) .cse0) (bvadd (_ bv24 32) .cse0)))) (not (bvule (bvadd (_ bv12 32) (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select |c_#length| .cse2)))))))))) (forall ((v_ArrVal_7957 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7956 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7863 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7862 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7861 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7860 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse14 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_7956))) (let ((.cse11 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse13 (store .cse14 .cse11 v_ArrVal_7861))) (let ((.cse12 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse10 (store .cse13 .cse12 v_ArrVal_7863))) (let ((.cse8 (store (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_7957) .cse11 v_ArrVal_7860) .cse12 v_ArrVal_7862)) (.cse9 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (or (forall ((v_ArrVal_7865 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7864 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv24 32) (select (select (store .cse8 .cse9 v_ArrVal_7864) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select |c_#length| (select (select (store .cse10 .cse9 v_ArrVal_7865) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))) (not (bvule (bvadd (_ bv12 32) (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select |c_#length| .cse9))))))))))))) is different from false [2024-11-28 04:43:23,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [734876259] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:43:23,109 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 04:43:23,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2024-11-28 04:43:23,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338921972] [2024-11-28 04:43:23,109 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 04:43:23,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-28 04:43:23,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 04:43:23,110 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-28 04:43:23,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=432, Unknown=12, NotChecked=636, Total=1190 [2024-11-28 04:43:23,110 INFO L87 Difference]: Start difference. First operand 1928 states and 2268 transitions. Second operand has 19 states, 16 states have (on average 9.0) internal successors, (144), 19 states have internal predecessors, (144), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 04:44:53,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:44:53,660 INFO L93 Difference]: Finished difference Result 2604 states and 3001 transitions. [2024-11-28 04:44:53,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-28 04:44:53,660 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 9.0) internal successors, (144), 19 states have internal predecessors, (144), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 121 [2024-11-28 04:44:53,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:44:53,666 INFO L225 Difference]: With dead ends: 2604 [2024-11-28 04:44:53,666 INFO L226 Difference]: Without dead ends: 2604 [2024-11-28 04:44:53,666 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 230 SyntacticMatches, 3 SemanticMatches, 40 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 11.2s TimeCoverageRelationStatistics Valid=180, Invalid=726, Unknown=12, NotChecked=804, Total=1722 [2024-11-28 04:44:53,667 INFO L435 NwaCegarLoop]: 880 mSDtfsCounter, 2879 mSDsluCounter, 4839 mSDsCounter, 0 mSdLazyCounter, 8489 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 85.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2897 SdHoareTripleChecker+Valid, 5719 SdHoareTripleChecker+Invalid, 8522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 8489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 88.6s IncrementalHoareTripleChecker+Time [2024-11-28 04:44:53,667 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2897 Valid, 5719 Invalid, 8522 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [33 Valid, 8489 Invalid, 0 Unknown, 0 Unchecked, 88.6s Time] [2024-11-28 04:44:53,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2604 states. [2024-11-28 04:44:53,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2604 to 1927. [2024-11-28 04:44:53,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1927 states, 1349 states have (on average 1.6545589325426242) internal successors, (2232), 1911 states have internal predecessors, (2232), 17 states have call successors, (17), 5 states have call predecessors, (17), 5 states have return successors, (17), 11 states have call predecessors, (17), 15 states have call successors, (17) [2024-11-28 04:44:53,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1927 states to 1927 states and 2266 transitions. [2024-11-28 04:44:53,700 INFO L78 Accepts]: Start accepts. Automaton has 1927 states and 2266 transitions. Word has length 121 [2024-11-28 04:44:53,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:44:53,701 INFO L471 AbstractCegarLoop]: Abstraction has 1927 states and 2266 transitions. [2024-11-28 04:44:53,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 9.0) internal successors, (144), 19 states have internal predecessors, (144), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 04:44:53,701 INFO L276 IsEmpty]: Start isEmpty. Operand 1927 states and 2266 transitions. [2024-11-28 04:44:53,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-28 04:44:53,702 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:44:53,702 INFO L218 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:44:53,745 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e2201e-ae81-4b52-ac26-bd25afdac78a/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (34)] Ended with exit code 0 [2024-11-28 04:44:53,926 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e2201e-ae81-4b52-ac26-bd25afdac78a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Ended with exit code 0 [2024-11-28 04:44:54,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e2201e-ae81-4b52-ac26-bd25afdac78a/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt,33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e2201e-ae81-4b52-ac26-bd25afdac78a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:44:54,108 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr87REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 814 more)] === [2024-11-28 04:44:54,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:44:54,108 INFO L85 PathProgramCache]: Analyzing trace with hash 494697893, now seen corresponding path program 1 times [2024-11-28 04:44:54,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 04:44:54,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [94965729] [2024-11-28 04:44:54,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:44:54,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:44:54,109 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e2201e-ae81-4b52-ac26-bd25afdac78a/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:44:54,110 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e2201e-ae81-4b52-ac26-bd25afdac78a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:44:54,111 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e2201e-ae81-4b52-ac26-bd25afdac78a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2024-11-28 04:44:54,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:44:54,989 INFO L256 TraceCheckSpWp]: Trace formula consists of 890 conjuncts, 123 conjuncts are in the unsatisfiable core [2024-11-28 04:44:55,000 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:44:55,018 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-28 04:44:55,998 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 04:44:56,120 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-28 04:44:56,120 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-28 04:44:56,270 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-28 04:44:56,291 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-28 04:44:56,945 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-28 04:44:56,966 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-28 04:45:02,334 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:45:02,334 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 68 [2024-11-28 04:45:02,415 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-28 04:45:03,329 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:45:03,329 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 68 [2024-11-28 04:45:03,371 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-28 04:45:04,063 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:45:04,063 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 68 [2024-11-28 04:45:04,086 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-28 04:45:04,861 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:45:04,861 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 68 [2024-11-28 04:45:04,883 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-28 04:45:05,639 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:45:05,639 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 68 [2024-11-28 04:45:05,679 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-28 04:45:05,923 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 20 [2024-11-28 04:45:05,944 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-28 04:45:06,281 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:45:06,436 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-11-28 04:45:06,436 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 21 [2024-11-28 04:45:06,544 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-28 04:45:06,544 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-28 04:45:06,836 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-28 04:45:06,836 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:45:09,519 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$#0.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (or (forall ((|v_ULTIMATE.start_main_#t~malloc39#1.base_6| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc39#1.base_6|)))) (forall ((v_ArrVal_8464 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#0.offset| .cse1 v_ArrVal_8464) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule .cse0 (bvadd (_ bv4 32) .cse0))))) (forall ((v_ArrVal_8465 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc39#1.base_6| (_ BitVec 32)) (v_ArrVal_8464 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc39#1.base_6|))) (forall ((v_ArrVal_8466 (_ BitVec 32))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$#0.offset| .cse1 v_ArrVal_8464) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc39#1.base_6| v_ArrVal_8466) (select (select (store |c_#memory_$Pointer$#0.base| .cse1 v_ArrVal_8465) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false [2024-11-28 04:45:09,761 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (or (forall ((v_ArrVal_8463 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8462 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8464 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_8462) (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_8463) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8464) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule .cse0 (bvadd (_ bv4 32) .cse0)))) (forall ((|v_ULTIMATE.start_main_#t~malloc39#1.base_6| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc39#1.base_6|))))) (forall ((v_ArrVal_8463 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8462 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8465 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc39#1.base_6| (_ BitVec 32)) (v_ArrVal_8464 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc39#1.base_6|))) (forall ((v_ArrVal_8466 (_ BitVec 32))) (let ((.cse3 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_8463))) (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$#0.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_8462) .cse2 v_ArrVal_8464) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc39#1.base_6| v_ArrVal_8466) (select (select (store .cse3 .cse2 v_ArrVal_8465) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))))) is different from false [2024-11-28 04:45:10,123 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$#0.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_8463 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8462 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8465 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc39#1.base_6| (_ BitVec 32)) (v_ArrVal_8464 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc39#1.base_6|))) (forall ((v_ArrVal_8466 (_ BitVec 32))) (let ((.cse3 (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_8463))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_8462) .cse1 v_ArrVal_8464) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv4 32)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc39#1.base_6| v_ArrVal_8466) (select (select (store .cse3 .cse1 v_ArrVal_8465) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc39#1.base_6| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc39#1.base_6|)))) (forall ((v_ArrVal_8463 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8462 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8464 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_8462) (select (select (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_8463) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_8464) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule .cse4 (bvadd .cse4 (_ bv4 32))))))))) is different from false [2024-11-28 04:45:14,359 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8463 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8462 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8461 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8460 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8465 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc39#1.base_6| (_ BitVec 32)) (v_ArrVal_8464 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_8466 (_ BitVec 32))) (let ((.cse4 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_8461))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_8463))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv4 32) (select (select (store (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_8460) .cse0 v_ArrVal_8462) .cse1 v_ArrVal_8464) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc39#1.base_6| v_ArrVal_8466) (select (select (store .cse3 .cse1 v_ArrVal_8465) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc39#1.base_6|))))) (or (forall ((v_ArrVal_8463 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8462 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8461 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8460 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8464 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_8461))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_8460) .cse6 v_ArrVal_8462) (select (select (store .cse7 .cse6 v_ArrVal_8463) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_8464))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule .cse5 (bvadd (_ bv4 32) .cse5)))) (forall ((|v_ULTIMATE.start_main_#t~malloc39#1.base_6| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc39#1.base_6|))))))) is different from false [2024-11-28 04:45:14,514 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$#0.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (and (forall ((v_ArrVal_8463 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8462 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8461 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8460 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8465 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc39#1.base_6| (_ BitVec 32)) (v_ArrVal_8464 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_8466 (_ BitVec 32))) (let ((.cse5 (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_8461))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_8463))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv4 32) (select (select (store (store (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_8460) .cse1 v_ArrVal_8462) .cse2 v_ArrVal_8464) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc39#1.base_6| v_ArrVal_8466) (select (select (store .cse4 .cse2 v_ArrVal_8465) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc39#1.base_6|))))) (or (forall ((v_ArrVal_8463 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8462 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8461 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8460 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8464 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (select (select (let ((.cse8 (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_8461))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_8460) .cse7 v_ArrVal_8462) (select (select (store .cse8 .cse7 v_ArrVal_8463) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_8464))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule .cse6 (bvadd (_ bv4 32) .cse6)))) (forall ((|v_ULTIMATE.start_main_#t~malloc39#1.base_6| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc39#1.base_6|)))))))) is different from false [2024-11-28 04:45:14,796 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8463 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8462 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8461 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8460 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8459 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8458 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8465 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc39#1.base_6| (_ BitVec 32)) (v_ArrVal_8464 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc39#1.base_6|))) (forall ((v_ArrVal_8466 (_ BitVec 32))) (let ((.cse6 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_8459))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_8461))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_8463))) (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$#0.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_8458) .cse0 v_ArrVal_8460) .cse1 v_ArrVal_8462) .cse2 v_ArrVal_8464) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc39#1.base_6| v_ArrVal_8466) (select (select (store .cse4 .cse2 v_ArrVal_8465) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))))) (or (forall ((v_ArrVal_8463 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8462 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8461 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8460 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8459 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8458 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8464 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (select (select (let ((.cse11 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_8459))) (let ((.cse8 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse10 (store .cse11 .cse8 v_ArrVal_8461))) (let ((.cse9 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_8458) .cse8 v_ArrVal_8460) .cse9 v_ArrVal_8462) (select (select (store .cse10 .cse9 v_ArrVal_8463) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_8464))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule .cse7 (bvadd (_ bv4 32) .cse7)))) (forall ((|v_ULTIMATE.start_main_#t~malloc39#1.base_6| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc39#1.base_6|))))))) is different from false [2024-11-28 04:45:15,028 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (and (or (forall ((v_ArrVal_8463 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8462 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8461 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8460 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8459 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8458 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8464 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse6 (store |c_#memory_$Pointer$#0.base| .cse1 v_ArrVal_8459))) (let ((.cse2 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse4 (store .cse6 .cse2 v_ArrVal_8461))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (store (store (store (store |c_#memory_$Pointer$#0.offset| .cse1 v_ArrVal_8458) .cse2 v_ArrVal_8460) .cse3 v_ArrVal_8462) (select (select (store .cse4 .cse3 v_ArrVal_8463) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_ArrVal_8464))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (bvule .cse0 (bvadd (_ bv4 32) .cse0)))) (forall ((|v_ULTIMATE.start_main_#t~malloc39#1.base_6| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc39#1.base_6|))))) (forall ((v_ArrVal_8463 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8462 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8461 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8460 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8459 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8458 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8465 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc39#1.base_6| (_ BitVec 32)) (v_ArrVal_8464 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc39#1.base_6|))) (forall ((v_ArrVal_8466 (_ BitVec 32))) (let ((.cse12 (store |c_#memory_$Pointer$#0.base| .cse1 v_ArrVal_8459))) (let ((.cse7 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse11 (store .cse12 .cse7 v_ArrVal_8461))) (let ((.cse8 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse10 (store .cse11 .cse8 v_ArrVal_8463))) (let ((.cse9 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (bvule (bvadd (_ bv4 32) (select (select (store (store (store (store |c_#memory_$Pointer$#0.offset| .cse1 v_ArrVal_8458) .cse7 v_ArrVal_8460) .cse8 v_ArrVal_8462) .cse9 v_ArrVal_8464) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc39#1.base_6| v_ArrVal_8466) (select (select (store .cse10 .cse9 v_ArrVal_8465) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))))))))))))))) is different from false [2024-11-28 04:45:18,600 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:45:18,601 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 795 treesize of output 819 [2024-11-28 04:45:24,029 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8463 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8462 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8461 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8460 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8466 (_ BitVec 32)) (v_ArrVal_8558 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8459 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8557 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8458 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8465 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc39#1.base_6| (_ BitVec 32)) (v_ArrVal_8464 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |c_ULTIMATE.start_main_#t~mem32#1.base| |v_ULTIMATE.start_main_#t~malloc39#1.base_6|) (let ((.cse8 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_8557))) (let ((.cse0 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse7 (store .cse8 .cse0 v_ArrVal_8459))) (let ((.cse1 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse6 (store .cse7 .cse1 v_ArrVal_8461))) (let ((.cse2 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse5 (store .cse6 .cse2 v_ArrVal_8463))) (let ((.cse3 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (_ bv4 32) (select (select (store (store (store (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_8558) .cse0 v_ArrVal_8458) .cse1 v_ArrVal_8460) .cse2 v_ArrVal_8462) .cse3 v_ArrVal_8464) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc39#1.base_6| v_ArrVal_8466) (select (select (store .cse5 .cse3 v_ArrVal_8465) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))))))))))))) (forall ((v_prenex_39 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_37 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_38 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_35 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_36 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_34 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_43 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_40 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_41 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse9 (select (select (let ((.cse15 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_prenex_40))) (let ((.cse10 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse14 (store .cse15 .cse10 v_prenex_39))) (let ((.cse11 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse13 (store .cse14 .cse11 v_prenex_36))) (let ((.cse12 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem32#1.base| v_prenex_38) .cse10 v_prenex_41) .cse11 v_prenex_37) .cse12 v_prenex_35) (select (select (store .cse13 .cse12 v_prenex_34) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_prenex_43))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule .cse9 (bvadd (_ bv4 32) .cse9)))))) is different from false [2024-11-28 04:45:24,052 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 04:45:24,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [94965729] [2024-11-28 04:45:24,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [94965729] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:45:24,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [572705877] [2024-11-28 04:45:24,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:45:24,052 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-28 04:45:24,052 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e2201e-ae81-4b52-ac26-bd25afdac78a/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 [2024-11-28 04:45:24,054 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e2201e-ae81-4b52-ac26-bd25afdac78a/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-28 04:45:24,055 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74e2201e-ae81-4b52-ac26-bd25afdac78a/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (36)] Waiting until timeout for monitored process [2024-11-28 04:47:19,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:47:19,771 INFO L256 TraceCheckSpWp]: Trace formula consists of 890 conjuncts, 125 conjuncts are in the unsatisfiable core [2024-11-28 04:47:19,785 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:47:19,818 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-28 04:47:21,084 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 04:47:21,404 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-28 04:47:21,405 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2024-11-28 04:47:21,958 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-28 04:47:22,040 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-28 04:47:23,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 35 treesize of output 17 [2024-11-28 04:47:23,918 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-28 04:47:34,444 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:47:34,445 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 68 [2024-11-28 04:47:34,505 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-28 04:47:36,073 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:47:36,074 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 68 [2024-11-28 04:47:36,103 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-28 04:47:37,315 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:47:37,316 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 68 [2024-11-28 04:47:37,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-28 04:47:38,559 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:47:38,560 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 68 [2024-11-28 04:47:38,590 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-28 04:47:39,810 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 04:47:39,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 68 [2024-11-28 04:47:39,840 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-28 04:47:40,167 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 20 [2024-11-28 04:47:40,196 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-28 04:47:40,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:47:40,930 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-28 04:47:41,184 INFO L349 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2024-11-28 04:47:41,184 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2024-11-28 04:47:41,235 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-28 04:47:41,235 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:47:44,264 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9065 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9064 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8465 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc39#1.base_6| (_ BitVec 32)) (v_ArrVal_8464 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_8466 (_ BitVec 32))) (let ((.cse2 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_9065))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_9064) .cse0 v_ArrVal_8464) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc39#1.base_6| v_ArrVal_8466) (select (select (store .cse2 .cse0 v_ArrVal_8465) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc39#1.base_6|))))) (or (forall ((v_ArrVal_9065 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9064 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8464 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_9064) (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_9065) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8464) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule .cse3 (bvadd (_ bv4 32) .cse3)))) (forall ((|v_ULTIMATE.start_main_#t~malloc39#1.base_6| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc39#1.base_6|))))))) is different from false [2024-11-28 04:47:44,471 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$#0.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_9065 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9064 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8465 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc39#1.base_6| (_ BitVec 32)) (v_ArrVal_8464 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc39#1.base_6|))) (forall ((v_ArrVal_8466 (_ BitVec 32))) (let ((.cse3 (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_9065))) (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$#0.offset| .cse0 v_ArrVal_9064) .cse1 v_ArrVal_8464) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc39#1.base_6| v_ArrVal_8466) (select (select (store .cse3 .cse1 v_ArrVal_8465) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc39#1.base_6| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc39#1.base_6|)))) (forall ((v_ArrVal_9065 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9064 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8464 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_9064) (select (select (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_9065) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_8464) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule .cse4 (bvadd (_ bv4 32) .cse4)))))))) is different from false [2024-11-28 04:47:44,820 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (or (forall ((v_ArrVal_9065 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9064 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9063 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9062 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8464 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_9062))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_9063) .cse1 v_ArrVal_9064) (select (select (store .cse2 .cse1 v_ArrVal_9065) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_8464))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule .cse0 (bvadd .cse0 (_ bv4 32))))) (forall ((|v_ULTIMATE.start_main_#t~malloc39#1.base_6| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc39#1.base_6|))))) (forall ((v_ArrVal_9065 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9064 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9063 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9062 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8465 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc39#1.base_6| (_ BitVec 32)) (v_ArrVal_8464 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_8466 (_ BitVec 32))) (let ((.cse7 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_9062))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_9065))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_9063) .cse4 v_ArrVal_9064) .cse5 v_ArrVal_8464) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv4 32)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc39#1.base_6| v_ArrVal_8466) (select (select (store .cse6 .cse5 v_ArrVal_8465) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc39#1.base_6|))))))) is different from false [2024-11-28 04:47:45,019 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$#0.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (and (or (forall ((|v_ULTIMATE.start_main_#t~malloc39#1.base_6| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc39#1.base_6|)))) (forall ((v_ArrVal_9065 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9064 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9063 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9062 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8464 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse3 (store |c_#memory_$Pointer$#0.base| .cse1 v_ArrVal_9062))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store |c_#memory_$Pointer$#0.offset| .cse1 v_ArrVal_9063) .cse2 v_ArrVal_9064) (select (select (store .cse3 .cse2 v_ArrVal_9065) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_8464))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule .cse0 (bvadd (_ bv4 32) .cse0))))) (forall ((v_ArrVal_9065 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9064 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9063 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9062 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8465 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc39#1.base_6| (_ BitVec 32)) (v_ArrVal_8464 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_8466 (_ BitVec 32))) (let ((.cse8 (store |c_#memory_$Pointer$#0.base| .cse1 v_ArrVal_9062))) (let ((.cse5 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse7 (store .cse8 .cse5 v_ArrVal_9065))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (_ bv4 32) (select (select (store (store (store |c_#memory_$Pointer$#0.offset| .cse1 v_ArrVal_9063) .cse5 v_ArrVal_9064) .cse6 v_ArrVal_8464) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc39#1.base_6| v_ArrVal_8466) (select (select (store .cse7 .cse6 v_ArrVal_8465) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc39#1.base_6|)))))))) is different from false [2024-11-28 04:47:58,024 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (and (or (forall ((v_ArrVal_9065 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9064 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9063 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9062 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9061 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9060 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8464 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse6 (store |c_#memory_$Pointer$#0.base| .cse1 v_ArrVal_9061))) (let ((.cse2 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse4 (store .cse6 .cse2 v_ArrVal_9062))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (store (store (store (store |c_#memory_$Pointer$#0.offset| .cse1 v_ArrVal_9060) .cse2 v_ArrVal_9063) .cse3 v_ArrVal_9064) (select (select (store .cse4 .cse3 v_ArrVal_9065) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_ArrVal_8464))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (bvule .cse0 (bvadd (_ bv4 32) .cse0)))) (forall ((|v_ULTIMATE.start_main_#t~malloc39#1.base_6| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc39#1.base_6|))))) (forall ((v_ArrVal_9065 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9064 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9063 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9062 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9061 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9060 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8465 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc39#1.base_6| (_ BitVec 32)) (v_ArrVal_8464 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_8466 (_ BitVec 32))) (let ((.cse12 (store |c_#memory_$Pointer$#0.base| .cse1 v_ArrVal_9061))) (let ((.cse7 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse11 (store .cse12 .cse7 v_ArrVal_9062))) (let ((.cse8 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse10 (store .cse11 .cse8 v_ArrVal_9065))) (let ((.cse9 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (bvule (bvadd (_ bv4 32) (select (select (store (store (store (store |c_#memory_$Pointer$#0.offset| .cse1 v_ArrVal_9060) .cse7 v_ArrVal_9063) .cse8 v_ArrVal_9064) .cse9 v_ArrVal_8464) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc39#1.base_6| v_ArrVal_8466) (select (select (store .cse10 .cse9 v_ArrVal_8465) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)))))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc39#1.base_6|)))))))) is different from false