./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../../sv-benchmarks/c/verifythis/tree_max.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/bin/uautomizer-uyxdKDjOR8/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/verifythis/tree_max.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/bin/uautomizer-uyxdKDjOR8/config/svcomp-MemCleanup-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/bin/uautomizer-uyxdKDjOR8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e98a60ea9ee0c00575c08606ce8b95d0660c5b235c5932147dfee4b13512f57c --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-13 18:16:28,869 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 18:16:28,870 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 18:16:28,882 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 18:16:28,883 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 18:16:28,883 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 18:16:28,884 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 18:16:28,885 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 18:16:28,886 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 18:16:28,886 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 18:16:28,887 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 18:16:28,888 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 18:16:28,888 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 18:16:28,888 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 18:16:28,889 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 18:16:28,890 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 18:16:28,890 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 18:16:28,891 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 18:16:28,892 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 18:16:28,893 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 18:16:28,894 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 18:16:28,895 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 18:16:28,896 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 18:16:28,896 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 18:16:28,898 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 18:16:28,898 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 18:16:28,899 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 18:16:28,899 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 18:16:28,899 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 18:16:28,900 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 18:16:28,900 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 18:16:28,901 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 18:16:28,901 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 18:16:28,902 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 18:16:28,902 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 18:16:28,902 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 18:16:28,903 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 18:16:28,903 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 18:16:28,903 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 18:16:28,904 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 18:16:28,904 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 18:16:28,905 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/bin/uautomizer-uyxdKDjOR8/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2022-12-13 18:16:28,920 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 18:16:28,920 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 18:16:28,921 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 18:16:28,921 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 18:16:28,921 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 18:16:28,921 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 18:16:28,922 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 18:16:28,922 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 18:16:28,922 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 18:16:28,923 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 18:16:28,923 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 18:16:28,923 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-13 18:16:28,923 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 18:16:28,923 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 18:16:28,924 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 18:16:28,924 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-12-13 18:16:28,924 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-12-13 18:16:28,924 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 18:16:28,924 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-13 18:16:28,924 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 18:16:28,924 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 18:16:28,925 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 18:16:28,925 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 18:16:28,925 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 18:16:28,925 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 18:16:28,925 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 18:16:28,925 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 18:16:28,926 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 18:16:28,926 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 18:16:28,926 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 18:16:28,926 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 18:16:28,926 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 18:16:28,926 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 18:16:28,926 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/bin/uautomizer-uyxdKDjOR8/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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_570f3999-5257-4ef9-bcb1-c251b9df1421/bin/uautomizer-uyxdKDjOR8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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-memcleanup) ) 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 -> e98a60ea9ee0c00575c08606ce8b95d0660c5b235c5932147dfee4b13512f57c [2022-12-13 18:16:29,096 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 18:16:29,113 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 18:16:29,115 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 18:16:29,116 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 18:16:29,117 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 18:16:29,118 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/verifythis/tree_max.c [2022-12-13 18:16:31,755 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 18:16:31,876 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 18:16:31,877 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/sv-benchmarks/c/verifythis/tree_max.c [2022-12-13 18:16:31,881 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/bin/uautomizer-uyxdKDjOR8/data/fb7b9587b/e397d50d60684ac2982e05ee98095866/FLAG507d81675 [2022-12-13 18:16:31,892 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/bin/uautomizer-uyxdKDjOR8/data/fb7b9587b/e397d50d60684ac2982e05ee98095866 [2022-12-13 18:16:31,894 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 18:16:31,895 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 18:16:31,896 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 18:16:31,896 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 18:16:31,899 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 18:16:31,899 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 06:16:31" (1/1) ... [2022-12-13 18:16:31,900 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24c95bf1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:16:31, skipping insertion in model container [2022-12-13 18:16:31,900 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 06:16:31" (1/1) ... [2022-12-13 18:16:31,906 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 18:16:31,916 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 18:16:32,014 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/sv-benchmarks/c/verifythis/tree_max.c[544,557] [2022-12-13 18:16:32,028 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 18:16:32,036 ERROR L326 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) [2022-12-13 18:16:32,037 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@198591c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:16:32, skipping insertion in model container [2022-12-13 18:16:32,037 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 18:16:32,037 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2022-12-13 18:16:32,038 INFO L158 Benchmark]: Toolchain (without parser) took 142.71ms. Allocated memory is still 146.8MB. Free memory was 111.4MB in the beginning and 102.1MB in the end (delta: 9.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-12-13 18:16:32,039 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 98.6MB. Free memory was 68.2MB in the beginning and 68.1MB in the end (delta: 30.8kB). There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 18:16:32,039 INFO L158 Benchmark]: CACSL2BoogieTranslator took 141.06ms. Allocated memory is still 146.8MB. Free memory was 111.4MB in the beginning and 102.1MB in the end (delta: 9.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-12-13 18:16:32,040 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 98.6MB. Free memory was 68.2MB in the beginning and 68.1MB in the end (delta: 30.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 141.06ms. Allocated memory is still 146.8MB. Free memory was 111.4MB in the beginning and 102.1MB in the end (delta: 9.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 27]: 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/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/bin/uautomizer-uyxdKDjOR8/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/verifythis/tree_max.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/bin/uautomizer-uyxdKDjOR8/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/bin/uautomizer-uyxdKDjOR8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e98a60ea9ee0c00575c08606ce8b95d0660c5b235c5932147dfee4b13512f57c --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-13 18:16:33,322 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 18:16:33,323 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 18:16:33,343 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 18:16:33,344 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 18:16:33,345 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 18:16:33,346 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 18:16:33,347 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 18:16:33,348 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 18:16:33,349 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 18:16:33,350 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 18:16:33,350 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 18:16:33,351 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 18:16:33,352 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 18:16:33,352 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 18:16:33,353 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 18:16:33,354 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 18:16:33,355 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 18:16:33,356 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 18:16:33,357 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 18:16:33,358 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 18:16:33,359 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 18:16:33,360 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 18:16:33,361 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 18:16:33,363 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 18:16:33,364 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 18:16:33,364 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 18:16:33,365 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 18:16:33,365 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 18:16:33,366 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 18:16:33,366 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 18:16:33,367 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 18:16:33,368 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 18:16:33,368 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 18:16:33,369 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 18:16:33,369 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 18:16:33,370 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 18:16:33,370 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 18:16:33,371 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 18:16:33,371 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 18:16:33,372 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 18:16:33,373 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/bin/uautomizer-uyxdKDjOR8/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf [2022-12-13 18:16:33,390 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 18:16:33,390 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 18:16:33,391 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 18:16:33,391 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 18:16:33,391 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 18:16:33,391 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 18:16:33,392 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 18:16:33,392 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 18:16:33,392 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 18:16:33,393 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 18:16:33,393 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 18:16:33,393 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-13 18:16:33,393 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 18:16:33,393 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 18:16:33,394 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 18:16:33,394 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-12-13 18:16:33,394 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-12-13 18:16:33,394 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 18:16:33,394 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-13 18:16:33,394 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-12-13 18:16:33,395 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-12-13 18:16:33,395 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 18:16:33,395 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 18:16:33,395 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 18:16:33,395 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 18:16:33,395 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 18:16:33,396 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 18:16:33,396 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 18:16:33,396 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 18:16:33,396 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-12-13 18:16:33,396 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-12-13 18:16:33,396 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 18:16:33,397 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 18:16:33,397 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 18:16:33,397 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2022-12-13 18:16:33,397 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 18:16:33,397 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/bin/uautomizer-uyxdKDjOR8/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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_570f3999-5257-4ef9-bcb1-c251b9df1421/bin/uautomizer-uyxdKDjOR8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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-memcleanup) ) 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 -> e98a60ea9ee0c00575c08606ce8b95d0660c5b235c5932147dfee4b13512f57c [2022-12-13 18:16:33,609 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 18:16:33,625 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 18:16:33,627 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 18:16:33,628 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 18:16:33,628 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 18:16:33,630 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/verifythis/tree_max.c [2022-12-13 18:16:36,186 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 18:16:36,314 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 18:16:36,315 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/sv-benchmarks/c/verifythis/tree_max.c [2022-12-13 18:16:36,320 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/bin/uautomizer-uyxdKDjOR8/data/99696f5da/be81e541585b4c6ba4519ebd0ac8adfc/FLAG387337f0e [2022-12-13 18:16:36,330 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/bin/uautomizer-uyxdKDjOR8/data/99696f5da/be81e541585b4c6ba4519ebd0ac8adfc [2022-12-13 18:16:36,332 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 18:16:36,333 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 18:16:36,334 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 18:16:36,334 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 18:16:36,337 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 18:16:36,338 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 06:16:36" (1/1) ... [2022-12-13 18:16:36,338 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6172b697 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:16:36, skipping insertion in model container [2022-12-13 18:16:36,338 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 06:16:36" (1/1) ... [2022-12-13 18:16:36,344 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 18:16:36,355 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 18:16:36,463 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/sv-benchmarks/c/verifythis/tree_max.c[544,557] [2022-12-13 18:16:36,477 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 18:16:36,488 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-12-13 18:16:36,490 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 18:16:36,492 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/sv-benchmarks/c/verifythis/tree_max.c[544,557] [2022-12-13 18:16:36,498 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 18:16:36,502 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 18:16:36,517 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/sv-benchmarks/c/verifythis/tree_max.c[544,557] [2022-12-13 18:16:36,523 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 18:16:36,535 INFO L208 MainTranslator]: Completed translation [2022-12-13 18:16:36,535 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:16:36 WrapperNode [2022-12-13 18:16:36,535 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 18:16:36,536 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 18:16:36,536 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 18:16:36,536 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 18:16:36,541 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:16:36" (1/1) ... [2022-12-13 18:16:36,551 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:16:36" (1/1) ... [2022-12-13 18:16:36,570 INFO L138 Inliner]: procedures = 26, calls = 28, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 37 [2022-12-13 18:16:36,570 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 18:16:36,571 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 18:16:36,571 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 18:16:36,571 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 18:16:36,578 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:16:36" (1/1) ... [2022-12-13 18:16:36,578 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:16:36" (1/1) ... [2022-12-13 18:16:36,581 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:16:36" (1/1) ... [2022-12-13 18:16:36,582 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:16:36" (1/1) ... [2022-12-13 18:16:36,590 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:16:36" (1/1) ... [2022-12-13 18:16:36,592 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:16:36" (1/1) ... [2022-12-13 18:16:36,594 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:16:36" (1/1) ... [2022-12-13 18:16:36,595 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:16:36" (1/1) ... [2022-12-13 18:16:36,598 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 18:16:36,599 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 18:16:36,599 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 18:16:36,599 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 18:16:36,600 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:16:36" (1/1) ... [2022-12-13 18:16:36,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 18:16:36,615 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:16:36,625 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 18:16:36,627 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 18:16:36,653 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 18:16:36,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-12-13 18:16:36,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-12-13 18:16:36,653 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-12-13 18:16:36,653 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-12-13 18:16:36,653 INFO L130 BoogieDeclarations]: Found specification of procedure max [2022-12-13 18:16:36,653 INFO L138 BoogieDeclarations]: Found implementation of procedure max [2022-12-13 18:16:36,654 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_tree [2022-12-13 18:16:36,654 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_tree [2022-12-13 18:16:36,654 INFO L130 BoogieDeclarations]: Found specification of procedure check [2022-12-13 18:16:36,654 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2022-12-13 18:16:36,654 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-13 18:16:36,654 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 18:16:36,654 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 18:16:36,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-12-13 18:16:36,723 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 18:16:36,725 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 18:16:37,005 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 18:16:37,010 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 18:16:37,010 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 18:16:37,012 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 06:16:37 BoogieIcfgContainer [2022-12-13 18:16:37,012 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 18:16:37,014 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 18:16:37,014 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 18:16:37,016 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 18:16:37,016 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 06:16:36" (1/3) ... [2022-12-13 18:16:37,017 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e66a81a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 06:16:37, skipping insertion in model container [2022-12-13 18:16:37,017 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:16:36" (2/3) ... [2022-12-13 18:16:37,017 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e66a81a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 06:16:37, skipping insertion in model container [2022-12-13 18:16:37,017 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 06:16:37" (3/3) ... [2022-12-13 18:16:37,018 INFO L112 eAbstractionObserver]: Analyzing ICFG tree_max.c [2022-12-13 18:16:37,033 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 18:16:37,033 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 20 error locations. [2022-12-13 18:16:37,067 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 18:16:37,072 INFO L357 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, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@fecb6c0, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 18:16:37,072 INFO L358 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2022-12-13 18:16:37,075 INFO L276 IsEmpty]: Start isEmpty. Operand has 72 states, 39 states have (on average 1.6923076923076923) internal successors, (66), 59 states have internal predecessors, (66), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-12-13 18:16:37,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-12-13 18:16:37,085 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:16:37,085 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-12-13 18:16:37,086 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting nondet_treeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [maxErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, maxErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, maxErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-12-13 18:16:37,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:16:37,090 INFO L85 PathProgramCache]: Analyzing trace with hash 73597257, now seen corresponding path program 1 times [2022-12-13 18:16:37,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 18:16:37,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1459373947] [2022-12-13 18:16:37,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:16:37,100 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 18:16:37,100 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 18:16:37,101 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 18:16:37,102 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-12-13 18:16:37,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:16:37,194 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 18:16:37,198 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:16:37,260 INFO L350 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 [2022-12-13 18:16:37,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:16:37,273 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 18:16:37,273 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 18:16:37,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1459373947] [2022-12-13 18:16:37,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1459373947] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:16:37,274 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:16:37,274 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 18:16:37,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127797334] [2022-12-13 18:16:37,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:16:37,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 18:16:37,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 18:16:37,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 18:16:37,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 18:16:37,312 INFO L87 Difference]: Start difference. First operand has 72 states, 39 states have (on average 1.6923076923076923) internal successors, (66), 59 states have internal predecessors, (66), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:16:37,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:16:37,421 INFO L93 Difference]: Finished difference Result 73 states and 86 transitions. [2022-12-13 18:16:37,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 18:16:37,424 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-12-13 18:16:37,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:16:37,430 INFO L225 Difference]: With dead ends: 73 [2022-12-13 18:16:37,430 INFO L226 Difference]: Without dead ends: 71 [2022-12-13 18:16:37,431 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 18:16:37,434 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 6 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 18:16:37,434 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 133 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 18:16:37,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-12-13 18:16:37,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 69. [2022-12-13 18:16:37,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 38 states have (on average 1.631578947368421) internal successors, (62), 56 states have internal predecessors, (62), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-12-13 18:16:37,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 80 transitions. [2022-12-13 18:16:37,476 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 80 transitions. Word has length 5 [2022-12-13 18:16:37,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:16:37,477 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 80 transitions. [2022-12-13 18:16:37,477 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:16:37,477 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 80 transitions. [2022-12-13 18:16:37,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-12-13 18:16:37,478 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:16:37,478 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-12-13 18:16:37,492 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-12-13 18:16:37,678 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 18:16:37,680 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting nondet_treeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [maxErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, maxErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, maxErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-12-13 18:16:37,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:16:37,682 INFO L85 PathProgramCache]: Analyzing trace with hash 73597258, now seen corresponding path program 1 times [2022-12-13 18:16:37,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 18:16:37,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [392723834] [2022-12-13 18:16:37,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:16:37,685 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 18:16:37,685 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 18:16:37,688 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 18:16:37,692 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-12-13 18:16:37,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:16:37,769 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-13 18:16:37,770 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:16:37,779 INFO L350 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 [2022-12-13 18:16:37,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:16:37,789 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 18:16:37,789 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 18:16:37,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [392723834] [2022-12-13 18:16:37,789 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [392723834] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:16:37,789 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:16:37,790 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 18:16:37,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147492275] [2022-12-13 18:16:37,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:16:37,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 18:16:37,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 18:16:37,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 18:16:37,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 18:16:37,792 INFO L87 Difference]: Start difference. First operand 69 states and 80 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:16:37,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:16:37,884 INFO L93 Difference]: Finished difference Result 68 states and 79 transitions. [2022-12-13 18:16:37,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 18:16:37,885 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-12-13 18:16:37,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:16:37,886 INFO L225 Difference]: With dead ends: 68 [2022-12-13 18:16:37,887 INFO L226 Difference]: Without dead ends: 68 [2022-12-13 18:16:37,887 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 18:16:37,888 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 2 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 18:16:37,888 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 132 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 18:16:37,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-12-13 18:16:37,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2022-12-13 18:16:37,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 38 states have (on average 1.605263157894737) internal successors, (61), 55 states have internal predecessors, (61), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-12-13 18:16:37,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 79 transitions. [2022-12-13 18:16:37,894 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 79 transitions. Word has length 5 [2022-12-13 18:16:37,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:16:37,894 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 79 transitions. [2022-12-13 18:16:37,894 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:16:37,894 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 79 transitions. [2022-12-13 18:16:37,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-12-13 18:16:37,894 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:16:37,894 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:16:37,905 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-12-13 18:16:38,095 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 18:16:38,097 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting maxErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [maxErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, maxErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, maxErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-12-13 18:16:38,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:16:38,100 INFO L85 PathProgramCache]: Analyzing trace with hash -345289291, now seen corresponding path program 1 times [2022-12-13 18:16:38,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 18:16:38,102 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1492625475] [2022-12-13 18:16:38,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:16:38,103 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 18:16:38,104 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 18:16:38,107 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 18:16:38,111 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-12-13 18:16:38,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:16:38,242 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-13 18:16:38,245 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:16:38,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:16:38,347 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 18:16:38,348 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 18:16:38,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1492625475] [2022-12-13 18:16:38,348 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1492625475] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:16:38,348 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:16:38,348 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 18:16:38,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703092291] [2022-12-13 18:16:38,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:16:38,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 18:16:38,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 18:16:38,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 18:16:38,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 18:16:38,351 INFO L87 Difference]: Start difference. First operand 68 states and 79 transitions. Second operand has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-13 18:16:38,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:16:38,475 INFO L93 Difference]: Finished difference Result 83 states and 98 transitions. [2022-12-13 18:16:38,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 18:16:38,476 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-12-13 18:16:38,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:16:38,477 INFO L225 Difference]: With dead ends: 83 [2022-12-13 18:16:38,477 INFO L226 Difference]: Without dead ends: 83 [2022-12-13 18:16:38,478 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-12-13 18:16:38,479 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 11 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 18:16:38,479 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 432 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 18:16:38,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-12-13 18:16:38,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 76. [2022-12-13 18:16:38,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 43 states have (on average 1.5348837209302326) internal successors, (66), 61 states have internal predecessors, (66), 10 states have call successors, (10), 4 states have call predecessors, (10), 5 states have return successors, (13), 10 states have call predecessors, (13), 10 states have call successors, (13) [2022-12-13 18:16:38,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 89 transitions. [2022-12-13 18:16:38,489 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 89 transitions. Word has length 11 [2022-12-13 18:16:38,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:16:38,489 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 89 transitions. [2022-12-13 18:16:38,489 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-13 18:16:38,489 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 89 transitions. [2022-12-13 18:16:38,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-12-13 18:16:38,490 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:16:38,490 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:16:38,501 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2022-12-13 18:16:38,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 18:16:38,692 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting nondet_treeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [maxErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, maxErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, maxErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-12-13 18:16:38,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:16:38,694 INFO L85 PathProgramCache]: Analyzing trace with hash -159104294, now seen corresponding path program 1 times [2022-12-13 18:16:38,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 18:16:38,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [241386686] [2022-12-13 18:16:38,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:16:38,698 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 18:16:38,699 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 18:16:38,702 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 18:16:38,705 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-12-13 18:16:38,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:16:38,849 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-13 18:16:38,851 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:16:38,858 INFO L350 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 [2022-12-13 18:16:38,886 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:16:38,887 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 18:16:38,887 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 18:16:38,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [241386686] [2022-12-13 18:16:38,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [241386686] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:16:38,887 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:16:38,887 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 18:16:38,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219862634] [2022-12-13 18:16:38,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:16:38,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 18:16:38,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 18:16:38,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 18:16:38,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 18:16:38,889 INFO L87 Difference]: Start difference. First operand 76 states and 89 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-13 18:16:39,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:16:39,093 INFO L93 Difference]: Finished difference Result 80 states and 93 transitions. [2022-12-13 18:16:39,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 18:16:39,094 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-12-13 18:16:39,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:16:39,095 INFO L225 Difference]: With dead ends: 80 [2022-12-13 18:16:39,095 INFO L226 Difference]: Without dead ends: 80 [2022-12-13 18:16:39,095 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 18:16:39,097 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 53 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 18:16:39,097 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 38 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 18:16:39,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-12-13 18:16:39,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 78. [2022-12-13 18:16:39,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 45 states have (on average 1.5555555555555556) internal successors, (70), 61 states have internal predecessors, (70), 10 states have call successors, (10), 4 states have call predecessors, (10), 5 states have return successors, (13), 12 states have call predecessors, (13), 10 states have call successors, (13) [2022-12-13 18:16:39,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 93 transitions. [2022-12-13 18:16:39,103 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 93 transitions. Word has length 11 [2022-12-13 18:16:39,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:16:39,103 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 93 transitions. [2022-12-13 18:16:39,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-13 18:16:39,103 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 93 transitions. [2022-12-13 18:16:39,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-12-13 18:16:39,104 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:16:39,104 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:16:39,113 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-12-13 18:16:39,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 18:16:39,306 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting nondet_treeErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [maxErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, maxErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, maxErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-12-13 18:16:39,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:16:39,307 INFO L85 PathProgramCache]: Analyzing trace with hash -159104293, now seen corresponding path program 1 times [2022-12-13 18:16:39,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 18:16:39,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1725440708] [2022-12-13 18:16:39,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:16:39,310 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 18:16:39,310 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 18:16:39,313 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 18:16:39,316 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-12-13 18:16:39,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:16:39,475 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 18:16:39,477 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:16:39,484 INFO L350 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 [2022-12-13 18:16:39,522 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:16:39,522 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 18:16:39,522 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 18:16:39,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1725440708] [2022-12-13 18:16:39,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1725440708] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:16:39,523 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:16:39,523 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 18:16:39,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995190430] [2022-12-13 18:16:39,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:16:39,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 18:16:39,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 18:16:39,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 18:16:39,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 18:16:39,524 INFO L87 Difference]: Start difference. First operand 78 states and 93 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-13 18:16:39,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:16:39,754 INFO L93 Difference]: Finished difference Result 84 states and 103 transitions. [2022-12-13 18:16:39,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 18:16:39,755 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-12-13 18:16:39,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:16:39,756 INFO L225 Difference]: With dead ends: 84 [2022-12-13 18:16:39,756 INFO L226 Difference]: Without dead ends: 84 [2022-12-13 18:16:39,756 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 18:16:39,757 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 51 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 18:16:39,757 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 49 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 18:16:39,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-12-13 18:16:39,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 81. [2022-12-13 18:16:39,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 47 states have (on average 1.5106382978723405) internal successors, (71), 63 states have internal predecessors, (71), 11 states have call successors, (11), 4 states have call predecessors, (11), 5 states have return successors, (15), 13 states have call predecessors, (15), 11 states have call successors, (15) [2022-12-13 18:16:39,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 97 transitions. [2022-12-13 18:16:39,765 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 97 transitions. Word has length 11 [2022-12-13 18:16:39,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:16:39,765 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 97 transitions. [2022-12-13 18:16:39,765 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-13 18:16:39,765 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 97 transitions. [2022-12-13 18:16:39,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-12-13 18:16:39,766 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:16:39,766 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:16:39,774 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2022-12-13 18:16:39,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 18:16:39,968 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting checkErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [maxErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, maxErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, maxErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-12-13 18:16:39,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:16:39,969 INFO L85 PathProgramCache]: Analyzing trace with hash -1041946460, now seen corresponding path program 1 times [2022-12-13 18:16:39,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 18:16:39,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1525034133] [2022-12-13 18:16:39,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:16:39,971 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 18:16:39,971 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 18:16:39,974 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 18:16:39,976 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-12-13 18:16:40,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:16:40,106 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-13 18:16:40,108 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:16:40,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:16:40,184 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 18:16:40,184 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 18:16:40,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1525034133] [2022-12-13 18:16:40,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1525034133] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:16:40,184 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:16:40,184 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 18:16:40,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736341922] [2022-12-13 18:16:40,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:16:40,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 18:16:40,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 18:16:40,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 18:16:40,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 18:16:40,188 INFO L87 Difference]: Start difference. First operand 81 states and 97 transitions. Second operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-13 18:16:40,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:16:40,275 INFO L93 Difference]: Finished difference Result 92 states and 109 transitions. [2022-12-13 18:16:40,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 18:16:40,275 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2022-12-13 18:16:40,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:16:40,276 INFO L225 Difference]: With dead ends: 92 [2022-12-13 18:16:40,276 INFO L226 Difference]: Without dead ends: 92 [2022-12-13 18:16:40,277 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-12-13 18:16:40,277 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 10 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 18:16:40,278 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 432 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 18:16:40,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-12-13 18:16:40,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 87. [2022-12-13 18:16:40,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 51 states have (on average 1.4705882352941178) internal successors, (75), 67 states have internal predecessors, (75), 12 states have call successors, (12), 5 states have call predecessors, (12), 6 states have return successors, (16), 14 states have call predecessors, (16), 12 states have call successors, (16) [2022-12-13 18:16:40,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 103 transitions. [2022-12-13 18:16:40,286 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 103 transitions. Word has length 17 [2022-12-13 18:16:40,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:16:40,287 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 103 transitions. [2022-12-13 18:16:40,287 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-13 18:16:40,287 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 103 transitions. [2022-12-13 18:16:40,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-12-13 18:16:40,288 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:16:40,288 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:16:40,299 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2022-12-13 18:16:40,488 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 18:16:40,489 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [maxErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, maxErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, maxErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-12-13 18:16:40,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:16:40,490 INFO L85 PathProgramCache]: Analyzing trace with hash -868680531, now seen corresponding path program 1 times [2022-12-13 18:16:40,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 18:16:40,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1871884351] [2022-12-13 18:16:40,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:16:40,491 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 18:16:40,491 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 18:16:40,492 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 18:16:40,494 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-12-13 18:16:40,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:16:40,592 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-13 18:16:40,593 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:16:40,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:16:40,615 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 18:16:40,615 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 18:16:40,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1871884351] [2022-12-13 18:16:40,615 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1871884351] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:16:40,615 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:16:40,616 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 18:16:40,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443289634] [2022-12-13 18:16:40,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:16:40,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 18:16:40,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 18:16:40,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 18:16:40,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 18:16:40,617 INFO L87 Difference]: Start difference. First operand 87 states and 103 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-12-13 18:16:40,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:16:40,771 INFO L93 Difference]: Finished difference Result 89 states and 104 transitions. [2022-12-13 18:16:40,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 18:16:40,771 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 20 [2022-12-13 18:16:40,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:16:40,772 INFO L225 Difference]: With dead ends: 89 [2022-12-13 18:16:40,772 INFO L226 Difference]: Without dead ends: 75 [2022-12-13 18:16:40,773 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 18:16:40,773 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 46 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 18:16:40,774 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 48 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 18:16:40,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-12-13 18:16:40,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2022-12-13 18:16:40,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 43 states have (on average 1.558139534883721) internal successors, (67), 59 states have internal predecessors, (67), 10 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (13), 12 states have call predecessors, (13), 10 states have call successors, (13) [2022-12-13 18:16:40,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 90 transitions. [2022-12-13 18:16:40,779 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 90 transitions. Word has length 20 [2022-12-13 18:16:40,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:16:40,779 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 90 transitions. [2022-12-13 18:16:40,779 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-12-13 18:16:40,779 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 90 transitions. [2022-12-13 18:16:40,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-12-13 18:16:40,780 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:16:40,780 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:16:40,789 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-12-13 18:16:40,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 18:16:40,982 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting nondet_treeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [maxErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, maxErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, maxErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-12-13 18:16:40,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:16:40,984 INFO L85 PathProgramCache]: Analyzing trace with hash -360622958, now seen corresponding path program 1 times [2022-12-13 18:16:40,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 18:16:40,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1716031684] [2022-12-13 18:16:40,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:16:40,985 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 18:16:40,986 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 18:16:40,988 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 18:16:40,991 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-12-13 18:16:41,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:16:41,173 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 11 conjunts are in the unsatisfiable core [2022-12-13 18:16:41,175 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:16:41,179 INFO L350 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 [2022-12-13 18:16:41,205 WARN L859 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_107 (_ BitVec 1))) (= (store |c_old(#valid)| nondet_tree_~n~0.base v_ArrVal_107) |c_#valid|)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-12-13 18:16:41,236 WARN L859 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32)) (v_ArrVal_107 (_ BitVec 1))) (and (= (store |c_old(#valid)| nondet_tree_~n~0.base v_ArrVal_107) |c_#valid|) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-12-13 18:16:41,303 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-12-13 18:16:41,304 INFO L350 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 [2022-12-13 18:16:41,311 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 8 not checked. [2022-12-13 18:16:41,311 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 18:16:41,436 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 18:16:41,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1716031684] [2022-12-13 18:16:41,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1716031684] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 18:16:41,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1428025614] [2022-12-13 18:16:41,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:16:41,437 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-13 18:16:41,437 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/bin/uautomizer-uyxdKDjOR8/cvc4 [2022-12-13 18:16:41,438 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-13 18:16:41,439 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt (10)] Waiting until timeout for monitored process [2022-12-13 18:16:41,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:16:41,602 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-13 18:16:41,605 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:16:41,611 INFO L350 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 [2022-12-13 18:16:41,625 WARN L859 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (= (store |c_old(#valid)| nondet_tree_~n~0.base (_ bv1 1)) |c_#valid|)) is different from true [2022-12-13 18:16:41,669 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-12-13 18:16:41,670 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-12-13 18:16:41,676 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 8 not checked. [2022-12-13 18:16:41,677 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 18:16:41,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1428025614] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 18:16:41,765 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 18:16:41,765 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 6 [2022-12-13 18:16:41,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195807934] [2022-12-13 18:16:41,766 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 18:16:41,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 18:16:41,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 18:16:41,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 18:16:41,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=15, Unknown=3, NotChecked=24, Total=56 [2022-12-13 18:16:41,767 INFO L87 Difference]: Start difference. First operand 75 states and 90 transitions. Second operand has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 5 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) [2022-12-13 18:16:44,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:16:44,009 INFO L93 Difference]: Finished difference Result 82 states and 100 transitions. [2022-12-13 18:16:44,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 18:16:44,010 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 5 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) Word has length 29 [2022-12-13 18:16:44,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:16:44,011 INFO L225 Difference]: With dead ends: 82 [2022-12-13 18:16:44,011 INFO L226 Difference]: Without dead ends: 82 [2022-12-13 18:16:44,011 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 60 SyntacticMatches, 5 SemanticMatches, 7 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=18, Invalid=21, Unknown=3, NotChecked=30, Total=72 [2022-12-13 18:16:44,011 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 58 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 255 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 18:16:44,012 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 36 Invalid, 417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 150 Invalid, 0 Unknown, 255 Unchecked, 0.2s Time] [2022-12-13 18:16:44,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-12-13 18:16:44,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 79. [2022-12-13 18:16:44,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 46 states have (on average 1.5434782608695652) internal successors, (71), 62 states have internal predecessors, (71), 10 states have call successors, (10), 3 states have call predecessors, (10), 5 states have return successors, (17), 13 states have call predecessors, (17), 10 states have call successors, (17) [2022-12-13 18:16:44,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 98 transitions. [2022-12-13 18:16:44,018 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 98 transitions. Word has length 29 [2022-12-13 18:16:44,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:16:44,018 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 98 transitions. [2022-12-13 18:16:44,018 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 5 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) [2022-12-13 18:16:44,018 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 98 transitions. [2022-12-13 18:16:44,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-12-13 18:16:44,019 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:16:44,019 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:16:44,028 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2022-12-13 18:16:44,223 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt (10)] Ended with exit code 0 [2022-12-13 18:16:44,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt [2022-12-13 18:16:44,422 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting nondet_treeErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [maxErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, maxErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, maxErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-12-13 18:16:44,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:16:44,423 INFO L85 PathProgramCache]: Analyzing trace with hash 1828073473, now seen corresponding path program 1 times [2022-12-13 18:16:44,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 18:16:44,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [374713322] [2022-12-13 18:16:44,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:16:44,425 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 18:16:44,425 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 18:16:44,427 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 18:16:44,431 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-12-13 18:16:44,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:16:44,650 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-13 18:16:44,652 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:16:44,659 INFO L350 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 [2022-12-13 18:16:44,663 INFO L350 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 [2022-12-13 18:16:44,711 WARN L859 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_248 (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_248))) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-12-13 18:16:44,743 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_248 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32))) (and (= |c_#length| (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_248)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-12-13 18:16:44,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:16:44,799 INFO L350 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 12 treesize of output 14 [2022-12-13 18:16:44,810 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-13 18:16:44,810 INFO L350 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 [2022-12-13 18:16:44,823 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 8 not checked. [2022-12-13 18:16:44,823 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 18:16:47,015 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 18:16:47,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [374713322] [2022-12-13 18:16:47,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [374713322] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 18:16:47,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [285665329] [2022-12-13 18:16:47,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:16:47,016 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-13 18:16:47,016 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/bin/uautomizer-uyxdKDjOR8/cvc4 [2022-12-13 18:16:47,017 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-13 18:16:47,017 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt (12)] Waiting until timeout for monitored process [2022-12-13 18:16:47,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:16:47,225 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-13 18:16:47,228 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:16:47,234 INFO L350 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 [2022-12-13 18:16:47,238 INFO L350 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 [2022-12-13 18:16:47,268 WARN L859 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_323 (_ BitVec 32))) (= (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_323) |c_#length|)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-12-13 18:16:47,293 WARN L859 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32)) (v_ArrVal_323 (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)) (= (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_323) |c_#length|))) is different from true [2022-12-13 18:16:47,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:16:47,344 INFO L350 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 12 treesize of output 14 [2022-12-13 18:16:47,354 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-13 18:16:47,355 INFO L350 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 [2022-12-13 18:16:47,358 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 8 not checked. [2022-12-13 18:16:47,358 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 18:16:49,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [285665329] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 18:16:49,526 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 18:16:49,526 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2022-12-13 18:16:49,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923097821] [2022-12-13 18:16:49,526 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 18:16:49,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 18:16:49,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 18:16:49,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 18:16:49,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=41, Unknown=5, NotChecked=60, Total=132 [2022-12-13 18:16:49,527 INFO L87 Difference]: Start difference. First operand 79 states and 98 transitions. Second operand has 10 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 8 states have internal predecessors, (31), 6 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 6 states have call successors, (7) [2022-12-13 18:16:49,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:16:49,865 INFO L93 Difference]: Finished difference Result 86 states and 111 transitions. [2022-12-13 18:16:49,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 18:16:49,866 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 8 states have internal predecessors, (31), 6 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 6 states have call successors, (7) Word has length 35 [2022-12-13 18:16:49,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:16:49,867 INFO L225 Difference]: With dead ends: 86 [2022-12-13 18:16:49,867 INFO L226 Difference]: Without dead ends: 86 [2022-12-13 18:16:49,868 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 61 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=32, Invalid=51, Unknown=5, NotChecked=68, Total=156 [2022-12-13 18:16:49,868 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 98 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 605 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 356 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 18:16:49,869 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 56 Invalid, 605 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 222 Invalid, 0 Unknown, 356 Unchecked, 0.3s Time] [2022-12-13 18:16:49,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-12-13 18:16:49,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 82. [2022-12-13 18:16:49,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 48 states have (on average 1.5) internal successors, (72), 64 states have internal predecessors, (72), 11 states have call successors, (11), 3 states have call predecessors, (11), 5 states have return successors, (20), 14 states have call predecessors, (20), 11 states have call successors, (20) [2022-12-13 18:16:49,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 103 transitions. [2022-12-13 18:16:49,876 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 103 transitions. Word has length 35 [2022-12-13 18:16:49,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:16:49,876 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 103 transitions. [2022-12-13 18:16:49,876 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 8 states have internal predecessors, (31), 6 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 6 states have call successors, (7) [2022-12-13 18:16:49,876 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 103 transitions. [2022-12-13 18:16:49,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-12-13 18:16:49,877 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:16:49,877 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:16:49,887 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-12-13 18:16:50,084 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt (12)] Ended with exit code 0 [2022-12-13 18:16:50,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt [2022-12-13 18:16:50,279 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting maxErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [maxErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, maxErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, maxErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-12-13 18:16:50,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:16:50,280 INFO L85 PathProgramCache]: Analyzing trace with hash -694882647, now seen corresponding path program 1 times [2022-12-13 18:16:50,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 18:16:50,281 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1567761910] [2022-12-13 18:16:50,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:16:50,282 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 18:16:50,282 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 18:16:50,285 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 18:16:50,286 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-12-13 18:16:50,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:16:50,370 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-13 18:16:50,372 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:16:50,374 INFO L350 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 [2022-12-13 18:16:50,434 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 18:16:50,434 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 18:16:50,552 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 18:16:50,553 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 18:16:50,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1567761910] [2022-12-13 18:16:50,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1567761910] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 18:16:50,553 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 18:16:50,553 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2022-12-13 18:16:50,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701584045] [2022-12-13 18:16:50,553 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 18:16:50,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 18:16:50,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 18:16:50,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 18:16:50,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-12-13 18:16:50,554 INFO L87 Difference]: Start difference. First operand 82 states and 103 transitions. Second operand has 10 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 3 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 18:16:51,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:16:51,255 INFO L93 Difference]: Finished difference Result 97 states and 125 transitions. [2022-12-13 18:16:51,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 18:16:51,255 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 3 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 25 [2022-12-13 18:16:51,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:16:51,256 INFO L225 Difference]: With dead ends: 97 [2022-12-13 18:16:51,256 INFO L226 Difference]: Without dead ends: 97 [2022-12-13 18:16:51,256 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2022-12-13 18:16:51,257 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 177 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 501 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 549 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-12-13 18:16:51,257 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 59 Invalid, 549 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 501 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-12-13 18:16:51,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-12-13 18:16:51,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 91. [2022-12-13 18:16:51,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 58 states have (on average 1.4310344827586208) internal successors, (83), 71 states have internal predecessors, (83), 13 states have call successors, (13), 4 states have call predecessors, (13), 6 states have return successors, (22), 15 states have call predecessors, (22), 13 states have call successors, (22) [2022-12-13 18:16:51,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 118 transitions. [2022-12-13 18:16:51,260 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 118 transitions. Word has length 25 [2022-12-13 18:16:51,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:16:51,261 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 118 transitions. [2022-12-13 18:16:51,261 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 3 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 18:16:51,261 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 118 transitions. [2022-12-13 18:16:51,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-12-13 18:16:51,261 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:16:51,261 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:16:51,268 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2022-12-13 18:16:51,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 18:16:51,463 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting maxErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [maxErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, maxErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, maxErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-12-13 18:16:51,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:16:51,464 INFO L85 PathProgramCache]: Analyzing trace with hash -694882646, now seen corresponding path program 1 times [2022-12-13 18:16:51,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 18:16:51,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1751491430] [2022-12-13 18:16:51,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:16:51,472 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 18:16:51,472 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 18:16:51,473 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 18:16:51,474 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-12-13 18:16:51,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:16:51,547 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 20 conjunts are in the unsatisfiable core [2022-12-13 18:16:51,548 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:16:51,552 INFO L350 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 [2022-12-13 18:16:51,693 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 18:16:51,693 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 18:16:52,585 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 18:16:52,585 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 18:16:52,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1751491430] [2022-12-13 18:16:52,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1751491430] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 18:16:52,585 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 18:16:52,586 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2022-12-13 18:16:52,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832422773] [2022-12-13 18:16:52,586 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 18:16:52,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-13 18:16:52,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 18:16:52,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-13 18:16:52,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2022-12-13 18:16:52,587 INFO L87 Difference]: Start difference. First operand 91 states and 118 transitions. Second operand has 16 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 12 states have internal predecessors, (30), 5 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-12-13 18:16:54,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:16:54,673 INFO L93 Difference]: Finished difference Result 116 states and 153 transitions. [2022-12-13 18:16:54,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 18:16:54,675 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 12 states have internal predecessors, (30), 5 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 25 [2022-12-13 18:16:54,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:16:54,676 INFO L225 Difference]: With dead ends: 116 [2022-12-13 18:16:54,676 INFO L226 Difference]: Without dead ends: 116 [2022-12-13 18:16:54,676 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=69, Invalid=351, Unknown=0, NotChecked=0, Total=420 [2022-12-13 18:16:54,676 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 116 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 797 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 828 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 797 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-12-13 18:16:54,676 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 121 Invalid, 828 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 797 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-12-13 18:16:54,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-12-13 18:16:54,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 107. [2022-12-13 18:16:54,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 70 states have (on average 1.4) internal successors, (98), 83 states have internal predecessors, (98), 16 states have call successors, (16), 5 states have call predecessors, (16), 7 states have return successors, (25), 18 states have call predecessors, (25), 16 states have call successors, (25) [2022-12-13 18:16:54,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 139 transitions. [2022-12-13 18:16:54,681 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 139 transitions. Word has length 25 [2022-12-13 18:16:54,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:16:54,681 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 139 transitions. [2022-12-13 18:16:54,681 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 12 states have internal predecessors, (30), 5 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-12-13 18:16:54,681 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 139 transitions. [2022-12-13 18:16:54,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-12-13 18:16:54,682 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:16:54,682 INFO L195 NwaCegarLoop]: trace histogram [3, 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] [2022-12-13 18:16:54,689 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2022-12-13 18:16:54,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 18:16:54,883 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting checkErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [maxErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, maxErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, maxErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-12-13 18:16:54,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:16:54,884 INFO L85 PathProgramCache]: Analyzing trace with hash 986137240, now seen corresponding path program 1 times [2022-12-13 18:16:54,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 18:16:54,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [512085172] [2022-12-13 18:16:54,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:16:54,886 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 18:16:54,887 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 18:16:54,889 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 18:16:54,905 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-12-13 18:16:55,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:16:55,003 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-13 18:16:55,004 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:16:55,050 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-13 18:16:55,050 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 18:16:55,050 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 18:16:55,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [512085172] [2022-12-13 18:16:55,050 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [512085172] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:16:55,050 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:16:55,050 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 18:16:55,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776140036] [2022-12-13 18:16:55,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:16:55,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 18:16:55,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 18:16:55,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 18:16:55,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 18:16:55,052 INFO L87 Difference]: Start difference. First operand 107 states and 139 transitions. Second operand has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-12-13 18:16:55,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:16:55,234 INFO L93 Difference]: Finished difference Result 113 states and 148 transitions. [2022-12-13 18:16:55,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 18:16:55,234 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 31 [2022-12-13 18:16:55,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:16:55,235 INFO L225 Difference]: With dead ends: 113 [2022-12-13 18:16:55,236 INFO L226 Difference]: Without dead ends: 109 [2022-12-13 18:16:55,236 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-12-13 18:16:55,236 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 27 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 18:16:55,237 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 357 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 18:16:55,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-12-13 18:16:55,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 107. [2022-12-13 18:16:55,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 70 states have (on average 1.3714285714285714) internal successors, (96), 83 states have internal predecessors, (96), 16 states have call successors, (16), 5 states have call predecessors, (16), 7 states have return successors, (25), 18 states have call predecessors, (25), 16 states have call successors, (25) [2022-12-13 18:16:55,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 137 transitions. [2022-12-13 18:16:55,243 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 137 transitions. Word has length 31 [2022-12-13 18:16:55,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:16:55,243 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 137 transitions. [2022-12-13 18:16:55,243 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-12-13 18:16:55,243 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 137 transitions. [2022-12-13 18:16:55,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-12-13 18:16:55,244 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:16:55,244 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:16:55,252 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2022-12-13 18:16:55,445 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 18:16:55,445 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting maxErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [maxErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, maxErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, maxErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-12-13 18:16:55,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:16:55,445 INFO L85 PathProgramCache]: Analyzing trace with hash 1746105865, now seen corresponding path program 1 times [2022-12-13 18:16:55,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 18:16:55,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1710977182] [2022-12-13 18:16:55,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:16:55,446 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 18:16:55,446 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 18:16:55,446 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 18:16:55,447 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-12-13 18:16:55,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:16:55,547 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 37 conjunts are in the unsatisfiable core [2022-12-13 18:16:55,550 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:16:55,575 INFO L350 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 [2022-12-13 18:16:55,581 INFO L350 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 [2022-12-13 18:16:55,633 INFO L350 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-12-13 18:16:55,640 INFO L350 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 23 treesize of output 22 [2022-12-13 18:16:55,805 INFO L350 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 19 treesize of output 7 [2022-12-13 18:16:55,807 INFO L350 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 19 treesize of output 7 [2022-12-13 18:16:55,870 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 18:16:55,870 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 18:16:56,582 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 18:16:56,583 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 18:16:56,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1710977182] [2022-12-13 18:16:56,583 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1710977182] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 18:16:56,583 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 18:16:56,583 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2022-12-13 18:16:56,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125258447] [2022-12-13 18:16:56,583 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 18:16:56,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-13 18:16:56,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 18:16:56,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 18:16:56,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2022-12-13 18:16:56,584 INFO L87 Difference]: Start difference. First operand 107 states and 137 transitions. Second operand has 15 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 11 states have internal predecessors, (25), 4 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-12-13 18:16:57,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:16:57,907 INFO L93 Difference]: Finished difference Result 118 states and 151 transitions. [2022-12-13 18:16:57,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-13 18:16:57,907 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 11 states have internal predecessors, (25), 4 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 31 [2022-12-13 18:16:57,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:16:57,908 INFO L225 Difference]: With dead ends: 118 [2022-12-13 18:16:57,908 INFO L226 Difference]: Without dead ends: 118 [2022-12-13 18:16:57,908 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=84, Invalid=516, Unknown=0, NotChecked=0, Total=600 [2022-12-13 18:16:57,909 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 98 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 833 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 857 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 833 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-12-13 18:16:57,909 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 228 Invalid, 857 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 833 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-12-13 18:16:57,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-12-13 18:16:57,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 111. [2022-12-13 18:16:57,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 73 states have (on average 1.356164383561644) internal successors, (99), 86 states have internal predecessors, (99), 16 states have call successors, (16), 6 states have call predecessors, (16), 8 states have return successors, (25), 18 states have call predecessors, (25), 16 states have call successors, (25) [2022-12-13 18:16:57,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 140 transitions. [2022-12-13 18:16:57,913 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 140 transitions. Word has length 31 [2022-12-13 18:16:57,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:16:57,913 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 140 transitions. [2022-12-13 18:16:57,913 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 11 states have internal predecessors, (25), 4 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-12-13 18:16:57,913 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 140 transitions. [2022-12-13 18:16:57,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-12-13 18:16:57,914 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:16:57,914 INFO L195 NwaCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2022-12-13 18:16:57,922 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2022-12-13 18:16:58,115 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 18:16:58,115 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting nondet_treeErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [maxErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, maxErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, maxErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-12-13 18:16:58,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:16:58,117 INFO L85 PathProgramCache]: Analyzing trace with hash -1830162109, now seen corresponding path program 2 times [2022-12-13 18:16:58,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 18:16:58,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [490397566] [2022-12-13 18:16:58,118 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 18:16:58,118 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 18:16:58,118 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 18:16:58,119 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 18:16:58,120 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2022-12-13 18:16:58,279 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 18:16:58,279 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 18:16:58,288 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 22 conjunts are in the unsatisfiable core [2022-12-13 18:16:58,290 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:16:58,294 INFO L350 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 [2022-12-13 18:16:58,298 INFO L350 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 [2022-12-13 18:16:58,327 WARN L859 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_544 (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_544))) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-12-13 18:16:58,351 WARN L859 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32)) (v_ArrVal_544 (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)) (= |c_#length| (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_544)))) is different from true [2022-12-13 18:16:58,366 WARN L859 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (= (store |c_old(#length)| nondet_tree_~n~0.base (_ bv12 32)) |c_#length|)) is different from true [2022-12-13 18:16:58,400 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_nondet_tree_~n~0.base_39 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32)) (v_ArrVal_544 (_ BitVec 32))) (and (= (store (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_544) v_nondet_tree_~n~0.base_39 (_ bv12 32)) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-12-13 18:16:58,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:16:58,441 INFO L321 Elim1Store]: treesize reduction 24, result has 38.5 percent of original size [2022-12-13 18:16:58,441 INFO L350 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 2 case distinctions, treesize of input 15 treesize of output 23 [2022-12-13 18:16:58,450 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-13 18:16:58,451 INFO L350 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 [2022-12-13 18:16:58,470 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 30 not checked. [2022-12-13 18:16:58,470 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 18:16:58,681 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 18:16:58,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [490397566] [2022-12-13 18:16:58,681 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [490397566] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 18:16:58,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1863770959] [2022-12-13 18:16:58,681 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 18:16:58,681 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-13 18:16:58,681 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/bin/uautomizer-uyxdKDjOR8/cvc4 [2022-12-13 18:16:58,682 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-13 18:16:58,683 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt (18)] Waiting until timeout for monitored process [2022-12-13 18:16:58,866 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 18:16:58,866 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 18:16:58,870 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 22 conjunts are in the unsatisfiable core [2022-12-13 18:16:58,873 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:16:58,878 INFO L350 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 [2022-12-13 18:16:58,882 INFO L350 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 [2022-12-13 18:16:58,909 WARN L859 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_627 (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_627))) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-12-13 18:16:58,935 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_627 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32))) (and (= |c_#length| (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_627)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-12-13 18:16:58,991 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_627 (_ BitVec 32)) (v_nondet_tree_~n~0.base_50 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32))) (and (= (store (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_627) v_nondet_tree_~n~0.base_50 (_ bv12 32)) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-12-13 18:16:59,019 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:16:59,044 INFO L321 Elim1Store]: treesize reduction 24, result has 38.5 percent of original size [2022-12-13 18:16:59,044 INFO L350 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 2 case distinctions, treesize of input 15 treesize of output 23 [2022-12-13 18:16:59,057 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-13 18:16:59,057 INFO L350 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 [2022-12-13 18:16:59,068 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 30 not checked. [2022-12-13 18:16:59,068 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 18:16:59,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1863770959] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 18:16:59,827 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 18:16:59,828 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2022-12-13 18:16:59,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88152968] [2022-12-13 18:16:59,828 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 18:16:59,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-13 18:16:59,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 18:16:59,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-13 18:16:59,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=45, Unknown=7, NotChecked=126, Total=210 [2022-12-13 18:16:59,829 INFO L87 Difference]: Start difference. First operand 111 states and 140 transitions. Second operand has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 11 states have internal predecessors, (32), 7 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2022-12-13 18:17:06,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:17:06,745 INFO L93 Difference]: Finished difference Result 124 states and 166 transitions. [2022-12-13 18:17:06,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 18:17:06,746 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 11 states have internal predecessors, (32), 7 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) Word has length 39 [2022-12-13 18:17:06,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:17:06,747 INFO L225 Difference]: With dead ends: 124 [2022-12-13 18:17:06,747 INFO L226 Difference]: Without dead ends: 124 [2022-12-13 18:17:06,748 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 65 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=57, Invalid=91, Unknown=12, NotChecked=182, Total=342 [2022-12-13 18:17:06,748 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 96 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 1014 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 751 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-13 18:17:06,748 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 56 Invalid, 1014 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 232 Invalid, 0 Unknown, 751 Unchecked, 0.4s Time] [2022-12-13 18:17:06,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-12-13 18:17:06,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 115. [2022-12-13 18:17:06,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 76 states have (on average 1.3421052631578947) internal successors, (102), 89 states have internal predecessors, (102), 16 states have call successors, (16), 6 states have call predecessors, (16), 9 states have return successors, (30), 19 states have call predecessors, (30), 16 states have call successors, (30) [2022-12-13 18:17:06,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 148 transitions. [2022-12-13 18:17:06,752 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 148 transitions. Word has length 39 [2022-12-13 18:17:06,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:17:06,752 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 148 transitions. [2022-12-13 18:17:06,752 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 11 states have internal predecessors, (32), 7 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2022-12-13 18:17:06,752 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 148 transitions. [2022-12-13 18:17:06,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-12-13 18:17:06,753 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:17:06,753 INFO L195 NwaCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2022-12-13 18:17:06,756 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt (18)] Ended with exit code 0 [2022-12-13 18:17:06,967 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2022-12-13 18:17:07,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 18:17:07,155 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting nondet_treeErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [maxErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, maxErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, maxErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-12-13 18:17:07,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:17:07,156 INFO L85 PathProgramCache]: Analyzing trace with hash -1475599677, now seen corresponding path program 3 times [2022-12-13 18:17:07,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 18:17:07,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1909997941] [2022-12-13 18:17:07,157 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 18:17:07,158 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 18:17:07,158 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 18:17:07,159 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 18:17:07,160 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2022-12-13 18:17:07,358 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-12-13 18:17:07,359 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 18:17:07,368 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 23 conjunts are in the unsatisfiable core [2022-12-13 18:17:07,371 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:17:07,375 INFO L350 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 [2022-12-13 18:17:07,380 INFO L350 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 [2022-12-13 18:17:07,419 WARN L859 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_710 (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_710))) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-12-13 18:17:07,481 WARN L859 $PredicateComparison]: unable to prove that (exists ((|nondet_tree_#res.base| (_ BitVec 32))) (= (store |c_old(#length)| |nondet_tree_#res.base| (_ bv12 32)) |c_#length|)) is different from true [2022-12-13 18:17:07,495 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_710 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32)) (|nondet_tree_#res.base| (_ BitVec 32))) (and (= (store (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_710) |nondet_tree_#res.base| (_ bv12 32)) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-12-13 18:17:07,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:17:07,581 INFO L321 Elim1Store]: treesize reduction 24, result has 38.5 percent of original size [2022-12-13 18:17:07,581 INFO L350 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 2 case distinctions, treesize of input 15 treesize of output 23 [2022-12-13 18:17:07,592 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-13 18:17:07,592 INFO L350 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 [2022-12-13 18:17:07,620 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 12 trivial. 26 not checked. [2022-12-13 18:17:07,620 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 18:17:10,010 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 18:17:10,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1909997941] [2022-12-13 18:17:10,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1909997941] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 18:17:10,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1758684653] [2022-12-13 18:17:10,011 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 18:17:10,011 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-13 18:17:10,011 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/bin/uautomizer-uyxdKDjOR8/cvc4 [2022-12-13 18:17:10,011 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-13 18:17:10,013 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt (20)] Waiting until timeout for monitored process [2022-12-13 18:17:10,170 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-12-13 18:17:10,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1161160029] [2022-12-13 18:17:10,170 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 18:17:10,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:17:10,171 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:17:10,172 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt (20)] Ended with exit code 1 [2022-12-13 18:17:10,172 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 18:17:10,173 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-12-13 18:17:12,175 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-12-13 18:17:12,175 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 18:17:12,181 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 21 conjunts are in the unsatisfiable core [2022-12-13 18:17:12,184 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:17:12,187 INFO L350 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 [2022-12-13 18:17:12,223 WARN L859 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_867 (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_867))) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-12-13 18:17:12,243 WARN L859 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (= (store |c_old(#length)| nondet_tree_~n~0.base (_ bv12 32)) |c_#length|)) is different from true [2022-12-13 18:17:12,288 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_867 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32)) (v_nondet_tree_~n~0.base_69 (_ BitVec 32))) (and (= (store (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_867) v_nondet_tree_~n~0.base_69 (_ bv12 32)) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-12-13 18:17:12,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:17:12,368 INFO L321 Elim1Store]: treesize reduction 24, result has 38.5 percent of original size [2022-12-13 18:17:12,368 INFO L350 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 2 case distinctions, treesize of input 15 treesize of output 23 [2022-12-13 18:17:12,380 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-13 18:17:12,380 INFO L350 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 [2022-12-13 18:17:12,395 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 30 not checked. [2022-12-13 18:17:12,396 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 18:17:14,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1161160029] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 18:17:14,706 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 18:17:14,706 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2022-12-13 18:17:14,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361685166] [2022-12-13 18:17:14,707 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 18:17:14,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-13 18:17:14,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 18:17:14,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-13 18:17:14,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=57, Unknown=7, NotChecked=114, Total=210 [2022-12-13 18:17:14,708 INFO L87 Difference]: Start difference. First operand 115 states and 148 transitions. Second operand has 13 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 8 states have call successors, (10), 3 states have call predecessors, (10), 5 states have return successors, (10), 5 states have call predecessors, (10), 7 states have call successors, (10) [2022-12-13 18:17:23,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:17:23,340 INFO L93 Difference]: Finished difference Result 131 states and 184 transitions. [2022-12-13 18:17:23,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 18:17:23,340 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 8 states have call successors, (10), 3 states have call predecessors, (10), 5 states have return successors, (10), 5 states have call predecessors, (10), 7 states have call successors, (10) Word has length 39 [2022-12-13 18:17:23,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:17:23,341 INFO L225 Difference]: With dead ends: 131 [2022-12-13 18:17:23,341 INFO L226 Difference]: Without dead ends: 131 [2022-12-13 18:17:23,341 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 65 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 12.7s TimeCoverageRelationStatistics Valid=58, Invalid=111, Unknown=11, NotChecked=162, Total=342 [2022-12-13 18:17:23,342 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 69 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 929 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 617 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-13 18:17:23,342 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 67 Invalid, 929 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 287 Invalid, 0 Unknown, 617 Unchecked, 0.4s Time] [2022-12-13 18:17:23,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2022-12-13 18:17:23,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 125. [2022-12-13 18:17:23,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 83 states have (on average 1.3132530120481927) internal successors, (109), 96 states have internal predecessors, (109), 18 states have call successors, (18), 6 states have call predecessors, (18), 10 states have return successors, (45), 22 states have call predecessors, (45), 18 states have call successors, (45) [2022-12-13 18:17:23,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 172 transitions. [2022-12-13 18:17:23,348 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 172 transitions. Word has length 39 [2022-12-13 18:17:23,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:17:23,348 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 172 transitions. [2022-12-13 18:17:23,349 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 8 states have call successors, (10), 3 states have call predecessors, (10), 5 states have return successors, (10), 5 states have call predecessors, (10), 7 states have call successors, (10) [2022-12-13 18:17:23,349 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 172 transitions. [2022-12-13 18:17:23,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-12-13 18:17:23,349 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:17:23,350 INFO L195 NwaCegarLoop]: trace histogram [5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:17:23,359 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Ended with exit code 0 [2022-12-13 18:17:23,562 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2022-12-13 18:17:23,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:17:23,752 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting maxErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [maxErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, maxErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, maxErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-12-13 18:17:23,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:17:23,753 INFO L85 PathProgramCache]: Analyzing trace with hash -101280226, now seen corresponding path program 2 times [2022-12-13 18:17:23,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 18:17:23,754 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [201436800] [2022-12-13 18:17:23,754 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 18:17:23,755 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 18:17:23,755 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 18:17:23,758 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 18:17:23,761 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2022-12-13 18:17:23,901 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 18:17:23,902 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 18:17:23,907 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 15 conjunts are in the unsatisfiable core [2022-12-13 18:17:23,908 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:17:24,025 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-12-13 18:17:24,025 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 18:17:24,492 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 18 [2022-12-13 18:17:24,629 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-12-13 18:17:24,629 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 18:17:24,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [201436800] [2022-12-13 18:17:24,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [201436800] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 18:17:24,629 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 18:17:24,629 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2022-12-13 18:17:24,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564596456] [2022-12-13 18:17:24,630 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 18:17:24,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-13 18:17:24,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 18:17:24,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-13 18:17:24,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2022-12-13 18:17:24,630 INFO L87 Difference]: Start difference. First operand 125 states and 172 transitions. Second operand has 16 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 12 states have internal predecessors, (35), 5 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 5 states have call predecessors, (8), 3 states have call successors, (8) [2022-12-13 18:17:25,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:17:25,717 INFO L93 Difference]: Finished difference Result 127 states and 175 transitions. [2022-12-13 18:17:25,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 18:17:25,718 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 12 states have internal predecessors, (35), 5 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 5 states have call predecessors, (8), 3 states have call successors, (8) Word has length 39 [2022-12-13 18:17:25,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:17:25,719 INFO L225 Difference]: With dead ends: 127 [2022-12-13 18:17:25,719 INFO L226 Difference]: Without dead ends: 127 [2022-12-13 18:17:25,719 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=65, Invalid=315, Unknown=0, NotChecked=0, Total=380 [2022-12-13 18:17:25,720 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 74 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-12-13 18:17:25,720 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 402 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-12-13 18:17:25,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-12-13 18:17:25,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 125. [2022-12-13 18:17:25,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 83 states have (on average 1.2771084337349397) internal successors, (106), 96 states have internal predecessors, (106), 18 states have call successors, (18), 6 states have call predecessors, (18), 10 states have return successors, (45), 22 states have call predecessors, (45), 18 states have call successors, (45) [2022-12-13 18:17:25,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 169 transitions. [2022-12-13 18:17:25,724 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 169 transitions. Word has length 39 [2022-12-13 18:17:25,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:17:25,724 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 169 transitions. [2022-12-13 18:17:25,724 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 12 states have internal predecessors, (35), 5 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 5 states have call predecessors, (8), 3 states have call successors, (8) [2022-12-13 18:17:25,724 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 169 transitions. [2022-12-13 18:17:25,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-12-13 18:17:25,725 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:17:25,725 INFO L195 NwaCegarLoop]: trace histogram [7, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2022-12-13 18:17:25,732 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Ended with exit code 0 [2022-12-13 18:17:25,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 18:17:25,926 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting nondet_treeErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [maxErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, maxErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, maxErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-12-13 18:17:25,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:17:25,927 INFO L85 PathProgramCache]: Analyzing trace with hash -579247621, now seen corresponding path program 4 times [2022-12-13 18:17:25,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 18:17:25,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [229189223] [2022-12-13 18:17:25,929 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-13 18:17:25,929 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 18:17:25,929 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 18:17:25,930 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 18:17:25,931 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2022-12-13 18:17:26,206 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-13 18:17:26,206 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 18:17:26,218 INFO L263 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 29 conjunts are in the unsatisfiable core [2022-12-13 18:17:26,221 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:17:26,225 INFO L350 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 [2022-12-13 18:17:26,229 INFO L350 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 [2022-12-13 18:17:26,266 WARN L859 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_1054 (_ BitVec 32))) (= (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_1054) |c_#length|)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-12-13 18:17:26,293 WARN L859 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32)) (v_ArrVal_1054 (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)) (= (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_1054) |c_#length|))) is different from true [2022-12-13 18:17:26,355 WARN L859 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (= (store |c_old(#length)| nondet_tree_~n~0.base (_ bv12 32)) |c_#length|)) is different from true [2022-12-13 18:17:26,424 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_nondet_tree_~n~0.base_90 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32)) (v_ArrVal_1055 (_ BitVec 32))) (and (bvule (_ bv12 32) (select |c_#length| nondet_tree_~n~0.base)) (= (store (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_1055) v_nondet_tree_~n~0.base_90 (_ bv12 32)) |c_#length|))) is different from true [2022-12-13 18:17:26,450 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_nondet_tree_~n~0.base_90 (_ BitVec 32)) (v_nondet_tree_~n~0.base_91 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32)) (v_ArrVal_1055 (_ BitVec 32)) (v_ArrVal_1054 (_ BitVec 32))) (and (bvule (_ bv12 32) (select |c_#length| nondet_tree_~n~0.base)) (= (_ bv0 1) (select |c_old(#valid)| v_nondet_tree_~n~0.base_91)) (= |c_#length| (store (store (store |c_old(#length)| v_nondet_tree_~n~0.base_91 v_ArrVal_1054) nondet_tree_~n~0.base v_ArrVal_1055) v_nondet_tree_~n~0.base_90 (_ bv12 32))))) is different from true [2022-12-13 18:17:26,486 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:17:26,546 INFO L321 Elim1Store]: treesize reduction 59, result has 34.4 percent of original size [2022-12-13 18:17:26,546 INFO L350 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 3 case distinctions, treesize of input 18 treesize of output 39 [2022-12-13 18:17:26,561 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-13 18:17:26,561 INFO L350 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 [2022-12-13 18:17:26,598 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 26 proven. 9 refuted. 1 times theorem prover too weak. 28 trivial. 62 not checked. [2022-12-13 18:17:26,598 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 18:17:27,378 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 18:17:27,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [229189223] [2022-12-13 18:17:27,379 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [229189223] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 18:17:27,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1137844651] [2022-12-13 18:17:27,379 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-13 18:17:27,379 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-13 18:17:27,379 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/bin/uautomizer-uyxdKDjOR8/cvc4 [2022-12-13 18:17:27,380 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-13 18:17:27,381 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt (24)] Waiting until timeout for monitored process [2022-12-13 18:17:27,758 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-13 18:17:27,758 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 18:17:27,765 INFO L263 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 33 conjunts are in the unsatisfiable core [2022-12-13 18:17:27,768 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:17:27,772 INFO L350 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 [2022-12-13 18:17:27,777 INFO L350 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 [2022-12-13 18:17:27,813 WARN L859 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_1191 (_ BitVec 32))) (= (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_1191) |c_#length|)) (exists ((v_ArrVal_1190 (_ BitVec 1))) (= (store |c_old(#valid)| nondet_tree_~n~0.base v_ArrVal_1190) |c_#valid|)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-12-13 18:17:27,851 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1191 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32)) (v_ArrVal_1190 (_ BitVec 1))) (and (= (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_1191) |c_#length|) (= (store |c_old(#valid)| nondet_tree_~n~0.base v_ArrVal_1190) |c_#valid|) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-12-13 18:17:27,883 WARN L859 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_1192 (_ BitVec 32))) (= (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_1192) |c_#length|)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-12-13 18:17:27,906 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1192 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32))) (and (= (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_1192) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-12-13 18:17:27,957 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_nondet_tree_~n~0.base_111 (_ BitVec 32)) (v_ArrVal_1192 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32))) (and (= (store (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_1192) v_nondet_tree_~n~0.base_111 (_ bv12 32)) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-12-13 18:17:27,987 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_nondet_tree_~n~0.base_111 (_ BitVec 32)) (v_nondet_tree_~n~0.base_112 (_ BitVec 32)) (v_ArrVal_1192 (_ BitVec 32)) (v_ArrVal_1191 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32)) (v_ArrVal_1190 (_ BitVec 1))) (and (= |c_#length| (store (store (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_1191) v_nondet_tree_~n~0.base_112 v_ArrVal_1192) v_nondet_tree_~n~0.base_111 (_ bv12 32))) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)) (= (select (store |c_old(#valid)| nondet_tree_~n~0.base v_ArrVal_1190) v_nondet_tree_~n~0.base_112) (_ bv0 1)))) is different from true [2022-12-13 18:17:28,034 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:17:28,035 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:17:28,095 INFO L321 Elim1Store]: treesize reduction 47, result has 36.5 percent of original size [2022-12-13 18:17:28,096 INFO L350 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 3 case distinctions, treesize of input 18 treesize of output 35 [2022-12-13 18:17:28,145 INFO L321 Elim1Store]: treesize reduction 17, result has 45.2 percent of original size [2022-12-13 18:17:28,145 INFO L350 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 31 treesize of output 38 [2022-12-13 18:17:28,202 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 26 proven. 18 refuted. 0 times theorem prover too weak. 16 trivial. 66 not checked. [2022-12-13 18:17:28,202 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 18:17:35,850 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1137844651] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 18:17:35,850 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 18:17:35,851 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 19 [2022-12-13 18:17:35,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262714481] [2022-12-13 18:17:35,851 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 18:17:35,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-13 18:17:35,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 18:17:35,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-13 18:17:35,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=105, Unknown=18, NotChecked=330, Total=506 [2022-12-13 18:17:35,852 INFO L87 Difference]: Start difference. First operand 125 states and 169 transitions. Second operand has 20 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 17 states have internal predecessors, (54), 10 states have call successors, (13), 3 states have call predecessors, (13), 7 states have return successors, (12), 11 states have call predecessors, (12), 9 states have call successors, (12) [2022-12-13 18:18:01,405 WARN L233 SmtUtils]: Spent 6.49s on a formula simplification. DAG size of input: 45 DAG size of output: 43 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 18:18:39,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:18:39,869 INFO L93 Difference]: Finished difference Result 149 states and 235 transitions. [2022-12-13 18:18:39,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-13 18:18:39,870 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 17 states have internal predecessors, (54), 10 states have call successors, (13), 3 states have call predecessors, (13), 7 states have return successors, (12), 11 states have call predecessors, (12), 9 states have call successors, (12) Word has length 57 [2022-12-13 18:18:39,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:18:39,872 INFO L225 Difference]: With dead ends: 149 [2022-12-13 18:18:39,872 INFO L226 Difference]: Without dead ends: 149 [2022-12-13 18:18:39,872 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 95 SyntacticMatches, 3 SemanticMatches, 31 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 70.1s TimeCoverageRelationStatistics Valid=147, Invalid=313, Unknown=46, NotChecked=550, Total=1056 [2022-12-13 18:18:39,872 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 120 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 553 mSolverCounterSat, 55 mSolverCounterUnsat, 27 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 1880 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 553 IncrementalHoareTripleChecker+Invalid, 27 IncrementalHoareTripleChecker+Unknown, 1245 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-12-13 18:18:39,873 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 99 Invalid, 1880 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 553 Invalid, 27 Unknown, 1245 Unchecked, 1.9s Time] [2022-12-13 18:18:39,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2022-12-13 18:18:39,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 133. [2022-12-13 18:18:39,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 89 states have (on average 1.2584269662921348) internal successors, (112), 102 states have internal predecessors, (112), 18 states have call successors, (18), 6 states have call predecessors, (18), 12 states have return successors, (59), 24 states have call predecessors, (59), 18 states have call successors, (59) [2022-12-13 18:18:39,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 189 transitions. [2022-12-13 18:18:39,877 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 189 transitions. Word has length 57 [2022-12-13 18:18:39,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:18:39,878 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 189 transitions. [2022-12-13 18:18:39,878 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 17 states have internal predecessors, (54), 10 states have call successors, (13), 3 states have call predecessors, (13), 7 states have return successors, (12), 11 states have call predecessors, (12), 9 states have call successors, (12) [2022-12-13 18:18:39,878 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 189 transitions. [2022-12-13 18:18:39,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-12-13 18:18:39,878 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:18:39,878 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 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] [2022-12-13 18:18:39,892 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Ended with exit code 0 [2022-12-13 18:18:40,091 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt (24)] Ended with exit code 0 [2022-12-13 18:18:40,280 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt [2022-12-13 18:18:40,280 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting maxErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [maxErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, maxErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, maxErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-12-13 18:18:40,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:18:40,280 INFO L85 PathProgramCache]: Analyzing trace with hash -612022781, now seen corresponding path program 1 times [2022-12-13 18:18:40,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 18:18:40,281 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [944647392] [2022-12-13 18:18:40,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:18:40,281 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 18:18:40,281 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 18:18:40,283 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 18:18:40,284 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2022-12-13 18:18:40,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:18:40,392 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 29 conjunts are in the unsatisfiable core [2022-12-13 18:18:40,394 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:18:40,426 INFO L350 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 [2022-12-13 18:18:40,433 INFO L350 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 [2022-12-13 18:18:40,773 INFO L350 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 19 treesize of output 7 [2022-12-13 18:18:40,775 INFO L350 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 19 treesize of output 7 [2022-12-13 18:18:40,881 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 18:18:40,881 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 18:18:41,168 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 18:18:41,169 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 18:18:41,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [944647392] [2022-12-13 18:18:41,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [944647392] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 18:18:41,169 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 18:18:41,169 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 14 [2022-12-13 18:18:41,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399526502] [2022-12-13 18:18:41,169 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 18:18:41,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-13 18:18:41,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 18:18:41,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-13 18:18:41,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2022-12-13 18:18:41,170 INFO L87 Difference]: Start difference. First operand 133 states and 189 transitions. Second operand has 14 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 10 states have internal predecessors, (31), 4 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 18:18:43,196 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:18:46,249 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:18:48,310 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:18:50,331 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:18:50,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:18:50,549 INFO L93 Difference]: Finished difference Result 215 states and 292 transitions. [2022-12-13 18:18:50,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-13 18:18:50,550 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 10 states have internal predecessors, (31), 4 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) Word has length 38 [2022-12-13 18:18:50,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:18:50,552 INFO L225 Difference]: With dead ends: 215 [2022-12-13 18:18:50,552 INFO L226 Difference]: Without dead ends: 215 [2022-12-13 18:18:50,552 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=73, Invalid=389, Unknown=0, NotChecked=0, Total=462 [2022-12-13 18:18:50,552 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 82 mSDsluCounter, 740 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 16 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 821 SdHoareTripleChecker+Invalid, 358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.0s IncrementalHoareTripleChecker+Time [2022-12-13 18:18:50,552 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 821 Invalid, 358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 338 Invalid, 4 Unknown, 0 Unchecked, 9.0s Time] [2022-12-13 18:18:50,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2022-12-13 18:18:50,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 172. [2022-12-13 18:18:50,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 119 states have (on average 1.2773109243697478) internal successors, (152), 131 states have internal predecessors, (152), 23 states have call successors, (23), 9 states have call predecessors, (23), 16 states have return successors, (71), 31 states have call predecessors, (71), 23 states have call successors, (71) [2022-12-13 18:18:50,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 246 transitions. [2022-12-13 18:18:50,558 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 246 transitions. Word has length 38 [2022-12-13 18:18:50,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:18:50,558 INFO L495 AbstractCegarLoop]: Abstraction has 172 states and 246 transitions. [2022-12-13 18:18:50,558 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 10 states have internal predecessors, (31), 4 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 18:18:50,558 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 246 transitions. [2022-12-13 18:18:50,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-12-13 18:18:50,559 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:18:50,559 INFO L195 NwaCegarLoop]: trace histogram [5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:18:50,570 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Forceful destruction successful, exit code 0 [2022-12-13 18:18:50,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 18:18:50,760 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting maxErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [maxErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, maxErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, maxErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-12-13 18:18:50,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:18:50,761 INFO L85 PathProgramCache]: Analyzing trace with hash -407980419, now seen corresponding path program 2 times [2022-12-13 18:18:50,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 18:18:50,762 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2112169883] [2022-12-13 18:18:50,763 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 18:18:50,763 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 18:18:50,763 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 18:18:50,766 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 18:18:50,769 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2022-12-13 18:18:51,040 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 18:18:51,041 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 18:18:51,049 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 59 conjunts are in the unsatisfiable core [2022-12-13 18:18:51,052 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:18:51,056 INFO L350 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 [2022-12-13 18:18:51,133 INFO L350 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 [2022-12-13 18:18:51,139 INFO L350 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 [2022-12-13 18:18:51,387 WARN L859 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_1311 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| nondet_tree_~n~0.base v_ArrVal_1311))) (exists ((v_ArrVal_1312 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| nondet_tree_~n~0.base v_ArrVal_1312) |c_#memory_$Pointer$.base|)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-12-13 18:18:51,414 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:18:51,415 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-13 18:18:51,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:18:51,422 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-13 18:18:51,433 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-13 18:18:51,433 INFO L350 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 [2022-12-13 18:18:51,477 INFO L350 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 23 treesize of output 22 [2022-12-13 18:18:51,483 INFO L350 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 23 treesize of output 22 [2022-12-13 18:18:51,735 INFO L350 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 15 treesize of output 7 [2022-12-13 18:18:51,738 INFO L350 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 15 treesize of output 7 [2022-12-13 18:18:51,866 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 6 proven. 23 refuted. 0 times theorem prover too weak. 3 trivial. 9 not checked. [2022-12-13 18:18:51,866 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 18:18:53,637 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 18:18:53,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2112169883] [2022-12-13 18:18:53,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2112169883] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 18:18:53,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1277913553] [2022-12-13 18:18:53,638 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 18:18:53,638 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-13 18:18:53,638 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/bin/uautomizer-uyxdKDjOR8/cvc4 [2022-12-13 18:18:53,639 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-13 18:18:53,639 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt (27)] Waiting until timeout for monitored process [2022-12-13 18:18:53,919 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 18:18:53,919 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 18:18:53,923 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 60 conjunts are in the unsatisfiable core [2022-12-13 18:18:53,927 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:18:53,932 INFO L350 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 [2022-12-13 18:18:53,976 INFO L350 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 [2022-12-13 18:18:53,984 INFO L350 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 [2022-12-13 18:18:54,149 WARN L859 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_1424 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| nondet_tree_~n~0.base v_ArrVal_1424))) (exists ((v_ArrVal_1423 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| nondet_tree_~n~0.base v_ArrVal_1423))) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-12-13 18:18:54,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:18:54,177 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-13 18:18:54,183 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:18:54,183 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-13 18:18:54,195 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-13 18:18:54,196 INFO L350 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 [2022-12-13 18:18:54,208 INFO L350 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 23 treesize of output 22 [2022-12-13 18:18:54,215 INFO L350 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 23 treesize of output 22 [2022-12-13 18:18:54,334 INFO L350 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 15 treesize of output 7 [2022-12-13 18:18:54,337 INFO L350 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 15 treesize of output 7 [2022-12-13 18:18:54,352 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 6 proven. 23 refuted. 0 times theorem prover too weak. 3 trivial. 9 not checked. [2022-12-13 18:18:54,352 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 18:18:55,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1277913553] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 18:18:55,822 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 18:18:55,822 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 22 [2022-12-13 18:18:55,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456053154] [2022-12-13 18:18:55,822 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 18:18:55,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-12-13 18:18:55,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 18:18:55,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-12-13 18:18:55,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=636, Unknown=4, NotChecked=102, Total=812 [2022-12-13 18:18:55,823 INFO L87 Difference]: Start difference. First operand 172 states and 246 transitions. Second operand has 22 states, 20 states have (on average 1.7) internal successors, (34), 16 states have internal predecessors, (34), 6 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-12-13 18:18:58,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:18:58,574 INFO L93 Difference]: Finished difference Result 201 states and 284 transitions. [2022-12-13 18:18:58,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-12-13 18:18:58,575 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 20 states have (on average 1.7) internal successors, (34), 16 states have internal predecessors, (34), 6 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 45 [2022-12-13 18:18:58,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:18:58,576 INFO L225 Difference]: With dead ends: 201 [2022-12-13 18:18:58,576 INFO L226 Difference]: Without dead ends: 201 [2022-12-13 18:18:58,578 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 90 SyntacticMatches, 5 SemanticMatches, 43 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 313 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=197, Invalid=1611, Unknown=6, NotChecked=166, Total=1980 [2022-12-13 18:18:58,578 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 220 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 1011 mSolverCounterSat, 72 mSolverCounterUnsat, 17 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 1300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 1011 IncrementalHoareTripleChecker+Invalid, 17 IncrementalHoareTripleChecker+Unknown, 200 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-12-13 18:18:58,578 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 197 Invalid, 1300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 1011 Invalid, 17 Unknown, 200 Unchecked, 1.7s Time] [2022-12-13 18:18:58,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2022-12-13 18:18:58,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 192. [2022-12-13 18:18:58,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 134 states have (on average 1.2611940298507462) internal successors, (169), 146 states have internal predecessors, (169), 26 states have call successors, (26), 11 states have call predecessors, (26), 18 states have return successors, (74), 34 states have call predecessors, (74), 26 states have call successors, (74) [2022-12-13 18:18:58,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 269 transitions. [2022-12-13 18:18:58,584 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 269 transitions. Word has length 45 [2022-12-13 18:18:58,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:18:58,584 INFO L495 AbstractCegarLoop]: Abstraction has 192 states and 269 transitions. [2022-12-13 18:18:58,584 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 20 states have (on average 1.7) internal successors, (34), 16 states have internal predecessors, (34), 6 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-12-13 18:18:58,584 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 269 transitions. [2022-12-13 18:18:58,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-12-13 18:18:58,585 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:18:58,585 INFO L195 NwaCegarLoop]: trace histogram [14, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 1, 1, 1, 1] [2022-12-13 18:18:58,588 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt (27)] Ended with exit code 0 [2022-12-13 18:18:58,798 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Ended with exit code 0 [2022-12-13 18:18:58,986 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt,26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 18:18:58,987 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting nondet_treeErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [maxErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, maxErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, maxErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-12-13 18:18:58,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:18:58,988 INFO L85 PathProgramCache]: Analyzing trace with hash -772891836, now seen corresponding path program 1 times [2022-12-13 18:18:58,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 18:18:58,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1290907400] [2022-12-13 18:18:58,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:18:58,989 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 18:18:58,989 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 18:18:58,990 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 18:18:58,991 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2022-12-13 18:18:59,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:18:59,664 INFO L263 TraceCheckSpWp]: Trace formula consists of 659 conjuncts, 59 conjunts are in the unsatisfiable core [2022-12-13 18:18:59,668 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:18:59,672 INFO L350 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 [2022-12-13 18:18:59,677 INFO L350 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 [2022-12-13 18:18:59,738 WARN L859 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_1668 (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_1668))) (exists ((v_ArrVal_1667 (_ BitVec 1))) (= (store |c_old(#valid)| nondet_tree_~n~0.base v_ArrVal_1667) |c_#valid|)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-12-13 18:18:59,788 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1668 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32)) (v_ArrVal_1667 (_ BitVec 1))) (and (= |c_#length| (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_1668)) (= (store |c_old(#valid)| nondet_tree_~n~0.base v_ArrVal_1667) |c_#valid|) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-12-13 18:18:59,880 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:18:59,881 INFO L350 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 12 treesize of output 14 [2022-12-13 18:18:59,906 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-12-13 18:18:59,906 INFO L350 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 [2022-12-13 18:18:59,947 WARN L859 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_1669 (_ BitVec 32))) (= (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_1669) |c_#length|)) (exists ((v_ArrVal_1670 (_ BitVec 1))) (= (store |c_old(#valid)| nondet_tree_~n~0.base v_ArrVal_1670) |c_#valid|)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-12-13 18:18:59,982 WARN L859 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_1671 (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_1671))) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-12-13 18:19:00,017 WARN L859 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32)) (v_ArrVal_1671 (_ BitVec 32))) (and (= |c_#length| (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_1671)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-12-13 18:19:00,083 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_nondet_tree_~n~0.base_162 (_ BitVec 32)) (v_ArrVal_1669 (_ BitVec 32)) (v_ArrVal_1670 (_ BitVec 1)) (nondet_tree_~n~0.base (_ BitVec 32)) (v_ArrVal_1671 (_ BitVec 32))) (and (= (select (store |c_old(#valid)| v_nondet_tree_~n~0.base_162 v_ArrVal_1670) nondet_tree_~n~0.base) (_ bv0 1)) (= (select |c_old(#valid)| v_nondet_tree_~n~0.base_162) (_ bv0 1)) (= (store (store |c_old(#length)| v_nondet_tree_~n~0.base_162 v_ArrVal_1669) nondet_tree_~n~0.base v_ArrVal_1671) |c_#length|))) is different from true [2022-12-13 18:19:00,124 WARN L859 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (= (store |c_old(#length)| nondet_tree_~n~0.base (_ bv12 32)) |c_#length|)) is different from true [2022-12-13 18:19:00,228 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_nondet_tree_~n~0.base_163 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32))) (= |c_#length| (store (store |c_old(#length)| v_nondet_tree_~n~0.base_163 (_ bv12 32)) nondet_tree_~n~0.base (_ bv12 32)))) is different from true [2022-12-13 18:19:00,248 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_nondet_tree_~n~0.base_163 (_ BitVec 32)) (v_nondet_tree_~n~0.base_164 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32))) (= (store (store (store |c_old(#length)| v_nondet_tree_~n~0.base_164 (_ bv12 32)) v_nondet_tree_~n~0.base_163 (_ bv12 32)) nondet_tree_~n~0.base (_ bv12 32)) |c_#length|)) is different from true [2022-12-13 18:19:00,286 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_nondet_tree_~n~0.base_162 (_ BitVec 32)) (v_nondet_tree_~n~0.base_163 (_ BitVec 32)) (v_nondet_tree_~n~0.base_164 (_ BitVec 32)) (v_ArrVal_1669 (_ BitVec 32)) (v_nondet_tree_~n~0.base_165 (_ BitVec 32)) (v_ArrVal_1670 (_ BitVec 1)) (nondet_tree_~n~0.base (_ BitVec 32)) (v_ArrVal_1671 (_ BitVec 32))) (and (= (select (store |c_old(#valid)| v_nondet_tree_~n~0.base_162 v_ArrVal_1670) nondet_tree_~n~0.base) (_ bv0 1)) (= (select |c_old(#valid)| v_nondet_tree_~n~0.base_162) (_ bv0 1)) (= (store (store (store (store (store |c_old(#length)| v_nondet_tree_~n~0.base_162 v_ArrVal_1669) nondet_tree_~n~0.base v_ArrVal_1671) v_nondet_tree_~n~0.base_164 (_ bv12 32)) v_nondet_tree_~n~0.base_163 (_ bv12 32)) v_nondet_tree_~n~0.base_165 (_ bv12 32)) |c_#length|))) is different from true [2022-12-13 18:19:00,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:19:00,359 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:19:00,573 INFO L321 Elim1Store]: treesize reduction 190, result has 20.5 percent of original size [2022-12-13 18:19:00,573 INFO L350 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 5 case distinctions, treesize of input 24 treesize of output 57 [2022-12-13 18:19:00,618 INFO L321 Elim1Store]: treesize reduction 17, result has 45.2 percent of original size [2022-12-13 18:19:00,618 INFO L350 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 31 treesize of output 38 [2022-12-13 18:19:00,685 INFO L134 CoverageAnalysis]: Checked inductivity of 449 backedges. 14 proven. 69 refuted. 0 times theorem prover too weak. 96 trivial. 270 not checked. [2022-12-13 18:19:00,685 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 18:19:01,301 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 18:19:01,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1290907400] [2022-12-13 18:19:01,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1290907400] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 18:19:01,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1430322800] [2022-12-13 18:19:01,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:19:01,302 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-13 18:19:01,302 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/bin/uautomizer-uyxdKDjOR8/cvc4 [2022-12-13 18:19:01,303 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-13 18:19:01,303 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt (29)] Waiting until timeout for monitored process [2022-12-13 18:19:02,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:19:02,497 INFO L263 TraceCheckSpWp]: Trace formula consists of 659 conjuncts, 74 conjunts are in the unsatisfiable core [2022-12-13 18:19:02,502 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:19:02,507 INFO L350 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 [2022-12-13 18:19:02,514 INFO L350 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 [2022-12-13 18:19:02,547 WARN L859 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_1890 (_ BitVec 32))) (= (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_1890) |c_#length|)) (exists ((v_ArrVal_1889 (_ BitVec 1))) (= |c_#valid| (store |c_old(#valid)| nondet_tree_~n~0.base v_ArrVal_1889))) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-12-13 18:19:02,586 WARN L859 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32)) (v_ArrVal_1890 (_ BitVec 32)) (v_ArrVal_1889 (_ BitVec 1))) (and (= |c_#valid| (store |c_old(#valid)| nondet_tree_~n~0.base v_ArrVal_1889)) (= (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_1890) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-12-13 18:19:02,685 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-12-13 18:19:02,685 INFO L350 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 [2022-12-13 18:19:02,692 INFO L350 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 12 treesize of output 14 [2022-12-13 18:19:02,859 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1894 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32))) (and (= (store |c_old(#valid)| nondet_tree_~n~0.base (_ bv1 1)) |c_#valid|) (= (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_1894) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-12-13 18:19:03,217 WARN L859 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_1897 (_ BitVec 32))) (= (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_1897) |c_#length|)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-12-13 18:19:03,245 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1897 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32))) (and (= (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_1897) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-12-13 18:19:03,315 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1897 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32)) (v_nondet_tree_~n~0.base_205 (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| v_nondet_tree_~n~0.base_205)) (= (store (store |c_old(#length)| v_nondet_tree_~n~0.base_205 v_ArrVal_1897) nondet_tree_~n~0.base (_ bv12 32)) |c_#length|))) is different from true [2022-12-13 18:19:03,351 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1894 (_ BitVec 32)) (v_ArrVal_1897 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32)) (v_nondet_tree_~n~0.base_205 (_ BitVec 32)) (v_nondet_tree_~n~0.base_206 (_ BitVec 32))) (and (= (store (store (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_1894) v_nondet_tree_~n~0.base_205 v_ArrVal_1897) v_nondet_tree_~n~0.base_206 (_ bv12 32)) |c_#length|) (= (_ bv0 1) (select (store |c_old(#valid)| nondet_tree_~n~0.base (_ bv1 1)) v_nondet_tree_~n~0.base_205)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-12-13 18:19:03,675 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:19:03,678 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:19:03,681 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:19:03,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:19:03,689 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:19:03,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:19:03,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:19:03,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:19:03,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:19:03,901 INFO L321 Elim1Store]: treesize reduction 67, result has 40.2 percent of original size [2022-12-13 18:19:03,901 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 24 treesize of output 53 [2022-12-13 18:19:04,024 INFO L321 Elim1Store]: treesize reduction 79, result has 21.8 percent of original size [2022-12-13 18:19:04,025 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 157 treesize of output 168 [2022-12-13 18:19:04,116 INFO L134 CoverageAnalysis]: Checked inductivity of 449 backedges. 14 proven. 105 refuted. 0 times theorem prover too weak. 83 trivial. 247 not checked. [2022-12-13 18:19:04,116 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 18:19:20,124 WARN L233 SmtUtils]: Spent 6.08s on a formula simplification that was a NOOP. DAG size: 60 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 18:19:20,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1430322800] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 18:19:20,126 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 18:19:20,126 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 18] total 27 [2022-12-13 18:19:20,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130632280] [2022-12-13 18:19:20,127 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 18:19:20,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-12-13 18:19:20,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 18:19:20,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-12-13 18:19:20,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=163, Unknown=20, NotChecked=680, Total=930 [2022-12-13 18:19:20,128 INFO L87 Difference]: Start difference. First operand 192 states and 269 transitions. Second operand has 28 states, 27 states have (on average 3.1481481481481484) internal successors, (85), 26 states have internal predecessors, (85), 17 states have call successors, (19), 3 states have call predecessors, (19), 13 states have return successors, (23), 16 states have call predecessors, (23), 16 states have call successors, (23) [2022-12-13 18:19:22,180 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:19:26,358 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:19:28,363 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:19:30,378 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:19:32,396 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:19:36,490 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:19:38,495 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:19:40,507 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:19:42,527 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:19:46,615 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:19:48,624 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:19:50,631 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:19:54,349 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:19:58,501 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:20:00,529 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:20:02,539 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:20:04,566 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:20:12,883 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:20:14,912 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:20:16,923 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:20:18,990 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:20:28,885 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:20:31,017 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:20:33,090 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:20:35,135 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:20:45,658 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:20:56,138 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:20:58,306 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:21:00,561 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:21:04,625 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:21:06,634 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:21:08,642 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:21:10,659 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:21:12,681 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:21:14,783 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:21:16,913 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:21:18,656 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:21:40,999 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:21:43,152 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:21:47,073 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:21:49,392 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:21:51,671 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:21:52,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:21:52,283 INFO L93 Difference]: Finished difference Result 216 states and 329 transitions. [2022-12-13 18:21:52,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 18:21:52,284 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 3.1481481481481484) internal successors, (85), 26 states have internal predecessors, (85), 17 states have call successors, (19), 3 states have call predecessors, (19), 13 states have return successors, (23), 16 states have call predecessors, (23), 16 states have call successors, (23) Word has length 101 [2022-12-13 18:21:52,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:21:52,285 INFO L225 Difference]: With dead ends: 216 [2022-12-13 18:21:52,285 INFO L226 Difference]: Without dead ends: 216 [2022-12-13 18:21:52,286 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 173 SyntacticMatches, 5 SemanticMatches, 37 ConstructedPredicates, 17 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 76.1s TimeCoverageRelationStatistics Valid=137, Invalid=348, Unknown=45, NotChecked=952, Total=1482 [2022-12-13 18:21:52,286 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 144 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 642 mSolverCounterSat, 62 mSolverCounterUnsat, 76 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 91.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 3024 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 642 IncrementalHoareTripleChecker+Invalid, 76 IncrementalHoareTripleChecker+Unknown, 2244 IncrementalHoareTripleChecker+Unchecked, 91.7s IncrementalHoareTripleChecker+Time [2022-12-13 18:21:52,286 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 99 Invalid, 3024 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 642 Invalid, 76 Unknown, 2244 Unchecked, 91.7s Time] [2022-12-13 18:21:52,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2022-12-13 18:21:52,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 199. [2022-12-13 18:21:52,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 139 states have (on average 1.2517985611510791) internal successors, (174), 151 states have internal predecessors, (174), 27 states have call successors, (27), 11 states have call predecessors, (27), 19 states have return successors, (90), 36 states have call predecessors, (90), 27 states have call successors, (90) [2022-12-13 18:21:52,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 291 transitions. [2022-12-13 18:21:52,292 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 291 transitions. Word has length 101 [2022-12-13 18:21:52,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:21:52,292 INFO L495 AbstractCegarLoop]: Abstraction has 199 states and 291 transitions. [2022-12-13 18:21:52,292 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 3.1481481481481484) internal successors, (85), 26 states have internal predecessors, (85), 17 states have call successors, (19), 3 states have call predecessors, (19), 13 states have return successors, (23), 16 states have call predecessors, (23), 16 states have call successors, (23) [2022-12-13 18:21:52,293 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 291 transitions. [2022-12-13 18:21:52,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-12-13 18:21:52,293 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:21:52,293 INFO L195 NwaCegarLoop]: trace histogram [11, 7, 7, 7, 7, 6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1] [2022-12-13 18:21:52,301 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt (29)] Ended with exit code 0 [2022-12-13 18:21:52,534 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Ended with exit code 0 [2022-12-13 18:21:52,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt,28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 18:21:52,695 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting nondet_treeErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [maxErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, maxErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, maxErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-12-13 18:21:52,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:21:52,696 INFO L85 PathProgramCache]: Analyzing trace with hash 502294499, now seen corresponding path program 5 times [2022-12-13 18:21:52,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 18:21:52,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [546321330] [2022-12-13 18:21:52,697 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-13 18:21:52,698 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 18:21:52,698 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 18:21:52,700 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 18:21:52,703 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Waiting until timeout for monitored process [2022-12-13 18:21:53,791 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2022-12-13 18:21:53,791 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 18:21:53,815 INFO L263 TraceCheckSpWp]: Trace formula consists of 579 conjuncts, 63 conjunts are in the unsatisfiable core [2022-12-13 18:21:53,819 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:21:53,823 INFO L350 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 [2022-12-13 18:21:53,826 INFO L350 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 [2022-12-13 18:21:56,350 WARN L859 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_2119 (_ BitVec 1))) (= (store |c_old(#valid)| nondet_tree_~n~0.base v_ArrVal_2119) |c_#valid|)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)) (exists ((v_ArrVal_2118 (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_2118))))) is different from true [2022-12-13 18:21:56,385 WARN L859 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_2120 (_ BitVec 32))) (= (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_2120) |c_#length|)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-12-13 18:21:56,436 WARN L859 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32)) (v_ArrVal_2120 (_ BitVec 32))) (and (= (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_2120) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-12-13 18:21:56,500 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2118 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32)) (v_nondet_tree_~n~0.base_245 (_ BitVec 32)) (v_ArrVal_2120 (_ BitVec 32)) (v_ArrVal_2119 (_ BitVec 1))) (and (= (select |c_old(#valid)| v_nondet_tree_~n~0.base_245) (_ bv0 1)) (= |c_#length| (store (store |c_old(#length)| v_nondet_tree_~n~0.base_245 v_ArrVal_2118) nondet_tree_~n~0.base v_ArrVal_2120)) (= (_ bv0 1) (select (store |c_old(#valid)| v_nondet_tree_~n~0.base_245 v_ArrVal_2119) nondet_tree_~n~0.base)))) is different from true [2022-12-13 18:22:03,278 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:22:03,280 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:22:03,302 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:22:03,593 INFO L321 Elim1Store]: treesize reduction 162, result has 25.3 percent of original size [2022-12-13 18:22:03,593 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 24 treesize of output 63 [2022-12-13 18:22:03,912 INFO L321 Elim1Store]: treesize reduction 22, result has 78.2 percent of original size [2022-12-13 18:22:03,912 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 3606 treesize of output 3638 [2022-12-13 18:22:05,000 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 40 proven. 116 refuted. 4 times theorem prover too weak. 44 trivial. 102 not checked. [2022-12-13 18:22:05,000 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 18:22:10,683 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 18:22:10,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [546321330] [2022-12-13 18:22:10,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [546321330] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 18:22:10,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [280486108] [2022-12-13 18:22:10,683 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-13 18:22:10,683 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-13 18:22:10,684 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/bin/uautomizer-uyxdKDjOR8/cvc4 [2022-12-13 18:22:10,684 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-13 18:22:10,685 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt (31)] Waiting until timeout for monitored process [2022-12-13 18:22:10,938 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-12-13 18:22:10,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2116793427] [2022-12-13 18:22:10,938 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-13 18:22:10,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:22:10,939 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:22:10,940 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 18:22:10,940 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-12-13 18:22:10,942 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt (31)] Ended with exit code 1 [2022-12-13 18:23:34,839 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2022-12-13 18:23:34,840 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 18:23:34,873 INFO L263 TraceCheckSpWp]: Trace formula consists of 579 conjuncts, 62 conjunts are in the unsatisfiable core [2022-12-13 18:23:34,878 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:23:34,882 INFO L350 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 [2022-12-13 18:23:37,685 WARN L859 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_2547 (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_2547))) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-12-13 18:23:37,716 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2547 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32))) (and (= |c_#length| (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_2547)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-12-13 18:23:37,786 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_nondet_tree_~n~0.base_284 (_ BitVec 32)) (v_ArrVal_2547 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32)) (v_ArrVal_2111 (_ BitVec 32))) (and (= (select (store |c_old(#valid)| nondet_tree_~n~0.base (_ bv1 1)) v_nondet_tree_~n~0.base_284) (_ bv0 1)) (= (store (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_2111) v_nondet_tree_~n~0.base_284 v_ArrVal_2547) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-12-13 18:23:37,920 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_nondet_tree_~n~0.base_284 (_ BitVec 32)) (v_ArrVal_2548 (_ BitVec 32)) (v_ArrVal_2547 (_ BitVec 32)) (v_nondet_tree_~n~0.base_285 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32)) (v_ArrVal_2111 (_ BitVec 32))) (let ((.cse0 (store |c_old(#valid)| v_nondet_tree_~n~0.base_285 (_ bv1 1)))) (and (= (select |c_old(#valid)| v_nondet_tree_~n~0.base_285) (_ bv0 1)) (= (select (store .cse0 nondet_tree_~n~0.base (_ bv1 1)) v_nondet_tree_~n~0.base_284) (_ bv0 1)) (= |c_#length| (store (store (store |c_old(#length)| v_nondet_tree_~n~0.base_285 v_ArrVal_2548) nondet_tree_~n~0.base v_ArrVal_2111) v_nondet_tree_~n~0.base_284 v_ArrVal_2547)) (= (_ bv0 1) (select .cse0 nondet_tree_~n~0.base))))) is different from true [2022-12-13 18:23:38,080 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_nondet_tree_~n~0.base_283 (_ BitVec 32)) (v_ArrVal_2114 (_ BitVec 32)) (v_nondet_tree_~n~0.base_284 (_ BitVec 32)) (v_ArrVal_2548 (_ BitVec 32)) (v_ArrVal_2547 (_ BitVec 32)) (v_nondet_tree_~n~0.base_285 (_ BitVec 32)) (v_nondet_tree_~n~0.base_286 (_ BitVec 32)) (v_ArrVal_2549 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32)) (v_ArrVal_2111 (_ BitVec 32))) (let ((.cse2 (store |c_old(#valid)| v_nondet_tree_~n~0.base_286 (_ bv1 1)))) (let ((.cse1 (store .cse2 v_nondet_tree_~n~0.base_283 (_ bv1 1)))) (let ((.cse0 (store .cse1 v_nondet_tree_~n~0.base_285 (_ bv1 1)))) (and (= (_ bv0 1) (select |c_old(#valid)| v_nondet_tree_~n~0.base_286)) (= (store (store (store (store (store |c_old(#length)| v_nondet_tree_~n~0.base_286 v_ArrVal_2114) v_nondet_tree_~n~0.base_283 v_ArrVal_2549) v_nondet_tree_~n~0.base_285 v_ArrVal_2548) nondet_tree_~n~0.base v_ArrVal_2111) v_nondet_tree_~n~0.base_284 v_ArrVal_2547) |c_#length|) (= (_ bv0 1) (select (store .cse0 nondet_tree_~n~0.base (_ bv1 1)) v_nondet_tree_~n~0.base_284)) (= (select .cse1 v_nondet_tree_~n~0.base_285) (_ bv0 1)) (= (_ bv0 1) (select .cse2 v_nondet_tree_~n~0.base_283)) (= (_ bv0 1) (select .cse0 nondet_tree_~n~0.base))))))) is different from true [2022-12-13 18:23:38,265 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:23:38,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:23:38,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:23:38,276 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:23:38,282 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:23:38,286 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:23:38,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:23:38,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:23:38,297 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:23:38,299 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:23:38,303 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:23:38,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:23:38,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:23:38,312 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:23:38,317 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:23:38,318 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 15 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 34 [2022-12-13 18:23:38,398 INFO L321 Elim1Store]: treesize reduction 130, result has 13.9 percent of original size [2022-12-13 18:23:38,398 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 73 treesize of output 81 [2022-12-13 18:23:38,409 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 40 proven. 90 refuted. 0 times theorem prover too weak. 50 trivial. 126 not checked. [2022-12-13 18:23:38,409 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 18:23:46,914 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2116793427] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 18:23:46,914 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 18:23:46,915 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 15] total 27 [2022-12-13 18:23:46,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649377554] [2022-12-13 18:23:46,915 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 18:23:46,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-12-13 18:23:46,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 18:23:46,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-12-13 18:23:46,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=392, Unknown=32, NotChecked=432, Total=930 [2022-12-13 18:23:46,916 INFO L87 Difference]: Start difference. First operand 199 states and 291 transitions. Second operand has 28 states, 27 states have (on average 3.037037037037037) internal successors, (82), 24 states have internal predecessors, (82), 15 states have call successors, (19), 3 states have call predecessors, (19), 12 states have return successors, (19), 14 states have call predecessors, (19), 14 states have call successors, (19) [2022-12-13 18:23:48,985 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:23:51,003 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:23:53,010 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:23:55,016 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:24:05,165 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:24:07,196 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:24:09,202 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:24:11,206 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:24:13,215 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:24:15,221 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:24:17,226 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:24:19,231 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:24:21,249 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:24:26,241 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:24:28,251 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:24:30,271 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:24:32,277 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:24:34,283 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:24:36,292 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:24:38,305 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:24:40,330 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:24:42,334 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:24:44,342 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:24:54,417 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:24:56,438 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:24:58,443 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:25:06,819 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:25:08,824 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:25:10,829 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:25:12,869 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:25:14,881 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:25:16,893 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:25:18,913 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:25:20,920 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:25:22,925 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:25:24,935 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:25:26,956 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:25:28,961 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:25:30,968 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:25:32,974 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:25:34,983 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:25:36,988 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:25:49,256 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:25:51,260 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:25:53,267 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:25:56,405 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:25:58,454 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:26:00,460 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:26:08,770 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:26:10,799 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:26:12,808 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:26:14,825 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:26:16,834 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:26:27,732 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:26:29,744 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:26:31,765 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:26:33,801 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:26:42,045 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:26:44,080 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:26:46,111 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:26:48,136 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:26:50,160 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:26:52,164 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:26:54,393 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:27:06,731 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:27:21,068 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:27:23,248 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:27:25,336 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:27:27,388 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:27:29,444 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:27:31,455 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:27:33,466 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:27:36,099 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:27:39,077 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:27:41,993 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:27:45,367 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:27:47,401 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:27:49,496 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:27:59,807 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:28:16,501 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:28:19,070 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:28:22,039 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:28:24,275 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:28:40,513 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.82s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:28:42,717 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:28:44,764 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:28:47,373 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:29:26,697 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:29:28,714 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:29:31,726 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:29:34,502 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:29:36,086 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:29:38,236 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:29:41,081 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:30:32,402 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:30:36,946 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:30:39,326 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:30:44,037 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:30:47,715 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:30:48,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:30:48,772 INFO L93 Difference]: Finished difference Result 258 states and 496 transitions. [2022-12-13 18:30:48,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-13 18:30:48,774 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 3.037037037037037) internal successors, (82), 24 states have internal predecessors, (82), 15 states have call successors, (19), 3 states have call predecessors, (19), 12 states have return successors, (19), 14 states have call predecessors, (19), 14 states have call successors, (19) Word has length 85 [2022-12-13 18:30:48,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:30:48,775 INFO L225 Difference]: With dead ends: 258 [2022-12-13 18:30:48,775 INFO L226 Difference]: Without dead ends: 258 [2022-12-13 18:30:48,775 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 138 SyntacticMatches, 9 SemanticMatches, 43 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 216.5s TimeCoverageRelationStatistics Valid=228, Invalid=966, Unknown=102, NotChecked=684, Total=1980 [2022-12-13 18:30:48,776 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 115 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 1425 mSolverCounterSat, 86 mSolverCounterUnsat, 234 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 226.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 2934 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 1425 IncrementalHoareTripleChecker+Invalid, 234 IncrementalHoareTripleChecker+Unknown, 1189 IncrementalHoareTripleChecker+Unchecked, 227.6s IncrementalHoareTripleChecker+Time [2022-12-13 18:30:48,776 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 214 Invalid, 2934 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 1425 Invalid, 234 Unknown, 1189 Unchecked, 227.6s Time] [2022-12-13 18:30:48,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2022-12-13 18:30:48,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 228. [2022-12-13 18:30:48,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 160 states have (on average 1.225) internal successors, (196), 172 states have internal predecessors, (196), 29 states have call successors, (29), 12 states have call predecessors, (29), 25 states have return successors, (158), 43 states have call predecessors, (158), 29 states have call successors, (158) [2022-12-13 18:30:48,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 383 transitions. [2022-12-13 18:30:48,787 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 383 transitions. Word has length 85 [2022-12-13 18:30:48,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:30:48,787 INFO L495 AbstractCegarLoop]: Abstraction has 228 states and 383 transitions. [2022-12-13 18:30:48,788 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 3.037037037037037) internal successors, (82), 24 states have internal predecessors, (82), 15 states have call successors, (19), 3 states have call predecessors, (19), 12 states have return successors, (19), 14 states have call predecessors, (19), 14 states have call successors, (19) [2022-12-13 18:30:48,788 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 383 transitions. [2022-12-13 18:30:48,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-12-13 18:30:48,788 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:30:48,788 INFO L195 NwaCegarLoop]: trace histogram [5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:30:48,826 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Ended with exit code 0 [2022-12-13 18:30:49,030 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Ended with exit code 0 [2022-12-13 18:30:49,189 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 18:30:49,190 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting maxErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [maxErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, maxErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, maxErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-12-13 18:30:49,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:30:49,191 INFO L85 PathProgramCache]: Analyzing trace with hash -1293875203, now seen corresponding path program 3 times [2022-12-13 18:30:49,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 18:30:49,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1891370226] [2022-12-13 18:30:49,192 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 18:30:49,193 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 18:30:49,193 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 18:30:49,196 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 18:30:49,198 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (33)] Waiting until timeout for monitored process [2022-12-13 18:30:49,440 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-13 18:30:49,440 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 18:30:49,448 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 32 conjunts are in the unsatisfiable core [2022-12-13 18:30:49,450 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:30:49,513 INFO L350 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 [2022-12-13 18:30:49,585 INFO L350 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2022-12-13 18:30:49,814 INFO L350 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 [2022-12-13 18:30:49,945 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 14 proven. 22 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-13 18:30:49,945 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 18:30:50,669 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 8 proven. 28 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-13 18:30:50,669 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 18:30:50,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1891370226] [2022-12-13 18:30:50,669 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1891370226] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 18:30:50,669 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 18:30:50,669 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 17 [2022-12-13 18:30:50,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077573621] [2022-12-13 18:30:50,669 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 18:30:50,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-13 18:30:50,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 18:30:50,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-13 18:30:50,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2022-12-13 18:30:50,671 INFO L87 Difference]: Start difference. First operand 228 states and 383 transitions. Second operand has 18 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 14 states have internal predecessors, (34), 5 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2022-12-13 18:30:54,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:30:54,730 INFO L93 Difference]: Finished difference Result 255 states and 420 transitions. [2022-12-13 18:30:54,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-13 18:30:54,730 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 14 states have internal predecessors, (34), 5 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) Word has length 45 [2022-12-13 18:30:54,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:30:54,731 INFO L225 Difference]: With dead ends: 255 [2022-12-13 18:30:54,732 INFO L226 Difference]: Without dead ends: 255 [2022-12-13 18:30:54,732 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=154, Invalid=902, Unknown=0, NotChecked=0, Total=1056 [2022-12-13 18:30:54,732 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 119 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 1582 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 1623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 1582 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-12-13 18:30:54,732 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 217 Invalid, 1623 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 1582 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2022-12-13 18:30:54,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2022-12-13 18:30:54,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 242. [2022-12-13 18:30:54,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 171 states have (on average 1.2456140350877194) internal successors, (213), 183 states have internal predecessors, (213), 31 states have call successors, (31), 13 states have call predecessors, (31), 26 states have return successors, (160), 45 states have call predecessors, (160), 31 states have call successors, (160) [2022-12-13 18:30:54,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 404 transitions. [2022-12-13 18:30:54,740 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 404 transitions. Word has length 45 [2022-12-13 18:30:54,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:30:54,740 INFO L495 AbstractCegarLoop]: Abstraction has 242 states and 404 transitions. [2022-12-13 18:30:54,740 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 14 states have internal predecessors, (34), 5 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2022-12-13 18:30:54,740 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 404 transitions. [2022-12-13 18:30:54,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-12-13 18:30:54,741 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:30:54,741 INFO L195 NwaCegarLoop]: trace histogram [11, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 1, 1, 1, 1] [2022-12-13 18:30:54,754 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (33)] Ended with exit code 0 [2022-12-13 18:30:54,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 18:30:54,941 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting nondet_treeErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [maxErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, maxErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, maxErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-12-13 18:30:54,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:30:54,942 INFO L85 PathProgramCache]: Analyzing trace with hash -1316376178, now seen corresponding path program 2 times [2022-12-13 18:30:54,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 18:30:54,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1732497319] [2022-12-13 18:30:54,942 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 18:30:54,942 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 18:30:54,942 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 18:30:54,943 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 18:30:54,944 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (34)] Waiting until timeout for monitored process [2022-12-13 18:30:55,381 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 18:30:55,381 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 18:30:55,398 INFO L263 TraceCheckSpWp]: Trace formula consists of 549 conjuncts, 41 conjunts are in the unsatisfiable core [2022-12-13 18:30:55,401 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:30:55,406 INFO L350 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 [2022-12-13 18:30:55,413 INFO L350 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 [2022-12-13 18:30:55,510 WARN L859 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_2825 (_ BitVec 32))) (= (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_2825) |c_#length|)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-12-13 18:30:55,550 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2825 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)) (= (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_2825) |c_#length|))) is different from true [2022-12-13 18:30:55,680 WARN L859 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (= (store |c_old(#length)| nondet_tree_~n~0.base (_ bv12 32)) |c_#length|)) is different from true [2022-12-13 18:30:55,894 WARN L859 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32)) (v_ArrVal_2826 (_ BitVec 32)) (v_nondet_tree_~n~0.base_336 (_ BitVec 32))) (and (bvule (_ bv12 32) (select |c_#length| nondet_tree_~n~0.base)) (= |c_#length| (store (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_2826) v_nondet_tree_~n~0.base_336 (_ bv12 32))))) is different from true [2022-12-13 18:30:56,048 WARN L859 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32)) (v_ArrVal_2826 (_ BitVec 32)) (v_nondet_tree_~n~0.base_336 (_ BitVec 32)) (v_ArrVal_2829 (_ BitVec 32)) (v_nondet_tree_~n~0.base_337 (_ BitVec 32))) (and (= (store (store (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_2829) v_nondet_tree_~n~0.base_337 v_ArrVal_2826) v_nondet_tree_~n~0.base_336 (_ bv12 32)) |c_#length|) (bvule (_ bv12 32) (select |c_#length| v_nondet_tree_~n~0.base_337)) (bvule (_ bv12 32) (select |c_#length| nondet_tree_~n~0.base)))) is different from true [2022-12-13 18:30:56,116 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2825 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32)) (v_ArrVal_2826 (_ BitVec 32)) (v_nondet_tree_~n~0.base_336 (_ BitVec 32)) (v_ArrVal_2829 (_ BitVec 32)) (v_nondet_tree_~n~0.base_337 (_ BitVec 32)) (v_nondet_tree_~n~0.base_338 (_ BitVec 32))) (and (= (store (store (store (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_2825) v_nondet_tree_~n~0.base_338 v_ArrVal_2829) v_nondet_tree_~n~0.base_337 v_ArrVal_2826) v_nondet_tree_~n~0.base_336 (_ bv12 32)) |c_#length|) (bvule (_ bv12 32) (select |c_#length| v_nondet_tree_~n~0.base_337)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)) (bvule (_ bv12 32) (select |c_#length| v_nondet_tree_~n~0.base_338)))) is different from true [2022-12-13 18:30:56,211 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:30:56,399 INFO L321 Elim1Store]: treesize reduction 114, result has 30.1 percent of original size [2022-12-13 18:30:56,399 INFO L350 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 4 case distinctions, treesize of input 21 treesize of output 57 [2022-12-13 18:30:56,426 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-13 18:30:56,426 INFO L350 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 [2022-12-13 18:30:56,576 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 80 proven. 42 refuted. 2 times theorem prover too weak. 55 trivial. 115 not checked. [2022-12-13 18:30:56,576 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 18:30:59,563 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 18:30:59,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1732497319] [2022-12-13 18:30:59,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1732497319] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 18:30:59,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [675210378] [2022-12-13 18:30:59,564 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 18:30:59,564 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-13 18:30:59,564 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/bin/uautomizer-uyxdKDjOR8/cvc4 [2022-12-13 18:30:59,565 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-13 18:30:59,565 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_570f3999-5257-4ef9-bcb1-c251b9df1421/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt (35)] Waiting until timeout for monitored process [2022-12-13 18:31:00,278 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 18:31:00,278 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 18:31:00,301 INFO L263 TraceCheckSpWp]: Trace formula consists of 549 conjuncts, 49 conjunts are in the unsatisfiable core [2022-12-13 18:31:00,304 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:31:00,309 INFO L350 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 [2022-12-13 18:31:00,314 INFO L350 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 [2022-12-13 18:31:00,394 WARN L859 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_3013 (_ BitVec 32))) (= (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_3013) |c_#length|)) (exists ((v_ArrVal_3014 (_ BitVec 1))) (= (store |c_old(#valid)| nondet_tree_~n~0.base v_ArrVal_3014) |c_#valid|)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-12-13 18:31:00,440 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3013 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32)) (v_ArrVal_3014 (_ BitVec 1))) (and (= (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_3013) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)) (= (store |c_old(#valid)| nondet_tree_~n~0.base v_ArrVal_3014) |c_#valid|))) is different from true [2022-12-13 18:31:00,561 WARN L859 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32)) (v_ArrVal_3016 (_ BitVec 32))) (and (= (store |c_old(#valid)| nondet_tree_~n~0.base (_ bv1 1)) |c_#valid|) (= (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_3016) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-12-13 18:31:00,597 WARN L859 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_3017 (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_3017))) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-12-13 18:31:00,676 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_nondet_tree_~n~0.base_370 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32)) (v_ArrVal_3017 (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| v_nondet_tree_~n~0.base_370)) (= (store (store |c_old(#length)| v_nondet_tree_~n~0.base_370 v_ArrVal_3017) nondet_tree_~n~0.base (_ bv12 32)) |c_#length|))) is different from true [2022-12-13 18:31:00,754 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_nondet_tree_~n~0.base_371 (_ BitVec 32)) (v_nondet_tree_~n~0.base_370 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32)) (v_ArrVal_3016 (_ BitVec 32)) (v_ArrVal_3017 (_ BitVec 32))) (and (= (select (store |c_old(#valid)| nondet_tree_~n~0.base (_ bv1 1)) v_nondet_tree_~n~0.base_370) (_ bv0 1)) (= |c_#length| (store (store (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_3016) v_nondet_tree_~n~0.base_370 v_ArrVal_3017) v_nondet_tree_~n~0.base_371 (_ bv12 32))) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-12-13 18:31:00,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:31:00,973 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:31:00,975 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:31:00,982 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:31:01,105 INFO L321 Elim1Store]: treesize reduction 73, result has 34.8 percent of original size [2022-12-13 18:31:01,106 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 21 treesize of output 47 [2022-12-13 18:31:01,191 INFO L321 Elim1Store]: treesize reduction 38, result has 37.7 percent of original size [2022-12-13 18:31:01,191 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 57 treesize of output 71 [2022-12-13 18:31:01,304 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 80 proven. 58 refuted. 0 times theorem prover too weak. 36 trivial. 120 not checked. [2022-12-13 18:31:01,304 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 18:31:03,868 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv12 32) c_nondet_tree_~n~0.offset))) (and (or (bvule (bvadd (_ bv8 32) c_nondet_tree_~n~0.offset) .cse0) (forall ((v_nondet_tree_~n~0.base_401 (_ BitVec 32)) (v_nondet_tree_~n~0.base_402 (_ BitVec 32)) (v_nondet_tree_~n~0.base_400 (_ BitVec 32)) (v_ArrVal_3041 (_ BitVec 1))) (let ((.cse1 (store |c_#valid| v_nondet_tree_~n~0.base_402 v_ArrVal_3041))) (or (not (= (select .cse1 v_nondet_tree_~n~0.base_401) (_ bv0 1))) (not (= (_ bv0 1) (select (store .cse1 v_nondet_tree_~n~0.base_401 (_ bv1 1)) v_nondet_tree_~n~0.base_400))) (not (= (select |c_#valid| v_nondet_tree_~n~0.base_402) (_ bv0 1))))))) (forall ((v_nondet_tree_~n~0.base_402 (_ BitVec 32))) (or (not (= (select |c_#valid| v_nondet_tree_~n~0.base_402) (_ bv0 1))) (forall ((v_nondet_tree_~n~0.base_401 (_ BitVec 32)) (v_ArrVal_3041 (_ BitVec 1))) (let ((.cse2 (store |c_#valid| v_nondet_tree_~n~0.base_402 v_ArrVal_3041))) (or (not (= (select .cse2 v_nondet_tree_~n~0.base_401) (_ bv0 1))) (forall ((v_nondet_tree_~n~0.base_400 (_ BitVec 32))) (or (not (= (_ bv0 1) (select (store .cse2 v_nondet_tree_~n~0.base_401 (_ bv1 1)) v_nondet_tree_~n~0.base_400))) (forall ((v_ArrVal_3040 (_ BitVec 32)) (v_ArrVal_3038 (_ BitVec 32)) (v_nondet_tree_~n~0.base_403 (_ BitVec 32)) (v_ArrVal_3039 (_ BitVec 32))) (bvule .cse0 (select (store (store (store (store |c_#length| v_nondet_tree_~n~0.base_402 v_ArrVal_3039) v_nondet_tree_~n~0.base_401 v_ArrVal_3038) v_nondet_tree_~n~0.base_400 v_ArrVal_3040) v_nondet_tree_~n~0.base_403 (_ bv12 32)) c_nondet_tree_~n~0.base)))))))))))) is different from false [2022-12-13 18:31:03,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [675210378] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 18:31:03,877 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 18:31:03,878 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 24 [2022-12-13 18:31:03,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460189154] [2022-12-13 18:31:03,878 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 18:31:03,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-12-13 18:31:03,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 18:31:03,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-12-13 18:31:03,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=172, Unknown=26, NotChecked=494, Total=756 [2022-12-13 18:31:03,879 INFO L87 Difference]: Start difference. First operand 242 states and 404 transitions. Second operand has 25 states, 24 states have (on average 3.0416666666666665) internal successors, (73), 21 states have internal predecessors, (73), 13 states have call successors, (18), 3 states have call predecessors, (18), 10 states have return successors, (18), 16 states have call predecessors, (18), 13 states have call successors, (18) [2022-12-13 18:31:05,915 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:31:10,100 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:31:12,113 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:31:14,127 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:31:16,164 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:31:20,230 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:31:22,248 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:31:24,261 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:31:26,293 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:31:30,344 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:31:34,427 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:31:36,434 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:31:41,129 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 18:31:43,297 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0]