./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../../sv-benchmarks/c/verifythis/tree_del_iter.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version b5237d83 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_cd78a4f5-ed3e-4b9f-ad67-5dcd51cf5a59/bin/uautomizer-vX5HgA9Q3a/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd78a4f5-ed3e-4b9f-ad67-5dcd51cf5a59/bin/uautomizer-vX5HgA9Q3a/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd78a4f5-ed3e-4b9f-ad67-5dcd51cf5a59/bin/uautomizer-vX5HgA9Q3a/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd78a4f5-ed3e-4b9f-ad67-5dcd51cf5a59/bin/uautomizer-vX5HgA9Q3a/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/verifythis/tree_del_iter.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd78a4f5-ed3e-4b9f-ad67-5dcd51cf5a59/bin/uautomizer-vX5HgA9Q3a/config/svcomp-MemCleanup-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd78a4f5-ed3e-4b9f-ad67-5dcd51cf5a59/bin/uautomizer-vX5HgA9Q3a --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 cce1bb7a06b9dd56fbf663e182ffe801720ee05ee19a126a08070f1616bc4afe --- 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-b5237d8 [2022-11-21 13:50:20,508 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-21 13:50:20,510 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-21 13:50:20,550 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-21 13:50:20,552 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-21 13:50:20,556 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-21 13:50:20,559 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-21 13:50:20,562 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-21 13:50:20,564 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-21 13:50:20,570 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-21 13:50:20,572 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-21 13:50:20,573 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-21 13:50:20,574 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-21 13:50:20,577 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-21 13:50:20,579 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-21 13:50:20,582 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-21 13:50:20,584 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-21 13:50:20,585 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-21 13:50:20,586 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-21 13:50:20,593 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-21 13:50:20,595 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-21 13:50:20,597 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-21 13:50:20,598 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-21 13:50:20,599 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-21 13:50:20,609 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-21 13:50:20,610 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-21 13:50:20,611 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-21 13:50:20,612 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-21 13:50:20,613 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-21 13:50:20,615 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-21 13:50:20,616 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-21 13:50:20,617 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-21 13:50:20,619 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-21 13:50:20,620 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-21 13:50:20,622 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-21 13:50:20,622 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-21 13:50:20,623 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-21 13:50:20,623 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-21 13:50:20,623 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-21 13:50:20,625 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-21 13:50:20,626 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-21 13:50:20,627 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd78a4f5-ed3e-4b9f-ad67-5dcd51cf5a59/bin/uautomizer-vX5HgA9Q3a/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2022-11-21 13:50:20,670 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-21 13:50:20,670 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-21 13:50:20,671 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-21 13:50:20,671 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-21 13:50:20,672 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-21 13:50:20,673 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-21 13:50:20,673 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-21 13:50:20,674 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-21 13:50:20,674 INFO L138 SettingsManager]: * Use SBE=true [2022-11-21 13:50:20,674 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-21 13:50:20,676 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-21 13:50:20,676 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-21 13:50:20,676 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-21 13:50:20,676 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-21 13:50:20,677 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-21 13:50:20,677 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-21 13:50:20,677 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-21 13:50:20,677 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-21 13:50:20,678 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-21 13:50:20,678 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-21 13:50:20,678 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-21 13:50:20,679 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-21 13:50:20,679 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-21 13:50:20,679 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-21 13:50:20,679 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 13:50:20,680 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-21 13:50:20,680 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-21 13:50:20,680 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-21 13:50:20,681 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-21 13:50:20,681 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_cd78a4f5-ed3e-4b9f-ad67-5dcd51cf5a59/bin/uautomizer-vX5HgA9Q3a/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_cd78a4f5-ed3e-4b9f-ad67-5dcd51cf5a59/bin/uautomizer-vX5HgA9Q3a 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 -> cce1bb7a06b9dd56fbf663e182ffe801720ee05ee19a126a08070f1616bc4afe [2022-11-21 13:50:20,995 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-21 13:50:21,037 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-21 13:50:21,041 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-21 13:50:21,043 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-21 13:50:21,044 INFO L275 PluginConnector]: CDTParser initialized [2022-11-21 13:50:21,046 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd78a4f5-ed3e-4b9f-ad67-5dcd51cf5a59/bin/uautomizer-vX5HgA9Q3a/../../sv-benchmarks/c/verifythis/tree_del_iter.c [2022-11-21 13:50:24,146 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-21 13:50:24,349 INFO L351 CDTParser]: Found 1 translation units. [2022-11-21 13:50:24,349 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd78a4f5-ed3e-4b9f-ad67-5dcd51cf5a59/sv-benchmarks/c/verifythis/tree_del_iter.c [2022-11-21 13:50:24,357 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd78a4f5-ed3e-4b9f-ad67-5dcd51cf5a59/bin/uautomizer-vX5HgA9Q3a/data/53a1bce63/59b203a49af24e43ac09f0e12d778bfb/FLAGe9bdaf083 [2022-11-21 13:50:24,371 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd78a4f5-ed3e-4b9f-ad67-5dcd51cf5a59/bin/uautomizer-vX5HgA9Q3a/data/53a1bce63/59b203a49af24e43ac09f0e12d778bfb [2022-11-21 13:50:24,374 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-21 13:50:24,376 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-21 13:50:24,377 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-21 13:50:24,378 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-21 13:50:24,389 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-21 13:50:24,390 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 01:50:24" (1/1) ... [2022-11-21 13:50:24,391 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a0e57e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:50:24, skipping insertion in model container [2022-11-21 13:50:24,392 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 01:50:24" (1/1) ... [2022-11-21 13:50:24,400 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-21 13:50:24,419 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-21 13:50:24,590 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_cd78a4f5-ed3e-4b9f-ad67-5dcd51cf5a59/sv-benchmarks/c/verifythis/tree_del_iter.c[586,599] [2022-11-21 13:50:24,613 WARN L1569 CHandler]: Possible shadowing of function min [2022-11-21 13:50:24,630 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 13:50:24,645 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-11-21 13:50:24,646 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@1a35eeef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:50:24, skipping insertion in model container [2022-11-21 13:50:24,646 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-21 13:50:24,646 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2022-11-21 13:50:24,648 INFO L158 Benchmark]: Toolchain (without parser) took 271.58ms. Allocated memory is still 174.1MB. Free memory was 126.5MB in the beginning and 116.2MB in the end (delta: 10.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-21 13:50:24,649 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 174.1MB. Free memory is still 144.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-21 13:50:24,650 INFO L158 Benchmark]: CACSL2BoogieTranslator took 268.98ms. Allocated memory is still 174.1MB. Free memory was 125.9MB in the beginning and 116.2MB in the end (delta: 9.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-21 13:50:24,651 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.33ms. Allocated memory is still 174.1MB. Free memory is still 144.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 268.98ms. Allocated memory is still 174.1MB. Free memory was 125.9MB in the beginning and 116.2MB in the end (delta: 9.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 28]: 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_cd78a4f5-ed3e-4b9f-ad67-5dcd51cf5a59/bin/uautomizer-vX5HgA9Q3a/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd78a4f5-ed3e-4b9f-ad67-5dcd51cf5a59/bin/uautomizer-vX5HgA9Q3a/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd78a4f5-ed3e-4b9f-ad67-5dcd51cf5a59/bin/uautomizer-vX5HgA9Q3a/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd78a4f5-ed3e-4b9f-ad67-5dcd51cf5a59/bin/uautomizer-vX5HgA9Q3a/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/verifythis/tree_del_iter.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd78a4f5-ed3e-4b9f-ad67-5dcd51cf5a59/bin/uautomizer-vX5HgA9Q3a/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd78a4f5-ed3e-4b9f-ad67-5dcd51cf5a59/bin/uautomizer-vX5HgA9Q3a --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 cce1bb7a06b9dd56fbf663e182ffe801720ee05ee19a126a08070f1616bc4afe --- 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-b5237d8 [2022-11-21 13:50:27,209 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-21 13:50:27,212 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-21 13:50:27,282 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-21 13:50:27,283 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-21 13:50:27,287 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-21 13:50:27,290 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-21 13:50:27,296 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-21 13:50:27,298 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-21 13:50:27,304 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-21 13:50:27,306 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-21 13:50:27,307 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-21 13:50:27,308 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-21 13:50:27,311 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-21 13:50:27,312 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-21 13:50:27,317 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-21 13:50:27,321 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-21 13:50:27,322 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-21 13:50:27,324 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-21 13:50:27,327 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-21 13:50:27,332 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-21 13:50:27,334 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-21 13:50:27,338 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-21 13:50:27,340 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-21 13:50:27,346 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-21 13:50:27,352 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-21 13:50:27,352 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-21 13:50:27,354 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-21 13:50:27,356 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-21 13:50:27,357 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-21 13:50:27,357 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-21 13:50:27,363 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-21 13:50:27,364 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-21 13:50:27,365 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-21 13:50:27,366 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-21 13:50:27,366 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-21 13:50:27,367 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-21 13:50:27,367 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-21 13:50:27,367 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-21 13:50:27,368 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-21 13:50:27,369 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-21 13:50:27,370 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd78a4f5-ed3e-4b9f-ad67-5dcd51cf5a59/bin/uautomizer-vX5HgA9Q3a/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf [2022-11-21 13:50:27,414 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-21 13:50:27,414 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-21 13:50:27,416 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-21 13:50:27,416 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-21 13:50:27,417 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-21 13:50:27,418 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-21 13:50:27,418 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-21 13:50:27,419 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-21 13:50:27,419 INFO L138 SettingsManager]: * Use SBE=true [2022-11-21 13:50:27,419 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-21 13:50:27,421 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-21 13:50:27,421 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-21 13:50:27,421 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-21 13:50:27,422 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-21 13:50:27,422 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-21 13:50:27,422 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-21 13:50:27,422 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-21 13:50:27,423 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-21 13:50:27,423 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-21 13:50:27,423 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-21 13:50:27,423 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-21 13:50:27,424 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-21 13:50:27,424 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-21 13:50:27,424 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-21 13:50:27,425 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-21 13:50:27,425 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-21 13:50:27,425 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 13:50:27,426 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-21 13:50:27,426 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-21 13:50:27,426 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-11-21 13:50:27,426 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-21 13:50:27,427 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-21 13:50:27,427 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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_cd78a4f5-ed3e-4b9f-ad67-5dcd51cf5a59/bin/uautomizer-vX5HgA9Q3a/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_cd78a4f5-ed3e-4b9f-ad67-5dcd51cf5a59/bin/uautomizer-vX5HgA9Q3a 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 -> cce1bb7a06b9dd56fbf663e182ffe801720ee05ee19a126a08070f1616bc4afe [2022-11-21 13:50:27,884 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-21 13:50:27,922 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-21 13:50:27,925 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-21 13:50:27,927 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-21 13:50:27,927 INFO L275 PluginConnector]: CDTParser initialized [2022-11-21 13:50:27,929 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd78a4f5-ed3e-4b9f-ad67-5dcd51cf5a59/bin/uautomizer-vX5HgA9Q3a/../../sv-benchmarks/c/verifythis/tree_del_iter.c [2022-11-21 13:50:31,073 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-21 13:50:31,284 INFO L351 CDTParser]: Found 1 translation units. [2022-11-21 13:50:31,285 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd78a4f5-ed3e-4b9f-ad67-5dcd51cf5a59/sv-benchmarks/c/verifythis/tree_del_iter.c [2022-11-21 13:50:31,292 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd78a4f5-ed3e-4b9f-ad67-5dcd51cf5a59/bin/uautomizer-vX5HgA9Q3a/data/e621974e1/1779e041614a42d1b5386602abd75fcc/FLAG22bbb6d24 [2022-11-21 13:50:31,314 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd78a4f5-ed3e-4b9f-ad67-5dcd51cf5a59/bin/uautomizer-vX5HgA9Q3a/data/e621974e1/1779e041614a42d1b5386602abd75fcc [2022-11-21 13:50:31,316 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-21 13:50:31,318 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-21 13:50:31,319 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-21 13:50:31,319 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-21 13:50:31,324 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-21 13:50:31,324 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 01:50:31" (1/1) ... [2022-11-21 13:50:31,326 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5be1a20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:50:31, skipping insertion in model container [2022-11-21 13:50:31,326 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 01:50:31" (1/1) ... [2022-11-21 13:50:31,334 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-21 13:50:31,366 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-21 13:50:31,521 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_cd78a4f5-ed3e-4b9f-ad67-5dcd51cf5a59/sv-benchmarks/c/verifythis/tree_del_iter.c[586,599] [2022-11-21 13:50:31,545 WARN L1569 CHandler]: Possible shadowing of function min [2022-11-21 13:50:31,562 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 13:50:31,579 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-11-21 13:50:31,584 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-21 13:50:31,588 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_cd78a4f5-ed3e-4b9f-ad67-5dcd51cf5a59/sv-benchmarks/c/verifythis/tree_del_iter.c[586,599] [2022-11-21 13:50:31,598 WARN L1569 CHandler]: Possible shadowing of function min [2022-11-21 13:50:31,610 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 13:50:31,623 INFO L203 MainTranslator]: Completed pre-run [2022-11-21 13:50:31,658 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_cd78a4f5-ed3e-4b9f-ad67-5dcd51cf5a59/sv-benchmarks/c/verifythis/tree_del_iter.c[586,599] [2022-11-21 13:50:31,672 WARN L1569 CHandler]: Possible shadowing of function min [2022-11-21 13:50:31,689 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 13:50:31,719 INFO L208 MainTranslator]: Completed translation [2022-11-21 13:50:31,720 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:50:31 WrapperNode [2022-11-21 13:50:31,720 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-21 13:50:31,722 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-21 13:50:31,722 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-21 13:50:31,722 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-21 13:50:31,732 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:50:31" (1/1) ... [2022-11-21 13:50:31,746 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:50:31" (1/1) ... [2022-11-21 13:50:31,772 INFO L138 Inliner]: procedures = 31, calls = 64, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 122 [2022-11-21 13:50:31,773 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-21 13:50:31,774 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-21 13:50:31,774 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-21 13:50:31,774 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-21 13:50:31,785 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:50:31" (1/1) ... [2022-11-21 13:50:31,785 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:50:31" (1/1) ... [2022-11-21 13:50:31,792 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:50:31" (1/1) ... [2022-11-21 13:50:31,792 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:50:31" (1/1) ... [2022-11-21 13:50:31,807 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:50:31" (1/1) ... [2022-11-21 13:50:31,812 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:50:31" (1/1) ... [2022-11-21 13:50:31,814 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:50:31" (1/1) ... [2022-11-21 13:50:31,816 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:50:31" (1/1) ... [2022-11-21 13:50:31,820 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-21 13:50:31,821 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-21 13:50:31,821 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-21 13:50:31,821 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-21 13:50:31,822 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:50:31" (1/1) ... [2022-11-21 13:50:31,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 13:50:31,841 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd78a4f5-ed3e-4b9f-ad67-5dcd51cf5a59/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:50:31,859 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd78a4f5-ed3e-4b9f-ad67-5dcd51cf5a59/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-21 13:50:31,867 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd78a4f5-ed3e-4b9f-ad67-5dcd51cf5a59/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-21 13:50:31,908 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-21 13:50:31,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-21 13:50:31,908 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-21 13:50:31,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-21 13:50:31,909 INFO L130 BoogieDeclarations]: Found specification of procedure min [2022-11-21 13:50:31,909 INFO L138 BoogieDeclarations]: Found implementation of procedure min [2022-11-21 13:50:31,909 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-11-21 13:50:31,909 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-11-21 13:50:31,909 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-11-21 13:50:31,909 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-21 13:50:31,910 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_tree [2022-11-21 13:50:31,910 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_tree [2022-11-21 13:50:31,910 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-21 13:50:31,910 INFO L130 BoogieDeclarations]: Found specification of procedure size [2022-11-21 13:50:31,910 INFO L138 BoogieDeclarations]: Found implementation of procedure size [2022-11-21 13:50:31,910 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-21 13:50:31,911 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-21 13:50:31,911 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-11-21 13:50:31,911 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-11-21 13:50:31,911 INFO L130 BoogieDeclarations]: Found specification of procedure tree_inorder [2022-11-21 13:50:31,911 INFO L138 BoogieDeclarations]: Found implementation of procedure tree_inorder [2022-11-21 13:50:31,911 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-21 13:50:31,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-21 13:50:32,049 INFO L235 CfgBuilder]: Building ICFG [2022-11-21 13:50:32,060 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-21 13:50:33,034 INFO L276 CfgBuilder]: Performing block encoding [2022-11-21 13:50:33,043 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-21 13:50:33,043 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-11-21 13:50:33,045 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 01:50:33 BoogieIcfgContainer [2022-11-21 13:50:33,046 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-21 13:50:33,048 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-21 13:50:33,048 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-21 13:50:33,052 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-21 13:50:33,052 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 01:50:31" (1/3) ... [2022-11-21 13:50:33,053 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@385c605f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 01:50:33, skipping insertion in model container [2022-11-21 13:50:33,053 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:50:31" (2/3) ... [2022-11-21 13:50:33,053 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@385c605f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 01:50:33, skipping insertion in model container [2022-11-21 13:50:33,054 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 01:50:33" (3/3) ... [2022-11-21 13:50:33,055 INFO L112 eAbstractionObserver]: Analyzing ICFG tree_del_iter.c [2022-11-21 13:50:33,091 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-21 13:50:33,091 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 64 error locations. [2022-11-21 13:50:33,166 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-21 13:50:33,175 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=FINITE_AUTOMATA, 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;@71b8c544, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-21 13:50:33,175 INFO L358 AbstractCegarLoop]: Starting to check reachability of 64 error locations. [2022-11-21 13:50:33,182 INFO L276 IsEmpty]: Start isEmpty. Operand has 190 states, 99 states have (on average 1.797979797979798) internal successors, (178), 163 states have internal predecessors, (178), 20 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2022-11-21 13:50:33,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-21 13:50:33,190 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:50:33,191 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-21 13:50:33,192 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting nondet_treeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [nondet_treeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-21 13:50:33,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:50:33,202 INFO L85 PathProgramCache]: Analyzing trace with hash 88048840, now seen corresponding path program 1 times [2022-11-21 13:50:33,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 13:50:33,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1153445538] [2022-11-21 13:50:33,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:50:33,220 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-11-21 13:50:33,221 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd78a4f5-ed3e-4b9f-ad67-5dcd51cf5a59/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 13:50:33,227 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd78a4f5-ed3e-4b9f-ad67-5dcd51cf5a59/bin/uautomizer-vX5HgA9Q3a/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-11-21 13:50:33,236 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd78a4f5-ed3e-4b9f-ad67-5dcd51cf5a59/bin/uautomizer-vX5HgA9Q3a/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-11-21 13:50:33,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:33,341 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-21 13:50:33,347 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:50:33,434 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-11-21 13:50:33,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:50:33,450 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 13:50:33,450 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 13:50:33,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1153445538] [2022-11-21 13:50:33,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1153445538] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:50:33,452 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:50:33,452 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 13:50:33,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689344447] [2022-11-21 13:50:33,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:50:33,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 13:50:33,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 13:50:33,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 13:50:33,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 13:50:33,510 INFO L87 Difference]: Start difference. First operand has 190 states, 99 states have (on average 1.797979797979798) internal successors, (178), 163 states have internal predecessors, (178), 20 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) 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-11-21 13:50:33,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:50:33,897 INFO L93 Difference]: Finished difference Result 191 states and 216 transitions. [2022-11-21 13:50:33,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 13:50:33,902 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-11-21 13:50:33,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:50:33,913 INFO L225 Difference]: With dead ends: 191 [2022-11-21 13:50:33,914 INFO L226 Difference]: Without dead ends: 188 [2022-11-21 13:50:33,915 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-11-21 13:50:33,925 INFO L413 NwaCegarLoop]: 213 mSDtfsCounter, 6 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-21 13:50:33,926 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 350 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-21 13:50:33,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2022-11-21 13:50:33,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 186. [2022-11-21 13:50:33,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 97 states have (on average 1.731958762886598) internal successors, (168), 159 states have internal predecessors, (168), 20 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2022-11-21 13:50:33,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 208 transitions. [2022-11-21 13:50:33,986 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 208 transitions. Word has length 5 [2022-11-21 13:50:33,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:50:33,987 INFO L495 AbstractCegarLoop]: Abstraction has 186 states and 208 transitions. [2022-11-21 13:50:33,987 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-11-21 13:50:33,987 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 208 transitions. [2022-11-21 13:50:33,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-21 13:50:33,988 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:50:33,988 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-21 13:50:34,006 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd78a4f5-ed3e-4b9f-ad67-5dcd51cf5a59/bin/uautomizer-vX5HgA9Q3a/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)] Ended with exit code 0 [2022-11-21 13:50:34,201 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd78a4f5-ed3e-4b9f-ad67-5dcd51cf5a59/bin/uautomizer-vX5HgA9Q3a/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-11-21 13:50:34,201 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting nondet_treeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [nondet_treeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-21 13:50:34,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:50:34,203 INFO L85 PathProgramCache]: Analyzing trace with hash 88048841, now seen corresponding path program 1 times [2022-11-21 13:50:34,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 13:50:34,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [223970142] [2022-11-21 13:50:34,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:50:34,204 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-11-21 13:50:34,204 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd78a4f5-ed3e-4b9f-ad67-5dcd51cf5a59/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 13:50:34,206 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd78a4f5-ed3e-4b9f-ad67-5dcd51cf5a59/bin/uautomizer-vX5HgA9Q3a/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-11-21 13:50:34,224 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd78a4f5-ed3e-4b9f-ad67-5dcd51cf5a59/bin/uautomizer-vX5HgA9Q3a/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-11-21 13:50:34,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:34,277 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-21 13:50:34,278 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:50:34,290 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-11-21 13:50:34,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:50:34,307 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 13:50:34,308 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 13:50:34,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [223970142] [2022-11-21 13:50:34,309 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [223970142] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:50:34,315 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:50:34,315 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 13:50:34,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080169217] [2022-11-21 13:50:34,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:50:34,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 13:50:34,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 13:50:34,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 13:50:34,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 13:50:34,322 INFO L87 Difference]: Start difference. First operand 186 states and 208 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-11-21 13:50:34,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:50:34,716 INFO L93 Difference]: Finished difference Result 185 states and 207 transitions. [2022-11-21 13:50:34,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 13:50:34,718 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-11-21 13:50:34,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:50:34,720 INFO L225 Difference]: With dead ends: 185 [2022-11-21 13:50:34,720 INFO L226 Difference]: Without dead ends: 185 [2022-11-21 13:50:34,721 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-11-21 13:50:34,722 INFO L413 NwaCegarLoop]: 206 mSDtfsCounter, 2 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-21 13:50:34,722 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 353 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-21 13:50:34,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2022-11-21 13:50:34,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2022-11-21 13:50:34,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 97 states have (on average 1.7216494845360826) internal successors, (167), 158 states have internal predecessors, (167), 20 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2022-11-21 13:50:34,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 207 transitions. [2022-11-21 13:50:34,739 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 207 transitions. Word has length 5 [2022-11-21 13:50:34,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:50:34,740 INFO L495 AbstractCegarLoop]: Abstraction has 185 states and 207 transitions. [2022-11-21 13:50:34,740 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-11-21 13:50:34,740 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 207 transitions. [2022-11-21 13:50:34,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-21 13:50:34,741 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:50:34,741 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:50:34,755 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd78a4f5-ed3e-4b9f-ad67-5dcd51cf5a59/bin/uautomizer-vX5HgA9Q3a/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-11-21 13:50:34,952 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd78a4f5-ed3e-4b9f-ad67-5dcd51cf5a59/bin/uautomizer-vX5HgA9Q3a/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-11-21 13:50:34,953 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting minErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [nondet_treeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-21 13:50:34,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:50:34,953 INFO L85 PathProgramCache]: Analyzing trace with hash -163614216, now seen corresponding path program 1 times [2022-11-21 13:50:34,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 13:50:34,954 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2080232844] [2022-11-21 13:50:34,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:50:34,954 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-11-21 13:50:34,955 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd78a4f5-ed3e-4b9f-ad67-5dcd51cf5a59/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 13:50:34,956 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd78a4f5-ed3e-4b9f-ad67-5dcd51cf5a59/bin/uautomizer-vX5HgA9Q3a/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-11-21 13:50:34,969 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd78a4f5-ed3e-4b9f-ad67-5dcd51cf5a59/bin/uautomizer-vX5HgA9Q3a/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-11-21 13:50:35,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:35,022 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-21 13:50:35,024 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:50:35,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:50:35,188 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 13:50:35,189 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 13:50:35,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2080232844] [2022-11-21 13:50:35,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2080232844] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:50:35,189 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:50:35,190 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-21 13:50:35,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683816495] [2022-11-21 13:50:35,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:50:35,195 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-21 13:50:35,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 13:50:35,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-21 13:50:35,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-21 13:50:35,201 INFO L87 Difference]: Start difference. First operand 185 states and 207 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-11-21 13:50:35,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:50:35,445 INFO L93 Difference]: Finished difference Result 297 states and 335 transitions. [2022-11-21 13:50:35,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-21 13:50:35,445 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-11-21 13:50:35,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:50:35,448 INFO L225 Difference]: With dead ends: 297 [2022-11-21 13:50:35,448 INFO L226 Difference]: Without dead ends: 297 [2022-11-21 13:50:35,448 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-11-21 13:50:35,449 INFO L413 NwaCegarLoop]: 213 mSDtfsCounter, 193 mSDsluCounter, 1008 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 1221 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 13:50:35,450 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 1221 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 13:50:35,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2022-11-21 13:50:35,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 193. [2022-11-21 13:50:35,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 102 states have (on average 1.6862745098039216) internal successors, (172), 164 states have internal predecessors, (172), 21 states have call successors, (21), 7 states have call predecessors, (21), 8 states have return successors, (24), 21 states have call predecessors, (24), 21 states have call successors, (24) [2022-11-21 13:50:35,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 217 transitions. [2022-11-21 13:50:35,473 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 217 transitions. Word has length 11 [2022-11-21 13:50:35,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:50:35,473 INFO L495 AbstractCegarLoop]: Abstraction has 193 states and 217 transitions. [2022-11-21 13:50:35,473 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-11-21 13:50:35,474 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 217 transitions. [2022-11-21 13:50:35,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-21 13:50:35,482 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:50:35,482 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:50:35,496 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd78a4f5-ed3e-4b9f-ad67-5dcd51cf5a59/bin/uautomizer-vX5HgA9Q3a/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)] Forceful destruction successful, exit code 0 [2022-11-21 13:50:35,696 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd78a4f5-ed3e-4b9f-ad67-5dcd51cf5a59/bin/uautomizer-vX5HgA9Q3a/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-11-21 13:50:35,696 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting nondet_treeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [nondet_treeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-21 13:50:35,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:50:35,697 INFO L85 PathProgramCache]: Analyzing trace with hash -916126343, now seen corresponding path program 1 times [2022-11-21 13:50:35,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 13:50:35,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [26367772] [2022-11-21 13:50:35,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:50:35,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-11-21 13:50:35,698 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd78a4f5-ed3e-4b9f-ad67-5dcd51cf5a59/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 13:50:35,699 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd78a4f5-ed3e-4b9f-ad67-5dcd51cf5a59/bin/uautomizer-vX5HgA9Q3a/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-11-21 13:50:35,703 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd78a4f5-ed3e-4b9f-ad67-5dcd51cf5a59/bin/uautomizer-vX5HgA9Q3a/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-11-21 13:50:35,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:35,791 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-21 13:50:35,793 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:50:35,803 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-11-21 13:50:35,851 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:50:35,852 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 13:50:35,852 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 13:50:35,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [26367772] [2022-11-21 13:50:35,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [26367772] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:50:35,853 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:50:35,853 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 13:50:35,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850105683] [2022-11-21 13:50:35,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:50:35,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 13:50:35,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 13:50:35,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 13:50:35,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-21 13:50:35,855 INFO L87 Difference]: Start difference. First operand 193 states and 217 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-11-21 13:50:36,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:50:36,500 INFO L93 Difference]: Finished difference Result 197 states and 221 transitions. [2022-11-21 13:50:36,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-21 13:50:36,501 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-11-21 13:50:36,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:50:36,502 INFO L225 Difference]: With dead ends: 197 [2022-11-21 13:50:36,503 INFO L226 Difference]: Without dead ends: 197 [2022-11-21 13:50:36,503 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-11-21 13:50:36,504 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 70 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-21 13:50:36,504 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 264 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-21 13:50:36,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2022-11-21 13:50:36,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 195. [2022-11-21 13:50:36,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 104 states have (on average 1.6923076923076923) internal successors, (176), 164 states have internal predecessors, (176), 21 states have call successors, (21), 7 states have call predecessors, (21), 8 states have return successors, (24), 23 states have call predecessors, (24), 21 states have call successors, (24) [2022-11-21 13:50:36,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 221 transitions. [2022-11-21 13:50:36,518 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 221 transitions. Word has length 11 [2022-11-21 13:50:36,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:50:36,518 INFO L495 AbstractCegarLoop]: Abstraction has 195 states and 221 transitions. [2022-11-21 13:50:36,518 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-11-21 13:50:36,519 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 221 transitions. [2022-11-21 13:50:36,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-21 13:50:36,519 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:50:36,519 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:50:36,535 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd78a4f5-ed3e-4b9f-ad67-5dcd51cf5a59/bin/uautomizer-vX5HgA9Q3a/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-11-21 13:50:36,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd78a4f5-ed3e-4b9f-ad67-5dcd51cf5a59/bin/uautomizer-vX5HgA9Q3a/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-11-21 13:50:36,733 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting nondet_treeErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [nondet_treeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-21 13:50:36,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:50:36,733 INFO L85 PathProgramCache]: Analyzing trace with hash -916126342, now seen corresponding path program 1 times [2022-11-21 13:50:36,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 13:50:36,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [436040098] [2022-11-21 13:50:36,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:50:36,734 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-11-21 13:50:36,734 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd78a4f5-ed3e-4b9f-ad67-5dcd51cf5a59/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 13:50:36,735 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd78a4f5-ed3e-4b9f-ad67-5dcd51cf5a59/bin/uautomizer-vX5HgA9Q3a/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-11-21 13:50:36,736 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd78a4f5-ed3e-4b9f-ad67-5dcd51cf5a59/bin/uautomizer-vX5HgA9Q3a/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-11-21 13:50:36,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:36,827 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-21 13:50:36,829 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:50:36,844 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-11-21 13:50:36,909 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:50:36,910 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 13:50:36,910 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 13:50:36,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [436040098] [2022-11-21 13:50:36,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [436040098] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:50:36,911 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:50:36,911 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 13:50:36,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814005342] [2022-11-21 13:50:36,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:50:36,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 13:50:36,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 13:50:36,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 13:50:36,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-21 13:50:36,915 INFO L87 Difference]: Start difference. First operand 195 states and 221 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-11-21 13:50:37,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:50:37,599 INFO L93 Difference]: Finished difference Result 201 states and 231 transitions. [2022-11-21 13:50:37,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-21 13:50:37,601 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-11-21 13:50:37,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:50:37,602 INFO L225 Difference]: With dead ends: 201 [2022-11-21 13:50:37,603 INFO L226 Difference]: Without dead ends: 201 [2022-11-21 13:50:37,603 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-11-21 13:50:37,604 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 68 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-21 13:50:37,604 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 291 Invalid, 273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-21 13:50:37,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2022-11-21 13:50:37,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 198. [2022-11-21 13:50:37,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 106 states have (on average 1.669811320754717) internal successors, (177), 166 states have internal predecessors, (177), 22 states have call successors, (22), 7 states have call predecessors, (22), 8 states have return successors, (26), 24 states have call predecessors, (26), 22 states have call successors, (26) [2022-11-21 13:50:37,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 225 transitions. [2022-11-21 13:50:37,615 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 225 transitions. Word has length 11 [2022-11-21 13:50:37,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:50:37,615 INFO L495 AbstractCegarLoop]: Abstraction has 198 states and 225 transitions. [2022-11-21 13:50:37,616 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-11-21 13:50:37,616 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 225 transitions. [2022-11-21 13:50:37,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-21 13:50:37,617 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:50:37,617 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:50:37,632 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd78a4f5-ed3e-4b9f-ad67-5dcd51cf5a59/bin/uautomizer-vX5HgA9Q3a/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-11-21 13:50:37,826 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd78a4f5-ed3e-4b9f-ad67-5dcd51cf5a59/bin/uautomizer-vX5HgA9Q3a/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-11-21 13:50:37,827 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting sizeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [nondet_treeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-21 13:50:37,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:50:37,827 INFO L85 PathProgramCache]: Analyzing trace with hash -1497511222, now seen corresponding path program 1 times [2022-11-21 13:50:37,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 13:50:37,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1841918749] [2022-11-21 13:50:37,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:50:37,828 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-11-21 13:50:37,828 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd78a4f5-ed3e-4b9f-ad67-5dcd51cf5a59/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 13:50:37,829 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd78a4f5-ed3e-4b9f-ad67-5dcd51cf5a59/bin/uautomizer-vX5HgA9Q3a/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-11-21 13:50:37,830 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd78a4f5-ed3e-4b9f-ad67-5dcd51cf5a59/bin/uautomizer-vX5HgA9Q3a/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-11-21 13:50:37,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:37,904 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-21 13:50:37,906 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:50:38,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:50:38,010 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 13:50:38,010 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 13:50:38,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1841918749] [2022-11-21 13:50:38,011 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1841918749] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:50:38,011 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:50:38,011 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-21 13:50:38,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938462994] [2022-11-21 13:50:38,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:50:38,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-21 13:50:38,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 13:50:38,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-21 13:50:38,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-21 13:50:38,013 INFO L87 Difference]: Start difference. First operand 198 states and 225 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-11-21 13:50:38,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:50:38,244 INFO L93 Difference]: Finished difference Result 306 states and 347 transitions. [2022-11-21 13:50:38,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-21 13:50:38,245 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-11-21 13:50:38,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:50:38,250 INFO L225 Difference]: With dead ends: 306 [2022-11-21 13:50:38,250 INFO L226 Difference]: Without dead ends: 306 [2022-11-21 13:50:38,251 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-11-21 13:50:38,254 INFO L413 NwaCegarLoop]: 212 mSDtfsCounter, 192 mSDsluCounter, 1008 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 1220 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 13:50:38,254 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 1220 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 13:50:38,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2022-11-21 13:50:38,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 244. [2022-11-21 13:50:38,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 145 states have (on average 1.696551724137931) internal successors, (246), 205 states have internal predecessors, (246), 28 states have call successors, (28), 8 states have call predecessors, (28), 9 states have return successors, (32), 30 states have call predecessors, (32), 28 states have call successors, (32) [2022-11-21 13:50:38,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 306 transitions. [2022-11-21 13:50:38,272 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 306 transitions. Word has length 17 [2022-11-21 13:50:38,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:50:38,272 INFO L495 AbstractCegarLoop]: Abstraction has 244 states and 306 transitions. [2022-11-21 13:50:38,273 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-11-21 13:50:38,273 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 306 transitions. [2022-11-21 13:50:38,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-21 13:50:38,274 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:50:38,275 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:50:38,287 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd78a4f5-ed3e-4b9f-ad67-5dcd51cf5a59/bin/uautomizer-vX5HgA9Q3a/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)] Forceful destruction successful, exit code 0 [2022-11-21 13:50:38,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd78a4f5-ed3e-4b9f-ad67-5dcd51cf5a59/bin/uautomizer-vX5HgA9Q3a/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-11-21 13:50:38,488 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting nondet_treeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [nondet_treeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-21 13:50:38,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:50:38,488 INFO L85 PathProgramCache]: Analyzing trace with hash -2030552348, now seen corresponding path program 1 times [2022-11-21 13:50:38,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 13:50:38,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [941767131] [2022-11-21 13:50:38,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:50:38,489 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-11-21 13:50:38,490 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd78a4f5-ed3e-4b9f-ad67-5dcd51cf5a59/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 13:50:38,491 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd78a4f5-ed3e-4b9f-ad67-5dcd51cf5a59/bin/uautomizer-vX5HgA9Q3a/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-11-21 13:50:38,498 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd78a4f5-ed3e-4b9f-ad67-5dcd51cf5a59/bin/uautomizer-vX5HgA9Q3a/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-11-21 13:50:38,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:38,738 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-21 13:50:38,741 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:50:38,747 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-11-21 13:50:38,790 WARN L859 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)) (exists ((v_ArrVal_109 (_ BitVec 1))) (= |c_#valid| (store |c_old(#valid)| nondet_tree_~n~0.base v_ArrVal_109))))) is different from true [2022-11-21 13:50:38,837 WARN L859 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32)) (v_ArrVal_109 (_ BitVec 1))) (and (= |c_#valid| (store |c_old(#valid)| nondet_tree_~n~0.base v_ArrVal_109)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-21 13:50:38,937 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-21 13:50:38,937 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-11-21 13:50:38,947 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 8 not checked. [2022-11-21 13:50:38,947 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:50:39,159 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 13:50:39,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [941767131] [2022-11-21 13:50:39,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [941767131] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 13:50:39,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1625181275] [2022-11-21 13:50:39,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:50:39,175 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-21 13:50:39,176 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd78a4f5-ed3e-4b9f-ad67-5dcd51cf5a59/bin/uautomizer-vX5HgA9Q3a/cvc4 [2022-11-21 13:50:39,227 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd78a4f5-ed3e-4b9f-ad67-5dcd51cf5a59/bin/uautomizer-vX5HgA9Q3a/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-21 13:50:39,237 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd78a4f5-ed3e-4b9f-ad67-5dcd51cf5a59/bin/uautomizer-vX5HgA9Q3a/cvc4 --incremental --print-success --lang smt (9)] Waiting until timeout for monitored process [2022-11-21 13:50:39,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:39,563 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-21 13:50:39,566 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:50:39,589 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-11-21 13:50:39,627 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-11-21 13:50:39,715 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-21 13:50:39,716 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-11-21 13:50:39,726 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 8 not checked. [2022-11-21 13:50:39,726 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:50:39,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1625181275] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 13:50:39,901 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 13:50:39,901 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 6 [2022-11-21 13:50:39,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55252502] [2022-11-21 13:50:39,902 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 13:50:39,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-21 13:50:39,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 13:50:39,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-21 13:50:39,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=15, Unknown=3, NotChecked=24, Total=56 [2022-11-21 13:50:39,911 INFO L87 Difference]: Start difference. First operand 244 states and 306 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-11-21 13:50:42,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:50:42,641 INFO L93 Difference]: Finished difference Result 251 states and 316 transitions. [2022-11-21 13:50:42,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 13:50:42,642 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-11-21 13:50:42,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:50:42,644 INFO L225 Difference]: With dead ends: 251 [2022-11-21 13:50:42,644 INFO L226 Difference]: Without dead ends: 251 [2022-11-21 13:50:42,644 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=20, Unknown=4, NotChecked=30, Total=72 [2022-11-21 13:50:42,645 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 75 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 947 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 644 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-21 13:50:42,645 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 263 Invalid, 947 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 282 Invalid, 0 Unknown, 644 Unchecked, 0.6s Time] [2022-11-21 13:50:42,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2022-11-21 13:50:42,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 248. [2022-11-21 13:50:42,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 148 states have (on average 1.6891891891891893) internal successors, (250), 208 states have internal predecessors, (250), 28 states have call successors, (28), 8 states have call predecessors, (28), 10 states have return successors, (36), 31 states have call predecessors, (36), 28 states have call successors, (36) [2022-11-21 13:50:42,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 314 transitions. [2022-11-21 13:50:42,657 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 314 transitions. Word has length 29 [2022-11-21 13:50:42,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:50:42,657 INFO L495 AbstractCegarLoop]: Abstraction has 248 states and 314 transitions. [2022-11-21 13:50:42,658 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-11-21 13:50:42,658 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 314 transitions. [2022-11-21 13:50:42,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-21 13:50:42,659 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:50:42,659 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:50:42,677 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd78a4f5-ed3e-4b9f-ad67-5dcd51cf5a59/bin/uautomizer-vX5HgA9Q3a/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-11-21 13:50:42,880 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd78a4f5-ed3e-4b9f-ad67-5dcd51cf5a59/bin/uautomizer-vX5HgA9Q3a/cvc4 --incremental --print-success --lang smt (9)] Ended with exit code 0 [2022-11-21 13:50:43,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd78a4f5-ed3e-4b9f-ad67-5dcd51cf5a59/bin/uautomizer-vX5HgA9Q3a/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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd78a4f5-ed3e-4b9f-ad67-5dcd51cf5a59/bin/uautomizer-vX5HgA9Q3a/cvc4 --incremental --print-success --lang smt [2022-11-21 13:50:43,073 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting nondet_treeErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [nondet_treeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-21 13:50:43,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:50:43,073 INFO L85 PathProgramCache]: Analyzing trace with hash 2020472179, now seen corresponding path program 1 times [2022-11-21 13:50:43,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 13:50:43,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [434148320] [2022-11-21 13:50:43,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:50:43,074 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-11-21 13:50:43,074 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd78a4f5-ed3e-4b9f-ad67-5dcd51cf5a59/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 13:50:43,075 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd78a4f5-ed3e-4b9f-ad67-5dcd51cf5a59/bin/uautomizer-vX5HgA9Q3a/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-11-21 13:50:43,076 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd78a4f5-ed3e-4b9f-ad67-5dcd51cf5a59/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-11-21 13:50:43,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:43,304 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-21 13:50:43,307 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:50:43,317 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-11-21 13:50:43,324 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-11-21 13:50:43,411 WARN L859 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_250 (_ BitVec 32))) (= (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_250) |c_#length|)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-21 13:50:43,469 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_250 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32))) (and (= (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_250) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-21 13:50:43,579 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:50:43,580 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-11-21 13:50:43,602 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-21 13:50:43,603 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-11-21 13:50:43,621 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 8 not checked. [2022-11-21 13:50:43,621 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:50:43,934 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 13:50:43,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [434148320] [2022-11-21 13:50:43,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [434148320] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 13:50:43,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [244975281] [2022-11-21 13:50:43,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:50:43,934 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-21 13:50:43,935 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd78a4f5-ed3e-4b9f-ad67-5dcd51cf5a59/bin/uautomizer-vX5HgA9Q3a/cvc4 [2022-11-21 13:50:43,939 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd78a4f5-ed3e-4b9f-ad67-5dcd51cf5a59/bin/uautomizer-vX5HgA9Q3a/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-21 13:50:43,966 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd78a4f5-ed3e-4b9f-ad67-5dcd51cf5a59/bin/uautomizer-vX5HgA9Q3a/cvc4 --incremental --print-success --lang smt (11)] Waiting until timeout for monitored process [2022-11-21 13:50:44,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:44,335 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-21 13:50:44,338 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:50:44,346 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-11-21 13:50:44,353 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-11-21 13:50:44,402 WARN L859 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_325 (_ BitVec 32))) (= (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_325) |c_#length|)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-21 13:50:44,443 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_325 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32))) (and (= (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_325) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-21 13:50:44,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:50:44,534 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-11-21 13:50:44,549 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-21 13:50:44,550 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-11-21 13:50:44,555 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 8 not checked. [2022-11-21 13:50:44,555 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:50:44,771 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [244975281] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 13:50:44,772 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 13:50:44,772 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2022-11-21 13:50:44,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514347903] [2022-11-21 13:50:44,772 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 13:50:44,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-21 13:50:44,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 13:50:44,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-21 13:50:44,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=42, Unknown=4, NotChecked=60, Total=132 [2022-11-21 13:50:44,774 INFO L87 Difference]: Start difference. First operand 248 states and 314 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-11-21 13:50:45,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:50:45,982 INFO L93 Difference]: Finished difference Result 255 states and 327 transitions. [2022-11-21 13:50:45,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-21 13:50:45,983 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-11-21 13:50:45,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:50:45,986 INFO L225 Difference]: With dead ends: 255 [2022-11-21 13:50:45,986 INFO L226 Difference]: Without dead ends: 255 [2022-11-21 13:50:45,986 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 61 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=32, Invalid=52, Unknown=4, NotChecked=68, Total=156 [2022-11-21 13:50:45,987 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 75 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 499 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 1409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 499 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 886 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-21 13:50:45,987 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 396 Invalid, 1409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 499 Invalid, 0 Unknown, 886 Unchecked, 1.1s Time] [2022-11-21 13:50:45,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2022-11-21 13:50:45,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 251. [2022-11-21 13:50:45,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 150 states have (on average 1.6733333333333333) internal successors, (251), 210 states have internal predecessors, (251), 29 states have call successors, (29), 8 states have call predecessors, (29), 10 states have return successors, (39), 32 states have call predecessors, (39), 29 states have call successors, (39) [2022-11-21 13:50:45,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 319 transitions. [2022-11-21 13:50:45,999 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 319 transitions. Word has length 35 [2022-11-21 13:50:46,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:50:46,000 INFO L495 AbstractCegarLoop]: Abstraction has 251 states and 319 transitions. [2022-11-21 13:50:46,000 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-11-21 13:50:46,001 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 319 transitions. [2022-11-21 13:50:46,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-21 13:50:46,002 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:50:46,002 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-11-21 13:50:46,022 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd78a4f5-ed3e-4b9f-ad67-5dcd51cf5a59/bin/uautomizer-vX5HgA9Q3a/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)] Forceful destruction successful, exit code 0 [2022-11-21 13:50:46,219 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd78a4f5-ed3e-4b9f-ad67-5dcd51cf5a59/bin/uautomizer-vX5HgA9Q3a/cvc4 --incremental --print-success --lang smt (11)] Forceful destruction successful, exit code 0 [2022-11-21 13:50:46,416 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd78a4f5-ed3e-4b9f-ad67-5dcd51cf5a59/bin/uautomizer-vX5HgA9Q3a/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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd78a4f5-ed3e-4b9f-ad67-5dcd51cf5a59/bin/uautomizer-vX5HgA9Q3a/cvc4 --incremental --print-success --lang smt [2022-11-21 13:50:46,417 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting minErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [nondet_treeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-21 13:50:46,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:50:46,417 INFO L85 PathProgramCache]: Analyzing trace with hash -599064084, now seen corresponding path program 1 times [2022-11-21 13:50:46,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 13:50:46,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [963338704] [2022-11-21 13:50:46,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:50:46,418 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-11-21 13:50:46,418 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd78a4f5-ed3e-4b9f-ad67-5dcd51cf5a59/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 13:50:46,419 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd78a4f5-ed3e-4b9f-ad67-5dcd51cf5a59/bin/uautomizer-vX5HgA9Q3a/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-11-21 13:50:46,420 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd78a4f5-ed3e-4b9f-ad67-5dcd51cf5a59/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-11-21 13:50:46,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:46,556 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-21 13:50:46,558 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:50:46,562 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-11-21 13:50:46,683 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-21 13:50:46,683 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:50:46,912 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-21 13:50:46,912 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 13:50:46,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [963338704] [2022-11-21 13:50:46,912 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [963338704] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 13:50:46,913 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 13:50:46,913 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2022-11-21 13:50:46,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225686362] [2022-11-21 13:50:46,913 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 13:50:46,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-21 13:50:46,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 13:50:46,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-21 13:50:46,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-11-21 13:50:46,916 INFO L87 Difference]: Start difference. First operand 251 states and 319 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-11-21 13:50:49,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:50:49,063 INFO L93 Difference]: Finished difference Result 288 states and 341 transitions. [2022-11-21 13:50:49,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-21 13:50:49,064 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-11-21 13:50:49,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:50:49,066 INFO L225 Difference]: With dead ends: 288 [2022-11-21 13:50:49,066 INFO L226 Difference]: Without dead ends: 288 [2022-11-21 13:50:49,066 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2022-11-21 13:50:49,067 INFO L413 NwaCegarLoop]: 165 mSDtfsCounter, 230 mSDsluCounter, 733 mSDsCounter, 0 mSdLazyCounter, 1260 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 898 SdHoareTripleChecker+Invalid, 1312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 1260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-11-21 13:50:49,067 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 898 Invalid, 1312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 1260 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-11-21 13:50:49,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2022-11-21 13:50:49,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 260. [2022-11-21 13:50:49,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 160 states have (on average 1.6375) internal successors, (262), 217 states have internal predecessors, (262), 31 states have call successors, (31), 9 states have call predecessors, (31), 11 states have return successors, (41), 33 states have call predecessors, (41), 31 states have call successors, (41) [2022-11-21 13:50:49,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 334 transitions. [2022-11-21 13:50:49,089 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 334 transitions. Word has length 25 [2022-11-21 13:50:49,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:50:49,090 INFO L495 AbstractCegarLoop]: Abstraction has 260 states and 334 transitions. [2022-11-21 13:50:49,090 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-11-21 13:50:49,091 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 334 transitions. [2022-11-21 13:50:49,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-21 13:50:49,097 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:50:49,098 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-11-21 13:50:49,120 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd78a4f5-ed3e-4b9f-ad67-5dcd51cf5a59/bin/uautomizer-vX5HgA9Q3a/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)] Forceful destruction successful, exit code 0 [2022-11-21 13:50:49,314 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd78a4f5-ed3e-4b9f-ad67-5dcd51cf5a59/bin/uautomizer-vX5HgA9Q3a/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-11-21 13:50:49,315 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting minErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [nondet_treeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-21 13:50:49,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:50:49,315 INFO L85 PathProgramCache]: Analyzing trace with hash -599064083, now seen corresponding path program 1 times [2022-11-21 13:50:49,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 13:50:49,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [269404472] [2022-11-21 13:50:49,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:50:49,316 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-11-21 13:50:49,316 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd78a4f5-ed3e-4b9f-ad67-5dcd51cf5a59/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 13:50:49,317 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd78a4f5-ed3e-4b9f-ad67-5dcd51cf5a59/bin/uautomizer-vX5HgA9Q3a/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-11-21 13:50:49,318 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd78a4f5-ed3e-4b9f-ad67-5dcd51cf5a59/bin/uautomizer-vX5HgA9Q3a/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-11-21 13:50:49,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:49,457 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 20 conjunts are in the unsatisfiable core [2022-11-21 13:50:49,459 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:50:49,469 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-11-21 13:50:49,679 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-21 13:50:49,680 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:50:50,914 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-21 13:50:50,914 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 13:50:50,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [269404472] [2022-11-21 13:50:50,914 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [269404472] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 13:50:50,915 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 13:50:50,915 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2022-11-21 13:50:50,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360320048] [2022-11-21 13:50:50,915 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 13:50:50,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-21 13:50:50,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 13:50:50,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-21 13:50:50,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2022-11-21 13:50:50,917 INFO L87 Difference]: Start difference. First operand 260 states and 334 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-11-21 13:50:55,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:50:55,964 INFO L93 Difference]: Finished difference Result 285 states and 370 transitions. [2022-11-21 13:50:55,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-21 13:50:55,965 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-11-21 13:50:55,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:50:55,969 INFO L225 Difference]: With dead ends: 285 [2022-11-21 13:50:55,969 INFO L226 Difference]: Without dead ends: 285 [2022-11-21 13:50:55,970 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=74, Invalid=388, Unknown=0, NotChecked=0, Total=462 [2022-11-21 13:50:55,970 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 196 mSDsluCounter, 744 mSDsCounter, 0 mSdLazyCounter, 1248 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 884 SdHoareTripleChecker+Invalid, 1317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 1248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2022-11-21 13:50:55,972 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 884 Invalid, 1317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 1248 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2022-11-21 13:50:55,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2022-11-21 13:50:55,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 276. [2022-11-21 13:50:55,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 172 states have (on average 1.6104651162790697) internal successors, (277), 229 states have internal predecessors, (277), 34 states have call successors, (34), 10 states have call predecessors, (34), 12 states have return successors, (44), 36 states have call predecessors, (44), 34 states have call successors, (44) [2022-11-21 13:50:55,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 355 transitions. [2022-11-21 13:50:55,991 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 355 transitions. Word has length 25 [2022-11-21 13:50:55,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:50:55,992 INFO L495 AbstractCegarLoop]: Abstraction has 276 states and 355 transitions. [2022-11-21 13:50:55,992 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-11-21 13:50:55,992 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 355 transitions. [2022-11-21 13:50:55,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-21 13:50:55,997 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:50:55,997 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:50:56,015 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd78a4f5-ed3e-4b9f-ad67-5dcd51cf5a59/bin/uautomizer-vX5HgA9Q3a/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)] Forceful destruction successful, exit code 0 [2022-11-21 13:50:56,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd78a4f5-ed3e-4b9f-ad67-5dcd51cf5a59/bin/uautomizer-vX5HgA9Q3a/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-11-21 13:50:56,210 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting tree_inorderErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [nondet_treeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-21 13:50:56,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:50:56,211 INFO L85 PathProgramCache]: Analyzing trace with hash -1805510171, now seen corresponding path program 1 times [2022-11-21 13:50:56,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 13:50:56,211 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [208520887] [2022-11-21 13:50:56,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:50:56,211 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-11-21 13:50:56,212 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd78a4f5-ed3e-4b9f-ad67-5dcd51cf5a59/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 13:50:56,214 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd78a4f5-ed3e-4b9f-ad67-5dcd51cf5a59/bin/uautomizer-vX5HgA9Q3a/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-11-21 13:50:56,217 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd78a4f5-ed3e-4b9f-ad67-5dcd51cf5a59/bin/uautomizer-vX5HgA9Q3a/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-11-21 13:50:56,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:56,307 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-21 13:50:56,309 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:50:56,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:50:56,342 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 13:50:56,342 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 13:50:56,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [208520887] [2022-11-21 13:50:56,342 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [208520887] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:50:56,342 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:50:56,342 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-21 13:50:56,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800599497] [2022-11-21 13:50:56,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:50:56,343 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 13:50:56,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 13:50:56,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 13:50:56,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-21 13:50:56,344 INFO L87 Difference]: Start difference. First operand 276 states and 355 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-21 13:50:56,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:50:56,380 INFO L93 Difference]: Finished difference Result 242 states and 287 transitions. [2022-11-21 13:50:56,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 13:50:56,380 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 30 [2022-11-21 13:50:56,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:50:56,382 INFO L225 Difference]: With dead ends: 242 [2022-11-21 13:50:56,382 INFO L226 Difference]: Without dead ends: 226 [2022-11-21 13:50:56,383 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-21 13:50:56,383 INFO L413 NwaCegarLoop]: 202 mSDtfsCounter, 0 mSDsluCounter, 598 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 800 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-21 13:50:56,384 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 800 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 13:50:56,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2022-11-21 13:50:56,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 226. [2022-11-21 13:50:56,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 130 states have (on average 1.5769230769230769) internal successors, (205), 188 states have internal predecessors, (205), 27 states have call successors, (27), 8 states have call predecessors, (27), 11 states have return successors, (39), 29 states have call predecessors, (39), 27 states have call successors, (39) [2022-11-21 13:50:56,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 271 transitions. [2022-11-21 13:50:56,393 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 271 transitions. Word has length 30 [2022-11-21 13:50:56,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:50:56,394 INFO L495 AbstractCegarLoop]: Abstraction has 226 states and 271 transitions. [2022-11-21 13:50:56,394 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-21 13:50:56,394 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 271 transitions. [2022-11-21 13:50:56,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-21 13:50:56,395 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:50:56,395 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-11-21 13:50:56,412 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd78a4f5-ed3e-4b9f-ad67-5dcd51cf5a59/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-11-21 13:50:56,612 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd78a4f5-ed3e-4b9f-ad67-5dcd51cf5a59/bin/uautomizer-vX5HgA9Q3a/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-11-21 13:50:56,612 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting sizeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [nondet_treeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-21 13:50:56,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:50:56,613 INFO L85 PathProgramCache]: Analyzing trace with hash -1626172482, now seen corresponding path program 1 times [2022-11-21 13:50:56,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 13:50:56,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1327408349] [2022-11-21 13:50:56,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:50:56,613 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-11-21 13:50:56,613 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd78a4f5-ed3e-4b9f-ad67-5dcd51cf5a59/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 13:50:56,614 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd78a4f5-ed3e-4b9f-ad67-5dcd51cf5a59/bin/uautomizer-vX5HgA9Q3a/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-11-21 13:50:56,616 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd78a4f5-ed3e-4b9f-ad67-5dcd51cf5a59/bin/uautomizer-vX5HgA9Q3a/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-11-21 13:50:56,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:56,726 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-21 13:50:56,727 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:50:56,813 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-21 13:50:56,814 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 13:50:56,814 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 13:50:56,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1327408349] [2022-11-21 13:50:56,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1327408349] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:50:56,815 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:50:56,815 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-21 13:50:56,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697470753] [2022-11-21 13:50:56,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:50:56,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-21 13:50:56,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 13:50:56,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-21 13:50:56,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-21 13:50:56,817 INFO L87 Difference]: Start difference. First operand 226 states and 271 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-11-21 13:50:57,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:50:57,154 INFO L93 Difference]: Finished difference Result 232 states and 280 transitions. [2022-11-21 13:50:57,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-21 13:50:57,154 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-11-21 13:50:57,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:50:57,156 INFO L225 Difference]: With dead ends: 232 [2022-11-21 13:50:57,156 INFO L226 Difference]: Without dead ends: 228 [2022-11-21 13:50:57,156 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-11-21 13:50:57,157 INFO L413 NwaCegarLoop]: 186 mSDtfsCounter, 209 mSDsluCounter, 850 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 1036 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-21 13:50:57,157 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 1036 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-21 13:50:57,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2022-11-21 13:50:57,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 226. [2022-11-21 13:50:57,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 130 states have (on average 1.5615384615384615) internal successors, (203), 188 states have internal predecessors, (203), 27 states have call successors, (27), 8 states have call predecessors, (27), 11 states have return successors, (39), 29 states have call predecessors, (39), 27 states have call successors, (39) [2022-11-21 13:50:57,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 269 transitions. [2022-11-21 13:50:57,165 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 269 transitions. Word has length 31 [2022-11-21 13:50:57,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:50:57,166 INFO L495 AbstractCegarLoop]: Abstraction has 226 states and 269 transitions. [2022-11-21 13:50:57,166 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-11-21 13:50:57,166 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 269 transitions. [2022-11-21 13:50:57,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-21 13:50:57,167 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:50:57,167 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-11-21 13:50:57,187 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd78a4f5-ed3e-4b9f-ad67-5dcd51cf5a59/bin/uautomizer-vX5HgA9Q3a/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-11-21 13:50:57,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd78a4f5-ed3e-4b9f-ad67-5dcd51cf5a59/bin/uautomizer-vX5HgA9Q3a/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-11-21 13:50:57,379 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting minErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [nondet_treeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-21 13:50:57,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:50:57,379 INFO L85 PathProgramCache]: Analyzing trace with hash -575590880, now seen corresponding path program 1 times [2022-11-21 13:50:57,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 13:50:57,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2098825598] [2022-11-21 13:50:57,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:50:57,380 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-11-21 13:50:57,380 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd78a4f5-ed3e-4b9f-ad67-5dcd51cf5a59/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 13:50:57,381 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd78a4f5-ed3e-4b9f-ad67-5dcd51cf5a59/bin/uautomizer-vX5HgA9Q3a/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-11-21 13:50:57,382 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd78a4f5-ed3e-4b9f-ad67-5dcd51cf5a59/bin/uautomizer-vX5HgA9Q3a/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-11-21 13:50:57,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:57,572 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 37 conjunts are in the unsatisfiable core [2022-11-21 13:50:57,575 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:50:57,616 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-11-21 13:50:57,625 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-11-21 13:50:57,717 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-11-21 13:50:57,728 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-11-21 13:50:58,020 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-11-21 13:50:58,026 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-11-21 13:50:58,142 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-21 13:50:58,142 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:50:59,262 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-21 13:50:59,262 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 13:50:59,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2098825598] [2022-11-21 13:50:59,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2098825598] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 13:50:59,263 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 13:50:59,263 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2022-11-21 13:50:59,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500183430] [2022-11-21 13:50:59,263 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 13:50:59,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-21 13:50:59,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 13:50:59,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-21 13:50:59,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2022-11-21 13:50:59,264 INFO L87 Difference]: Start difference. First operand 226 states and 269 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-11-21 13:51:02,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:51:02,330 INFO L93 Difference]: Finished difference Result 303 states and 359 transitions. [2022-11-21 13:51:02,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-21 13:51:02,331 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-11-21 13:51:02,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:51:02,333 INFO L225 Difference]: With dead ends: 303 [2022-11-21 13:51:02,333 INFO L226 Difference]: Without dead ends: 303 [2022-11-21 13:51:02,333 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=84, Invalid=516, Unknown=0, NotChecked=0, Total=600 [2022-11-21 13:51:02,334 INFO L413 NwaCegarLoop]: 147 mSDtfsCounter, 286 mSDsluCounter, 1487 mSDsCounter, 0 mSdLazyCounter, 1087 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 1634 SdHoareTripleChecker+Invalid, 1169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 1087 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-11-21 13:51:02,334 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [292 Valid, 1634 Invalid, 1169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 1087 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-11-21 13:51:02,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2022-11-21 13:51:02,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 230. [2022-11-21 13:51:02,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 133 states have (on average 1.5488721804511278) internal successors, (206), 191 states have internal predecessors, (206), 27 states have call successors, (27), 9 states have call predecessors, (27), 12 states have return successors, (39), 29 states have call predecessors, (39), 27 states have call successors, (39) [2022-11-21 13:51:02,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 272 transitions. [2022-11-21 13:51:02,344 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 272 transitions. Word has length 31 [2022-11-21 13:51:02,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:51:02,345 INFO L495 AbstractCegarLoop]: Abstraction has 230 states and 272 transitions. [2022-11-21 13:51:02,345 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-11-21 13:51:02,345 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 272 transitions. [2022-11-21 13:51:02,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-11-21 13:51:02,346 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:51:02,346 INFO L195 NwaCegarLoop]: trace histogram [7, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1] [2022-11-21 13:51:02,360 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd78a4f5-ed3e-4b9f-ad67-5dcd51cf5a59/bin/uautomizer-vX5HgA9Q3a/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)] Forceful destruction successful, exit code 0 [2022-11-21 13:51:02,560 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd78a4f5-ed3e-4b9f-ad67-5dcd51cf5a59/bin/uautomizer-vX5HgA9Q3a/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-11-21 13:51:02,560 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting nondet_treeErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [nondet_treeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-21 13:51:02,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:51:02,560 INFO L85 PathProgramCache]: Analyzing trace with hash -1701152456, now seen corresponding path program 1 times [2022-11-21 13:51:02,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 13:51:02,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1753556439] [2022-11-21 13:51:02,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:51:02,561 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-11-21 13:51:02,562 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd78a4f5-ed3e-4b9f-ad67-5dcd51cf5a59/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 13:51:02,563 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd78a4f5-ed3e-4b9f-ad67-5dcd51cf5a59/bin/uautomizer-vX5HgA9Q3a/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-11-21 13:51:02,568 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd78a4f5-ed3e-4b9f-ad67-5dcd51cf5a59/bin/uautomizer-vX5HgA9Q3a/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-11-21 13:51:02,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:51:02,917 INFO L263 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 26 conjunts are in the unsatisfiable core [2022-11-21 13:51:02,920 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:51:02,937 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-11-21 13:51:02,943 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-11-21 13:51:03,067 WARN L859 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_582 (_ BitVec 32))) (= (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_582) |c_#length|)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-21 13:51:03,113 WARN L859 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32)) (v_ArrVal_582 (_ BitVec 32))) (and (= (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_582) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-21 13:51:03,144 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-11-21 13:51:03,211 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_582 (_ BitVec 32))) (and (= |c_#length| (store (store |c_old(#length)| v_nondet_tree_~n~0.base_39 v_ArrVal_582) nondet_tree_~n~0.base (_ bv12 32))) (= (select |c_old(#valid)| v_nondet_tree_~n~0.base_39) (_ bv0 1)))) is different from true [2022-11-21 13:51:03,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:51:03,305 INFO L321 Elim1Store]: treesize reduction 24, result has 38.5 percent of original size [2022-11-21 13:51:03,309 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-11-21 13:51:03,330 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-21 13:51:03,330 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-11-21 13:51:03,367 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 48 proven. 14 refuted. 0 times theorem prover too weak. 16 trivial. 40 not checked. [2022-11-21 13:51:03,367 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:51:05,713 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 13:51:05,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1753556439] [2022-11-21 13:51:05,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1753556439] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 13:51:05,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [601701884] [2022-11-21 13:51:05,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:51:05,714 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-21 13:51:05,714 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd78a4f5-ed3e-4b9f-ad67-5dcd51cf5a59/bin/uautomizer-vX5HgA9Q3a/cvc4 [2022-11-21 13:51:05,715 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd78a4f5-ed3e-4b9f-ad67-5dcd51cf5a59/bin/uautomizer-vX5HgA9Q3a/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-21 13:51:05,717 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd78a4f5-ed3e-4b9f-ad67-5dcd51cf5a59/bin/uautomizer-vX5HgA9Q3a/cvc4 --incremental --print-success --lang smt (18)] Waiting until timeout for monitored process [2022-11-21 13:51:06,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:51:06,154 INFO L263 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 26 conjunts are in the unsatisfiable core [2022-11-21 13:51:06,157 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:51:06,177 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-11-21 13:51:06,185 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-11-21 13:51:06,293 WARN L859 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_694 (_ BitVec 32))) (= (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_694) |c_#length|)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-21 13:51:06,342 WARN L859 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32)) (v_ArrVal_694 (_ BitVec 32))) (and (= (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_694) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-21 13:51:06,430 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_nondet_tree_~n~0.base_50 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32)) (v_ArrVal_694 (_ BitVec 32))) (and (= (select |c_old(#valid)| v_nondet_tree_~n~0.base_50) (_ bv0 1)) (= (store (store |c_old(#length)| v_nondet_tree_~n~0.base_50 v_ArrVal_694) nondet_tree_~n~0.base (_ bv12 32)) |c_#length|))) is different from true [2022-11-21 13:51:06,474 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:51:06,513 INFO L321 Elim1Store]: treesize reduction 24, result has 38.5 percent of original size [2022-11-21 13:51:06,513 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-11-21 13:51:06,534 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-21 13:51:06,534 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-11-21 13:51:06,555 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 48 proven. 14 refuted. 0 times theorem prover too weak. 16 trivial. 40 not checked. [2022-11-21 13:51:06,556 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:51:08,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [601701884] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 13:51:08,880 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 13:51:08,880 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2022-11-21 13:51:08,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748082011] [2022-11-21 13:51:08,881 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 13:51:08,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-21 13:51:08,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 13:51:08,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-21 13:51:08,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=44, Unknown=8, NotChecked=126, Total=210 [2022-11-21 13:51:08,882 INFO L87 Difference]: Start difference. First operand 230 states and 272 transitions. Second operand has 13 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 12 states have internal predecessors, (43), 7 states have call successors, (11), 3 states have call predecessors, (11), 6 states have return successors, (10), 8 states have call predecessors, (10), 7 states have call successors, (10) [2022-11-21 13:51:18,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:51:18,329 INFO L93 Difference]: Finished difference Result 243 states and 298 transitions. [2022-11-21 13:51:18,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-21 13:51:18,330 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 12 states have internal predecessors, (43), 7 states have call successors, (11), 3 states have call predecessors, (11), 6 states have return successors, (10), 8 states have call predecessors, (10), 7 states have call successors, (10) Word has length 55 [2022-11-21 13:51:18,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:51:18,332 INFO L225 Difference]: With dead ends: 243 [2022-11-21 13:51:18,332 INFO L226 Difference]: Without dead ends: 243 [2022-11-21 13:51:18,333 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 99 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 12.7s TimeCoverageRelationStatistics Valid=56, Invalid=90, Unknown=14, NotChecked=182, Total=342 [2022-11-21 13:51:18,333 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 128 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 2081 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1606 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-21 13:51:18,334 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 349 Invalid, 2081 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 424 Invalid, 0 Unknown, 1606 Unchecked, 1.1s Time] [2022-11-21 13:51:18,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2022-11-21 13:51:18,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 234. [2022-11-21 13:51:18,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 136 states have (on average 1.536764705882353) internal successors, (209), 194 states have internal predecessors, (209), 27 states have call successors, (27), 9 states have call predecessors, (27), 13 states have return successors, (44), 30 states have call predecessors, (44), 27 states have call successors, (44) [2022-11-21 13:51:18,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 280 transitions. [2022-11-21 13:51:18,343 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 280 transitions. Word has length 55 [2022-11-21 13:51:18,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:51:18,343 INFO L495 AbstractCegarLoop]: Abstraction has 234 states and 280 transitions. [2022-11-21 13:51:18,344 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 12 states have internal predecessors, (43), 7 states have call successors, (11), 3 states have call predecessors, (11), 6 states have return successors, (10), 8 states have call predecessors, (10), 7 states have call successors, (10) [2022-11-21 13:51:18,344 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 280 transitions. [2022-11-21 13:51:18,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-11-21 13:51:18,345 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:51:18,345 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2022-11-21 13:51:18,350 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd78a4f5-ed3e-4b9f-ad67-5dcd51cf5a59/bin/uautomizer-vX5HgA9Q3a/cvc4 --incremental --print-success --lang smt (18)] Forceful destruction successful, exit code 0 [2022-11-21 13:51:18,560 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd78a4f5-ed3e-4b9f-ad67-5dcd51cf5a59/bin/uautomizer-vX5HgA9Q3a/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)] Forceful destruction successful, exit code 0 [2022-11-21 13:51:18,750 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd78a4f5-ed3e-4b9f-ad67-5dcd51cf5a59/bin/uautomizer-vX5HgA9Q3a/cvc4 --incremental --print-success --lang smt,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd78a4f5-ed3e-4b9f-ad67-5dcd51cf5a59/bin/uautomizer-vX5HgA9Q3a/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-11-21 13:51:18,750 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting nondet_treeErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [nondet_treeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-21 13:51:18,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:51:18,751 INFO L85 PathProgramCache]: Analyzing trace with hash -1441349863, now seen corresponding path program 2 times [2022-11-21 13:51:18,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 13:51:18,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [339101587] [2022-11-21 13:51:18,751 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-21 13:51:18,751 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-11-21 13:51:18,751 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd78a4f5-ed3e-4b9f-ad67-5dcd51cf5a59/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 13:51:18,753 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd78a4f5-ed3e-4b9f-ad67-5dcd51cf5a59/bin/uautomizer-vX5HgA9Q3a/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-11-21 13:51:18,755 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd78a4f5-ed3e-4b9f-ad67-5dcd51cf5a59/bin/uautomizer-vX5HgA9Q3a/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-11-21 13:51:19,100 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-21 13:51:19,101 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 13:51:19,115 INFO L263 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 22 conjunts are in the unsatisfiable core [2022-11-21 13:51:19,118 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:51:19,126 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-11-21 13:51:19,134 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-11-21 13:51:19,213 WARN L859 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_794 (_ BitVec 32))) (= (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_794) |c_#length|)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-21 13:51:19,256 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-11-21 13:51:19,325 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_nondet_tree_~n~0.base_61 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32)) (v_ArrVal_794 (_ BitVec 32))) (and (= (select |c_old(#valid)| v_nondet_tree_~n~0.base_61) (_ bv0 1)) (= (store (store |c_old(#length)| v_nondet_tree_~n~0.base_61 v_ArrVal_794) nondet_tree_~n~0.base (_ bv12 32)) |c_#length|))) is different from true [2022-11-21 13:51:19,440 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:51:19,480 INFO L321 Elim1Store]: treesize reduction 24, result has 38.5 percent of original size [2022-11-21 13:51:19,481 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-11-21 13:51:19,502 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-21 13:51:19,502 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-11-21 13:51:19,544 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 19 proven. 4 refuted. 0 times theorem prover too weak. 13 trivial. 30 not checked. [2022-11-21 13:51:19,544 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:51:19,975 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 13:51:19,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [339101587] [2022-11-21 13:51:19,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [339101587] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 13:51:19,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1567446113] [2022-11-21 13:51:19,976 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-21 13:51:19,976 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-21 13:51:19,976 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd78a4f5-ed3e-4b9f-ad67-5dcd51cf5a59/bin/uautomizer-vX5HgA9Q3a/cvc4 [2022-11-21 13:51:19,977 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd78a4f5-ed3e-4b9f-ad67-5dcd51cf5a59/bin/uautomizer-vX5HgA9Q3a/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-21 13:51:19,981 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd78a4f5-ed3e-4b9f-ad67-5dcd51cf5a59/bin/uautomizer-vX5HgA9Q3a/cvc4 --incremental --print-success --lang smt (20)] Waiting until timeout for monitored process [2022-11-21 13:51:20,389 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-21 13:51:20,389 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 13:51:20,395 INFO L263 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 22 conjunts are in the unsatisfiable core [2022-11-21 13:51:20,398 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:51:20,405 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-11-21 13:51:20,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-11-21 13:51:20,475 WARN L859 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_894 (_ BitVec 32))) (= (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_894) |c_#length|)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-21 13:51:20,574 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_nondet_tree_~n~0.base_72 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32)) (v_ArrVal_894 (_ BitVec 32))) (and (= |c_#length| (store (store |c_old(#length)| v_nondet_tree_~n~0.base_72 v_ArrVal_894) nondet_tree_~n~0.base (_ bv12 32))) (= (select |c_old(#valid)| v_nondet_tree_~n~0.base_72) (_ bv0 1)))) is different from true [2022-11-21 13:51:20,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:51:20,717 INFO L321 Elim1Store]: treesize reduction 24, result has 38.5 percent of original size [2022-11-21 13:51:20,717 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-11-21 13:51:20,737 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-21 13:51:20,737 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-11-21 13:51:20,765 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 19 proven. 4 refuted. 0 times theorem prover too weak. 13 trivial. 30 not checked. [2022-11-21 13:51:20,766 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:51:24,725 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1567446113] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 13:51:24,725 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 13:51:24,725 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2022-11-21 13:51:24,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466903661] [2022-11-21 13:51:24,725 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 13:51:24,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-21 13:51:24,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 13:51:24,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-21 13:51:24,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=43, Unknown=5, NotChecked=80, Total=156 [2022-11-21 13:51:24,727 INFO L87 Difference]: Start difference. First operand 234 states and 280 transitions. Second operand has 11 states, 10 states have (on average 3.5) internal successors, (35), 9 states have internal predecessors, (35), 7 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 4 states have call predecessors, (8), 6 states have call successors, (8) [2022-11-21 13:51:32,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:51:32,437 INFO L93 Difference]: Finished difference Result 250 states and 316 transitions. [2022-11-21 13:51:32,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-21 13:51:32,438 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.5) internal successors, (35), 9 states have internal predecessors, (35), 7 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 4 states have call predecessors, (8), 6 states have call successors, (8) Word has length 43 [2022-11-21 13:51:32,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:51:32,439 INFO L225 Difference]: With dead ends: 250 [2022-11-21 13:51:32,440 INFO L226 Difference]: Without dead ends: 250 [2022-11-21 13:51:32,440 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 75 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=53, Invalid=89, Unknown=10, NotChecked=120, Total=272 [2022-11-21 13:51:32,440 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 129 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 443 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 1660 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1161 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-21 13:51:32,441 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 353 Invalid, 1660 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 443 Invalid, 0 Unknown, 1161 Unchecked, 1.3s Time] [2022-11-21 13:51:32,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2022-11-21 13:51:32,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 244. [2022-11-21 13:51:32,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 143 states have (on average 1.5104895104895104) internal successors, (216), 201 states have internal predecessors, (216), 29 states have call successors, (29), 9 states have call predecessors, (29), 14 states have return successors, (59), 33 states have call predecessors, (59), 29 states have call successors, (59) [2022-11-21 13:51:32,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 304 transitions. [2022-11-21 13:51:32,452 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 304 transitions. Word has length 43 [2022-11-21 13:51:32,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:51:32,453 INFO L495 AbstractCegarLoop]: Abstraction has 244 states and 304 transitions. [2022-11-21 13:51:32,453 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.5) internal successors, (35), 9 states have internal predecessors, (35), 7 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 4 states have call predecessors, (8), 6 states have call successors, (8) [2022-11-21 13:51:32,453 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 304 transitions. [2022-11-21 13:51:32,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-21 13:51:32,454 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:51:32,455 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-11-21 13:51:32,466 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd78a4f5-ed3e-4b9f-ad67-5dcd51cf5a59/bin/uautomizer-vX5HgA9Q3a/cvc4 --incremental --print-success --lang smt (20)] Forceful destruction successful, exit code 0 [2022-11-21 13:51:32,671 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd78a4f5-ed3e-4b9f-ad67-5dcd51cf5a59/bin/uautomizer-vX5HgA9Q3a/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)] Forceful destruction successful, exit code 0 [2022-11-21 13:51:32,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd78a4f5-ed3e-4b9f-ad67-5dcd51cf5a59/bin/uautomizer-vX5HgA9Q3a/cvc4 --incremental --print-success --lang smt,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd78a4f5-ed3e-4b9f-ad67-5dcd51cf5a59/bin/uautomizer-vX5HgA9Q3a/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-11-21 13:51:32,860 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting minErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [nondet_treeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-21 13:51:32,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:51:32,860 INFO L85 PathProgramCache]: Analyzing trace with hash 1591520033, now seen corresponding path program 2 times [2022-11-21 13:51:32,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 13:51:32,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [213431799] [2022-11-21 13:51:32,861 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-21 13:51:32,861 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-11-21 13:51:32,861 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd78a4f5-ed3e-4b9f-ad67-5dcd51cf5a59/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 13:51:32,862 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd78a4f5-ed3e-4b9f-ad67-5dcd51cf5a59/bin/uautomizer-vX5HgA9Q3a/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-11-21 13:51:32,867 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd78a4f5-ed3e-4b9f-ad67-5dcd51cf5a59/bin/uautomizer-vX5HgA9Q3a/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)] Waiting until timeout for monitored process [2022-11-21 13:51:33,034 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-21 13:51:33,034 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 13:51:33,041 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 15 conjunts are in the unsatisfiable core [2022-11-21 13:51:33,042 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:51:33,273 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-11-21 13:51:33,273 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:51:34,037 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-11-21 13:51:34,333 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-11-21 13:51:34,333 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 13:51:34,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [213431799] [2022-11-21 13:51:34,333 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [213431799] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 13:51:34,333 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 13:51:34,333 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2022-11-21 13:51:34,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627522341] [2022-11-21 13:51:34,334 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 13:51:34,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-21 13:51:34,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 13:51:34,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-21 13:51:34,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2022-11-21 13:51:34,335 INFO L87 Difference]: Start difference. First operand 244 states and 304 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-11-21 13:51:37,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:51:37,791 INFO L93 Difference]: Finished difference Result 246 states and 307 transitions. [2022-11-21 13:51:37,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-21 13:51:37,792 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-11-21 13:51:37,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:51:37,793 INFO L225 Difference]: With dead ends: 246 [2022-11-21 13:51:37,794 INFO L226 Difference]: Without dead ends: 246 [2022-11-21 13:51:37,794 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=70, Invalid=350, Unknown=0, NotChecked=0, Total=420 [2022-11-21 13:51:37,795 INFO L413 NwaCegarLoop]: 194 mSDtfsCounter, 55 mSDsluCounter, 1383 mSDsCounter, 0 mSdLazyCounter, 708 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 1577 SdHoareTripleChecker+Invalid, 725 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 708 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-11-21 13:51:37,795 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 1577 Invalid, 725 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 708 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-11-21 13:51:37,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2022-11-21 13:51:37,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 244. [2022-11-21 13:51:37,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 143 states have (on average 1.4895104895104896) internal successors, (213), 201 states have internal predecessors, (213), 29 states have call successors, (29), 9 states have call predecessors, (29), 14 states have return successors, (59), 33 states have call predecessors, (59), 29 states have call successors, (59) [2022-11-21 13:51:37,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 301 transitions. [2022-11-21 13:51:37,813 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 301 transitions. Word has length 39 [2022-11-21 13:51:37,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:51:37,813 INFO L495 AbstractCegarLoop]: Abstraction has 244 states and 301 transitions. [2022-11-21 13:51:37,813 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-11-21 13:51:37,814 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 301 transitions. [2022-11-21 13:51:37,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-11-21 13:51:37,815 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:51:37,815 INFO L195 NwaCegarLoop]: trace histogram [9, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 1, 1, 1, 1] [2022-11-21 13:51:37,828 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd78a4f5-ed3e-4b9f-ad67-5dcd51cf5a59/bin/uautomizer-vX5HgA9Q3a/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)] Forceful destruction successful, exit code 0 [2022-11-21 13:51:38,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd78a4f5-ed3e-4b9f-ad67-5dcd51cf5a59/bin/uautomizer-vX5HgA9Q3a/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-11-21 13:51:38,028 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting nondet_treeErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [nondet_treeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-21 13:51:38,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:51:38,028 INFO L85 PathProgramCache]: Analyzing trace with hash -216572884, now seen corresponding path program 2 times [2022-11-21 13:51:38,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 13:51:38,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2094706304] [2022-11-21 13:51:38,029 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-21 13:51:38,029 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-11-21 13:51:38,029 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd78a4f5-ed3e-4b9f-ad67-5dcd51cf5a59/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 13:51:38,030 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd78a4f5-ed3e-4b9f-ad67-5dcd51cf5a59/bin/uautomizer-vX5HgA9Q3a/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-11-21 13:51:38,031 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd78a4f5-ed3e-4b9f-ad67-5dcd51cf5a59/bin/uautomizer-vX5HgA9Q3a/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-11-21 13:51:38,580 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-21 13:51:38,580 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 13:51:38,602 INFO L263 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 32 conjunts are in the unsatisfiable core [2022-11-21 13:51:38,605 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:51:38,619 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-11-21 13:51:38,627 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-11-21 13:51:38,745 WARN L859 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_1093 (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_1093))) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-21 13:51:38,787 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1093 (_ BitVec 32)) (nondet_tree_~n~0.base (_ 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_1093)))) is different from true [2022-11-21 13:51:38,816 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-11-21 13:51:38,917 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_nondet_tree_~n~0.base_93 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32))) (= |c_#length| (store (store |c_old(#length)| v_nondet_tree_~n~0.base_93 (_ bv12 32)) nondet_tree_~n~0.base (_ bv12 32)))) is different from true [2022-11-21 13:51:38,948 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_nondet_tree_~n~0.base_94 (_ BitVec 32)) (v_ArrVal_1093 (_ BitVec 32)) (v_nondet_tree_~n~0.base_93 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32))) (and (= (store (store (store |c_old(#length)| v_nondet_tree_~n~0.base_94 v_ArrVal_1093) v_nondet_tree_~n~0.base_93 (_ bv12 32)) nondet_tree_~n~0.base (_ bv12 32)) |c_#length|) (= (select |c_old(#valid)| v_nondet_tree_~n~0.base_94) (_ bv0 1)))) is different from true [2022-11-21 13:51:39,001 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:51:39,098 INFO L321 Elim1Store]: treesize reduction 67, result has 25.6 percent of original size [2022-11-21 13:51:39,099 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 31 [2022-11-21 13:51:39,118 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-21 13:51:39,118 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-11-21 13:51:39,172 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 64 proven. 20 refuted. 0 times theorem prover too weak. 37 trivial. 75 not checked. [2022-11-21 13:51:39,172 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:51:39,678 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 13:51:39,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2094706304] [2022-11-21 13:51:39,678 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2094706304] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 13:51:39,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1844806868] [2022-11-21 13:51:39,678 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-21 13:51:39,678 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-21 13:51:39,678 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd78a4f5-ed3e-4b9f-ad67-5dcd51cf5a59/bin/uautomizer-vX5HgA9Q3a/cvc4 [2022-11-21 13:51:39,679 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd78a4f5-ed3e-4b9f-ad67-5dcd51cf5a59/bin/uautomizer-vX5HgA9Q3a/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-21 13:51:39,683 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd78a4f5-ed3e-4b9f-ad67-5dcd51cf5a59/bin/uautomizer-vX5HgA9Q3a/cvc4 --incremental --print-success --lang smt (23)] Waiting until timeout for monitored process [2022-11-21 13:51:40,267 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-21 13:51:40,267 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 13:51:40,298 INFO L263 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 37 conjunts are in the unsatisfiable core [2022-11-21 13:51:40,303 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:51:40,310 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-11-21 13:51:40,316 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-11-21 13:51:40,420 WARN L859 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_1236 (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_1236))) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)) (exists ((v_ArrVal_1237 (_ BitVec 1))) (= |c_#valid| (store |c_old(#valid)| nondet_tree_~n~0.base v_ArrVal_1237))))) is different from true [2022-11-21 13:51:40,484 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1236 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32)) (v_ArrVal_1237 (_ BitVec 1))) (and (= |c_#length| (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_1236)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)) (= |c_#valid| (store |c_old(#valid)| nondet_tree_~n~0.base v_ArrVal_1237)))) is different from true [2022-11-21 13:51:40,534 WARN L859 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_1238 (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_1238))) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-21 13:51:40,578 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1238 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32))) (and (= |c_#length| (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_1238)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-21 13:51:40,677 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1238 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32)) (v_nondet_tree_~n~0.base_114 (_ BitVec 32))) (and (= (select |c_old(#valid)| v_nondet_tree_~n~0.base_114) (_ bv0 1)) (= (store (store |c_old(#length)| v_nondet_tree_~n~0.base_114 v_ArrVal_1238) nondet_tree_~n~0.base (_ bv12 32)) |c_#length|))) is different from true [2022-11-21 13:51:40,733 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1236 (_ BitVec 32)) (v_ArrVal_1238 (_ BitVec 32)) (v_nondet_tree_~n~0.base_115 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32)) (v_ArrVal_1237 (_ BitVec 1)) (v_nondet_tree_~n~0.base_114 (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| v_nondet_tree_~n~0.base_115)) (= (_ bv0 1) (select (store |c_old(#valid)| v_nondet_tree_~n~0.base_115 v_ArrVal_1237) v_nondet_tree_~n~0.base_114)) (= |c_#length| (store (store (store |c_old(#length)| v_nondet_tree_~n~0.base_115 v_ArrVal_1236) v_nondet_tree_~n~0.base_114 v_ArrVal_1238) nondet_tree_~n~0.base (_ bv12 32))))) is different from true [2022-11-21 13:51:40,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:51:40,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:51:40,935 INFO L321 Elim1Store]: treesize reduction 47, result has 36.5 percent of original size [2022-11-21 13:51:40,935 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-11-21 13:51:41,009 INFO L321 Elim1Store]: treesize reduction 17, result has 45.2 percent of original size [2022-11-21 13:51:41,009 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-11-21 13:51:41,060 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 64 proven. 28 refuted. 0 times theorem prover too weak. 23 trivial. 81 not checked. [2022-11-21 13:51:41,061 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:51:43,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1844806868] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 13:51:43,808 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 13:51:43,808 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 16 [2022-11-21 13:51:43,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021600737] [2022-11-21 13:51:43,809 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 13:51:43,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-21 13:51:43,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 13:51:43,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-21 13:51:43,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=60, Unknown=12, NotChecked=264, Total=380 [2022-11-21 13:51:43,811 INFO L87 Difference]: Start difference. First operand 244 states and 301 transitions. Second operand has 17 states, 16 states have (on average 3.375) internal successors, (54), 16 states have internal predecessors, (54), 9 states have call successors, (13), 3 states have call predecessors, (13), 8 states have return successors, (13), 11 states have call predecessors, (13), 9 states have call successors, (13) [2022-11-21 13:52:10,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:52:10,873 INFO L93 Difference]: Finished difference Result 258 states and 334 transitions. [2022-11-21 13:52:10,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-21 13:52:10,874 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.375) internal successors, (54), 16 states have internal predecessors, (54), 9 states have call successors, (13), 3 states have call predecessors, (13), 8 states have return successors, (13), 11 states have call predecessors, (13), 9 states have call successors, (13) Word has length 69 [2022-11-21 13:52:10,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:52:10,876 INFO L225 Difference]: With dead ends: 258 [2022-11-21 13:52:10,876 INFO L226 Difference]: Without dead ends: 258 [2022-11-21 13:52:10,876 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 124 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 28.2s TimeCoverageRelationStatistics Valid=83, Invalid=143, Unknown=28, NotChecked=396, Total=650 [2022-11-21 13:52:10,877 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 143 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 2814 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2463 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-11-21 13:52:10,877 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 293 Invalid, 2814 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 294 Invalid, 0 Unknown, 2463 Unchecked, 1.4s Time] [2022-11-21 13:52:10,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2022-11-21 13:52:10,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 248. [2022-11-21 13:52:10,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 146 states have (on average 1.4794520547945205) internal successors, (216), 204 states have internal predecessors, (216), 29 states have call successors, (29), 9 states have call predecessors, (29), 15 states have return successors, (66), 34 states have call predecessors, (66), 29 states have call successors, (66) [2022-11-21 13:52:10,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 311 transitions. [2022-11-21 13:52:10,890 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 311 transitions. Word has length 69 [2022-11-21 13:52:10,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:52:10,891 INFO L495 AbstractCegarLoop]: Abstraction has 248 states and 311 transitions. [2022-11-21 13:52:10,891 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.375) internal successors, (54), 16 states have internal predecessors, (54), 9 states have call successors, (13), 3 states have call predecessors, (13), 8 states have return successors, (13), 11 states have call predecessors, (13), 9 states have call successors, (13) [2022-11-21 13:52:10,891 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 311 transitions. [2022-11-21 13:52:10,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-11-21 13:52:10,893 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:52:10,893 INFO L195 NwaCegarLoop]: trace histogram [9, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 1, 1, 1, 1] [2022-11-21 13:52:10,915 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd78a4f5-ed3e-4b9f-ad67-5dcd51cf5a59/bin/uautomizer-vX5HgA9Q3a/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)] Forceful destruction successful, exit code 0 [2022-11-21 13:52:11,114 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd78a4f5-ed3e-4b9f-ad67-5dcd51cf5a59/bin/uautomizer-vX5HgA9Q3a/cvc4 --incremental --print-success --lang smt (23)] Forceful destruction successful, exit code 0 [2022-11-21 13:52:11,309 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd78a4f5-ed3e-4b9f-ad67-5dcd51cf5a59/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd78a4f5-ed3e-4b9f-ad67-5dcd51cf5a59/bin/uautomizer-vX5HgA9Q3a/cvc4 --incremental --print-success --lang smt [2022-11-21 13:52:11,309 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting nondet_treeErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [nondet_treeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-21 13:52:11,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:52:11,310 INFO L85 PathProgramCache]: Analyzing trace with hash 736982444, now seen corresponding path program 3 times [2022-11-21 13:52:11,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 13:52:11,310 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1658648865] [2022-11-21 13:52:11,310 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-21 13:52:11,311 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-11-21 13:52:11,311 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd78a4f5-ed3e-4b9f-ad67-5dcd51cf5a59/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 13:52:11,312 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd78a4f5-ed3e-4b9f-ad67-5dcd51cf5a59/bin/uautomizer-vX5HgA9Q3a/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-11-21 13:52:11,313 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd78a4f5-ed3e-4b9f-ad67-5dcd51cf5a59/bin/uautomizer-vX5HgA9Q3a/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)] Waiting until timeout for monitored process [2022-11-21 13:52:12,095 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2022-11-21 13:52:12,095 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 13:52:12,117 INFO L263 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 40 conjunts are in the unsatisfiable core [2022-11-21 13:52:12,122 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:52:12,130 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-11-21 13:52:12,472 WARN L859 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_1391 (_ BitVec 32))) (= (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_1391) |c_#length|)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-21 13:52:12,523 WARN L859 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32)) (v_ArrVal_1391 (_ BitVec 32))) (and (= (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_1391) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-21 13:52:12,629 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1389 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32)) (v_ArrVal_1391 (_ BitVec 32)) (v_nondet_tree_~n~0.base_135 (_ BitVec 32))) (and (= (store (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_1389) v_nondet_tree_~n~0.base_135 v_ArrVal_1391) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)) (= (select (store |c_old(#valid)| nondet_tree_~n~0.base (_ bv1 1)) v_nondet_tree_~n~0.base_135) (_ bv0 1)))) is different from true [2022-11-21 13:52:14,953 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1389 (_ BitVec 32)) (v_ArrVal_1388 (_ BitVec 32)) (|nondet_tree_#res.base| (_ BitVec 32)) (v_ArrVal_1391 (_ BitVec 32)) (v_nondet_tree_~n~0.base_135 (_ BitVec 32)) (v_nondet_tree_~n~0.base_136 (_ BitVec 32))) (let ((.cse0 (store |c_old(#valid)| |nondet_tree_#res.base| (_ bv1 1)))) (and (= (_ bv0 1) (select (store .cse0 v_nondet_tree_~n~0.base_136 (_ bv1 1)) v_nondet_tree_~n~0.base_135)) (= (_ bv0 1) (select |c_old(#valid)| |nondet_tree_#res.base|)) (= (store (store (store |c_old(#length)| |nondet_tree_#res.base| v_ArrVal_1388) v_nondet_tree_~n~0.base_136 v_ArrVal_1389) v_nondet_tree_~n~0.base_135 v_ArrVal_1391) |c_#length|) (= (_ bv0 1) (select .cse0 v_nondet_tree_~n~0.base_136))))) is different from true [2022-11-21 13:52:15,008 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:52:15,010 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:52:15,014 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:52:15,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:52:15,019 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:52:15,022 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:52:15,023 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2022-11-21 13:52:15,080 INFO L321 Elim1Store]: treesize reduction 48, result has 21.3 percent of original size [2022-11-21 13:52:15,080 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 35 treesize of output 39 [2022-11-21 13:52:15,093 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 70 proven. 31 refuted. 0 times theorem prover too weak. 27 trivial. 68 not checked. [2022-11-21 13:52:15,093 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:52:18,289 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 13:52:18,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1658648865] [2022-11-21 13:52:18,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1658648865] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 13:52:18,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1732607909] [2022-11-21 13:52:18,290 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-21 13:52:18,290 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-21 13:52:18,290 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd78a4f5-ed3e-4b9f-ad67-5dcd51cf5a59/bin/uautomizer-vX5HgA9Q3a/cvc4 [2022-11-21 13:52:18,291 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd78a4f5-ed3e-4b9f-ad67-5dcd51cf5a59/bin/uautomizer-vX5HgA9Q3a/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-21 13:52:18,293 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd78a4f5-ed3e-4b9f-ad67-5dcd51cf5a59/bin/uautomizer-vX5HgA9Q3a/cvc4 --incremental --print-success --lang smt (25)] Waiting until timeout for monitored process [2022-11-21 13:52:19,819 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2022-11-21 13:52:19,819 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 13:52:19,834 INFO L263 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 45 conjunts are in the unsatisfiable core [2022-11-21 13:52:19,839 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:52:19,845 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-11-21 13:52:20,040 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1389 (_ 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_1389) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-21 13:52:32,808 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1389 (_ BitVec 32)) (v_ArrVal_1388 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32)) (v_ArrVal_1550 (_ BitVec 32)) (|nondet_tree_#t~ret8.base| (_ BitVec 32))) (let ((.cse0 (store |c_old(#valid)| nondet_tree_~n~0.base (_ bv1 1)))) (and (= (store (store (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_1389) |c_nondet_tree_#t~ret9.base| v_ArrVal_1388) |nondet_tree_#t~ret8.base| v_ArrVal_1550) |c_#length|) (= (_ bv0 1) (select .cse0 |c_nondet_tree_#t~ret9.base|)) (= (_ bv0 1) (select (store .cse0 |c_nondet_tree_#t~ret9.base| (_ bv1 1)) |nondet_tree_#t~ret8.base|)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base))))) is different from true [2022-11-21 13:52:32,847 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1389 (_ BitVec 32)) (v_ArrVal_1388 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32)) (|nondet_tree_#t~ret9.base| (_ BitVec 32)) (v_ArrVal_1550 (_ BitVec 32)) (|nondet_tree_#t~ret8.base| (_ BitVec 32))) (let ((.cse0 (store |c_old(#valid)| nondet_tree_~n~0.base (_ bv1 1)))) (and (= (_ bv0 1) (select .cse0 |nondet_tree_#t~ret9.base|)) (= (_ bv0 1) (select (store .cse0 |nondet_tree_#t~ret9.base| (_ bv1 1)) |nondet_tree_#t~ret8.base|)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)) (= (store (store (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_1389) |nondet_tree_#t~ret9.base| v_ArrVal_1388) |nondet_tree_#t~ret8.base| v_ArrVal_1550) |c_#length|)))) is different from true [2022-11-21 13:52:32,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:52:32,942 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:52:32,946 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:52:32,949 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:52:32,952 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:52:32,956 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:52:32,958 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2022-11-21 13:52:33,020 INFO L321 Elim1Store]: treesize reduction 48, result has 21.3 percent of original size [2022-11-21 13:52:33,021 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 35 treesize of output 39 [2022-11-21 13:52:33,028 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 73 proven. 68 refuted. 0 times theorem prover too weak. 27 trivial. 28 not checked. [2022-11-21 13:52:33,029 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:52:42,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1732607909] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 13:52:42,247 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 13:52:42,247 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15] total 20 [2022-11-21 13:52:42,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082301363] [2022-11-21 13:52:42,248 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 13:52:42,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-11-21 13:52:42,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 13:52:42,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-11-21 13:52:42,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=230, Unknown=16, NotChecked=252, Total=552 [2022-11-21 13:52:42,250 INFO L87 Difference]: Start difference. First operand 248 states and 311 transitions. Second operand has 21 states, 20 states have (on average 3.05) internal successors, (61), 19 states have internal predecessors, (61), 11 states have call successors, (15), 3 states have call predecessors, (15), 9 states have return successors, (16), 11 states have call predecessors, (16), 11 states have call successors, (16) [2022-11-21 13:52:44,300 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-11-21 13:52:46,307 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-11-21 13:52:52,432 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-11-21 13:52:54,450 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-11-21 13:52:56,488 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-11-21 13:52:58,492 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-11-21 13:53:00,525 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-11-21 13:53:02,534 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-11-21 13:53:08,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-11-21 13:53:10,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-11-21 13:53:12,645 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-11-21 13:53:14,650 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-11-21 13:53:16,684 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-11-21 13:53:18,694 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-11-21 13:53:24,753 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-11-21 13:53:26,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-11-21 13:53:28,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-11-21 13:53:30,788 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-11-21 13:53:32,797 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-11-21 13:53:40,927 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-11-21 13:53:42,934 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-11-21 13:53:44,938 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-11-21 13:53:47,849 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-11-21 13:53:49,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-11-21 13:53:54,146 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-11-21 13:53:56,177 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-11-21 13:54:05,617 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-11-21 13:54:07,673 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-11-21 13:54:09,712 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-11-21 13:54:18,067 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-11-21 13:55:25,118 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-11-21 13:55:27,864 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-11-21 13:55:30,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:55:30,766 INFO L93 Difference]: Finished difference Result 265 states and 356 transitions. [2022-11-21 13:55:30,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-21 13:55:30,767 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 3.05) internal successors, (61), 19 states have internal predecessors, (61), 11 states have call successors, (15), 3 states have call predecessors, (15), 9 states have return successors, (16), 11 states have call predecessors, (16), 11 states have call successors, (16) Word has length 69 [2022-11-21 13:55:30,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:55:30,769 INFO L225 Difference]: With dead ends: 265 [2022-11-21 13:55:30,769 INFO L226 Difference]: Without dead ends: 265 [2022-11-21 13:55:30,769 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 121 SyntacticMatches, 7 SemanticMatches, 30 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 122.5s TimeCoverageRelationStatistics Valid=124, Invalid=464, Unknown=40, NotChecked=364, Total=992 [2022-11-21 13:55:30,770 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 151 mSDsluCounter, 626 mSDsCounter, 0 mSdLazyCounter, 1403 mSolverCounterSat, 67 mSolverCounterUnsat, 87 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 70.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 772 SdHoareTripleChecker+Invalid, 3230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 1403 IncrementalHoareTripleChecker+Invalid, 87 IncrementalHoareTripleChecker+Unknown, 1673 IncrementalHoareTripleChecker+Unchecked, 71.4s IncrementalHoareTripleChecker+Time [2022-11-21 13:55:30,770 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 772 Invalid, 3230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 1403 Invalid, 87 Unknown, 1673 Unchecked, 71.4s Time] [2022-11-21 13:55:30,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2022-11-21 13:55:30,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 244. [2022-11-21 13:55:30,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 143 states have (on average 1.4895104895104896) internal successors, (213), 201 states have internal predecessors, (213), 29 states have call successors, (29), 9 states have call predecessors, (29), 14 states have return successors, (59), 33 states have call predecessors, (59), 29 states have call successors, (59) [2022-11-21 13:55:30,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 301 transitions. [2022-11-21 13:55:30,780 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 301 transitions. Word has length 69 [2022-11-21 13:55:30,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:55:30,781 INFO L495 AbstractCegarLoop]: Abstraction has 244 states and 301 transitions. [2022-11-21 13:55:30,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 3.05) internal successors, (61), 19 states have internal predecessors, (61), 11 states have call successors, (15), 3 states have call predecessors, (15), 9 states have return successors, (16), 11 states have call predecessors, (16), 11 states have call successors, (16) [2022-11-21 13:55:30,781 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 301 transitions. [2022-11-21 13:55:30,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-11-21 13:55:30,782 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:55:30,782 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-11-21 13:55:30,807 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd78a4f5-ed3e-4b9f-ad67-5dcd51cf5a59/bin/uautomizer-vX5HgA9Q3a/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)] Forceful destruction successful, exit code 0 [2022-11-21 13:55:31,005 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd78a4f5-ed3e-4b9f-ad67-5dcd51cf5a59/bin/uautomizer-vX5HgA9Q3a/cvc4 --incremental --print-success --lang smt (25)] Forceful destruction successful, exit code 0 [2022-11-21 13:55:31,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd78a4f5-ed3e-4b9f-ad67-5dcd51cf5a59/bin/uautomizer-vX5HgA9Q3a/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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd78a4f5-ed3e-4b9f-ad67-5dcd51cf5a59/bin/uautomizer-vX5HgA9Q3a/cvc4 --incremental --print-success --lang smt [2022-11-21 13:55:31,199 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting minErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [nondet_treeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-21 13:55:31,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:55:31,199 INFO L85 PathProgramCache]: Analyzing trace with hash 1971504767, now seen corresponding path program 1 times [2022-11-21 13:55:31,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 13:55:31,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [468689028] [2022-11-21 13:55:31,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:55:31,200 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-11-21 13:55:31,200 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd78a4f5-ed3e-4b9f-ad67-5dcd51cf5a59/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 13:55:31,201 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd78a4f5-ed3e-4b9f-ad67-5dcd51cf5a59/bin/uautomizer-vX5HgA9Q3a/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-11-21 13:55:31,202 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd78a4f5-ed3e-4b9f-ad67-5dcd51cf5a59/bin/uautomizer-vX5HgA9Q3a/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-11-21 13:55:31,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:55:31,384 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 29 conjunts are in the unsatisfiable core [2022-11-21 13:55:31,386 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:55:31,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-11-21 13:55:31,441 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-11-21 13:55:31,879 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-11-21 13:55:31,885 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-11-21 13:55:32,023 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-21 13:55:32,023 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:55:32,403 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-21 13:55:32,404 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 13:55:32,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [468689028] [2022-11-21 13:55:32,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [468689028] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 13:55:32,404 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 13:55:32,404 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 14 [2022-11-21 13:55:32,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096944872] [2022-11-21 13:55:32,405 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 13:55:32,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-21 13:55:32,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 13:55:32,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-21 13:55:32,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2022-11-21 13:55:32,406 INFO L87 Difference]: Start difference. First operand 244 states and 301 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-11-21 13:55:34,437 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-11-21 13:55:36,462 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-11-21 13:55:39,426 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-11-21 13:55:41,898 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-11-21 13:55:43,968 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-11-21 13:55:46,150 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-11-21 13:55:48,411 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-11-21 13:55:48,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:55:48,817 INFO L93 Difference]: Finished difference Result 409 states and 506 transitions. [2022-11-21 13:55:48,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-21 13:55:48,818 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-11-21 13:55:48,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:55:48,820 INFO L225 Difference]: With dead ends: 409 [2022-11-21 13:55:48,820 INFO L226 Difference]: Without dead ends: 409 [2022-11-21 13:55:48,820 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=73, Invalid=389, Unknown=0, NotChecked=0, Total=462 [2022-11-21 13:55:48,820 INFO L413 NwaCegarLoop]: 203 mSDtfsCounter, 174 mSDsluCounter, 1885 mSDsCounter, 0 mSdLazyCounter, 487 mSolverCounterSat, 25 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 2088 SdHoareTripleChecker+Invalid, 519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 487 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.0s IncrementalHoareTripleChecker+Time [2022-11-21 13:55:48,820 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 2088 Invalid, 519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 487 Invalid, 7 Unknown, 0 Unchecked, 16.0s Time] [2022-11-21 13:55:48,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2022-11-21 13:55:48,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 326. [2022-11-21 13:55:48,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 202 states have (on average 1.4504950495049505) internal successors, (293), 261 states have internal predecessors, (293), 41 states have call successors, (41), 16 states have call predecessors, (41), 25 states have return successors, (96), 48 states have call predecessors, (96), 41 states have call successors, (96) [2022-11-21 13:55:48,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 430 transitions. [2022-11-21 13:55:48,833 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 430 transitions. Word has length 38 [2022-11-21 13:55:48,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:55:48,833 INFO L495 AbstractCegarLoop]: Abstraction has 326 states and 430 transitions. [2022-11-21 13:55:48,834 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-11-21 13:55:48,834 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 430 transitions. [2022-11-21 13:55:48,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-21 13:55:48,835 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:55:48,835 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-11-21 13:55:48,848 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd78a4f5-ed3e-4b9f-ad67-5dcd51cf5a59/bin/uautomizer-vX5HgA9Q3a/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)] Forceful destruction successful, exit code 0 [2022-11-21 13:55:49,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd78a4f5-ed3e-4b9f-ad67-5dcd51cf5a59/bin/uautomizer-vX5HgA9Q3a/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-11-21 13:55:49,047 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting minErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [nondet_treeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-21 13:55:49,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:55:49,047 INFO L85 PathProgramCache]: Analyzing trace with hash 727982164, now seen corresponding path program 2 times [2022-11-21 13:55:49,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 13:55:49,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [990335196] [2022-11-21 13:55:49,048 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-21 13:55:49,048 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-11-21 13:55:49,048 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd78a4f5-ed3e-4b9f-ad67-5dcd51cf5a59/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 13:55:49,050 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd78a4f5-ed3e-4b9f-ad67-5dcd51cf5a59/bin/uautomizer-vX5HgA9Q3a/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-11-21 13:55:49,051 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd78a4f5-ed3e-4b9f-ad67-5dcd51cf5a59/bin/uautomizer-vX5HgA9Q3a/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 (27)] Waiting until timeout for monitored process [2022-11-21 13:55:49,371 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-21 13:55:49,371 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 13:55:49,381 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 59 conjunts are in the unsatisfiable core [2022-11-21 13:55:49,385 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:55:49,389 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-11-21 13:55:49,488 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-11-21 13:55:49,497 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-11-21 13:55:49,795 WARN L859 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_1682 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| nondet_tree_~n~0.base v_ArrVal_1682) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1681 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| nondet_tree_~n~0.base v_ArrVal_1681))) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-21 13:55:49,836 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:55:49,837 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-11-21 13:55:49,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:55:49,847 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-11-21 13:55:49,861 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-21 13:55:49,862 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-11-21 13:55:49,923 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-11-21 13:55:49,933 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-11-21 13:55:50,261 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-11-21 13:55:50,264 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-11-21 13:55:50,404 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 6 proven. 23 refuted. 0 times theorem prover too weak. 3 trivial. 9 not checked. [2022-11-21 13:55:50,405 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:55:53,048 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 13:55:53,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [990335196] [2022-11-21 13:55:53,048 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [990335196] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 13:55:53,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [963067669] [2022-11-21 13:55:53,048 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-21 13:55:53,048 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-21 13:55:53,048 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd78a4f5-ed3e-4b9f-ad67-5dcd51cf5a59/bin/uautomizer-vX5HgA9Q3a/cvc4 [2022-11-21 13:55:53,049 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd78a4f5-ed3e-4b9f-ad67-5dcd51cf5a59/bin/uautomizer-vX5HgA9Q3a/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-21 13:55:53,055 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd78a4f5-ed3e-4b9f-ad67-5dcd51cf5a59/bin/uautomizer-vX5HgA9Q3a/cvc4 --incremental --print-success --lang smt (28)] Waiting until timeout for monitored process [2022-11-21 13:55:53,531 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-21 13:55:53,532 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 13:55:53,559 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 60 conjunts are in the unsatisfiable core [2022-11-21 13:55:53,564 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:55:53,571 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-11-21 13:55:53,641 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-11-21 13:55:53,653 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-11-21 13:55:53,910 WARN L859 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_1794 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| nondet_tree_~n~0.base v_ArrVal_1794))) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)) (exists ((v_ArrVal_1793 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| nondet_tree_~n~0.base v_ArrVal_1793) |c_#memory_$Pointer$.base|)))) is different from true [2022-11-21 13:55:53,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:55:53,955 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-11-21 13:55:53,967 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:55:53,968 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-11-21 13:55:53,984 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-21 13:55:53,984 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-11-21 13:55:54,001 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-11-21 13:55:54,009 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-11-21 13:55:54,133 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-11-21 13:55:54,136 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-11-21 13:55:54,157 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 6 proven. 23 refuted. 0 times theorem prover too weak. 3 trivial. 9 not checked. [2022-11-21 13:55:54,157 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:55:56,376 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [963067669] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 13:55:56,376 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 13:55:56,376 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 22 [2022-11-21 13:55:56,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939527573] [2022-11-21 13:55:56,376 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 13:55:56,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-11-21 13:55:56,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 13:55:56,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-11-21 13:55:56,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=636, Unknown=4, NotChecked=102, Total=812 [2022-11-21 13:55:56,378 INFO L87 Difference]: Start difference. First operand 326 states and 430 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-11-21 13:56:02,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:56:02,271 INFO L93 Difference]: Finished difference Result 432 states and 562 transitions. [2022-11-21 13:56:02,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-21 13:56:02,273 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-11-21 13:56:02,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:56:02,276 INFO L225 Difference]: With dead ends: 432 [2022-11-21 13:56:02,276 INFO L226 Difference]: Without dead ends: 432 [2022-11-21 13:56:02,277 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 91 SyntacticMatches, 4 SemanticMatches, 43 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 308 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=197, Invalid=1611, Unknown=6, NotChecked=166, Total=1980 [2022-11-21 13:56:02,277 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 383 mSDsluCounter, 1378 mSDsCounter, 0 mSdLazyCounter, 1857 mSolverCounterSat, 126 mSolverCounterUnsat, 16 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 391 SdHoareTripleChecker+Valid, 1502 SdHoareTripleChecker+Invalid, 2583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 1857 IncrementalHoareTripleChecker+Invalid, 16 IncrementalHoareTripleChecker+Unknown, 584 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2022-11-21 13:56:02,277 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [391 Valid, 1502 Invalid, 2583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 1857 Invalid, 16 Unknown, 584 Unchecked, 4.5s Time] [2022-11-21 13:56:02,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2022-11-21 13:56:02,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 348. [2022-11-21 13:56:02,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 348 states, 218 states have (on average 1.426605504587156) internal successors, (311), 278 states have internal predecessors, (311), 44 states have call successors, (44), 18 states have call predecessors, (44), 28 states have return successors, (103), 51 states have call predecessors, (103), 44 states have call successors, (103) [2022-11-21 13:56:02,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 458 transitions. [2022-11-21 13:56:02,290 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 458 transitions. Word has length 45 [2022-11-21 13:56:02,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:56:02,291 INFO L495 AbstractCegarLoop]: Abstraction has 348 states and 458 transitions. [2022-11-21 13:56:02,291 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-11-21 13:56:02,291 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 458 transitions. [2022-11-21 13:56:02,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-11-21 13:56:02,293 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:56:02,293 INFO L195 NwaCegarLoop]: trace histogram [14, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 1, 1, 1, 1] [2022-11-21 13:56:02,303 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd78a4f5-ed3e-4b9f-ad67-5dcd51cf5a59/bin/uautomizer-vX5HgA9Q3a/cvc4 --incremental --print-success --lang smt (28)] Forceful destruction successful, exit code 0 [2022-11-21 13:56:02,506 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd78a4f5-ed3e-4b9f-ad67-5dcd51cf5a59/bin/uautomizer-vX5HgA9Q3a/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 (27)] Forceful destruction successful, exit code 0 [2022-11-21 13:56:02,697 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd78a4f5-ed3e-4b9f-ad67-5dcd51cf5a59/bin/uautomizer-vX5HgA9Q3a/cvc4 --incremental --print-success --lang smt,27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd78a4f5-ed3e-4b9f-ad67-5dcd51cf5a59/bin/uautomizer-vX5HgA9Q3a/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-11-21 13:56:02,698 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting nondet_treeErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [nondet_treeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-21 13:56:02,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:56:02,698 INFO L85 PathProgramCache]: Analyzing trace with hash -328572221, now seen corresponding path program 4 times [2022-11-21 13:56:02,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 13:56:02,699 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [889477360] [2022-11-21 13:56:02,699 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-21 13:56:02,699 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-11-21 13:56:02,699 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd78a4f5-ed3e-4b9f-ad67-5dcd51cf5a59/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 13:56:02,700 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd78a4f5-ed3e-4b9f-ad67-5dcd51cf5a59/bin/uautomizer-vX5HgA9Q3a/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-11-21 13:56:02,702 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd78a4f5-ed3e-4b9f-ad67-5dcd51cf5a59/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2022-11-21 13:56:03,461 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-21 13:56:03,461 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 13:56:03,498 INFO L263 TraceCheckSpWp]: Trace formula consists of 659 conjuncts, 65 conjunts are in the unsatisfiable core [2022-11-21 13:56:03,504 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:56:03,511 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-11-21 13:56:03,521 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-11-21 13:56:03,589 WARN L859 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_2037 (_ BitVec 32))) (= (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_2037) |c_#length|)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-21 13:56:03,637 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2037 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32))) (and (= (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_2037) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-21 13:56:03,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:56:03,721 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-11-21 13:56:03,734 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-21 13:56:03,734 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-11-21 13:56:03,816 WARN L859 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_2038 (_ BitVec 1))) (= (store |c_old(#valid)| nondet_tree_~n~0.base v_ArrVal_2038) |c_#valid|)) (exists ((v_ArrVal_2039 (_ BitVec 32))) (= (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_2039) |c_#length|)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-21 13:56:03,859 WARN L859 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_2040 (_ BitVec 32))) (= (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_2040) |c_#length|)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-21 13:56:03,908 WARN L859 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32)) (v_ArrVal_2040 (_ BitVec 32))) (and (= (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_2040) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-21 13:56:03,999 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2039 (_ BitVec 32)) (v_nondet_tree_~n~0.base_197 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32)) (v_ArrVal_2040 (_ BitVec 32)) (v_ArrVal_2038 (_ BitVec 1))) (and (= (select (store |c_old(#valid)| v_nondet_tree_~n~0.base_197 v_ArrVal_2038) nondet_tree_~n~0.base) (_ bv0 1)) (= (_ bv0 1) (select |c_old(#valid)| v_nondet_tree_~n~0.base_197)) (= (store (store |c_old(#length)| v_nondet_tree_~n~0.base_197 v_ArrVal_2039) nondet_tree_~n~0.base v_ArrVal_2040) |c_#length|))) is different from true [2022-11-21 13:56:04,045 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-11-21 13:56:04,087 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-11-21 13:56:04,203 WARN L859 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (= (store |c_old(#length)| nondet_tree_~n~0.base (_ bv12 32)) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-21 13:56:04,333 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-21 13:56:04,334 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-11-21 13:56:04,347 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_nondet_tree_~n~0.base_198 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32))) (and (= |c_#length| (store (store |c_old(#length)| nondet_tree_~n~0.base (_ bv12 32)) v_nondet_tree_~n~0.base_198 (_ bv12 32))) (not (= v_nondet_tree_~n~0.base_198 nondet_tree_~n~0.base)))) is different from true [2022-11-21 13:56:04,400 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_nondet_tree_~n~0.base_199 (_ BitVec 32)) (v_nondet_tree_~n~0.base_198 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32))) (and (= |c_#length| (store (store (store |c_old(#length)| v_nondet_tree_~n~0.base_199 (_ bv12 32)) nondet_tree_~n~0.base (_ bv12 32)) v_nondet_tree_~n~0.base_198 (_ bv12 32))) (not (= v_nondet_tree_~n~0.base_198 nondet_tree_~n~0.base)))) is different from true [2022-11-21 13:56:04,492 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2039 (_ BitVec 32)) (v_nondet_tree_~n~0.base_199 (_ BitVec 32)) (v_nondet_tree_~n~0.base_200 (_ BitVec 32)) (v_nondet_tree_~n~0.base_197 (_ BitVec 32)) (v_nondet_tree_~n~0.base_198 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32)) (v_ArrVal_2040 (_ BitVec 32)) (v_ArrVal_2038 (_ BitVec 1))) (and (= (select (store |c_old(#valid)| v_nondet_tree_~n~0.base_197 v_ArrVal_2038) v_nondet_tree_~n~0.base_200) (_ bv0 1)) (= (_ bv0 1) (select |c_old(#valid)| v_nondet_tree_~n~0.base_197)) (not (= v_nondet_tree_~n~0.base_198 nondet_tree_~n~0.base)) (= (store (store (store (store (store |c_old(#length)| v_nondet_tree_~n~0.base_197 v_ArrVal_2039) v_nondet_tree_~n~0.base_200 v_ArrVal_2040) v_nondet_tree_~n~0.base_199 (_ bv12 32)) nondet_tree_~n~0.base (_ bv12 32)) v_nondet_tree_~n~0.base_198 (_ bv12 32)) |c_#length|))) is different from true [2022-11-21 13:56:04,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:56:04,639 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:56:04,890 INFO L321 Elim1Store]: treesize reduction 176, result has 20.0 percent of original size [2022-11-21 13:56:04,890 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 4 case distinctions, treesize of input 24 treesize of output 57 [2022-11-21 13:56:04,974 INFO L321 Elim1Store]: treesize reduction 17, result has 45.2 percent of original size [2022-11-21 13:56:04,974 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-11-21 13:56:05,105 INFO L134 CoverageAnalysis]: Checked inductivity of 449 backedges. 30 proven. 69 refuted. 0 times theorem prover too weak. 68 trivial. 282 not checked. [2022-11-21 13:56:05,105 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:56:05,853 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 10 treesize of output 8 [2022-11-21 13:56:07,997 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv12 32) c_nondet_tree_~n~0.offset))) (and (forall ((v_nondet_tree_~n~0.base_237 (_ BitVec 32))) (or (not (= (select |c_#valid| v_nondet_tree_~n~0.base_237) (_ bv0 1))) (forall ((v_ArrVal_2058 (_ BitVec 1)) (v_nondet_tree_~n~0.base_234 (_ BitVec 32))) (or (not (= (_ bv0 1) (select (store |c_#valid| v_nondet_tree_~n~0.base_237 v_ArrVal_2058) v_nondet_tree_~n~0.base_234))) (forall ((v_nondet_tree_~n~0.base_236 (_ BitVec 32)) (v_nondet_tree_~n~0.base_235 (_ BitVec 32))) (or (= v_nondet_tree_~n~0.base_235 v_nondet_tree_~n~0.base_236) (forall ((v_ArrVal_2059 (_ BitVec 32)) (v_nondet_tree_~n~0.base_233 (_ BitVec 32)) (v_ArrVal_2060 (_ BitVec 32))) (bvule .cse0 (select (store (store (store (store (store |c_#length| v_nondet_tree_~n~0.base_237 v_ArrVal_2060) v_nondet_tree_~n~0.base_234 v_ArrVal_2059) v_nondet_tree_~n~0.base_233 (_ bv12 32)) v_nondet_tree_~n~0.base_236 (_ bv12 32)) v_nondet_tree_~n~0.base_235 (_ bv12 32)) c_nondet_tree_~n~0.base))))))))) (or (bvule (bvadd (_ bv8 32) c_nondet_tree_~n~0.offset) .cse0) (forall ((v_ArrVal_2058 (_ BitVec 1)) (v_nondet_tree_~n~0.base_237 (_ BitVec 32)) (v_nondet_tree_~n~0.base_234 (_ BitVec 32))) (or (not (= (_ bv0 1) (select (store |c_#valid| v_nondet_tree_~n~0.base_237 v_ArrVal_2058) v_nondet_tree_~n~0.base_234))) (not (= (select |c_#valid| v_nondet_tree_~n~0.base_237) (_ bv0 1)))))))) is different from false [2022-11-21 13:56:08,004 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 13:56:08,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [889477360] [2022-11-21 13:56:08,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [889477360] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 13:56:08,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1414997060] [2022-11-21 13:56:08,005 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-21 13:56:08,005 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-21 13:56:08,005 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd78a4f5-ed3e-4b9f-ad67-5dcd51cf5a59/bin/uautomizer-vX5HgA9Q3a/cvc4 [2022-11-21 13:56:08,006 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd78a4f5-ed3e-4b9f-ad67-5dcd51cf5a59/bin/uautomizer-vX5HgA9Q3a/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-21 13:56:08,008 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd78a4f5-ed3e-4b9f-ad67-5dcd51cf5a59/bin/uautomizer-vX5HgA9Q3a/cvc4 --incremental --print-success --lang smt (30)] Waiting until timeout for monitored process [2022-11-21 13:56:09,777 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-21 13:56:09,777 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 13:56:09,832 INFO L263 TraceCheckSpWp]: Trace formula consists of 659 conjuncts, 74 conjunts are in the unsatisfiable core [2022-11-21 13:56:09,838 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:56:09,845 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-11-21 13:56:09,865 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-11-21 13:56:09,925 WARN L859 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_2260 (_ BitVec 1))) (= |c_#valid| (store |c_old(#valid)| nondet_tree_~n~0.base v_ArrVal_2260))) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)) (exists ((v_ArrVal_2261 (_ BitVec 32))) (= (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_2261) |c_#length|)))) is different from true [2022-11-21 13:56:09,991 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2260 (_ BitVec 1)) (nondet_tree_~n~0.base (_ BitVec 32)) (v_ArrVal_2261 (_ BitVec 32))) (and (= |c_#valid| (store |c_old(#valid)| nondet_tree_~n~0.base v_ArrVal_2260)) (= (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_2261) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-21 13:56:10,134 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-21 13:56:10,134 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-11-21 13:56:10,144 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-11-21 13:56:10,371 WARN L859 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32)) (v_ArrVal_2265 (_ 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_2265) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-21 13:56:10,929 WARN L859 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_2268 (_ BitVec 32))) (= (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_2268) |c_#length|)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-21 13:56:10,970 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2268 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32))) (and (= (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_2268) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-21 13:56:11,067 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2268 (_ BitVec 32)) (v_nondet_tree_~n~0.base_240 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32))) (and (= (store (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_2268) v_nondet_tree_~n~0.base_240 (_ bv12 32)) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-21 13:56:11,132 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2268 (_ BitVec 32)) (v_nondet_tree_~n~0.base_240 (_ BitVec 32)) (v_nondet_tree_~n~0.base_241 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32)) (v_ArrVal_2265 (_ BitVec 32))) (and (= (select (store |c_old(#valid)| nondet_tree_~n~0.base (_ bv1 1)) v_nondet_tree_~n~0.base_241) (_ bv0 1)) (= |c_#length| (store (store (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_2265) v_nondet_tree_~n~0.base_241 v_ArrVal_2268) v_nondet_tree_~n~0.base_240 (_ bv12 32))) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-21 13:56:13,680 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:56:13,684 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:56:13,690 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:56:13,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:56:13,705 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:56:13,710 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:56:13,713 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:56:13,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:56:13,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:56:14,048 INFO L321 Elim1Store]: treesize reduction 67, result has 40.2 percent of original size [2022-11-21 13:56:14,049 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-11-21 13:56:14,231 INFO L321 Elim1Store]: treesize reduction 79, result has 21.8 percent of original size [2022-11-21 13:56:14,231 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 154 treesize of output 159 [2022-11-21 13:56:14,387 INFO L134 CoverageAnalysis]: Checked inductivity of 449 backedges. 14 proven. 105 refuted. 0 times theorem prover too weak. 83 trivial. 247 not checked. [2022-11-21 13:56:14,387 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:56:24,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1414997060] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 13:56:24,410 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 13:56:24,410 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 30 [2022-11-21 13:56:24,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373415974] [2022-11-21 13:56:24,410 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 13:56:24,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-11-21 13:56:24,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 13:56:24,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-11-21 13:56:24,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=192, Unknown=21, NotChecked=836, Total=1122 [2022-11-21 13:56:24,412 INFO L87 Difference]: Start difference. First operand 348 states and 458 transitions. Second operand has 31 states, 30 states have (on average 3.3333333333333335) internal successors, (100), 28 states have internal predecessors, (100), 19 states have call successors, (23), 3 states have call predecessors, (23), 14 states have return successors, (26), 19 states have call predecessors, (26), 18 states have call successors, (26) [2022-11-21 13:56:26,509 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-11-21 13:56:30,886 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-11-21 13:56:32,929 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-11-21 13:56:34,939 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-11-21 13:56:39,019 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-11-21 13:56:41,030 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-11-21 13:56:45,410 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-11-21 13:56:47,426 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-11-21 13:56:49,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-11-21 13:56:53,618 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-11-21 13:56:55,630 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-11-21 13:56:57,652 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-11-21 13:56:59,678 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-11-21 13:57:01,690 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-11-21 13:57:03,719 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-11-21 13:57:07,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-11-21 13:57:12,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-11-21 13:57:14,033 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-11-21 13:57:16,062 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-11-21 13:57:18,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-11-21 13:57:20,086 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-11-21 13:57:22,104 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-11-21 13:57:24,682 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-11-21 13:57:28,811 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-11-21 13:57:30,828 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-11-21 13:57:32,839 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-11-21 13:57:34,860 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-11-21 13:57:39,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-11-21 13:57:45,536 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-11-21 13:57:47,603 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-11-21 13:57:52,638 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-11-21 13:57:54,693 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-11-21 13:57:56,724 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-11-21 13:57:58,840 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-11-21 13:58:01,555 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-11-21 13:58:04,049 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-11-21 13:58:06,285 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-11-21 13:58:16,194 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-11-21 13:58:18,289 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-11-21 13:58:20,332 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-11-21 13:58:22,500 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-11-21 13:58:24,749 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-11-21 13:58:26,901 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-11-21 13:58:29,047 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-11-21 13:58:40,513 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-11-21 13:58:57,392 WARN L233 SmtUtils]: Spent 5.02s on a formula simplification. DAG size of input: 75 DAG size of output: 66 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 13:59:19,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-11-21 13:59:22,374 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-11-21 13:59:24,630 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-11-21 13:59:26,677 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 13:59:29,100 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.95s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-21 13:59:32,476 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-11-21 13:59:35,619 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-11-21 13:59:38,156 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-11-21 13:59:41,245 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-11-21 13:59:44,265 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-11-21 13:59:47,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:59:47,791 INFO L93 Difference]: Finished difference Result 391 states and 582 transitions. [2022-11-21 13:59:47,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-21 13:59:47,794 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 3.3333333333333335) internal successors, (100), 28 states have internal predecessors, (100), 19 states have call successors, (23), 3 states have call predecessors, (23), 14 states have return successors, (26), 19 states have call predecessors, (26), 18 states have call successors, (26) Word has length 101 [2022-11-21 13:59:47,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:59:47,796 INFO L225 Difference]: With dead ends: 391 [2022-11-21 13:59:47,796 INFO L226 Difference]: Without dead ends: 391 [2022-11-21 13:59:47,797 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 170 SyntacticMatches, 7 SemanticMatches, 43 ConstructedPredicates, 19 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 86.2s TimeCoverageRelationStatistics Valid=176, Invalid=503, Unknown=47, NotChecked=1254, Total=1980 [2022-11-21 13:59:47,797 INFO L413 NwaCegarLoop]: 153 mSDtfsCounter, 142 mSDsluCounter, 551 mSDsCounter, 0 mSdLazyCounter, 1613 mSolverCounterSat, 129 mSolverCounterUnsat, 98 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 129.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 704 SdHoareTripleChecker+Invalid, 6609 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 1613 IncrementalHoareTripleChecker+Invalid, 98 IncrementalHoareTripleChecker+Unknown, 4769 IncrementalHoareTripleChecker+Unchecked, 130.5s IncrementalHoareTripleChecker+Time [2022-11-21 13:59:47,797 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 704 Invalid, 6609 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 1613 Invalid, 98 Unknown, 4769 Unchecked, 130.5s Time] [2022-11-21 13:59:47,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2022-11-21 13:59:47,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 375. [2022-11-21 13:59:47,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 237 states have (on average 1.3966244725738397) internal successors, (331), 298 states have internal predecessors, (331), 48 states have call successors, (48), 19 states have call predecessors, (48), 32 states have return successors, (157), 57 states have call predecessors, (157), 48 states have call successors, (157) [2022-11-21 13:59:47,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 536 transitions. [2022-11-21 13:59:47,813 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 536 transitions. Word has length 101 [2022-11-21 13:59:47,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:59:47,814 INFO L495 AbstractCegarLoop]: Abstraction has 375 states and 536 transitions. [2022-11-21 13:59:47,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 3.3333333333333335) internal successors, (100), 28 states have internal predecessors, (100), 19 states have call successors, (23), 3 states have call predecessors, (23), 14 states have return successors, (26), 19 states have call predecessors, (26), 18 states have call successors, (26) [2022-11-21 13:59:47,814 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 536 transitions. [2022-11-21 13:59:47,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-11-21 13:59:47,816 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:59:47,816 INFO L195 NwaCegarLoop]: trace histogram [12, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 1, 1, 1, 1] [2022-11-21 13:59:47,830 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd78a4f5-ed3e-4b9f-ad67-5dcd51cf5a59/bin/uautomizer-vX5HgA9Q3a/cvc4 --incremental --print-success --lang smt (30)] Forceful destruction successful, exit code 0 [2022-11-21 13:59:48,042 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd78a4f5-ed3e-4b9f-ad67-5dcd51cf5a59/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Forceful destruction successful, exit code 0 [2022-11-21 13:59:48,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd78a4f5-ed3e-4b9f-ad67-5dcd51cf5a59/bin/uautomizer-vX5HgA9Q3a/cvc4 --incremental --print-success --lang smt,29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd78a4f5-ed3e-4b9f-ad67-5dcd51cf5a59/bin/uautomizer-vX5HgA9Q3a/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-11-21 13:59:48,230 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting nondet_treeErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [nondet_treeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-21 13:59:48,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:59:48,230 INFO L85 PathProgramCache]: Analyzing trace with hash 2102295695, now seen corresponding path program 5 times [2022-11-21 13:59:48,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-21 13:59:48,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1235263389] [2022-11-21 13:59:48,231 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-21 13:59:48,231 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-11-21 13:59:48,231 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd78a4f5-ed3e-4b9f-ad67-5dcd51cf5a59/bin/uautomizer-vX5HgA9Q3a/mathsat [2022-11-21 13:59:48,232 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd78a4f5-ed3e-4b9f-ad67-5dcd51cf5a59/bin/uautomizer-vX5HgA9Q3a/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-11-21 13:59:48,233 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd78a4f5-ed3e-4b9f-ad67-5dcd51cf5a59/bin/uautomizer-vX5HgA9Q3a/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (31)] Waiting until timeout for monitored process [2022-11-21 13:59:49,177 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2022-11-21 13:59:49,177 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 13:59:49,200 INFO L263 TraceCheckSpWp]: Trace formula consists of 567 conjuncts, 45 conjunts are in the unsatisfiable core [2022-11-21 13:59:49,204 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:59:49,209 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-11-21 13:59:49,448 WARN L859 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_2472 (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_2472))) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-21 13:59:49,490 WARN L859 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32)) (v_ArrVal_2472 (_ BitVec 32))) (and (= |c_#length| (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_2472)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-21 13:59:49,586 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2470 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32)) (v_ArrVal_2472 (_ BitVec 32)) (v_nondet_tree_~n~0.base_280 (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| v_nondet_tree_~n~0.base_280)) (= (_ bv0 1) (select (store |c_old(#valid)| v_nondet_tree_~n~0.base_280 (_ bv1 1)) nondet_tree_~n~0.base)) (= (store (store |c_old(#length)| v_nondet_tree_~n~0.base_280 v_ArrVal_2470) nondet_tree_~n~0.base v_ArrVal_2472) |c_#length|))) is different from true [2022-11-21 13:59:49,635 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-11-21 13:59:49,739 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_nondet_tree_~n~0.base_281 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32))) (= (store (store |c_old(#length)| nondet_tree_~n~0.base (_ bv12 32)) v_nondet_tree_~n~0.base_281 (_ bv12 32)) |c_#length|)) is different from true [2022-11-21 13:59:49,795 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_nondet_tree_~n~0.base_281 (_ BitVec 32)) (v_nondet_tree_~n~0.base_282 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32))) (= |c_#length| (store (store (store |c_old(#length)| nondet_tree_~n~0.base (_ bv12 32)) v_nondet_tree_~n~0.base_282 (_ bv12 32)) v_nondet_tree_~n~0.base_281 (_ bv12 32)))) is different from true [2022-11-21 13:59:49,838 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_nondet_tree_~n~0.base_283 (_ BitVec 32)) (v_nondet_tree_~n~0.base_281 (_ BitVec 32)) (v_nondet_tree_~n~0.base_282 (_ BitVec 32)) (v_ArrVal_2470 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32)) (v_ArrVal_2472 (_ BitVec 32)) (v_nondet_tree_~n~0.base_280 (_ BitVec 32))) (and (= (_ bv0 1) (select (store |c_old(#valid)| v_nondet_tree_~n~0.base_280 (_ bv1 1)) v_nondet_tree_~n~0.base_283)) (= (_ bv0 1) (select |c_old(#valid)| v_nondet_tree_~n~0.base_280)) (= (store (store (store (store (store |c_old(#length)| v_nondet_tree_~n~0.base_280 v_ArrVal_2470) v_nondet_tree_~n~0.base_283 v_ArrVal_2472) nondet_tree_~n~0.base (_ bv12 32)) v_nondet_tree_~n~0.base_282 (_ bv12 32)) v_nondet_tree_~n~0.base_281 (_ bv12 32)) |c_#length|))) is different from true [2022-11-21 13:59:49,936 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:59:49,938 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:59:49,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:59:50,173 INFO L321 Elim1Store]: treesize reduction 171, result has 21.2 percent of original size [2022-11-21 13:59:50,173 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 54 [2022-11-21 13:59:50,224 INFO L321 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2022-11-21 13:59:50,225 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 22 treesize of output 24 [2022-11-21 13:59:50,277 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 14 proven. 21 refuted. 0 times theorem prover too weak. 100 trivial. 190 not checked. [2022-11-21 13:59:50,277 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:59:51,170 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-21 13:59:51,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1235263389] [2022-11-21 13:59:51,170 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1235263389] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 13:59:51,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1136070689] [2022-11-21 13:59:51,171 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-21 13:59:51,171 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-21 13:59:51,171 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd78a4f5-ed3e-4b9f-ad67-5dcd51cf5a59/bin/uautomizer-vX5HgA9Q3a/cvc4 [2022-11-21 13:59:51,172 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd78a4f5-ed3e-4b9f-ad67-5dcd51cf5a59/bin/uautomizer-vX5HgA9Q3a/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-21 13:59:51,183 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd78a4f5-ed3e-4b9f-ad67-5dcd51cf5a59/bin/uautomizer-vX5HgA9Q3a/cvc4 --incremental --print-success --lang smt (32)] Waiting until timeout for monitored process [2022-11-21 13:59:51,883 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-21 13:59:51,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [866333062] [2022-11-21 13:59:51,883 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-21 13:59:51,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:59:51,884 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd78a4f5-ed3e-4b9f-ad67-5dcd51cf5a59/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:59:51,887 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd78a4f5-ed3e-4b9f-ad67-5dcd51cf5a59/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:59:51,889 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd78a4f5-ed3e-4b9f-ad67-5dcd51cf5a59/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-11-21 13:59:51,890 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd78a4f5-ed3e-4b9f-ad67-5dcd51cf5a59/bin/uautomizer-vX5HgA9Q3a/cvc4 --incremental --print-success --lang smt (32)] Forceful destruction successful, exit code 1 [2022-11-21 14:01:00,469 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2022-11-21 14:01:00,469 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 14:01:00,496 INFO L263 TraceCheckSpWp]: Trace formula consists of 567 conjuncts, 63 conjunts are in the unsatisfiable core [2022-11-21 14:01:00,501 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 14:01:00,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-11-21 14:01:01,302 WARN L859 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_2832 (_ BitVec 32))) (= (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_2832) |c_#length|)) (exists ((v_ArrVal_2833 (_ BitVec 1))) (= (store |c_old(#valid)| nondet_tree_~n~0.base v_ArrVal_2833) |c_#valid|)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-21 14:01:01,340 WARN L859 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_2834 (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_2834))) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-21 14:01:01,376 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2834 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32))) (and (= |c_#length| (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_2834)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-21 14:01:01,456 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2832 (_ BitVec 32)) (v_ArrVal_2834 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32)) (v_nondet_tree_~n~0.base_322 (_ BitVec 32)) (v_ArrVal_2833 (_ BitVec 1))) (and (= (_ bv0 1) (select |c_old(#valid)| v_nondet_tree_~n~0.base_322)) (= (select (store |c_old(#valid)| v_nondet_tree_~n~0.base_322 v_ArrVal_2833) nondet_tree_~n~0.base) (_ bv0 1)) (= (store (store |c_old(#length)| v_nondet_tree_~n~0.base_322 v_ArrVal_2832) nondet_tree_~n~0.base v_ArrVal_2834) |c_#length|))) is different from true [2022-11-21 14:01:28,314 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 14:01:28,317 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 14:01:28,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 14:01:28,328 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 14:01:28,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 14:01:28,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 14:01:28,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 14:01:28,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 14:01:28,359 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 14:01:28,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 14:01:28,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 14:01:28,376 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 14:01:28,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 14:01:28,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 14:01:28,476 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-21 14:01:28,477 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 14 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 38 [2022-11-21 14:01:28,660 INFO L321 Elim1Store]: treesize reduction 125, result has 17.2 percent of original size [2022-11-21 14:01:28,660 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 594 treesize of output 601 [2022-11-21 14:01:28,865 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 26 proven. 127 refuted. 0 times theorem prover too weak. 60 trivial. 112 not checked. [2022-11-21 14:01:28,865 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 14:01:37,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [866333062] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 14:01:37,401 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 14:01:37,401 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16] total 23 [2022-11-21 14:01:37,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870983505] [2022-11-21 14:01:37,401 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 14:01:37,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-11-21 14:01:37,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-21 14:01:37,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-11-21 14:01:37,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=198, Unknown=26, NotChecked=418, Total=702 [2022-11-21 14:01:37,403 INFO L87 Difference]: Start difference. First operand 375 states and 536 transitions. Second operand has 24 states, 23 states have (on average 3.347826086956522) internal successors, (77), 23 states have internal predecessors, (77), 16 states have call successors, (18), 3 states have call predecessors, (18), 12 states have return successors, (21), 14 states have call predecessors, (21), 15 states have call successors, (21) [2022-11-21 14:01:39,513 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-11-21 14:01:41,520 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-11-21 14:01:43,530 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-11-21 14:01:45,539 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-11-21 14:01:51,676 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-11-21 14:01:53,685 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-11-21 14:01:55,710 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-11-21 14:01:57,719 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-11-21 14:01:59,752 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-11-21 14:02:01,758 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-11-21 14:02:03,770 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-11-21 14:02:05,779 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-11-21 14:02:07,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-11-21 14:02:09,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-11-21 14:02:15,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-11-21 14:02:17,892 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-11-21 14:02:19,909 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-11-21 14:02:21,915 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-11-21 14:02:23,921 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-11-21 14:02:25,930 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-11-21 14:02:27,952 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-11-21 14:02:29,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-11-21 14:02:31,980 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-11-21 14:02:33,984 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-11-21 14:02:36,011 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-11-21 14:02:38,022 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-11-21 14:02:40,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-11-21 14:02:42,043 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-11-21 14:02:44,106 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-11-21 14:02:46,112 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-11-21 14:02:48,137 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-11-21 14:02:50,148 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-11-21 14:02:52,194 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-11-21 14:02:54,204 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-11-21 14:02:56,245 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-11-21 14:02:58,254 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-11-21 14:03:00,270 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-11-21 14:03:02,279 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-11-21 14:03:04,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] [2022-11-21 14:03:06,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-11-21 14:03:08,325 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-11-21 14:03:10,332 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-11-21 14:03:12,354 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-11-21 14:03:14,361 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-11-21 14:03:16,398 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-11-21 14:03:18,406 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-11-21 14:03:20,423 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-11-21 14:03:22,433 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-11-21 14:03:24,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-11-21 14:03:26,464 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-11-21 14:03:28,479 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-11-21 14:03:30,488 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-11-21 14:03:32,505 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-11-21 14:03:34,516 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-11-21 14:03:36,537 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-11-21 14:03:38,548 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-11-21 14:03:40,565 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-11-21 14:03:42,574 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-11-21 14:03:44,667 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-11-21 14:03:46,677 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-11-21 14:03:48,697 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-11-21 14:03:50,709 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-11-21 14:03:52,724 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-11-21 14:03:54,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-11-21 14:03:56,756 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-11-21 14:03:58,767 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-11-21 14:04:00,856 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-11-21 14:04:02,866 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-11-21 14:04:04,897 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-11-21 14:04:06,905 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-11-21 14:04:08,930 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-11-21 14:04:10,938 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-11-21 14:04:17,270 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-11-21 14:04:19,275 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-11-21 14:04:21,373 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-11-21 14:04:23,379 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-11-21 14:04:25,387 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-11-21 14:04:27,397 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-11-21 14:04:29,433 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-11-21 14:04:31,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-11-21 14:04:33,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-11-21 14:04:35,535 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-11-21 14:04:37,553 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-11-21 14:04:39,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-11-21 14:04:41,592 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-11-21 14:04:43,600 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-11-21 14:04:49,776 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-11-21 14:04:51,780 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-11-21 14:04:53,834 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-11-21 14:04:55,838 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-11-21 14:04:57,866 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-11-21 14:04:59,872 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-11-21 14:05:01,987 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-11-21 14:05:03,997 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-11-21 14:05:06,030 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-11-21 14:05:08,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-11-21 14:05:10,057 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-11-21 14:05:12,065 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-11-21 14:05:14,084 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-11-21 14:05:16,095 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-11-21 14:05:18,187 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-11-21 14:05:20,197 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-11-21 14:05:22,213 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-11-21 14:05:24,221 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-11-21 14:05:26,274 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-11-21 14:05:28,281 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]