./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../../sv-benchmarks/c/verifythis/tree_del_rec.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version e04fb08f Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/verifythis/tree_del_rec.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/config/svcomp-MemCleanup-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8 --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 448d6e9f7f0c094a8335d652a2766ae983308e33ec1a543ceaed97ae79744722 --- 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-e04fb08 [2022-11-16 10:56:07,658 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 10:56:07,661 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 10:56:07,708 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 10:56:07,710 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 10:56:07,714 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 10:56:07,717 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 10:56:07,721 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 10:56:07,723 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 10:56:07,725 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 10:56:07,727 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 10:56:07,730 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 10:56:07,730 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 10:56:07,736 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 10:56:07,737 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 10:56:07,739 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 10:56:07,741 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 10:56:07,744 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 10:56:07,745 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 10:56:07,750 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 10:56:07,752 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 10:56:07,753 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 10:56:07,757 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 10:56:07,758 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 10:56:07,766 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 10:56:07,768 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 10:56:07,768 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 10:56:07,769 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 10:56:07,771 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 10:56:07,772 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 10:56:07,772 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 10:56:07,773 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 10:56:07,775 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 10:56:07,777 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 10:56:07,779 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 10:56:07,779 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 10:56:07,780 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 10:56:07,780 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 10:56:07,781 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 10:56:07,781 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 10:56:07,782 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 10:56:07,783 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2022-11-16 10:56:07,822 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 10:56:07,823 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 10:56:07,823 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 10:56:07,824 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 10:56:07,825 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 10:56:07,825 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 10:56:07,826 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 10:56:07,826 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 10:56:07,826 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 10:56:07,826 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 10:56:07,827 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 10:56:07,828 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-16 10:56:07,828 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 10:56:07,828 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 10:56:07,828 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 10:56:07,828 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-16 10:56:07,829 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-16 10:56:07,829 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 10:56:07,829 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-16 10:56:07,829 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 10:56:07,829 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 10:56:07,830 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 10:56:07,830 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 10:56:07,830 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 10:56:07,830 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 10:56:07,831 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 10:56:07,832 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 10:56:07,832 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-16 10:56:07,833 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-16 10:56:07,833 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_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/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_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8 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 -> 448d6e9f7f0c094a8335d652a2766ae983308e33ec1a543ceaed97ae79744722 [2022-11-16 10:56:08,119 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 10:56:08,146 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 10:56:08,149 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 10:56:08,151 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 10:56:08,152 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 10:56:08,153 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/../../sv-benchmarks/c/verifythis/tree_del_rec.c [2022-11-16 10:56:08,223 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/data/a7468109d/a29e15ca2ddc42a58e7186e7b47ae025/FLAGa4c865791 [2022-11-16 10:56:08,660 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 10:56:08,661 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/sv-benchmarks/c/verifythis/tree_del_rec.c [2022-11-16 10:56:08,681 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/data/a7468109d/a29e15ca2ddc42a58e7186e7b47ae025/FLAGa4c865791 [2022-11-16 10:56:09,057 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/data/a7468109d/a29e15ca2ddc42a58e7186e7b47ae025 [2022-11-16 10:56:09,059 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 10:56:09,061 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 10:56:09,062 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 10:56:09,063 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 10:56:09,074 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 10:56:09,075 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 10:56:09" (1/1) ... [2022-11-16 10:56:09,076 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7603697 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:56:09, skipping insertion in model container [2022-11-16 10:56:09,076 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 10:56:09" (1/1) ... [2022-11-16 10:56:09,084 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 10:56:09,104 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 10:56:09,290 WARN L229 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_6f938416-68ba-48bb-bd7d-a14849e39d84/sv-benchmarks/c/verifythis/tree_del_rec.c[585,598] [2022-11-16 10:56:09,307 WARN L1554 CHandler]: Possible shadowing of function min [2022-11-16 10:56:09,309 WARN L1554 CHandler]: Possible shadowing of function min [2022-11-16 10:56:09,325 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 10:56:09,337 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-16 10:56:09,338 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@2d34b343 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:56:09, skipping insertion in model container [2022-11-16 10:56:09,338 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 10:56:09,338 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2022-11-16 10:56:09,340 INFO L158 Benchmark]: Toolchain (without parser) took 278.63ms. Allocated memory is still 111.1MB. Free memory was 70.9MB in the beginning and 86.2MB in the end (delta: -15.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-16 10:56:09,341 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 111.1MB. Free memory is still 88.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 10:56:09,342 INFO L158 Benchmark]: CACSL2BoogieTranslator took 275.84ms. Allocated memory is still 111.1MB. Free memory was 70.7MB in the beginning and 86.2MB in the end (delta: -15.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-16 10:56:09,343 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.29ms. Allocated memory is still 111.1MB. Free memory is still 88.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 275.84ms. Allocated memory is still 111.1MB. Free memory was 70.7MB in the beginning and 86.2MB in the end (delta: -15.5MB). 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-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/verifythis/tree_del_rec.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8 --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 448d6e9f7f0c094a8335d652a2766ae983308e33ec1a543ceaed97ae79744722 --- 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-e04fb08 [2022-11-16 10:56:11,592 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 10:56:11,595 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 10:56:11,632 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 10:56:11,633 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 10:56:11,636 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 10:56:11,640 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 10:56:11,646 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 10:56:11,649 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 10:56:11,654 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 10:56:11,656 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 10:56:11,658 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 10:56:11,659 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 10:56:11,661 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 10:56:11,663 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 10:56:11,667 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 10:56:11,670 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 10:56:11,671 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 10:56:11,673 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 10:56:11,680 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 10:56:11,683 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 10:56:11,685 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 10:56:11,687 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 10:56:11,688 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 10:56:11,695 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 10:56:11,698 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 10:56:11,699 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 10:56:11,701 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 10:56:11,701 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 10:56:11,702 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 10:56:11,703 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 10:56:11,704 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 10:56:11,706 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 10:56:11,707 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 10:56:11,708 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 10:56:11,708 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 10:56:11,709 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 10:56:11,709 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 10:56:11,710 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 10:56:11,712 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 10:56:11,713 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 10:56:11,714 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf [2022-11-16 10:56:11,757 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 10:56:11,757 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 10:56:11,759 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 10:56:11,759 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 10:56:11,760 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 10:56:11,760 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 10:56:11,762 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 10:56:11,762 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 10:56:11,762 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 10:56:11,762 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 10:56:11,763 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 10:56:11,764 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-16 10:56:11,764 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 10:56:11,764 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 10:56:11,765 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 10:56:11,765 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-16 10:56:11,765 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-16 10:56:11,765 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 10:56:11,766 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-16 10:56:11,766 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-16 10:56:11,766 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-16 10:56:11,766 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 10:56:11,766 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 10:56:11,767 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 10:56:11,767 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 10:56:11,767 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 10:56:11,768 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 10:56:11,768 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 10:56:11,768 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 10:56:11,768 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-11-16 10:56:11,769 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-16 10:56:11,769 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-16 10:56:11,769 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_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/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_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8 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 -> 448d6e9f7f0c094a8335d652a2766ae983308e33ec1a543ceaed97ae79744722 [2022-11-16 10:56:12,191 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 10:56:12,226 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 10:56:12,229 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 10:56:12,230 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 10:56:12,231 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 10:56:12,233 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/../../sv-benchmarks/c/verifythis/tree_del_rec.c [2022-11-16 10:56:12,316 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/data/45145958a/60695b622c9e41678016d01bbce2f42c/FLAG28e371f2f [2022-11-16 10:56:12,819 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 10:56:12,820 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/sv-benchmarks/c/verifythis/tree_del_rec.c [2022-11-16 10:56:12,828 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/data/45145958a/60695b622c9e41678016d01bbce2f42c/FLAG28e371f2f [2022-11-16 10:56:13,188 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/data/45145958a/60695b622c9e41678016d01bbce2f42c [2022-11-16 10:56:13,191 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 10:56:13,193 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 10:56:13,198 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 10:56:13,198 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 10:56:13,203 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 10:56:13,204 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 10:56:13" (1/1) ... [2022-11-16 10:56:13,205 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@140f7f2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:56:13, skipping insertion in model container [2022-11-16 10:56:13,205 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 10:56:13" (1/1) ... [2022-11-16 10:56:13,213 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 10:56:13,236 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 10:56:13,420 WARN L229 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_6f938416-68ba-48bb-bd7d-a14849e39d84/sv-benchmarks/c/verifythis/tree_del_rec.c[585,598] [2022-11-16 10:56:13,445 WARN L1554 CHandler]: Possible shadowing of function min [2022-11-16 10:56:13,448 WARN L1554 CHandler]: Possible shadowing of function min [2022-11-16 10:56:13,480 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 10:56:13,498 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-11-16 10:56:13,521 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 10:56:13,552 WARN L229 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_6f938416-68ba-48bb-bd7d-a14849e39d84/sv-benchmarks/c/verifythis/tree_del_rec.c[585,598] [2022-11-16 10:56:13,566 WARN L1554 CHandler]: Possible shadowing of function min [2022-11-16 10:56:13,568 WARN L1554 CHandler]: Possible shadowing of function min [2022-11-16 10:56:13,578 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 10:56:13,584 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 10:56:13,604 WARN L229 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_6f938416-68ba-48bb-bd7d-a14849e39d84/sv-benchmarks/c/verifythis/tree_del_rec.c[585,598] [2022-11-16 10:56:13,613 WARN L1554 CHandler]: Possible shadowing of function min [2022-11-16 10:56:13,615 WARN L1554 CHandler]: Possible shadowing of function min [2022-11-16 10:56:13,628 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 10:56:13,652 INFO L208 MainTranslator]: Completed translation [2022-11-16 10:56:13,652 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:56:13 WrapperNode [2022-11-16 10:56:13,652 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 10:56:13,653 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 10:56:13,653 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 10:56:13,654 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 10:56:13,661 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:56:13" (1/1) ... [2022-11-16 10:56:13,673 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:56:13" (1/1) ... [2022-11-16 10:56:13,693 INFO L138 Inliner]: procedures = 31, calls = 61, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 75 [2022-11-16 10:56:13,693 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 10:56:13,694 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 10:56:13,694 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 10:56:13,694 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 10:56:13,704 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:56:13" (1/1) ... [2022-11-16 10:56:13,704 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:56:13" (1/1) ... [2022-11-16 10:56:13,710 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:56:13" (1/1) ... [2022-11-16 10:56:13,710 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:56:13" (1/1) ... [2022-11-16 10:56:13,724 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:56:13" (1/1) ... [2022-11-16 10:56:13,728 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:56:13" (1/1) ... [2022-11-16 10:56:13,731 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:56:13" (1/1) ... [2022-11-16 10:56:13,732 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:56:13" (1/1) ... [2022-11-16 10:56:13,736 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 10:56:13,736 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 10:56:13,737 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 10:56:13,737 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 10:56:13,738 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:56:13" (1/1) ... [2022-11-16 10:56:13,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 10:56:13,755 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 10:56:13,768 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 10:56:13,793 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 10:56:13,812 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 10:56:13,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-16 10:56:13,812 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-16 10:56:13,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-16 10:56:13,812 INFO L130 BoogieDeclarations]: Found specification of procedure tree_del [2022-11-16 10:56:13,812 INFO L138 BoogieDeclarations]: Found implementation of procedure tree_del [2022-11-16 10:56:13,813 INFO L130 BoogieDeclarations]: Found specification of procedure min [2022-11-16 10:56:13,813 INFO L138 BoogieDeclarations]: Found implementation of procedure min [2022-11-16 10:56:13,813 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-11-16 10:56:13,813 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-11-16 10:56:13,813 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-11-16 10:56:13,813 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-16 10:56:13,813 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_tree [2022-11-16 10:56:13,813 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_tree [2022-11-16 10:56:13,814 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-16 10:56:13,814 INFO L130 BoogieDeclarations]: Found specification of procedure size [2022-11-16 10:56:13,814 INFO L138 BoogieDeclarations]: Found implementation of procedure size [2022-11-16 10:56:13,814 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 10:56:13,814 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 10:56:13,814 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-11-16 10:56:13,814 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-11-16 10:56:13,815 INFO L130 BoogieDeclarations]: Found specification of procedure tree_inorder [2022-11-16 10:56:13,815 INFO L138 BoogieDeclarations]: Found implementation of procedure tree_inorder [2022-11-16 10:56:13,815 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-16 10:56:13,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-16 10:56:13,935 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 10:56:13,937 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 10:56:14,786 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 10:56:14,794 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 10:56:14,794 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-16 10:56:14,797 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 10:56:14 BoogieIcfgContainer [2022-11-16 10:56:14,797 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 10:56:14,807 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 10:56:14,808 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 10:56:14,811 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 10:56:14,811 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 10:56:13" (1/3) ... [2022-11-16 10:56:14,812 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e36bfc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 10:56:14, skipping insertion in model container [2022-11-16 10:56:14,812 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:56:13" (2/3) ... [2022-11-16 10:56:14,813 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e36bfc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 10:56:14, skipping insertion in model container [2022-11-16 10:56:14,813 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 10:56:14" (3/3) ... [2022-11-16 10:56:14,814 INFO L112 eAbstractionObserver]: Analyzing ICFG tree_del_rec.c [2022-11-16 10:56:14,834 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 10:56:14,834 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 55 error locations. [2022-11-16 10:56:14,888 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 10:56:14,894 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;@1cb7cb7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 10:56:14,895 INFO L358 AbstractCegarLoop]: Starting to check reachability of 55 error locations. [2022-11-16 10:56:14,899 INFO L276 IsEmpty]: Start isEmpty. Operand has 174 states, 89 states have (on average 1.7640449438202248) internal successors, (157), 144 states have internal predecessors, (157), 22 states have call successors, (22), 7 states have call predecessors, (22), 7 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2022-11-16 10:56:14,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-16 10:56:14,907 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 10:56:14,908 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-16 10:56:14,909 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting nondet_treeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [nondet_treeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2022-11-16 10:56:14,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:56:14,914 INFO L85 PathProgramCache]: Analyzing trace with hash 120433579, now seen corresponding path program 1 times [2022-11-16 10:56:14,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 10:56:14,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [615738375] [2022-11-16 10:56:14,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:56:14,929 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 10:56:14,930 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 10:56:14,939 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/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-16 10:56:14,959 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/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-16 10:56:15,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:56:15,031 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-16 10:56:15,036 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 10:56:15,118 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-16 10:56:15,136 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-16 10:56:15,136 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 10:56:15,137 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 10:56:15,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [615738375] [2022-11-16 10:56:15,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [615738375] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 10:56:15,138 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 10:56:15,138 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 10:56:15,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904732015] [2022-11-16 10:56:15,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 10:56:15,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 10:56:15,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 10:56:15,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 10:56:15,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 10:56:15,187 INFO L87 Difference]: Start difference. First operand has 174 states, 89 states have (on average 1.7640449438202248) internal successors, (157), 144 states have internal predecessors, (157), 22 states have call successors, (22), 7 states have call predecessors, (22), 7 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) 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-16 10:56:15,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 10:56:15,495 INFO L93 Difference]: Finished difference Result 175 states and 200 transitions. [2022-11-16 10:56:15,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 10:56:15,499 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-16 10:56:15,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 10:56:15,511 INFO L225 Difference]: With dead ends: 175 [2022-11-16 10:56:15,511 INFO L226 Difference]: Without dead ends: 172 [2022-11-16 10:56:15,513 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-16 10:56:15,516 INFO L413 NwaCegarLoop]: 197 mSDtfsCounter, 6 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 10:56:15,517 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 326 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-16 10:56:15,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2022-11-16 10:56:15,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 170. [2022-11-16 10:56:15,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 87 states have (on average 1.7011494252873562) internal successors, (148), 140 states have internal predecessors, (148), 22 states have call successors, (22), 7 states have call predecessors, (22), 7 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2022-11-16 10:56:15,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 192 transitions. [2022-11-16 10:56:15,581 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 192 transitions. Word has length 5 [2022-11-16 10:56:15,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 10:56:15,582 INFO L495 AbstractCegarLoop]: Abstraction has 170 states and 192 transitions. [2022-11-16 10:56:15,582 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-16 10:56:15,583 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 192 transitions. [2022-11-16 10:56:15,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-16 10:56:15,584 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 10:56:15,584 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-16 10:56:15,604 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-11-16 10:56:15,796 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/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-16 10:56:15,796 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting nondet_treeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [nondet_treeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2022-11-16 10:56:15,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:56:15,797 INFO L85 PathProgramCache]: Analyzing trace with hash 120433580, now seen corresponding path program 1 times [2022-11-16 10:56:15,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 10:56:15,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [584882471] [2022-11-16 10:56:15,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:56:15,804 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-16 10:56:15,804 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 10:56:15,805 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/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-16 10:56:15,844 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/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-16 10:56:15,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:56:15,873 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-16 10:56:15,875 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 10:56:15,895 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-16 10:56:15,914 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-16 10:56:15,914 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 10:56:15,915 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 10:56:15,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [584882471] [2022-11-16 10:56:15,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [584882471] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 10:56:15,916 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 10:56:15,916 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 10:56:15,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237192748] [2022-11-16 10:56:15,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 10:56:15,918 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 10:56:15,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 10:56:15,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 10:56:15,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 10:56:15,921 INFO L87 Difference]: Start difference. First operand 170 states and 192 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-16 10:56:16,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 10:56:16,241 INFO L93 Difference]: Finished difference Result 169 states and 191 transitions. [2022-11-16 10:56:16,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 10:56:16,248 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-16 10:56:16,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 10:56:16,250 INFO L225 Difference]: With dead ends: 169 [2022-11-16 10:56:16,250 INFO L226 Difference]: Without dead ends: 169 [2022-11-16 10:56:16,250 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-16 10:56:16,251 INFO L413 NwaCegarLoop]: 190 mSDtfsCounter, 2 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 10:56:16,252 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 327 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-16 10:56:16,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2022-11-16 10:56:16,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2022-11-16 10:56:16,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 87 states have (on average 1.6896551724137931) internal successors, (147), 139 states have internal predecessors, (147), 22 states have call successors, (22), 7 states have call predecessors, (22), 7 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2022-11-16 10:56:16,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 191 transitions. [2022-11-16 10:56:16,283 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 191 transitions. Word has length 5 [2022-11-16 10:56:16,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 10:56:16,283 INFO L495 AbstractCegarLoop]: Abstraction has 169 states and 191 transitions. [2022-11-16 10:56:16,283 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-16 10:56:16,283 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 191 transitions. [2022-11-16 10:56:16,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-16 10:56:16,284 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 10:56:16,284 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 10:56:16,301 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/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-16 10:56:16,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/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-16 10:56:16,485 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting minErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [nondet_treeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2022-11-16 10:56:16,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:56:16,486 INFO L85 PathProgramCache]: Analyzing trace with hash 854953177, now seen corresponding path program 1 times [2022-11-16 10:56:16,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 10:56:16,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [240473739] [2022-11-16 10:56:16,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:56:16,487 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-16 10:56:16,487 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 10:56:16,490 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/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-16 10:56:16,492 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/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-16 10:56:16,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:56:16,562 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-16 10:56:16,566 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 10:56:16,701 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-16 10:56:16,701 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 10:56:16,702 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 10:56:16,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [240473739] [2022-11-16 10:56:16,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [240473739] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 10:56:16,702 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 10:56:16,703 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 10:56:16,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226311855] [2022-11-16 10:56:16,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 10:56:16,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 10:56:16,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 10:56:16,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 10:56:16,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-16 10:56:16,713 INFO L87 Difference]: Start difference. First operand 169 states and 191 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-16 10:56:16,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 10:56:16,960 INFO L93 Difference]: Finished difference Result 233 states and 270 transitions. [2022-11-16 10:56:16,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 10:56:16,961 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-16 10:56:16,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 10:56:16,963 INFO L225 Difference]: With dead ends: 233 [2022-11-16 10:56:16,964 INFO L226 Difference]: Without dead ends: 233 [2022-11-16 10:56:16,964 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-16 10:56:16,965 INFO L413 NwaCegarLoop]: 199 mSDtfsCounter, 91 mSDsluCounter, 925 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 1124 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 10:56:16,966 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 1124 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 10:56:16,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2022-11-16 10:56:16,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 177. [2022-11-16 10:56:16,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 92 states have (on average 1.6521739130434783) internal successors, (152), 145 states have internal predecessors, (152), 23 states have call successors, (23), 8 states have call predecessors, (23), 9 states have return successors, (26), 23 states have call predecessors, (26), 23 states have call successors, (26) [2022-11-16 10:56:16,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 201 transitions. [2022-11-16 10:56:16,996 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 201 transitions. Word has length 11 [2022-11-16 10:56:16,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 10:56:16,997 INFO L495 AbstractCegarLoop]: Abstraction has 177 states and 201 transitions. [2022-11-16 10:56:16,997 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-16 10:56:17,002 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 201 transitions. [2022-11-16 10:56:17,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-16 10:56:17,002 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 10:56:17,003 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 10:56:17,019 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/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-16 10:56:17,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/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-16 10:56:17,220 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting nondet_treeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [nondet_treeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2022-11-16 10:56:17,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:56:17,221 INFO L85 PathProgramCache]: Analyzing trace with hash 873486780, now seen corresponding path program 1 times [2022-11-16 10:56:17,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 10:56:17,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1976774543] [2022-11-16 10:56:17,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:56:17,222 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-16 10:56:17,222 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 10:56:17,227 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/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-16 10:56:17,229 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/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-16 10:56:17,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:56:17,312 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-16 10:56:17,315 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 10:56:17,322 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-16 10:56:17,358 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-16 10:56:17,358 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 10:56:17,358 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 10:56:17,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1976774543] [2022-11-16 10:56:17,361 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1976774543] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 10:56:17,362 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 10:56:17,362 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 10:56:17,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744466505] [2022-11-16 10:56:17,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 10:56:17,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 10:56:17,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 10:56:17,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 10:56:17,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 10:56:17,364 INFO L87 Difference]: Start difference. First operand 177 states and 201 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-16 10:56:17,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 10:56:17,951 INFO L93 Difference]: Finished difference Result 181 states and 205 transitions. [2022-11-16 10:56:17,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 10:56:17,957 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-16 10:56:17,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 10:56:17,959 INFO L225 Difference]: With dead ends: 181 [2022-11-16 10:56:17,959 INFO L226 Difference]: Without dead ends: 181 [2022-11-16 10:56:17,959 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-16 10:56:17,960 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 95 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-16 10:56:17,960 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 202 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-16 10:56:17,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2022-11-16 10:56:17,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 179. [2022-11-16 10:56:17,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 94 states have (on average 1.6595744680851063) internal successors, (156), 145 states have internal predecessors, (156), 23 states have call successors, (23), 8 states have call predecessors, (23), 9 states have return successors, (26), 25 states have call predecessors, (26), 23 states have call successors, (26) [2022-11-16 10:56:17,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 205 transitions. [2022-11-16 10:56:17,972 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 205 transitions. Word has length 11 [2022-11-16 10:56:17,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 10:56:17,972 INFO L495 AbstractCegarLoop]: Abstraction has 179 states and 205 transitions. [2022-11-16 10:56:17,972 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-16 10:56:17,973 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 205 transitions. [2022-11-16 10:56:17,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-16 10:56:17,973 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 10:56:17,973 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 10:56:17,996 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/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-16 10:56:18,186 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/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-16 10:56:18,187 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting nondet_treeErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [nondet_treeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2022-11-16 10:56:18,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:56:18,187 INFO L85 PathProgramCache]: Analyzing trace with hash 873486781, now seen corresponding path program 1 times [2022-11-16 10:56:18,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 10:56:18,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1728966502] [2022-11-16 10:56:18,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:56:18,188 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-16 10:56:18,188 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 10:56:18,195 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/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-16 10:56:18,226 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/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-16 10:56:18,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:56:18,270 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-16 10:56:18,272 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 10:56:18,285 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-16 10:56:18,340 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-16 10:56:18,341 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 10:56:18,341 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 10:56:18,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1728966502] [2022-11-16 10:56:18,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1728966502] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 10:56:18,343 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 10:56:18,343 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 10:56:18,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84205264] [2022-11-16 10:56:18,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 10:56:18,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 10:56:18,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 10:56:18,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 10:56:18,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 10:56:18,345 INFO L87 Difference]: Start difference. First operand 179 states and 205 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-16 10:56:19,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 10:56:19,013 INFO L93 Difference]: Finished difference Result 185 states and 215 transitions. [2022-11-16 10:56:19,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 10:56:19,014 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-16 10:56:19,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 10:56:19,016 INFO L225 Difference]: With dead ends: 185 [2022-11-16 10:56:19,016 INFO L226 Difference]: Without dead ends: 185 [2022-11-16 10:56:19,016 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-16 10:56:19,017 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 100 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-16 10:56:19,018 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 177 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-16 10:56:19,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2022-11-16 10:56:19,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 182. [2022-11-16 10:56:19,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 96 states have (on average 1.6354166666666667) internal successors, (157), 147 states have internal predecessors, (157), 24 states have call successors, (24), 8 states have call predecessors, (24), 9 states have return successors, (28), 26 states have call predecessors, (28), 24 states have call successors, (28) [2022-11-16 10:56:19,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 209 transitions. [2022-11-16 10:56:19,030 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 209 transitions. Word has length 11 [2022-11-16 10:56:19,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 10:56:19,031 INFO L495 AbstractCegarLoop]: Abstraction has 182 states and 209 transitions. [2022-11-16 10:56:19,031 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-16 10:56:19,031 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 209 transitions. [2022-11-16 10:56:19,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-16 10:56:19,032 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 10:56:19,032 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 10:56:19,048 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/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)] Forceful destruction successful, exit code 0 [2022-11-16 10:56:19,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/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-16 10:56:19,244 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting sizeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [nondet_treeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2022-11-16 10:56:19,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:56:19,244 INFO L85 PathProgramCache]: Analyzing trace with hash -1280810199, now seen corresponding path program 1 times [2022-11-16 10:56:19,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 10:56:19,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1431769919] [2022-11-16 10:56:19,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:56:19,245 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-16 10:56:19,245 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 10:56:19,246 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/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-16 10:56:19,251 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/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-16 10:56:19,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:56:19,331 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-16 10:56:19,335 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 10:56:19,459 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-16 10:56:19,459 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 10:56:19,459 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 10:56:19,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1431769919] [2022-11-16 10:56:19,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1431769919] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 10:56:19,460 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 10:56:19,460 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 10:56:19,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711487066] [2022-11-16 10:56:19,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 10:56:19,460 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 10:56:19,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 10:56:19,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 10:56:19,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-16 10:56:19,461 INFO L87 Difference]: Start difference. First operand 182 states and 209 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-16 10:56:19,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 10:56:19,643 INFO L93 Difference]: Finished difference Result 242 states and 282 transitions. [2022-11-16 10:56:19,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 10:56:19,645 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-16 10:56:19,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 10:56:19,647 INFO L225 Difference]: With dead ends: 242 [2022-11-16 10:56:19,647 INFO L226 Difference]: Without dead ends: 242 [2022-11-16 10:56:19,647 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-16 10:56:19,648 INFO L413 NwaCegarLoop]: 198 mSDtfsCounter, 90 mSDsluCounter, 925 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 1123 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 10:56:19,648 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 1123 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 10:56:19,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2022-11-16 10:56:19,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 204. [2022-11-16 10:56:19,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 110 states have (on average 1.5909090909090908) internal successors, (175), 161 states have internal predecessors, (175), 31 states have call successors, (31), 9 states have call predecessors, (31), 10 states have return successors, (35), 33 states have call predecessors, (35), 31 states have call successors, (35) [2022-11-16 10:56:19,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 241 transitions. [2022-11-16 10:56:19,679 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 241 transitions. Word has length 17 [2022-11-16 10:56:19,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 10:56:19,679 INFO L495 AbstractCegarLoop]: Abstraction has 204 states and 241 transitions. [2022-11-16 10:56:19,680 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-16 10:56:19,680 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 241 transitions. [2022-11-16 10:56:19,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-16 10:56:19,681 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 10:56:19,682 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 10:56:19,693 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/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-16 10:56:19,891 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/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-16 10:56:19,891 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting nondet_treeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [nondet_treeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2022-11-16 10:56:19,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:56:19,892 INFO L85 PathProgramCache]: Analyzing trace with hash -1539264760, now seen corresponding path program 1 times [2022-11-16 10:56:19,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 10:56:19,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [109669528] [2022-11-16 10:56:19,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:56:19,893 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-16 10:56:19,893 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 10:56:19,894 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/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-16 10:56:19,895 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/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-16 10:56:20,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:56:20,112 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-16 10:56:20,121 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 10:56:20,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 7 [2022-11-16 10:56:20,189 WARN L855 $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-16 10:56:20,261 WARN L855 $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-16 10:56:20,397 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-16 10:56:20,397 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-16 10:56:20,405 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-16 10:56:20,406 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 10:56:20,623 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 10:56:20,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [109669528] [2022-11-16 10:56:20,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [109669528] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 10:56:20,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1866952644] [2022-11-16 10:56:20,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:56:20,624 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-16 10:56:20,624 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/cvc4 [2022-11-16 10:56:20,631 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-16 10:56:20,652 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (9)] Waiting until timeout for monitored process [2022-11-16 10:56:20,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:56:20,910 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-16 10:56:20,914 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 10:56:20,922 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-16 10:56:20,940 WARN L855 $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-16 10:56:20,996 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-16 10:56:20,997 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-16 10:56:21,006 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-16 10:56:21,006 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 10:56:21,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1866952644] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 10:56:21,146 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 10:56:21,146 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 6 [2022-11-16 10:56:21,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575144146] [2022-11-16 10:56:21,146 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 10:56:21,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 10:56:21,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 10:56:21,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 10:56:21,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=15, Unknown=3, NotChecked=24, Total=56 [2022-11-16 10:56:21,148 INFO L87 Difference]: Start difference. First operand 204 states and 241 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-16 10:56:23,359 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (= (store |c_old(#valid)| nondet_tree_~n~0.base (_ bv1 1)) |c_#valid|)) (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-16 10:56:23,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 10:56:23,667 INFO L93 Difference]: Finished difference Result 210 states and 249 transitions. [2022-11-16 10:56:23,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 10:56:23,669 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-16 10:56:23,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 10:56:23,671 INFO L225 Difference]: With dead ends: 210 [2022-11-16 10:56:23,671 INFO L226 Difference]: Without dead ends: 210 [2022-11-16 10:56:23,671 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 60 SyntacticMatches, 4 SemanticMatches, 8 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=20, Invalid=21, Unknown=5, NotChecked=44, Total=90 [2022-11-16 10:56:23,672 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 92 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 862 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 597 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-16 10:56:23,672 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 206 Invalid, 862 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 248 Invalid, 0 Unknown, 597 Unchecked, 0.5s Time] [2022-11-16 10:56:23,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2022-11-16 10:56:23,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 208. [2022-11-16 10:56:23,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 113 states have (on average 1.584070796460177) internal successors, (179), 164 states have internal predecessors, (179), 31 states have call successors, (31), 9 states have call predecessors, (31), 11 states have return successors, (39), 34 states have call predecessors, (39), 31 states have call successors, (39) [2022-11-16 10:56:23,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 249 transitions. [2022-11-16 10:56:23,682 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 249 transitions. Word has length 29 [2022-11-16 10:56:23,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 10:56:23,696 INFO L495 AbstractCegarLoop]: Abstraction has 208 states and 249 transitions. [2022-11-16 10:56:23,696 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-16 10:56:23,696 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 249 transitions. [2022-11-16 10:56:23,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-16 10:56:23,701 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 10:56:23,701 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 10:56:23,711 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (9)] Forceful destruction successful, exit code 0 [2022-11-16 10:56:23,922 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/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-16 10:56:24,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/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-16 10:56:24,105 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting nondet_treeErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [nondet_treeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2022-11-16 10:56:24,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:56:24,106 INFO L85 PathProgramCache]: Analyzing trace with hash 1070284721, now seen corresponding path program 1 times [2022-11-16 10:56:24,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 10:56:24,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [62642634] [2022-11-16 10:56:24,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:56:24,107 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-16 10:56:24,107 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 10:56:24,107 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/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-16 10:56:24,109 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/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-16 10:56:24,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:56:24,288 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-16 10:56:24,290 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 10:56:24,301 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-16 10:56:24,308 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-16 10:56:24,379 WARN L855 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_227 (_ BitVec 32))) (= (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_227) |c_#length|)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-16 10:56:24,434 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_227 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)) (= (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_227) |c_#length|))) is different from true [2022-11-16 10:56:24,527 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 10:56:24,529 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-16 10:56:24,541 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-16 10:56:24,542 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-16 10:56:24,561 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 8 not checked. [2022-11-16 10:56:24,561 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 10:56:26,826 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 10:56:26,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [62642634] [2022-11-16 10:56:26,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [62642634] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 10:56:26,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [803497018] [2022-11-16 10:56:26,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:56:26,826 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-16 10:56:26,827 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/cvc4 [2022-11-16 10:56:26,827 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-16 10:56:26,830 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (11)] Waiting until timeout for monitored process [2022-11-16 10:56:27,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:56:27,132 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-16 10:56:27,135 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 10:56:27,146 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-16 10:56:27,152 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-16 10:56:27,198 WARN L855 $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_279 (_ BitVec 32))) (= (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_279) |c_#length|)))) is different from true [2022-11-16 10:56:27,244 WARN L855 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32)) (v_ArrVal_279 (_ BitVec 32))) (and (= (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_279) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-16 10:56:27,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 10:56:27,323 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-16 10:56:27,340 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-16 10:56:27,340 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-16 10:56:27,347 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 8 not checked. [2022-11-16 10:56:27,347 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 10:56:27,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [803497018] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 10:56:27,561 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 10:56:27,561 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2022-11-16 10:56:27,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298807398] [2022-11-16 10:56:27,561 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 10:56:27,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-16 10:56:27,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 10:56:27,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-16 10:56:27,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=42, Unknown=4, NotChecked=60, Total=132 [2022-11-16 10:56:27,563 INFO L87 Difference]: Start difference. First operand 208 states and 249 transitions. Second operand has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) [2022-11-16 10:56:27,998 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_227 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)) (= (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_227) |c_#length|))) (exists ((nondet_tree_~n~0.base (_ BitVec 32)) (v_ArrVal_279 (_ BitVec 32))) (and (= (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_279) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base))))) is different from true [2022-11-16 10:56:28,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 10:56:28,547 INFO L93 Difference]: Finished difference Result 227 states and 281 transitions. [2022-11-16 10:56:28,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 10:56:28,548 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Word has length 25 [2022-11-16 10:56:28,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 10:56:28,550 INFO L225 Difference]: With dead ends: 227 [2022-11-16 10:56:28,550 INFO L226 Difference]: Without dead ends: 227 [2022-11-16 10:56:28,551 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=34, Invalid=53, Unknown=5, NotChecked=90, Total=182 [2022-11-16 10:56:28,551 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 185 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 439 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 1338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 439 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 848 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-16 10:56:28,551 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 225 Invalid, 1338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 439 Invalid, 0 Unknown, 848 Unchecked, 0.9s Time] [2022-11-16 10:56:28,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2022-11-16 10:56:28,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 224. [2022-11-16 10:56:28,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 124 states have (on average 1.532258064516129) internal successors, (190), 176 states have internal predecessors, (190), 34 states have call successors, (34), 10 states have call predecessors, (34), 13 states have return successors, (48), 37 states have call predecessors, (48), 34 states have call successors, (48) [2022-11-16 10:56:28,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 272 transitions. [2022-11-16 10:56:28,562 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 272 transitions. Word has length 25 [2022-11-16 10:56:28,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 10:56:28,562 INFO L495 AbstractCegarLoop]: Abstraction has 224 states and 272 transitions. [2022-11-16 10:56:28,562 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) [2022-11-16 10:56:28,562 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 272 transitions. [2022-11-16 10:56:28,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-16 10:56:28,569 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 10:56:28,569 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-16 10:56:28,575 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (11)] Forceful destruction successful, exit code 0 [2022-11-16 10:56:28,780 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/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-16 10:56:28,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/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-16 10:56:28,973 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting minErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [nondet_treeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2022-11-16 10:56:28,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:56:28,973 INFO L85 PathProgramCache]: Analyzing trace with hash -1668050227, now seen corresponding path program 1 times [2022-11-16 10:56:28,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 10:56:28,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1379292238] [2022-11-16 10:56:28,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:56:28,973 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-16 10:56:28,974 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 10:56:28,974 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/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-16 10:56:28,976 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/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-16 10:56:29,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:56:29,104 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-16 10:56:29,113 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 10:56:29,121 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-16 10:56:29,233 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-16 10:56:29,234 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 10:56:29,474 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-16 10:56:29,474 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 10:56:29,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1379292238] [2022-11-16 10:56:29,474 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1379292238] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 10:56:29,475 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 10:56:29,475 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2022-11-16 10:56:29,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629546090] [2022-11-16 10:56:29,475 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 10:56:29,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-16 10:56:29,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 10:56:29,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-16 10:56:29,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-11-16 10:56:29,477 INFO L87 Difference]: Start difference. First operand 224 states and 272 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-16 10:56:31,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 10:56:31,166 INFO L93 Difference]: Finished difference Result 244 states and 296 transitions. [2022-11-16 10:56:31,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-16 10:56:31,167 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-16 10:56:31,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 10:56:31,168 INFO L225 Difference]: With dead ends: 244 [2022-11-16 10:56:31,168 INFO L226 Difference]: Without dead ends: 244 [2022-11-16 10:56:31,169 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2022-11-16 10:56:31,169 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 162 mSDsluCounter, 501 mSDsCounter, 0 mSdLazyCounter, 1030 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 621 SdHoareTripleChecker+Invalid, 1138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1030 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 59 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-11-16 10:56:31,170 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 621 Invalid, 1138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 1030 Invalid, 0 Unknown, 59 Unchecked, 1.6s Time] [2022-11-16 10:56:31,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2022-11-16 10:56:31,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 236. [2022-11-16 10:56:31,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 135 states have (on average 1.5185185185185186) internal successors, (205), 185 states have internal predecessors, (205), 36 states have call successors, (36), 11 states have call predecessors, (36), 14 states have return successors, (50), 39 states have call predecessors, (50), 36 states have call successors, (50) [2022-11-16 10:56:31,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 291 transitions. [2022-11-16 10:56:31,190 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 291 transitions. Word has length 25 [2022-11-16 10:56:31,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 10:56:31,193 INFO L495 AbstractCegarLoop]: Abstraction has 236 states and 291 transitions. [2022-11-16 10:56:31,193 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-16 10:56:31,193 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 291 transitions. [2022-11-16 10:56:31,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-16 10:56:31,196 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 10:56:31,197 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-16 10:56:31,213 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/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-16 10:56:31,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/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-16 10:56:31,408 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting minErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [nondet_treeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2022-11-16 10:56:31,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:56:31,409 INFO L85 PathProgramCache]: Analyzing trace with hash -1668050226, now seen corresponding path program 1 times [2022-11-16 10:56:31,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 10:56:31,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [759599955] [2022-11-16 10:56:31,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:56:31,409 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-16 10:56:31,409 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 10:56:31,410 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/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-16 10:56:31,412 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/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-16 10:56:31,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:56:31,538 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 20 conjunts are in the unsatisfiable core [2022-11-16 10:56:31,540 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 10:56:31,550 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-16 10:56:31,774 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-16 10:56:31,774 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 10:56:33,121 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-16 10:56:33,121 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 10:56:33,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [759599955] [2022-11-16 10:56:33,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [759599955] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 10:56:33,122 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 10:56:33,122 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2022-11-16 10:56:33,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727877399] [2022-11-16 10:56:33,122 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 10:56:33,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-16 10:56:33,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 10:56:33,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-16 10:56:33,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2022-11-16 10:56:33,124 INFO L87 Difference]: Start difference. First operand 236 states and 291 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-16 10:56:38,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 10:56:38,676 INFO L93 Difference]: Finished difference Result 261 states and 327 transitions. [2022-11-16 10:56:38,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-16 10:56:38,677 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-16 10:56:38,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 10:56:38,679 INFO L225 Difference]: With dead ends: 261 [2022-11-16 10:56:38,679 INFO L226 Difference]: Without dead ends: 261 [2022-11-16 10:56:38,680 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=74, Invalid=388, Unknown=0, NotChecked=0, Total=462 [2022-11-16 10:56:38,680 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 161 mSDsluCounter, 565 mSDsCounter, 0 mSdLazyCounter, 1555 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 658 SdHoareTripleChecker+Invalid, 1640 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 1555 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 45 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2022-11-16 10:56:38,680 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 658 Invalid, 1640 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 1555 Invalid, 0 Unknown, 45 Unchecked, 5.2s Time] [2022-11-16 10:56:38,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2022-11-16 10:56:38,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 252. [2022-11-16 10:56:38,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 147 states have (on average 1.4965986394557824) internal successors, (220), 197 states have internal predecessors, (220), 39 states have call successors, (39), 12 states have call predecessors, (39), 15 states have return successors, (53), 42 states have call predecessors, (53), 39 states have call successors, (53) [2022-11-16 10:56:38,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 312 transitions. [2022-11-16 10:56:38,697 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 312 transitions. Word has length 25 [2022-11-16 10:56:38,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 10:56:38,698 INFO L495 AbstractCegarLoop]: Abstraction has 252 states and 312 transitions. [2022-11-16 10:56:38,698 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-16 10:56:38,698 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 312 transitions. [2022-11-16 10:56:38,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-16 10:56:38,702 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 10:56:38,702 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-16 10:56:38,719 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/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-16 10:56:38,914 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/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-16 10:56:38,914 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting tree_inorderErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [nondet_treeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2022-11-16 10:56:38,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:56:38,915 INFO L85 PathProgramCache]: Analyzing trace with hash 369889479, now seen corresponding path program 1 times [2022-11-16 10:56:38,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 10:56:38,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1245183231] [2022-11-16 10:56:38,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:56:38,915 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-16 10:56:38,915 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 10:56:38,917 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/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-16 10:56:38,919 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/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-16 10:56:39,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:56:39,017 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-16 10:56:39,019 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 10:56:39,053 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-16 10:56:39,053 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 10:56:39,053 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 10:56:39,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1245183231] [2022-11-16 10:56:39,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1245183231] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 10:56:39,054 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 10:56:39,055 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 10:56:39,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288200622] [2022-11-16 10:56:39,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 10:56:39,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 10:56:39,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 10:56:39,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 10:56:39,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 10:56:39,059 INFO L87 Difference]: Start difference. First operand 252 states and 312 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-16 10:56:39,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 10:56:39,089 INFO L93 Difference]: Finished difference Result 242 states and 293 transitions. [2022-11-16 10:56:39,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 10:56:39,089 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-16 10:56:39,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 10:56:39,091 INFO L225 Difference]: With dead ends: 242 [2022-11-16 10:56:39,091 INFO L226 Difference]: Without dead ends: 226 [2022-11-16 10:56:39,092 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-16 10:56:39,092 INFO L413 NwaCegarLoop]: 188 mSDtfsCounter, 0 mSDsluCounter, 556 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 744 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-16 10:56:39,093 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 744 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 10:56:39,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2022-11-16 10:56:39,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 226. [2022-11-16 10:56:39,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 130 states have (on average 1.5307692307692307) internal successors, (199), 181 states have internal predecessors, (199), 31 states have call successors, (31), 10 states have call predecessors, (31), 14 states have return successors, (47), 34 states have call predecessors, (47), 31 states have call successors, (47) [2022-11-16 10:56:39,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 277 transitions. [2022-11-16 10:56:39,110 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 277 transitions. Word has length 30 [2022-11-16 10:56:39,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 10:56:39,110 INFO L495 AbstractCegarLoop]: Abstraction has 226 states and 277 transitions. [2022-11-16 10:56:39,110 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-16 10:56:39,111 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 277 transitions. [2022-11-16 10:56:39,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-16 10:56:39,111 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 10:56:39,112 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-16 10:56:39,123 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/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-16 10:56:39,322 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/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-16 10:56:39,323 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting sizeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [nondet_treeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2022-11-16 10:56:39,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:56:39,323 INFO L85 PathProgramCache]: Analyzing trace with hash -648076771, now seen corresponding path program 1 times [2022-11-16 10:56:39,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 10:56:39,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1271171864] [2022-11-16 10:56:39,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:56:39,324 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-16 10:56:39,324 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 10:56:39,326 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/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-16 10:56:39,335 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/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-16 10:56:39,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:56:39,448 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-16 10:56:39,449 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 10:56:39,528 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-16 10:56:39,528 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 10:56:39,528 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 10:56:39,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1271171864] [2022-11-16 10:56:39,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1271171864] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 10:56:39,529 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 10:56:39,529 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-16 10:56:39,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441011097] [2022-11-16 10:56:39,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 10:56:39,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-16 10:56:39,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 10:56:39,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-16 10:56:39,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-16 10:56:39,530 INFO L87 Difference]: Start difference. First operand 226 states and 277 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-16 10:56:39,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 10:56:39,898 INFO L93 Difference]: Finished difference Result 232 states and 286 transitions. [2022-11-16 10:56:39,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 10:56:39,899 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-16 10:56:39,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 10:56:39,900 INFO L225 Difference]: With dead ends: 232 [2022-11-16 10:56:39,900 INFO L226 Difference]: Without dead ends: 228 [2022-11-16 10:56:39,900 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-16 10:56:39,901 INFO L413 NwaCegarLoop]: 171 mSDtfsCounter, 109 mSDsluCounter, 846 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 1017 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 10:56:39,901 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 1017 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-16 10:56:39,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2022-11-16 10:56:39,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 226. [2022-11-16 10:56:39,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 130 states have (on average 1.5153846153846153) internal successors, (197), 181 states have internal predecessors, (197), 31 states have call successors, (31), 10 states have call predecessors, (31), 14 states have return successors, (47), 34 states have call predecessors, (47), 31 states have call successors, (47) [2022-11-16 10:56:39,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 275 transitions. [2022-11-16 10:56:39,910 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 275 transitions. Word has length 31 [2022-11-16 10:56:39,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 10:56:39,911 INFO L495 AbstractCegarLoop]: Abstraction has 226 states and 275 transitions. [2022-11-16 10:56:39,911 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-16 10:56:39,911 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 275 transitions. [2022-11-16 10:56:39,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-16 10:56:39,912 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 10:56:39,912 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-16 10:56:39,930 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/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)] Forceful destruction successful, exit code 0 [2022-11-16 10:56:40,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/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-16 10:56:40,124 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting minErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [nondet_treeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2022-11-16 10:56:40,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:56:40,124 INFO L85 PathProgramCache]: Analyzing trace with hash -2088825952, now seen corresponding path program 1 times [2022-11-16 10:56:40,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 10:56:40,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1926727836] [2022-11-16 10:56:40,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:56:40,125 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-16 10:56:40,125 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 10:56:40,129 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/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-16 10:56:40,130 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/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-16 10:56:40,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:56:40,285 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 38 conjunts are in the unsatisfiable core [2022-11-16 10:56:40,290 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 10:56:40,351 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-16 10:56:40,357 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-16 10:56:40,444 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-16 10:56:40,452 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-16 10:56:40,692 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-16 10:56:40,698 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-16 10:56:40,798 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-16 10:56:40,798 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 10:56:42,777 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-16 10:56:42,777 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 10:56:42,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1926727836] [2022-11-16 10:56:42,777 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1926727836] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 10:56:42,777 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 10:56:42,777 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 23 [2022-11-16 10:56:42,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392212413] [2022-11-16 10:56:42,778 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 10:56:42,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-16 10:56:42,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 10:56:42,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-16 10:56:42,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=453, Unknown=0, NotChecked=0, Total=506 [2022-11-16 10:56:42,780 INFO L87 Difference]: Start difference. First operand 226 states and 275 transitions. Second operand has 23 states, 20 states have (on average 1.95) internal successors, (39), 16 states have internal predecessors, (39), 7 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-16 10:56:44,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 10:56:44,649 INFO L93 Difference]: Finished difference Result 248 states and 303 transitions. [2022-11-16 10:56:44,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-16 10:56:44,650 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 20 states have (on average 1.95) internal successors, (39), 16 states have internal predecessors, (39), 7 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 31 [2022-11-16 10:56:44,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 10:56:44,651 INFO L225 Difference]: With dead ends: 248 [2022-11-16 10:56:44,652 INFO L226 Difference]: Without dead ends: 248 [2022-11-16 10:56:44,652 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=101, Invalid=829, Unknown=0, NotChecked=0, Total=930 [2022-11-16 10:56:44,653 INFO L413 NwaCegarLoop]: 189 mSDtfsCounter, 90 mSDsluCounter, 2335 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 2524 SdHoareTripleChecker+Invalid, 599 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 106 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-16 10:56:44,653 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 2524 Invalid, 599 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 464 Invalid, 0 Unknown, 106 Unchecked, 1.3s Time] [2022-11-16 10:56:44,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2022-11-16 10:56:44,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 236. [2022-11-16 10:56:44,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 137 states have (on average 1.5036496350364963) internal successors, (206), 188 states have internal predecessors, (206), 31 states have call successors, (31), 13 states have call predecessors, (31), 17 states have return successors, (47), 34 states have call predecessors, (47), 31 states have call successors, (47) [2022-11-16 10:56:44,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 284 transitions. [2022-11-16 10:56:44,664 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 284 transitions. Word has length 31 [2022-11-16 10:56:44,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 10:56:44,664 INFO L495 AbstractCegarLoop]: Abstraction has 236 states and 284 transitions. [2022-11-16 10:56:44,665 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 20 states have (on average 1.95) internal successors, (39), 16 states have internal predecessors, (39), 7 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-16 10:56:44,665 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 284 transitions. [2022-11-16 10:56:44,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-16 10:56:44,666 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 10:56:44,666 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1] [2022-11-16 10:56:44,683 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/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-16 10:56:44,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/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-16 10:56:44,879 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting nondet_treeErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [nondet_treeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2022-11-16 10:56:44,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:56:44,879 INFO L85 PathProgramCache]: Analyzing trace with hash 1361134830, now seen corresponding path program 1 times [2022-11-16 10:56:44,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 10:56:44,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [10691893] [2022-11-16 10:56:44,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:56:44,880 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-16 10:56:44,880 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 10:56:44,882 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/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-16 10:56:44,926 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/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-16 10:56:45,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:56:45,254 INFO L263 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 20 conjunts are in the unsatisfiable core [2022-11-16 10:56:45,257 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 10:56:45,267 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-16 10:56:45,277 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-16 10:56:45,399 WARN L855 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_530 (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_530))) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-16 10:56:45,440 WARN L855 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32)) (v_ArrVal_530 (_ BitVec 32))) (and (= |c_#length| (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_530)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-16 10:56:45,507 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 10:56:45,508 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-16 10:56:45,521 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-16 10:56:45,522 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-16 10:56:45,542 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 60 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 13 not checked. [2022-11-16 10:56:45,543 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 10:56:47,839 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 10:56:47,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [10691893] [2022-11-16 10:56:47,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [10691893] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 10:56:47,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1404351295] [2022-11-16 10:56:47,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:56:47,840 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-16 10:56:47,840 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/cvc4 [2022-11-16 10:56:47,841 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-16 10:56:47,843 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (18)] Waiting until timeout for monitored process [2022-11-16 10:56:48,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:56:48,350 INFO L263 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 20 conjunts are in the unsatisfiable core [2022-11-16 10:56:48,353 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 10:56:48,361 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-16 10:56:48,367 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-16 10:56:48,455 WARN L855 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_634 (_ BitVec 32))) (= (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_634) |c_#length|)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-16 10:56:48,490 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_634 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32))) (and (= (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_634) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-16 10:56:48,570 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 10:56:48,571 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-16 10:56:48,586 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-16 10:56:48,587 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-16 10:56:48,591 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 60 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 13 not checked. [2022-11-16 10:56:48,591 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 10:56:48,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1404351295] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 10:56:48,795 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 10:56:48,795 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2022-11-16 10:56:48,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424873496] [2022-11-16 10:56:48,795 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 10:56:48,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-16 10:56:48,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 10:56:48,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-16 10:56:48,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=42, Unknown=4, NotChecked=60, Total=132 [2022-11-16 10:56:48,797 INFO L87 Difference]: Start difference. First operand 236 states and 284 transitions. Second operand has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 6 states have call successors, (9), 3 states have call predecessors, (9), 5 states have return successors, (8), 5 states have call predecessors, (8), 6 states have call successors, (8) [2022-11-16 10:56:48,899 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_634 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32))) (and (= (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_634) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) (exists ((nondet_tree_~n~0.base (_ BitVec 32)) (v_ArrVal_530 (_ BitVec 32))) (and (= |c_#length| (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_530)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base))))) is different from true [2022-11-16 10:56:49,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 10:56:49,721 INFO L93 Difference]: Finished difference Result 241 states and 295 transitions. [2022-11-16 10:56:49,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 10:56:49,721 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 6 states have call successors, (9), 3 states have call predecessors, (9), 5 states have return successors, (8), 5 states have call predecessors, (8), 6 states have call successors, (8) Word has length 51 [2022-11-16 10:56:49,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 10:56:49,724 INFO L225 Difference]: With dead ends: 241 [2022-11-16 10:56:49,724 INFO L226 Difference]: Without dead ends: 241 [2022-11-16 10:56:49,724 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 95 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=34, Invalid=53, Unknown=5, NotChecked=90, Total=182 [2022-11-16 10:56:49,725 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 177 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 1253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 788 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-16 10:56:49,725 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 217 Invalid, 1253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 420 Invalid, 0 Unknown, 788 Unchecked, 0.8s Time] [2022-11-16 10:56:49,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2022-11-16 10:56:49,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 237. [2022-11-16 10:56:49,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 138 states have (on average 1.5072463768115942) internal successors, (208), 188 states have internal predecessors, (208), 31 states have call successors, (31), 13 states have call predecessors, (31), 17 states have return successors, (47), 35 states have call predecessors, (47), 31 states have call successors, (47) [2022-11-16 10:56:49,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 286 transitions. [2022-11-16 10:56:49,735 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 286 transitions. Word has length 51 [2022-11-16 10:56:49,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 10:56:49,736 INFO L495 AbstractCegarLoop]: Abstraction has 237 states and 286 transitions. [2022-11-16 10:56:49,736 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 6 states have call successors, (9), 3 states have call predecessors, (9), 5 states have return successors, (8), 5 states have call predecessors, (8), 6 states have call successors, (8) [2022-11-16 10:56:49,736 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 286 transitions. [2022-11-16 10:56:49,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-16 10:56:49,737 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 10:56:49,737 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1] [2022-11-16 10:56:49,746 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (18)] Forceful destruction successful, exit code 0 [2022-11-16 10:56:49,959 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/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-16 10:56:50,141 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/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-16 10:56:50,142 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting nondet_treeErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [nondet_treeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2022-11-16 10:56:50,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:56:50,142 INFO L85 PathProgramCache]: Analyzing trace with hash -931523585, now seen corresponding path program 1 times [2022-11-16 10:56:50,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 10:56:50,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [965768585] [2022-11-16 10:56:50,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:56:50,143 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-16 10:56:50,143 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 10:56:50,144 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/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-16 10:56:50,150 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/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-16 10:56:50,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:56:50,473 INFO L263 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-16 10:56:50,475 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 10:56:50,485 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-16 10:56:50,532 WARN L855 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_731 (_ BitVec 1))) (= |c_#valid| (store |c_old(#valid)| nondet_tree_~n~0.base v_ArrVal_731))) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-16 10:56:50,565 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_731 (_ BitVec 1)) (nondet_tree_~n~0.base (_ BitVec 32))) (and (= |c_#valid| (store |c_old(#valid)| nondet_tree_~n~0.base v_ArrVal_731)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-16 10:56:50,645 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-16 10:56:50,645 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-16 10:56:50,650 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 13 not checked. [2022-11-16 10:56:50,651 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 10:56:50,781 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 10:56:50,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [965768585] [2022-11-16 10:56:50,782 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [965768585] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 10:56:50,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1149376150] [2022-11-16 10:56:50,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:56:50,782 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-16 10:56:50,783 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/cvc4 [2022-11-16 10:56:50,784 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-16 10:56:50,811 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (20)] Waiting until timeout for monitored process [2022-11-16 10:56:51,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:56:51,347 INFO L263 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-16 10:56:51,351 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 10:56:51,366 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-16 10:56:51,413 WARN L855 $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-16 10:56:51,496 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-16 10:56:51,496 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-16 10:56:51,511 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 13 not checked. [2022-11-16 10:56:51,511 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 10:56:51,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1149376150] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 10:56:51,707 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 10:56:51,707 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 6 [2022-11-16 10:56:51,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507131257] [2022-11-16 10:56:51,707 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 10:56:51,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 10:56:51,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 10:56:51,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 10:56:51,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=15, Unknown=3, NotChecked=24, Total=56 [2022-11-16 10:56:51,709 INFO L87 Difference]: Start difference. First operand 237 states and 286 transitions. Second operand has 7 states, 6 states have (on average 5.5) internal successors, (33), 7 states have internal predecessors, (33), 5 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) [2022-11-16 10:56:53,774 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (= (store |c_old(#valid)| nondet_tree_~n~0.base (_ bv1 1)) |c_#valid|)) (exists ((v_ArrVal_731 (_ BitVec 1)) (nondet_tree_~n~0.base (_ BitVec 32))) (and (= |c_#valid| (store |c_old(#valid)| nondet_tree_~n~0.base v_ArrVal_731)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base))))) is different from true [2022-11-16 10:56:54,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 10:56:54,243 INFO L93 Difference]: Finished difference Result 240 states and 294 transitions. [2022-11-16 10:56:54,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 10:56:54,244 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.5) internal successors, (33), 7 states have internal predecessors, (33), 5 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) Word has length 45 [2022-11-16 10:56:54,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 10:56:54,245 INFO L225 Difference]: With dead ends: 240 [2022-11-16 10:56:54,245 INFO L226 Difference]: Without dead ends: 240 [2022-11-16 10:56:54,245 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 93 SyntacticMatches, 5 SemanticMatches, 8 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=20, Invalid=21, Unknown=5, NotChecked=44, Total=90 [2022-11-16 10:56:54,246 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 89 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 855 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 599 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-16 10:56:54,246 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 211 Invalid, 855 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 241 Invalid, 0 Unknown, 599 Unchecked, 0.5s Time] [2022-11-16 10:56:54,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2022-11-16 10:56:54,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 236. [2022-11-16 10:56:54,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 137 states have (on average 1.5036496350364963) internal successors, (206), 188 states have internal predecessors, (206), 31 states have call successors, (31), 13 states have call predecessors, (31), 17 states have return successors, (47), 34 states have call predecessors, (47), 31 states have call successors, (47) [2022-11-16 10:56:54,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 284 transitions. [2022-11-16 10:56:54,255 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 284 transitions. Word has length 45 [2022-11-16 10:56:54,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 10:56:54,255 INFO L495 AbstractCegarLoop]: Abstraction has 236 states and 284 transitions. [2022-11-16 10:56:54,256 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.5) internal successors, (33), 7 states have internal predecessors, (33), 5 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) [2022-11-16 10:56:54,256 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 284 transitions. [2022-11-16 10:56:54,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-16 10:56:54,256 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 10:56:54,257 INFO L195 NwaCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2022-11-16 10:56:54,279 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Ended with exit code 0 [2022-11-16 10:56:54,461 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (20)] Forceful destruction successful, exit code 0 [2022-11-16 10:56:54,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/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,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt [2022-11-16 10:56:54,657 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting nondet_treeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [nondet_treeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2022-11-16 10:56:54,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:56:54,658 INFO L85 PathProgramCache]: Analyzing trace with hash -189298012, now seen corresponding path program 2 times [2022-11-16 10:56:54,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 10:56:54,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1312621445] [2022-11-16 10:56:54,659 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 10:56:54,659 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-16 10:56:54,659 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 10:56:54,660 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/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-16 10:56:54,662 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/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-16 10:56:54,930 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 10:56:54,930 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 10:56:54,938 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-16 10:56:54,941 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 10:56:54,944 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-16 10:56:54,972 WARN L855 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_906 (_ BitVec 1))) (= (store |c_old(#valid)| nondet_tree_~n~0.base v_ArrVal_906) |c_#valid|)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-16 10:56:54,995 WARN L855 $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-16 10:56:55,157 INFO L321 Elim1Store]: treesize reduction 52, result has 30.7 percent of original size [2022-11-16 10:56:55,157 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 4 case distinctions, treesize of input 22 treesize of output 38 [2022-11-16 10:56:55,177 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 16 trivial. 23 not checked. [2022-11-16 10:56:55,177 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 10:56:56,865 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 10:56:56,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1312621445] [2022-11-16 10:56:56,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1312621445] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 10:56:56,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1498978867] [2022-11-16 10:56:56,866 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 10:56:56,866 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-16 10:56:56,866 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/cvc4 [2022-11-16 10:56:56,871 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-16 10:56:56,875 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (22)] Waiting until timeout for monitored process [2022-11-16 10:56:57,194 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-16 10:56:57,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2038899818] [2022-11-16 10:56:57,194 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 10:56:57,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 10:56:57,199 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (22)] Ended with exit code 1 [2022-11-16 10:56:57,199 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 10:56:57,201 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 10:56:57,202 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-11-16 10:56:57,412 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 10:56:57,412 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 10:56:57,417 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-16 10:56:57,419 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 10:56:57,423 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-16 10:56:57,438 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1063 (_ BitVec 1))) (= (store |c_old(#valid)| c_nondet_tree_~n~0.base v_ArrVal_1063) |c_#valid|)) is different from true [2022-11-16 10:56:57,451 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1064 (_ BitVec 1))) (= |c_#valid| (store |c_old(#valid)| c_nondet_tree_~n~0.base v_ArrVal_1064))) is different from true [2022-11-16 10:57:04,233 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1063 (_ BitVec 1)) (nondet_tree_~n~0.base (_ BitVec 32)) (v_nondet_tree_~n~0.base_66 (_ BitVec 32))) (let ((.cse0 (store (store |c_old(#valid)| nondet_tree_~n~0.base v_ArrVal_1063) v_nondet_tree_~n~0.base_66 (_ bv1 1)))) (and (= (_ bv0 1) (bvadd (select .cse0 nondet_tree_~n~0.base) (_ bv1 1))) (= .cse0 |c_#valid|)))) is different from true [2022-11-16 10:57:04,300 INFO L321 Elim1Store]: treesize reduction 46, result has 29.2 percent of original size [2022-11-16 10:57:04,300 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 2 case distinctions, treesize of input 31 treesize of output 45 [2022-11-16 10:57:04,313 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 5 proven. 8 refuted. 1 times theorem prover too weak. 16 trivial. 21 not checked. [2022-11-16 10:57:04,313 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 10:57:04,507 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2038899818] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 10:57:04,507 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 10:57:04,508 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9] total 12 [2022-11-16 10:57:04,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905115537] [2022-11-16 10:57:04,508 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 10:57:04,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-16 10:57:04,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 10:57:04,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-16 10:57:04,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=52, Unknown=8, NotChecked=90, Total=182 [2022-11-16 10:57:04,509 INFO L87 Difference]: Start difference. First operand 236 states and 284 transitions. Second operand has 13 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 states have internal predecessors, (40), 9 states have call successors, (10), 2 states have call predecessors, (10), 5 states have return successors, (10), 7 states have call predecessors, (10), 8 states have call successors, (10) [2022-11-16 10:57:08,589 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (= (store |c_old(#valid)| nondet_tree_~n~0.base (_ bv1 1)) |c_#valid|)) (exists ((v_ArrVal_1064 (_ BitVec 1))) (= |c_#valid| (store |c_old(#valid)| c_nondet_tree_~n~0.base v_ArrVal_1064)))) is different from true [2022-11-16 10:57:12,633 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (= (bvadd (select |c_#valid| nondet_tree_~n~0.base) (_ bv1 1)) (_ bv0 1)) (exists ((v_ArrVal_1064 (_ BitVec 1))) (= |c_#valid| (store |c_old(#valid)| nondet_tree_~n~0.base v_ArrVal_1064))))) (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (= (store |c_old(#valid)| nondet_tree_~n~0.base (_ bv1 1)) |c_#valid|)) (exists ((v_ArrVal_1063 (_ BitVec 1)) (nondet_tree_~n~0.base (_ BitVec 32)) (v_nondet_tree_~n~0.base_66 (_ BitVec 32))) (let ((.cse0 (store (store |c_old(#valid)| nondet_tree_~n~0.base v_ArrVal_1063) v_nondet_tree_~n~0.base_66 (_ bv1 1)))) (and (= (_ bv0 1) (bvadd (select .cse0 nondet_tree_~n~0.base) (_ bv1 1))) (= .cse0 |c_#valid|))))) is different from true [2022-11-16 10:57:15,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 10:57:15,220 INFO L93 Difference]: Finished difference Result 242 states and 296 transitions. [2022-11-16 10:57:15,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-16 10:57:15,221 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 states have internal predecessors, (40), 9 states have call successors, (10), 2 states have call predecessors, (10), 5 states have return successors, (10), 7 states have call predecessors, (10), 8 states have call successors, (10) Word has length 39 [2022-11-16 10:57:15,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 10:57:15,223 INFO L225 Difference]: With dead ends: 242 [2022-11-16 10:57:15,223 INFO L226 Difference]: Without dead ends: 242 [2022-11-16 10:57:15,223 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 72 SyntacticMatches, 11 SemanticMatches, 16 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 18.5s TimeCoverageRelationStatistics Valid=52, Invalid=75, Unknown=11, NotChecked=168, Total=306 [2022-11-16 10:57:15,224 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 93 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 1383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1132 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-16 10:57:15,224 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 328 Invalid, 1383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 236 Invalid, 0 Unknown, 1132 Unchecked, 0.5s Time] [2022-11-16 10:57:15,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2022-11-16 10:57:15,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 241. [2022-11-16 10:57:15,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 141 states have (on average 1.49645390070922) internal successors, (211), 191 states have internal predecessors, (211), 31 states have call successors, (31), 13 states have call predecessors, (31), 18 states have return successors, (54), 36 states have call predecessors, (54), 31 states have call successors, (54) [2022-11-16 10:57:15,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 296 transitions. [2022-11-16 10:57:15,233 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 296 transitions. Word has length 39 [2022-11-16 10:57:15,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 10:57:15,234 INFO L495 AbstractCegarLoop]: Abstraction has 241 states and 296 transitions. [2022-11-16 10:57:15,234 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 states have internal predecessors, (40), 9 states have call successors, (10), 2 states have call predecessors, (10), 5 states have return successors, (10), 7 states have call predecessors, (10), 8 states have call successors, (10) [2022-11-16 10:57:15,234 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 296 transitions. [2022-11-16 10:57:15,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-16 10:57:15,235 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 10:57:15,235 INFO L195 NwaCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2022-11-16 10:57:15,243 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-11-16 10:57:15,451 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/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-16 10:57:15,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/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-16 10:57:15,643 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting nondet_treeErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [nondet_treeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2022-11-16 10:57:15,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:57:15,643 INFO L85 PathProgramCache]: Analyzing trace with hash -189298011, now seen corresponding path program 2 times [2022-11-16 10:57:15,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 10:57:15,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [939554021] [2022-11-16 10:57:15,644 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 10:57:15,644 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-16 10:57:15,644 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 10:57:15,645 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/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-16 10:57:15,651 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/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-16 10:57:15,878 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 10:57:15,878 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 10:57:15,887 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 22 conjunts are in the unsatisfiable core [2022-11-16 10:57:15,889 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 10:57:15,895 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-16 10:57:15,905 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-16 10:57:15,967 WARN L855 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_1149 (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_1149))) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-16 10:57:16,000 WARN L855 $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-16 10:57:16,061 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1149 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32)) (v_nondet_tree_~n~0.base_77 (_ BitVec 32))) (and (= |c_#length| (store (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_1149) v_nondet_tree_~n~0.base_77 (_ bv12 32))) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-16 10:57:16,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 10:57:16,183 INFO L321 Elim1Store]: treesize reduction 24, result has 38.5 percent of original size [2022-11-16 10:57:16,183 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-16 10:57:16,203 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-16 10:57:16,203 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-16 10:57:16,238 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 30 not checked. [2022-11-16 10:57:16,238 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 10:57:16,648 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 10:57:16,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [939554021] [2022-11-16 10:57:16,648 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [939554021] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 10:57:16,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [819242469] [2022-11-16 10:57:16,649 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 10:57:16,649 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-16 10:57:16,649 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/cvc4 [2022-11-16 10:57:16,650 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-16 10:57:16,655 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (25)] Waiting until timeout for monitored process [2022-11-16 10:57:17,024 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 10:57:17,024 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 10:57:17,030 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 22 conjunts are in the unsatisfiable core [2022-11-16 10:57:17,032 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 10:57:17,040 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-16 10:57:17,046 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-16 10:57:17,104 WARN L855 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_1232 (_ BitVec 32))) (= (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_1232) |c_#length|)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-16 10:57:17,191 WARN L855 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32)) (v_nondet_tree_~n~0.base_88 (_ BitVec 32)) (v_ArrVal_1232 (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| v_nondet_tree_~n~0.base_88)) (= (store (store |c_old(#length)| v_nondet_tree_~n~0.base_88 v_ArrVal_1232) nondet_tree_~n~0.base (_ bv12 32)) |c_#length|))) is different from true [2022-11-16 10:57:17,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 10:57:17,290 INFO L321 Elim1Store]: treesize reduction 24, result has 38.5 percent of original size [2022-11-16 10:57:17,291 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-16 10:57:17,307 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-16 10:57:17,308 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-16 10:57:17,326 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 30 not checked. [2022-11-16 10:57:17,326 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 10:57:20,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [819242469] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 10:57:20,002 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 10:57:20,002 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2022-11-16 10:57:20,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797023979] [2022-11-16 10:57:20,002 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 10:57:20,003 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-16 10:57:20,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 10:57:20,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-16 10:57:20,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=43, Unknown=5, NotChecked=80, Total=156 [2022-11-16 10:57:20,004 INFO L87 Difference]: Start difference. First operand 241 states and 296 transitions. Second operand has 11 states, 10 states have (on average 3.2) internal successors, (32), 9 states have internal predecessors, (32), 7 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 4 states have call predecessors, (8), 6 states have call successors, (8) [2022-11-16 10:57:20,623 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1149 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32)) (v_nondet_tree_~n~0.base_77 (_ BitVec 32))) (and (= |c_#length| (store (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_1149) v_nondet_tree_~n~0.base_77 (_ bv12 32))) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) (exists ((nondet_tree_~n~0.base (_ BitVec 32)) (v_nondet_tree_~n~0.base_88 (_ BitVec 32)) (v_ArrVal_1232 (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| v_nondet_tree_~n~0.base_88)) (= (store (store |c_old(#length)| v_nondet_tree_~n~0.base_88 v_ArrVal_1232) nondet_tree_~n~0.base (_ bv12 32)) |c_#length|)))) is different from true [2022-11-16 10:57:20,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 10:57:20,879 INFO L93 Difference]: Finished difference Result 254 states and 319 transitions. [2022-11-16 10:57:20,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 10:57:20,880 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.2) internal successors, (32), 9 states have internal predecessors, (32), 7 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 4 states have call predecessors, (8), 6 states have call successors, (8) Word has length 39 [2022-11-16 10:57:20,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 10:57:20,881 INFO L225 Difference]: With dead ends: 254 [2022-11-16 10:57:20,881 INFO L226 Difference]: Without dead ends: 254 [2022-11-16 10:57:20,882 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 69 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=43, Invalid=63, Unknown=8, NotChecked=126, Total=240 [2022-11-16 10:57:20,882 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 96 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 1368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1044 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-16 10:57:20,883 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 215 Invalid, 1368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 306 Invalid, 0 Unknown, 1044 Unchecked, 0.7s Time] [2022-11-16 10:57:20,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2022-11-16 10:57:20,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 254. [2022-11-16 10:57:20,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 150 states have (on average 1.46) internal successors, (219), 202 states have internal predecessors, (219), 34 states have call successors, (34), 13 states have call predecessors, (34), 19 states have return successors, (66), 38 states have call predecessors, (66), 34 states have call successors, (66) [2022-11-16 10:57:20,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 319 transitions. [2022-11-16 10:57:20,892 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 319 transitions. Word has length 39 [2022-11-16 10:57:20,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 10:57:20,892 INFO L495 AbstractCegarLoop]: Abstraction has 254 states and 319 transitions. [2022-11-16 10:57:20,893 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.2) internal successors, (32), 9 states have internal predecessors, (32), 7 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 4 states have call predecessors, (8), 6 states have call successors, (8) [2022-11-16 10:57:20,893 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 319 transitions. [2022-11-16 10:57:20,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-16 10:57:20,894 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 10:57:20,894 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-16 10:57:20,903 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (25)] Forceful destruction successful, exit code 0 [2022-11-16 10:57:21,116 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/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-16 10:57:21,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt,24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/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-16 10:57:21,299 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting minErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [nondet_treeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2022-11-16 10:57:21,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:57:21,299 INFO L85 PathProgramCache]: Analyzing trace with hash -2047148606, now seen corresponding path program 2 times [2022-11-16 10:57:21,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 10:57:21,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1245755922] [2022-11-16 10:57:21,300 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 10:57:21,300 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-16 10:57:21,300 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 10:57:21,302 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/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-16 10:57:21,308 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/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-16 10:57:21,520 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 10:57:21,520 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 10:57:21,528 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-16 10:57:21,529 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 10:57:21,749 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 21 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-16 10:57:21,749 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 10:57:22,579 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-16 10:57:22,766 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 21 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-16 10:57:22,767 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 10:57:22,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1245755922] [2022-11-16 10:57:22,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1245755922] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 10:57:22,767 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 10:57:22,767 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2022-11-16 10:57:22,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370750267] [2022-11-16 10:57:22,767 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 10:57:22,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-16 10:57:22,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 10:57:22,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-16 10:57:22,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2022-11-16 10:57:22,769 INFO L87 Difference]: Start difference. First operand 254 states and 319 transitions. Second operand has 18 states, 15 states have (on average 2.6) internal successors, (39), 14 states have internal predecessors, (39), 7 states have call successors, (9), 5 states have call predecessors, (9), 5 states have return successors, (8), 7 states have call predecessors, (8), 5 states have call successors, (8) [2022-11-16 10:57:25,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 10:57:25,702 INFO L93 Difference]: Finished difference Result 261 states and 326 transitions. [2022-11-16 10:57:25,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-16 10:57:25,703 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 15 states have (on average 2.6) internal successors, (39), 14 states have internal predecessors, (39), 7 states have call successors, (9), 5 states have call predecessors, (9), 5 states have return successors, (8), 7 states have call predecessors, (8), 5 states have call successors, (8) Word has length 39 [2022-11-16 10:57:25,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 10:57:25,705 INFO L225 Difference]: With dead ends: 261 [2022-11-16 10:57:25,705 INFO L226 Difference]: Without dead ends: 261 [2022-11-16 10:57:25,705 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=68, Invalid=394, Unknown=0, NotChecked=0, Total=462 [2022-11-16 10:57:25,706 INFO L413 NwaCegarLoop]: 181 mSDtfsCounter, 66 mSDsluCounter, 1351 mSDsCounter, 0 mSdLazyCounter, 679 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 1532 SdHoareTripleChecker+Invalid, 862 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 679 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 164 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-11-16 10:57:25,706 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 1532 Invalid, 862 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 679 Invalid, 0 Unknown, 164 Unchecked, 2.6s Time] [2022-11-16 10:57:25,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2022-11-16 10:57:25,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 257. [2022-11-16 10:57:25,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 152 states have (on average 1.4473684210526316) internal successors, (220), 204 states have internal predecessors, (220), 34 states have call successors, (34), 14 states have call predecessors, (34), 20 states have return successors, (66), 38 states have call predecessors, (66), 34 states have call successors, (66) [2022-11-16 10:57:25,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 320 transitions. [2022-11-16 10:57:25,717 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 320 transitions. Word has length 39 [2022-11-16 10:57:25,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 10:57:25,717 INFO L495 AbstractCegarLoop]: Abstraction has 257 states and 320 transitions. [2022-11-16 10:57:25,717 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 15 states have (on average 2.6) internal successors, (39), 14 states have internal predecessors, (39), 7 states have call successors, (9), 5 states have call predecessors, (9), 5 states have return successors, (8), 7 states have call predecessors, (8), 5 states have call successors, (8) [2022-11-16 10:57:25,718 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 320 transitions. [2022-11-16 10:57:25,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-11-16 10:57:25,719 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 10:57:25,719 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2022-11-16 10:57:25,732 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/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-16 10:57:25,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/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-16 10:57:25,931 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting nondet_treeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [nondet_treeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2022-11-16 10:57:25,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:57:25,932 INFO L85 PathProgramCache]: Analyzing trace with hash -1831948676, now seen corresponding path program 3 times [2022-11-16 10:57:25,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 10:57:25,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [579535805] [2022-11-16 10:57:25,932 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-16 10:57:25,932 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-16 10:57:25,933 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 10:57:25,933 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/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-16 10:57:25,935 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/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-16 10:57:26,362 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-11-16 10:57:26,362 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 10:57:26,376 INFO L263 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-16 10:57:26,378 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 10:57:26,382 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-16 10:57:26,411 WARN L855 $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_1389 (_ BitVec 1))) (= |c_#valid| (store |c_old(#valid)| nondet_tree_~n~0.base v_ArrVal_1389))))) is different from true [2022-11-16 10:57:26,442 WARN L855 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32)) (v_ArrVal_1389 (_ BitVec 1))) (and (= |c_#valid| (store |c_old(#valid)| nondet_tree_~n~0.base v_ArrVal_1389)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-16 10:57:26,466 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1390 (_ BitVec 1))) (= (store |c_old(#valid)| c_nondet_tree_~n~0.base v_ArrVal_1390) |c_#valid|)) is different from true [2022-11-16 10:57:26,507 WARN L855 $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-16 10:57:28,640 INFO L321 Elim1Store]: treesize reduction 52, result has 30.7 percent of original size [2022-11-16 10:57:28,640 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 4 case distinctions, treesize of input 22 treesize of output 38 [2022-11-16 10:57:28,653 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 19 proven. 8 refuted. 0 times theorem prover too weak. 17 trivial. 22 not checked. [2022-11-16 10:57:28,653 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 10:57:30,851 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 10:57:30,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [579535805] [2022-11-16 10:57:30,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [579535805] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 10:57:30,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1104952379] [2022-11-16 10:57:30,852 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-16 10:57:30,852 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-16 10:57:30,852 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/cvc4 [2022-11-16 10:57:30,853 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-16 10:57:30,860 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (28)] Waiting until timeout for monitored process [2022-11-16 10:57:31,350 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-11-16 10:57:31,351 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 10:57:31,357 INFO L263 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-16 10:57:31,359 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 10:57:31,380 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1487 (_ BitVec 1))) (= (store |c_old(#valid)| c_nondet_tree_~n~0.base v_ArrVal_1487) |c_#valid|)) is different from true [2022-11-16 10:57:31,408 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1488 (_ BitVec 1))) (= |c_#valid| (store |c_old(#valid)| c_nondet_tree_~n~0.base v_ArrVal_1488))) is different from true [2022-11-16 10:57:31,506 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_nondet_tree_~n~0.base_120 (_ BitVec 32)) (v_ArrVal_1487 (_ BitVec 1))) (= |c_#valid| (store (store |c_old(#valid)| c_nondet_tree_~n~0.base v_ArrVal_1487) v_nondet_tree_~n~0.base_120 (_ bv1 1)))) is different from true [2022-11-16 10:57:33,610 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 10:57:33,647 INFO L321 Elim1Store]: treesize reduction 34, result has 35.8 percent of original size [2022-11-16 10:57:33,647 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 2 case distinctions, treesize of input 17 treesize of output 31 [2022-11-16 10:57:33,662 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 20 proven. 9 refuted. 0 times theorem prover too weak. 18 trivial. 19 not checked. [2022-11-16 10:57:33,662 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 10:57:33,973 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1104952379] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 10:57:33,973 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 10:57:33,974 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2022-11-16 10:57:33,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11991486] [2022-11-16 10:57:33,974 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 10:57:33,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-16 10:57:33,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 10:57:33,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-16 10:57:33,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=76, Unknown=11, NotChecked=168, Total=306 [2022-11-16 10:57:33,976 INFO L87 Difference]: Start difference. First operand 257 states and 320 transitions. Second operand has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 7 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (10), 7 states have call predecessors, (10), 6 states have call successors, (10) [2022-11-16 10:57:45,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 10:57:45,629 INFO L93 Difference]: Finished difference Result 262 states and 334 transitions. [2022-11-16 10:57:45,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 10:57:45,631 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 7 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (10), 7 states have call predecessors, (10), 6 states have call successors, (10) Word has length 43 [2022-11-16 10:57:45,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 10:57:45,632 INFO L225 Difference]: With dead ends: 262 [2022-11-16 10:57:45,632 INFO L226 Difference]: Without dead ends: 262 [2022-11-16 10:57:45,633 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 72 SyntacticMatches, 8 SemanticMatches, 19 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 17.4s TimeCoverageRelationStatistics Valid=78, Invalid=117, Unknown=15, NotChecked=210, Total=420 [2022-11-16 10:57:45,633 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 89 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 1887 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1637 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-16 10:57:45,633 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 368 Invalid, 1887 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 235 Invalid, 0 Unknown, 1637 Unchecked, 0.5s Time] [2022-11-16 10:57:45,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2022-11-16 10:57:45,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 261. [2022-11-16 10:57:45,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 155 states have (on average 1.4451612903225806) internal successors, (224), 207 states have internal predecessors, (224), 34 states have call successors, (34), 14 states have call predecessors, (34), 21 states have return successors, (76), 39 states have call predecessors, (76), 34 states have call successors, (76) [2022-11-16 10:57:45,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 334 transitions. [2022-11-16 10:57:45,647 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 334 transitions. Word has length 43 [2022-11-16 10:57:45,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 10:57:45,647 INFO L495 AbstractCegarLoop]: Abstraction has 261 states and 334 transitions. [2022-11-16 10:57:45,648 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 7 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (10), 7 states have call predecessors, (10), 6 states have call successors, (10) [2022-11-16 10:57:45,648 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 334 transitions. [2022-11-16 10:57:45,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-11-16 10:57:45,649 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 10:57:45,649 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2022-11-16 10:57:45,672 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/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-16 10:57:45,879 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (28)] Forceful destruction successful, exit code 0 [2022-11-16 10:57:46,076 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt [2022-11-16 10:57:46,077 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting nondet_treeErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [nondet_treeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2022-11-16 10:57:46,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:57:46,077 INFO L85 PathProgramCache]: Analyzing trace with hash -1831948675, now seen corresponding path program 3 times [2022-11-16 10:57:46,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 10:57:46,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1666305011] [2022-11-16 10:57:46,078 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-16 10:57:46,078 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-16 10:57:46,078 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 10:57:46,079 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/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-16 10:57:46,081 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/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-16 10:57:46,458 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-11-16 10:57:46,458 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 10:57:46,472 INFO L263 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 23 conjunts are in the unsatisfiable core [2022-11-16 10:57:46,474 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 10:57:46,478 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-16 10:57:46,591 WARN L855 $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-16 10:57:46,705 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-16 10:57:46,705 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-16 10:57:46,715 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_nondet_tree_~n~0.base_134 (_ BitVec 32))) (and (= (store (store |c_old(#length)| c_nondet_tree_~n~0.base (_ bv12 32)) v_nondet_tree_~n~0.base_134 (_ bv12 32)) |c_#length|) (not (= v_nondet_tree_~n~0.base_134 c_nondet_tree_~n~0.base)))) is different from true [2022-11-16 10:57:46,736 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_nondet_tree_~n~0.base_134 (_ BitVec 32)) (|nondet_tree_#res.base| (_ BitVec 32))) (and (= (store (store |c_old(#length)| |nondet_tree_#res.base| (_ bv12 32)) v_nondet_tree_~n~0.base_134 (_ bv12 32)) |c_#length|) (not (= v_nondet_tree_~n~0.base_134 |nondet_tree_#res.base|)))) is different from true [2022-11-16 10:57:46,777 INFO L321 Elim1Store]: treesize reduction 31, result has 13.9 percent of original size [2022-11-16 10:57:46,777 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 1 case distinctions, treesize of input 15 treesize of output 19 [2022-11-16 10:57:46,823 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 21 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 26 not checked. [2022-11-16 10:57:46,823 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 10:57:47,110 INFO L321 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2022-11-16 10:57:47,111 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 15 treesize of output 14 [2022-11-16 10:57:47,261 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 10:57:47,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1666305011] [2022-11-16 10:57:47,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1666305011] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 10:57:47,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [854363669] [2022-11-16 10:57:47,262 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-16 10:57:47,262 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-16 10:57:47,262 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/cvc4 [2022-11-16 10:57:47,263 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-16 10:57:47,265 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (30)] Waiting until timeout for monitored process [2022-11-16 10:57:47,981 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-11-16 10:57:47,981 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 10:57:48,009 INFO L263 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 31 conjunts are in the unsatisfiable core [2022-11-16 10:57:48,012 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 10:57:48,017 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-16 10:57:48,025 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-16 10:57:48,405 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1685 (_ BitVec 32)) (v_ArrVal_1687 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32))) (and (= |c_#length| (store (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_1685) |c_nondet_tree_#t~ret9.base| v_ArrVal_1687)) (= (_ bv0 1) (select (store |c_old(#valid)| nondet_tree_~n~0.base (_ bv1 1)) |c_nondet_tree_#t~ret9.base|)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-16 10:57:48,425 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1685 (_ BitVec 32)) (v_ArrVal_1687 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32)) (|nondet_tree_#t~ret9.base| (_ BitVec 32))) (and (= (_ bv0 1) (select (store |c_old(#valid)| nondet_tree_~n~0.base (_ bv1 1)) |nondet_tree_#t~ret9.base|)) (= (store (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_1685) |nondet_tree_#t~ret9.base| v_ArrVal_1687) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-16 10:57:48,472 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 10:57:48,474 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 10:57:48,492 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 10:57:48,493 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 0 case distinctions, treesize of input 15 treesize of output 19 [2022-11-16 10:57:48,526 INFO L321 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2022-11-16 10:57:48,526 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-16 10:57:48,532 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 19 proven. 26 refuted. 4 times theorem prover too weak. 7 trivial. 10 not checked. [2022-11-16 10:57:48,532 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 10:57:49,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [854363669] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 10:57:49,070 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 10:57:49,070 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 17 [2022-11-16 10:57:49,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20536321] [2022-11-16 10:57:49,071 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 10:57:49,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-16 10:57:49,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 10:57:49,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-16 10:57:49,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=202, Unknown=6, NotChecked=160, Total=420 [2022-11-16 10:57:49,072 INFO L87 Difference]: Start difference. First operand 261 states and 334 transitions. Second operand has 18 states, 17 states have (on average 2.8823529411764706) internal successors, (49), 16 states have internal predecessors, (49), 9 states have call successors, (12), 3 states have call predecessors, (12), 6 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2022-11-16 10:57:49,687 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1685 (_ BitVec 32)) (v_ArrVal_1687 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32))) (and (= |c_#length| (store (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_1685) |c_nondet_tree_#t~ret9.base| v_ArrVal_1687)) (= (_ bv0 1) (select (store |c_old(#valid)| nondet_tree_~n~0.base (_ bv1 1)) |c_nondet_tree_#t~ret9.base|)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) (exists ((v_nondet_tree_~n~0.base_134 (_ BitVec 32))) (and (= (store (store |c_old(#length)| c_nondet_tree_~n~0.base (_ bv12 32)) v_nondet_tree_~n~0.base_134 (_ bv12 32)) |c_#length|) (not (= v_nondet_tree_~n~0.base_134 c_nondet_tree_~n~0.base))))) is different from true [2022-11-16 10:57:49,698 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_nondet_tree_~n~0.base_134 (_ BitVec 32))) (and (= (store (store |c_old(#length)| c_nondet_tree_~n~0.base (_ bv12 32)) v_nondet_tree_~n~0.base_134 (_ bv12 32)) |c_#length|) (not (= v_nondet_tree_~n~0.base_134 c_nondet_tree_~n~0.base)))) (exists ((v_ArrVal_1685 (_ BitVec 32)) (v_ArrVal_1687 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32)) (|nondet_tree_#t~ret9.base| (_ BitVec 32))) (and (= (_ bv0 1) (select (store |c_old(#valid)| nondet_tree_~n~0.base (_ bv1 1)) |nondet_tree_#t~ret9.base|)) (= (store (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_1685) |nondet_tree_#t~ret9.base| v_ArrVal_1687) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base))))) is different from true [2022-11-16 10:57:49,705 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_nondet_tree_~n~0.base_134 (_ BitVec 32)) (|nondet_tree_#res.base| (_ BitVec 32))) (and (= (store (store |c_old(#length)| |nondet_tree_#res.base| (_ bv12 32)) v_nondet_tree_~n~0.base_134 (_ bv12 32)) |c_#length|) (not (= v_nondet_tree_~n~0.base_134 |nondet_tree_#res.base|)))) (exists ((v_ArrVal_1685 (_ BitVec 32)) (v_ArrVal_1687 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32)) (|nondet_tree_#t~ret9.base| (_ BitVec 32))) (and (= (_ bv0 1) (select (store |c_old(#valid)| nondet_tree_~n~0.base (_ bv1 1)) |nondet_tree_#t~ret9.base|)) (= (store (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_1685) |nondet_tree_#t~ret9.base| v_ArrVal_1687) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base))))) is different from true [2022-11-16 10:57:50,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 10:57:50,578 INFO L93 Difference]: Finished difference Result 261 states and 333 transitions. [2022-11-16 10:57:50,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-16 10:57:50,579 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.8823529411764706) internal successors, (49), 16 states have internal predecessors, (49), 9 states have call successors, (12), 3 states have call predecessors, (12), 6 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) Word has length 43 [2022-11-16 10:57:50,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 10:57:50,581 INFO L225 Difference]: With dead ends: 261 [2022-11-16 10:57:50,581 INFO L226 Difference]: Without dead ends: 261 [2022-11-16 10:57:50,581 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 70 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=94, Invalid=348, Unknown=10, NotChecked=360, Total=812 [2022-11-16 10:57:50,582 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 176 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 546 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 2164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1574 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-16 10:57:50,582 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 432 Invalid, 2164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 546 Invalid, 0 Unknown, 1574 Unchecked, 1.1s Time] [2022-11-16 10:57:50,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2022-11-16 10:57:50,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 260. [2022-11-16 10:57:50,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 154 states have (on average 1.4415584415584415) internal successors, (222), 207 states have internal predecessors, (222), 34 states have call successors, (34), 14 states have call predecessors, (34), 21 states have return successors, (76), 38 states have call predecessors, (76), 34 states have call successors, (76) [2022-11-16 10:57:50,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 332 transitions. [2022-11-16 10:57:50,592 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 332 transitions. Word has length 43 [2022-11-16 10:57:50,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 10:57:50,593 INFO L495 AbstractCegarLoop]: Abstraction has 260 states and 332 transitions. [2022-11-16 10:57:50,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.8823529411764706) internal successors, (49), 16 states have internal predecessors, (49), 9 states have call successors, (12), 3 states have call predecessors, (12), 6 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2022-11-16 10:57:50,593 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 332 transitions. [2022-11-16 10:57:50,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-11-16 10:57:50,594 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 10:57:50,594 INFO L195 NwaCegarLoop]: trace histogram [8, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1] [2022-11-16 10:57:50,600 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (30)] Ended with exit code 0 [2022-11-16 10:57:50,810 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/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-16 10:57:51,000 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt,29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/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-16 10:57:51,000 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting nondet_treeErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [nondet_treeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2022-11-16 10:57:51,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:57:51,001 INFO L85 PathProgramCache]: Analyzing trace with hash 1161376290, now seen corresponding path program 2 times [2022-11-16 10:57:51,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 10:57:51,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [679100033] [2022-11-16 10:57:51,001 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 10:57:51,001 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-16 10:57:51,001 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 10:57:51,002 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/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-16 10:57:51,007 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/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-16 10:57:51,421 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 10:57:51,421 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 10:57:51,435 INFO L263 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 33 conjunts are in the unsatisfiable core [2022-11-16 10:57:51,438 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 10:57:51,443 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-16 10:57:51,449 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-16 10:57:51,505 WARN L855 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_1829 (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_1829))) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-16 10:57:51,549 WARN L855 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32)) (v_ArrVal_1829 (_ BitVec 32))) (and (= |c_#length| (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_1829)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-16 10:57:51,626 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 10:57:51,627 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-16 10:57:51,642 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-16 10:57:51,642 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-16 10:57:51,698 WARN L855 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_1830 (_ BitVec 32))) (= (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_1830) |c_#length|)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-16 10:57:51,746 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1830 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32))) (and (= (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_1830) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-16 10:57:51,775 WARN L855 $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-16 10:57:51,843 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1830 (_ BitVec 32)) (v_nondet_tree_~n~0.base_155 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32))) (and (= (store (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_1830) v_nondet_tree_~n~0.base_155 (_ bv12 32)) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-16 10:57:51,879 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 10:57:51,914 INFO L321 Elim1Store]: treesize reduction 24, result has 38.5 percent of original size [2022-11-16 10:57:51,914 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-16 10:57:51,929 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-16 10:57:51,930 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-16 10:57:51,951 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 30 proven. 10 refuted. 0 times theorem prover too weak. 37 trivial. 81 not checked. [2022-11-16 10:57:51,951 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 10:57:52,285 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 10:57:52,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [679100033] [2022-11-16 10:57:52,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [679100033] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 10:57:52,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [698029705] [2022-11-16 10:57:52,285 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 10:57:52,286 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-16 10:57:52,286 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/cvc4 [2022-11-16 10:57:52,287 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-16 10:57:52,288 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (32)] Waiting until timeout for monitored process [2022-11-16 10:57:52,886 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 10:57:52,886 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 10:57:52,896 INFO L263 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 37 conjunts are in the unsatisfiable core [2022-11-16 10:57:52,900 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 10:57:52,906 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-16 10:57:52,911 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-16 10:57:52,954 WARN L855 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_1965 (_ BitVec 32))) (= (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_1965) |c_#length|)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-16 10:57:53,007 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1965 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32))) (and (= (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_1965) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-16 10:57:53,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 10:57:53,084 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-16 10:57:53,098 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-16 10:57:53,099 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-16 10:57:53,140 WARN L855 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_1966 (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_1966))) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-16 10:57:53,177 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1966 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32))) (and (= |c_#length| (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_1966)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-16 10:57:53,260 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_nondet_tree_~n~0.base_167 (_ BitVec 32)) (v_ArrVal_1966 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)) (= (store (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_1966) v_nondet_tree_~n~0.base_167 (_ bv12 32)) |c_#length|))) is different from true [2022-11-16 10:57:53,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 10:57:53,343 INFO L321 Elim1Store]: treesize reduction 24, result has 38.5 percent of original size [2022-11-16 10:57:53,344 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 23 [2022-11-16 10:57:53,362 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-16 10:57:53,362 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-16 10:57:53,383 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 28 proven. 28 refuted. 0 times theorem prover too weak. 21 trivial. 81 not checked. [2022-11-16 10:57:53,384 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 10:57:53,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [698029705] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 10:57:53,842 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 10:57:53,843 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 16 [2022-11-16 10:57:53,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306213205] [2022-11-16 10:57:53,843 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 10:57:53,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-16 10:57:53,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 10:57:53,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-16 10:57:53,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=49, Unknown=11, NotChecked=242, Total=342 [2022-11-16 10:57:53,844 INFO L87 Difference]: Start difference. First operand 260 states and 332 transitions. Second operand has 17 states, 16 states have (on average 3.4375) internal successors, (55), 16 states have internal predecessors, (55), 11 states have call successors, (14), 3 states have call predecessors, (14), 7 states have return successors, (14), 8 states have call predecessors, (14), 10 states have call successors, (14) [2022-11-16 10:57:53,970 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (= (store |c_old(#length)| nondet_tree_~n~0.base (_ bv12 32)) |c_#length|)) (exists ((nondet_tree_~n~0.base (_ BitVec 32)) (v_ArrVal_1829 (_ BitVec 32))) (and (= |c_#length| (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_1829)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) (exists ((v_ArrVal_1830 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32))) (and (= (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_1830) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) (exists ((v_ArrVal_1966 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32))) (and (= |c_#length| (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_1966)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) (exists ((v_ArrVal_1965 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32))) (and (= (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_1965) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base))))) is different from true [2022-11-16 10:57:53,975 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (= (store |c_old(#length)| nondet_tree_~n~0.base (_ bv12 32)) |c_#length|)) (exists ((nondet_tree_~n~0.base (_ BitVec 32)) (v_ArrVal_1829 (_ BitVec 32))) (and (= |c_#length| (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_1829)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) (exists ((v_ArrVal_1965 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32))) (and (= (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_1965) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base))))) is different from true [2022-11-16 10:57:54,147 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_nondet_tree_~n~0.base_167 (_ BitVec 32)) (v_ArrVal_1966 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)) (= (store (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_1966) v_nondet_tree_~n~0.base_167 (_ bv12 32)) |c_#length|))) (exists ((v_ArrVal_1830 (_ BitVec 32)) (v_nondet_tree_~n~0.base_155 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32))) (and (= (store (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_1830) v_nondet_tree_~n~0.base_155 (_ bv12 32)) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base))))) is different from true [2022-11-16 10:57:54,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 10:57:54,877 INFO L93 Difference]: Finished difference Result 262 states and 334 transitions. [2022-11-16 10:57:54,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-16 10:57:54,877 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.4375) internal successors, (55), 16 states have internal predecessors, (55), 11 states have call successors, (14), 3 states have call predecessors, (14), 7 states have return successors, (14), 8 states have call predecessors, (14), 10 states have call successors, (14) Word has length 63 [2022-11-16 10:57:54,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 10:57:54,879 INFO L225 Difference]: With dead ends: 262 [2022-11-16 10:57:54,879 INFO L226 Difference]: Without dead ends: 262 [2022-11-16 10:57:54,880 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 109 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=52, Invalid=62, Unknown=14, NotChecked=378, Total=506 [2022-11-16 10:57:54,880 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 95 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 455 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 2680 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2207 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-16 10:57:54,881 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 250 Invalid, 2680 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 455 Invalid, 0 Unknown, 2207 Unchecked, 0.9s Time] [2022-11-16 10:57:54,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2022-11-16 10:57:54,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 261. [2022-11-16 10:57:54,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 155 states have (on average 1.4451612903225806) internal successors, (224), 207 states have internal predecessors, (224), 34 states have call successors, (34), 14 states have call predecessors, (34), 21 states have return successors, (76), 39 states have call predecessors, (76), 34 states have call successors, (76) [2022-11-16 10:57:54,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 334 transitions. [2022-11-16 10:57:54,890 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 334 transitions. Word has length 63 [2022-11-16 10:57:54,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 10:57:54,891 INFO L495 AbstractCegarLoop]: Abstraction has 261 states and 334 transitions. [2022-11-16 10:57:54,891 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.4375) internal successors, (55), 16 states have internal predecessors, (55), 11 states have call successors, (14), 3 states have call predecessors, (14), 7 states have return successors, (14), 8 states have call predecessors, (14), 10 states have call successors, (14) [2022-11-16 10:57:54,891 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 334 transitions. [2022-11-16 10:57:54,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-11-16 10:57:54,892 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 10:57:54,893 INFO L195 NwaCegarLoop]: trace histogram [10, 7, 7, 7, 7, 7, 6, 6, 6, 6, 4, 3, 3, 1, 1, 1, 1] [2022-11-16 10:57:54,915 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/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)] Forceful destruction successful, exit code 0 [2022-11-16 10:57:55,117 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (32)] Forceful destruction successful, exit code 0 [2022-11-16 10:57:55,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/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,32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt [2022-11-16 10:57:55,307 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting nondet_treeErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [nondet_treeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2022-11-16 10:57:55,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:57:55,308 INFO L85 PathProgramCache]: Analyzing trace with hash 812521517, now seen corresponding path program 2 times [2022-11-16 10:57:55,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 10:57:55,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1378306322] [2022-11-16 10:57:55,308 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 10:57:55,308 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-16 10:57:55,308 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 10:57:55,309 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/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-16 10:57:55,311 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (33)] Waiting until timeout for monitored process [2022-11-16 10:57:55,871 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 10:57:55,871 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 10:57:55,895 INFO L263 TraceCheckSpWp]: Trace formula consists of 574 conjuncts, 21 conjunts are in the unsatisfiable core [2022-11-16 10:57:55,898 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 10:57:55,901 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-16 10:57:55,950 WARN L855 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_2146 (_ BitVec 1))) (= |c_#valid| (store |c_old(#valid)| nondet_tree_~n~0.base v_ArrVal_2146))) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-16 10:57:55,983 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2146 (_ BitVec 1)) (nondet_tree_~n~0.base (_ BitVec 32))) (and (= |c_#valid| (store |c_old(#valid)| nondet_tree_~n~0.base v_ArrVal_2146)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-16 10:57:56,019 WARN L855 $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-16 10:57:56,151 INFO L321 Elim1Store]: treesize reduction 52, result has 30.7 percent of original size [2022-11-16 10:57:56,151 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 4 case distinctions, treesize of input 22 treesize of output 38 [2022-11-16 10:57:56,168 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 148 proven. 15 refuted. 0 times theorem prover too weak. 110 trivial. 25 not checked. [2022-11-16 10:57:56,168 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 10:57:58,311 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 10:57:58,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1378306322] [2022-11-16 10:57:58,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1378306322] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 10:57:58,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [756988693] [2022-11-16 10:57:58,312 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 10:57:58,312 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-16 10:57:58,312 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/cvc4 [2022-11-16 10:57:58,313 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-16 10:57:58,314 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (34)] Waiting until timeout for monitored process [2022-11-16 10:57:58,939 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-16 10:57:58,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [600734132] [2022-11-16 10:57:58,939 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 10:57:58,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 10:57:58,940 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 10:57:58,944 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 10:57:58,946 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (34)] Forceful destruction successful, exit code 1 [2022-11-16 10:57:58,947 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2022-11-16 10:57:59,332 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 10:57:59,332 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 10:57:59,340 INFO L263 TraceCheckSpWp]: Trace formula consists of 574 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-16 10:57:59,342 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 10:57:59,361 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2498 (_ BitVec 1))) (= (store |c_old(#valid)| c_nondet_tree_~n~0.base v_ArrVal_2498) |c_#valid|)) is different from true [2022-11-16 10:57:59,392 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2499 (_ BitVec 1))) (= (store |c_old(#valid)| c_nondet_tree_~n~0.base v_ArrVal_2499) |c_#valid|)) is different from true [2022-11-16 10:58:01,467 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2498 (_ BitVec 1)) (v_nondet_tree_~n~0.base_189 (_ BitVec 32))) (= |c_#valid| (store (store |c_old(#valid)| c_nondet_tree_~n~0.base v_ArrVal_2498) v_nondet_tree_~n~0.base_189 (_ bv1 1)))) is different from true [2022-11-16 10:58:03,545 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 10:58:03,579 INFO L321 Elim1Store]: treesize reduction 34, result has 35.8 percent of original size [2022-11-16 10:58:03,579 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 2 case distinctions, treesize of input 17 treesize of output 31 [2022-11-16 10:58:03,598 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 156 proven. 8 refuted. 0 times theorem prover too weak. 114 trivial. 20 not checked. [2022-11-16 10:58:03,598 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 10:58:03,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [600734132] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 10:58:03,975 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 10:58:03,975 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 12 [2022-11-16 10:58:03,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97485419] [2022-11-16 10:58:03,976 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 10:58:03,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-16 10:58:03,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 10:58:03,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-16 10:58:03,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=76, Unknown=9, NotChecked=138, Total=272 [2022-11-16 10:58:03,977 INFO L87 Difference]: Start difference. First operand 261 states and 334 transitions. Second operand has 13 states, 12 states have (on average 3.75) internal successors, (45), 12 states have internal predecessors, (45), 8 states have call successors, (14), 2 states have call predecessors, (14), 5 states have return successors, (14), 8 states have call predecessors, (14), 8 states have call successors, (14) [2022-11-16 10:58:10,180 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_2146 (_ BitVec 1))) (= |c_#valid| (store |c_old(#valid)| nondet_tree_~n~0.base v_ArrVal_2146))) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) (exists ((v_ArrVal_2498 (_ BitVec 1))) (= (store |c_old(#valid)| c_nondet_tree_~n~0.base v_ArrVal_2498) |c_#valid|)) (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (= (store |c_old(#valid)| nondet_tree_~n~0.base (_ bv1 1)) |c_#valid|)) (exists ((v_ArrVal_2499 (_ BitVec 1))) (= (store |c_old(#valid)| c_nondet_tree_~n~0.base v_ArrVal_2499) |c_#valid|))) is different from true [2022-11-16 10:58:10,183 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2498 (_ BitVec 1))) (= (store |c_old(#valid)| c_nondet_tree_~n~0.base v_ArrVal_2498) |c_#valid|)) (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (= (store |c_old(#valid)| nondet_tree_~n~0.base (_ bv1 1)) |c_#valid|)) (exists ((v_ArrVal_2146 (_ BitVec 1)) (nondet_tree_~n~0.base (_ BitVec 32))) (and (= |c_#valid| (store |c_old(#valid)| nondet_tree_~n~0.base v_ArrVal_2146)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) (exists ((v_ArrVal_2499 (_ BitVec 1))) (= (store |c_old(#valid)| c_nondet_tree_~n~0.base v_ArrVal_2499) |c_#valid|))) is different from true [2022-11-16 10:58:10,360 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2146 (_ BitVec 1)) (v_nondet_tree_~n~0.base_178 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32))) (and (= |c_#valid| (store (store |c_old(#valid)| nondet_tree_~n~0.base v_ArrVal_2146) v_nondet_tree_~n~0.base_178 (_ bv1 1))) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) (exists ((v_ArrVal_2498 (_ BitVec 1)) (v_nondet_tree_~n~0.base_189 (_ BitVec 32))) (= |c_#valid| (store (store |c_old(#valid)| c_nondet_tree_~n~0.base v_ArrVal_2498) v_nondet_tree_~n~0.base_189 (_ bv1 1))))) is different from true [2022-11-16 10:58:10,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 10:58:10,750 INFO L93 Difference]: Finished difference Result 263 states and 335 transitions. [2022-11-16 10:58:10,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-16 10:58:10,754 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.75) internal successors, (45), 12 states have internal predecessors, (45), 8 states have call successors, (14), 2 states have call predecessors, (14), 5 states have return successors, (14), 8 states have call predecessors, (14), 8 states have call successors, (14) Word has length 83 [2022-11-16 10:58:10,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 10:58:10,756 INFO L225 Difference]: With dead ends: 263 [2022-11-16 10:58:10,756 INFO L226 Difference]: Without dead ends: 263 [2022-11-16 10:58:10,756 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 155 SyntacticMatches, 5 SemanticMatches, 19 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 12.5s TimeCoverageRelationStatistics Valid=64, Invalid=89, Unknown=15, NotChecked=252, Total=420 [2022-11-16 10:58:10,757 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 91 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 1610 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1349 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-16 10:58:10,757 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 265 Invalid, 1610 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 244 Invalid, 0 Unknown, 1349 Unchecked, 0.5s Time] [2022-11-16 10:58:10,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2022-11-16 10:58:10,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 261. [2022-11-16 10:58:10,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 155 states have (on average 1.4387096774193548) internal successors, (223), 207 states have internal predecessors, (223), 34 states have call successors, (34), 14 states have call predecessors, (34), 21 states have return successors, (76), 39 states have call predecessors, (76), 34 states have call successors, (76) [2022-11-16 10:58:10,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 333 transitions. [2022-11-16 10:58:10,767 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 333 transitions. Word has length 83 [2022-11-16 10:58:10,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 10:58:10,767 INFO L495 AbstractCegarLoop]: Abstraction has 261 states and 333 transitions. [2022-11-16 10:58:10,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.75) internal successors, (45), 12 states have internal predecessors, (45), 8 states have call successors, (14), 2 states have call predecessors, (14), 5 states have return successors, (14), 8 states have call predecessors, (14), 8 states have call successors, (14) [2022-11-16 10:58:10,768 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 333 transitions. [2022-11-16 10:58:10,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-16 10:58:10,769 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 10:58:10,769 INFO L195 NwaCegarLoop]: trace histogram [6, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1] [2022-11-16 10:58:10,783 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Ended with exit code 0 [2022-11-16 10:58:10,989 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (33)] Forceful destruction successful, exit code 0 [2022-11-16 10:58:11,177 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/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-16 10:58:11,178 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting nondet_treeErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [nondet_treeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2022-11-16 10:58:11,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:58:11,178 INFO L85 PathProgramCache]: Analyzing trace with hash -699297066, now seen corresponding path program 3 times [2022-11-16 10:58:11,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 10:58:11,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1242635594] [2022-11-16 10:58:11,179 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-16 10:58:11,179 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-16 10:58:11,179 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 10:58:11,180 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/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-16 10:58:11,181 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/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 (36)] Waiting until timeout for monitored process [2022-11-16 10:58:11,690 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-11-16 10:58:11,690 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 10:58:11,702 INFO L263 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 28 conjunts are in the unsatisfiable core [2022-11-16 10:58:11,705 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 10:58:11,710 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-16 10:58:11,719 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-16 10:58:11,775 WARN L855 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_2595 (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_2595))) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-16 10:58:11,814 WARN L855 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32)) (v_ArrVal_2595 (_ BitVec 32))) (and (= |c_#length| (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_2595)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-16 10:58:11,903 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 10:58:11,905 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-16 10:58:11,918 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-16 10:58:11,918 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-16 10:58:11,984 WARN L855 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_2596 (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_2596))) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-16 10:58:12,021 WARN L855 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32)) (v_ArrVal_2596 (_ BitVec 32))) (and (= |c_#length| (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_2596)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-16 10:58:12,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 10:58:12,090 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-16 10:58:12,106 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-16 10:58:12,107 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-16 10:58:12,111 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 19 trivial. 40 not checked. [2022-11-16 10:58:12,111 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 10:58:12,443 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 10:58:12,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1242635594] [2022-11-16 10:58:12,444 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1242635594] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 10:58:12,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1912449759] [2022-11-16 10:58:12,444 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-16 10:58:12,444 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-16 10:58:12,444 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/cvc4 [2022-11-16 10:58:12,445 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-16 10:58:12,446 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (37)] Waiting until timeout for monitored process [2022-11-16 10:58:12,917 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-16 10:58:12,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [38076871] [2022-11-16 10:58:12,917 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-16 10:58:12,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 10:58:12,918 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 10:58:12,919 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 10:58:12,922 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (37)] Ended with exit code 1 [2022-11-16 10:58:12,923 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2022-11-16 10:58:18,689 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-11-16 10:58:18,689 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 10:58:18,699 INFO L263 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 27 conjunts are in the unsatisfiable core [2022-11-16 10:58:18,701 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 10:58:18,705 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-16 10:58:18,711 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-16 10:58:18,750 WARN L855 $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_2764 (_ BitVec 32))) (= (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_2764) |c_#length|)))) is different from true [2022-11-16 10:58:18,795 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2764 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32))) (and (= (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_2764) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-16 10:58:18,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 10:58:18,871 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-16 10:58:18,888 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-16 10:58:18,888 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-16 10:58:18,937 WARN L855 $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_2765 (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_2765))))) is different from true [2022-11-16 10:58:18,976 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2765 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32))) (and (= |c_#length| (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_2765)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-16 10:58:19,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 10:58:19,044 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-16 10:58:19,059 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-16 10:58:19,060 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-16 10:58:19,064 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 19 trivial. 40 not checked. [2022-11-16 10:58:19,064 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 10:58:21,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [38076871] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 10:58:21,271 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 10:58:21,271 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2022-11-16 10:58:21,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240235511] [2022-11-16 10:58:21,272 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 10:58:21,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-16 10:58:21,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 10:58:21,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-16 10:58:21,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=46, Unknown=8, NotChecked=152, Total=240 [2022-11-16 10:58:21,273 INFO L87 Difference]: Start difference. First operand 261 states and 333 transitions. Second operand has 14 states, 13 states have (on average 3.230769230769231) internal successors, (42), 12 states have internal predecessors, (42), 10 states have call successors, (11), 3 states have call predecessors, (11), 5 states have return successors, (12), 5 states have call predecessors, (12), 9 states have call successors, (12) [2022-11-16 10:58:21,359 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((nondet_tree_~n~0.base (_ BitVec 32)) (v_ArrVal_2595 (_ BitVec 32))) (and (= |c_#length| (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_2595)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) (exists ((nondet_tree_~n~0.base (_ BitVec 32)) (v_ArrVal_2596 (_ BitVec 32))) (and (= |c_#length| (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_2596)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) (exists ((v_ArrVal_2764 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32))) (and (= (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_2764) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) (exists ((v_ArrVal_2765 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32))) (and (= |c_#length| (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_2765)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base))))) is different from true [2022-11-16 10:58:22,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 10:58:22,082 INFO L93 Difference]: Finished difference Result 296 states and 398 transitions. [2022-11-16 10:58:22,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 10:58:22,083 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.230769230769231) internal successors, (42), 12 states have internal predecessors, (42), 10 states have call successors, (11), 3 states have call predecessors, (11), 5 states have return successors, (12), 5 states have call predecessors, (12), 9 states have call successors, (12) Word has length 45 [2022-11-16 10:58:22,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 10:58:22,085 INFO L225 Difference]: With dead ends: 296 [2022-11-16 10:58:22,085 INFO L226 Difference]: Without dead ends: 296 [2022-11-16 10:58:22,086 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=42, Invalid=57, Unknown=9, NotChecked=198, Total=306 [2022-11-16 10:58:22,086 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 187 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 2015 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1671 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-16 10:58:22,086 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 188 Invalid, 2015 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 292 Invalid, 0 Unknown, 1671 Unchecked, 0.7s Time] [2022-11-16 10:58:22,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2022-11-16 10:58:22,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 292. [2022-11-16 10:58:22,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 177 states have (on average 1.4011299435028248) internal successors, (248), 230 states have internal predecessors, (248), 38 states have call successors, (38), 16 states have call predecessors, (38), 26 states have return successors, (96), 45 states have call predecessors, (96), 38 states have call successors, (96) [2022-11-16 10:58:22,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 382 transitions. [2022-11-16 10:58:22,102 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 382 transitions. Word has length 45 [2022-11-16 10:58:22,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 10:58:22,103 INFO L495 AbstractCegarLoop]: Abstraction has 292 states and 382 transitions. [2022-11-16 10:58:22,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.230769230769231) internal successors, (42), 12 states have internal predecessors, (42), 10 states have call successors, (11), 3 states have call predecessors, (11), 5 states have return successors, (12), 5 states have call predecessors, (12), 9 states have call successors, (12) [2022-11-16 10:58:22,103 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 382 transitions. [2022-11-16 10:58:22,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-11-16 10:58:22,104 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 10:58:22,104 INFO L195 NwaCegarLoop]: trace histogram [8, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1] [2022-11-16 10:58:22,124 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/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 (36)] Forceful destruction successful, exit code 0 [2022-11-16 10:58:22,329 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Forceful destruction successful, exit code 0 [2022-11-16 10:58:22,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/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,38 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 10:58:22,519 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting nondet_treeErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [nondet_treeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2022-11-16 10:58:22,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:58:22,519 INFO L85 PathProgramCache]: Analyzing trace with hash -1588214878, now seen corresponding path program 4 times [2022-11-16 10:58:22,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 10:58:22,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [428408109] [2022-11-16 10:58:22,520 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-16 10:58:22,520 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-16 10:58:22,520 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 10:58:22,521 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/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-16 10:58:22,523 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/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 (39)] Waiting until timeout for monitored process [2022-11-16 10:58:23,038 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-16 10:58:23,038 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 10:58:23,055 INFO L263 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 33 conjunts are in the unsatisfiable core [2022-11-16 10:58:23,058 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 10:58:23,065 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-16 10:58:23,070 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-16 10:58:23,128 WARN L855 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_2898 (_ BitVec 32))) (= (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_2898) |c_#length|)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-16 10:58:23,181 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2898 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32))) (and (= (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_2898) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-16 10:58:23,256 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 10:58:23,257 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-16 10:58:23,269 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-16 10:58:23,270 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-16 10:58:23,336 WARN L855 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_2899 (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_2899))) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-16 10:58:23,366 WARN L855 $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-16 10:58:23,432 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2899 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32)) (v_nondet_tree_~n~0.base_214 (_ BitVec 32))) (and (= |c_#length| (store (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_2899) v_nondet_tree_~n~0.base_214 (_ bv12 32))) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-16 10:58:23,506 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 10:58:23,547 INFO L321 Elim1Store]: treesize reduction 24, result has 38.5 percent of original size [2022-11-16 10:58:23,548 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-16 10:58:23,571 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-16 10:58:23,571 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-16 10:58:23,597 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 30 proven. 10 refuted. 0 times theorem prover too weak. 37 trivial. 81 not checked. [2022-11-16 10:58:23,597 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 10:58:24,034 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 10:58:24,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [428408109] [2022-11-16 10:58:24,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [428408109] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 10:58:24,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [242845183] [2022-11-16 10:58:24,034 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-16 10:58:24,034 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-16 10:58:24,034 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/cvc4 [2022-11-16 10:58:24,035 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-16 10:58:24,038 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (40)] Waiting until timeout for monitored process [2022-11-16 10:58:24,797 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-16 10:58:24,797 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 10:58:24,830 INFO L263 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 37 conjunts are in the unsatisfiable core [2022-11-16 10:58:24,835 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 10:58:24,841 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-16 10:58:24,847 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-16 10:58:24,889 WARN L855 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_3034 (_ BitVec 32))) (= (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_3034) |c_#length|)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-16 10:58:24,927 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3034 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32))) (and (= (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_3034) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-16 10:58:24,994 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 10:58:24,995 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-16 10:58:25,009 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-16 10:58:25,009 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-16 10:58:25,058 WARN L855 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_3035 (_ BitVec 32))) (= (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_3035) |c_#length|)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-16 10:58:25,143 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3035 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32)) (v_nondet_tree_~n~0.base_226 (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)) (= |c_#length| (store (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_3035) v_nondet_tree_~n~0.base_226 (_ bv12 32))))) is different from true [2022-11-16 10:58:25,215 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 10:58:25,251 INFO L321 Elim1Store]: treesize reduction 24, result has 38.5 percent of original size [2022-11-16 10:58:25,252 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-16 10:58:25,266 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-16 10:58:25,266 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-16 10:58:25,293 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 28 proven. 28 refuted. 0 times theorem prover too weak. 21 trivial. 81 not checked. [2022-11-16 10:58:25,293 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 10:58:25,958 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [242845183] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 10:58:25,958 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 10:58:25,958 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 14 [2022-11-16 10:58:25,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413277001] [2022-11-16 10:58:25,958 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 10:58:25,959 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-16 10:58:25,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 10:58:25,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-16 10:58:25,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=47, Unknown=9, NotChecked=180, Total=272 [2022-11-16 10:58:25,960 INFO L87 Difference]: Start difference. First operand 292 states and 382 transitions. Second operand has 15 states, 14 states have (on average 3.9285714285714284) internal successors, (55), 14 states have internal predecessors, (55), 11 states have call successors, (14), 3 states have call predecessors, (14), 7 states have return successors, (14), 6 states have call predecessors, (14), 10 states have call successors, (14) [2022-11-16 10:58:26,082 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (= (store |c_old(#length)| nondet_tree_~n~0.base (_ bv12 32)) |c_#length|)) (exists ((v_ArrVal_3034 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32))) (and (= (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_3034) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) (exists ((v_ArrVal_2898 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32))) (and (= (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_2898) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base))))) is different from true [2022-11-16 10:58:30,747 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2899 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32)) (v_nondet_tree_~n~0.base_214 (_ BitVec 32))) (and (= |c_#length| (store (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_2899) v_nondet_tree_~n~0.base_214 (_ bv12 32))) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) (exists ((v_ArrVal_3035 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32)) (v_nondet_tree_~n~0.base_226 (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)) (= |c_#length| (store (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_3035) v_nondet_tree_~n~0.base_226 (_ bv12 32)))))) is different from true [2022-11-16 10:58:31,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 10:58:31,010 INFO L93 Difference]: Finished difference Result 294 states and 384 transitions. [2022-11-16 10:58:31,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-16 10:58:31,011 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.9285714285714284) internal successors, (55), 14 states have internal predecessors, (55), 11 states have call successors, (14), 3 states have call predecessors, (14), 7 states have return successors, (14), 6 states have call predecessors, (14), 10 states have call successors, (14) Word has length 63 [2022-11-16 10:58:31,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 10:58:31,013 INFO L225 Difference]: With dead ends: 294 [2022-11-16 10:58:31,013 INFO L226 Difference]: Without dead ends: 294 [2022-11-16 10:58:31,014 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 112 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=57, Invalid=84, Unknown=13, NotChecked=308, Total=462 [2022-11-16 10:58:31,014 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 95 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 2084 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1757 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-16 10:58:31,015 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 216 Invalid, 2084 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 310 Invalid, 0 Unknown, 1757 Unchecked, 0.7s Time] [2022-11-16 10:58:31,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2022-11-16 10:58:31,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 292. [2022-11-16 10:58:31,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 177 states have (on average 1.4011299435028248) internal successors, (248), 230 states have internal predecessors, (248), 38 states have call successors, (38), 16 states have call predecessors, (38), 26 states have return successors, (96), 45 states have call predecessors, (96), 38 states have call successors, (96) [2022-11-16 10:58:31,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 382 transitions. [2022-11-16 10:58:31,025 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 382 transitions. Word has length 63 [2022-11-16 10:58:31,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 10:58:31,025 INFO L495 AbstractCegarLoop]: Abstraction has 292 states and 382 transitions. [2022-11-16 10:58:31,025 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.9285714285714284) internal successors, (55), 14 states have internal predecessors, (55), 11 states have call successors, (14), 3 states have call predecessors, (14), 7 states have return successors, (14), 6 states have call predecessors, (14), 10 states have call successors, (14) [2022-11-16 10:58:31,026 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 382 transitions. [2022-11-16 10:58:31,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-16 10:58:31,026 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 10:58:31,027 INFO L195 NwaCegarLoop]: trace histogram [6, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1] [2022-11-16 10:58:31,046 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/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 (39)] Ended with exit code 0 [2022-11-16 10:58:31,246 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (40)] Forceful destruction successful, exit code 0 [2022-11-16 10:58:31,441 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/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,40 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt [2022-11-16 10:58:31,442 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting nondet_treeErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [nondet_treeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2022-11-16 10:58:31,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:58:31,442 INFO L85 PathProgramCache]: Analyzing trace with hash -699297067, now seen corresponding path program 3 times [2022-11-16 10:58:31,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 10:58:31,443 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2138447829] [2022-11-16 10:58:31,443 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-16 10:58:31,443 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-16 10:58:31,443 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 10:58:31,444 INFO L229 MonitoredProcess]: Starting monitored process 41 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/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-16 10:58:31,445 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/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 (41)] Waiting until timeout for monitored process [2022-11-16 10:58:31,801 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-11-16 10:58:31,801 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 10:58:31,811 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-16 10:58:31,813 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 10:58:31,838 WARN L855 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_3122 (_ BitVec 1))) (= (store |c_old(#valid)| nondet_tree_~n~0.base v_ArrVal_3122) |c_#valid|)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-16 10:58:31,869 WARN L855 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32)) (v_ArrVal_3122 (_ BitVec 1))) (and (= (store |c_old(#valid)| nondet_tree_~n~0.base v_ArrVal_3122) |c_#valid|) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-16 10:58:31,941 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-16 10:58:31,941 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-16 10:58:31,945 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 7 not checked. [2022-11-16 10:58:31,945 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 10:58:32,090 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 10:58:32,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2138447829] [2022-11-16 10:58:32,091 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2138447829] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 10:58:32,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1772360521] [2022-11-16 10:58:32,091 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-16 10:58:32,091 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-16 10:58:32,091 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/cvc4 [2022-11-16 10:58:32,094 INFO L229 MonitoredProcess]: Starting monitored process 42 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-16 10:58:32,095 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (42)] Waiting until timeout for monitored process [2022-11-16 10:58:32,610 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-16 10:58:32,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1204166028] [2022-11-16 10:58:32,610 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-16 10:58:32,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 10:58:32,611 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 10:58:32,612 INFO L229 MonitoredProcess]: Starting monitored process 43 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 10:58:32,616 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2022-11-16 10:58:32,616 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (42)] Ended with exit code 1 [2022-11-16 10:58:33,253 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-11-16 10:58:33,254 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 10:58:33,258 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-16 10:58:33,260 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 10:58:33,276 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3288 (_ BitVec 1))) (= (store |c_old(#valid)| c_nondet_tree_~n~0.base v_ArrVal_3288) |c_#valid|)) is different from true [2022-11-16 10:58:33,370 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-16 10:58:33,370 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-16 10:58:33,381 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 45 proven. 4 refuted. 0 times theorem prover too weak. 21 trivial. 3 not checked. [2022-11-16 10:58:33,381 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 10:58:33,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1204166028] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 10:58:33,567 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 10:58:33,567 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2022-11-16 10:58:33,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104605393] [2022-11-16 10:58:33,567 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 10:58:33,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-16 10:58:33,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 10:58:33,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-16 10:58:33,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=29, Unknown=3, NotChecked=36, Total=90 [2022-11-16 10:58:33,569 INFO L87 Difference]: Start difference. First operand 292 states and 382 transitions. Second operand has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 8 states have internal predecessors, (32), 5 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) [2022-11-16 10:58:35,610 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_3122 (_ BitVec 1))) (= (store |c_old(#valid)| nondet_tree_~n~0.base v_ArrVal_3122) |c_#valid|)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) (exists ((v_ArrVal_3288 (_ BitVec 1))) (= (store |c_old(#valid)| c_nondet_tree_~n~0.base v_ArrVal_3288) |c_#valid|))) is different from true [2022-11-16 10:58:35,613 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3288 (_ BitVec 1))) (= (store |c_old(#valid)| c_nondet_tree_~n~0.base v_ArrVal_3288) |c_#valid|)) (exists ((nondet_tree_~n~0.base (_ BitVec 32)) (v_ArrVal_3122 (_ BitVec 1))) (and (= (store |c_old(#valid)| nondet_tree_~n~0.base v_ArrVal_3122) |c_#valid|) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base))))) is different from true [2022-11-16 10:58:35,644 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (= (bvadd (select |c_#valid| nondet_tree_~n~0.base) (_ bv1 1)) (_ bv0 1)) (exists ((v_ArrVal_3288 (_ BitVec 1))) (= |c_#valid| (store |c_old(#valid)| nondet_tree_~n~0.base v_ArrVal_3288))))) (exists ((nondet_tree_~n~0.base (_ BitVec 32)) (v_ArrVal_3122 (_ BitVec 1))) (and (= (store |c_old(#valid)| nondet_tree_~n~0.base v_ArrVal_3122) |c_#valid|) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base))))) is different from true [2022-11-16 10:58:36,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 10:58:36,166 INFO L93 Difference]: Finished difference Result 296 states and 387 transitions. [2022-11-16 10:58:36,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 10:58:36,166 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 8 states have internal predecessors, (32), 5 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) Word has length 45 [2022-11-16 10:58:36,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 10:58:36,168 INFO L225 Difference]: With dead ends: 296 [2022-11-16 10:58:36,168 INFO L226 Difference]: Without dead ends: 296 [2022-11-16 10:58:36,168 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 90 SyntacticMatches, 6 SemanticMatches, 12 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=34, Invalid=40, Unknown=6, NotChecked=102, Total=182 [2022-11-16 10:58:36,169 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 91 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 1002 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 742 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-16 10:58:36,169 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 258 Invalid, 1002 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 243 Invalid, 0 Unknown, 742 Unchecked, 0.5s Time] [2022-11-16 10:58:36,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2022-11-16 10:58:36,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 292. [2022-11-16 10:58:36,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 177 states have (on average 1.4011299435028248) internal successors, (248), 230 states have internal predecessors, (248), 38 states have call successors, (38), 16 states have call predecessors, (38), 26 states have return successors, (96), 45 states have call predecessors, (96), 38 states have call successors, (96) [2022-11-16 10:58:36,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 382 transitions. [2022-11-16 10:58:36,180 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 382 transitions. Word has length 45 [2022-11-16 10:58:36,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 10:58:36,180 INFO L495 AbstractCegarLoop]: Abstraction has 292 states and 382 transitions. [2022-11-16 10:58:36,181 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 8 states have internal predecessors, (32), 5 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) [2022-11-16 10:58:36,181 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 382 transitions. [2022-11-16 10:58:36,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-11-16 10:58:36,182 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 10:58:36,182 INFO L195 NwaCegarLoop]: trace histogram [8, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1] [2022-11-16 10:58:36,199 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/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 (41)] Forceful destruction successful, exit code 0 [2022-11-16 10:58:36,404 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Forceful destruction successful, exit code 0 [2022-11-16 10:58:36,596 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/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,43 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 10:58:36,596 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting nondet_treeErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [nondet_treeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2022-11-16 10:58:36,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:58:36,597 INFO L85 PathProgramCache]: Analyzing trace with hash 1148856905, now seen corresponding path program 4 times [2022-11-16 10:58:36,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 10:58:36,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [92103256] [2022-11-16 10:58:36,597 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-16 10:58:36,597 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-16 10:58:36,598 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 10:58:36,598 INFO L229 MonitoredProcess]: Starting monitored process 44 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/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-16 10:58:36,606 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/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 (44)] Waiting until timeout for monitored process [2022-11-16 10:58:37,038 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-16 10:58:37,039 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 10:58:37,054 INFO L263 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 26 conjunts are in the unsatisfiable core [2022-11-16 10:58:37,057 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 10:58:37,081 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-16 10:58:37,114 WARN L855 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_3403 (_ BitVec 1))) (= (store |c_old(#valid)| nondet_tree_~n~0.base v_ArrVal_3403) |c_#valid|)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-16 10:58:37,149 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3403 (_ BitVec 1)) (nondet_tree_~n~0.base (_ BitVec 32))) (and (= (store |c_old(#valid)| nondet_tree_~n~0.base v_ArrVal_3403) |c_#valid|) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-16 10:58:37,232 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-16 10:58:37,232 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-16 10:58:37,256 WARN L855 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_3404 (_ BitVec 1))) (= |c_#valid| (store |c_old(#valid)| nondet_tree_~n~0.base v_ArrVal_3404))) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-16 10:58:37,281 WARN L855 $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-16 10:58:37,465 INFO L321 Elim1Store]: treesize reduction 52, result has 30.7 percent of original size [2022-11-16 10:58:37,465 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 4 case distinctions, treesize of input 22 treesize of output 38 [2022-11-16 10:58:37,479 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 8 proven. 14 refuted. 0 times theorem prover too weak. 48 trivial. 67 not checked. [2022-11-16 10:58:37,479 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 10:58:39,660 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 10:58:39,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [92103256] [2022-11-16 10:58:39,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [92103256] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 10:58:39,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1027966668] [2022-11-16 10:58:39,661 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-16 10:58:39,661 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-16 10:58:39,661 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/cvc4 [2022-11-16 10:58:39,662 INFO L229 MonitoredProcess]: Starting monitored process 45 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-16 10:58:39,664 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (45)] Waiting until timeout for monitored process [2022-11-16 10:58:40,354 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-16 10:58:40,354 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 10:58:40,376 INFO L263 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 21 conjunts are in the unsatisfiable core [2022-11-16 10:58:40,378 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 10:58:40,406 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3520 (_ BitVec 1))) (= |c_#valid| (store |c_old(#valid)| c_nondet_tree_~n~0.base v_ArrVal_3520))) is different from true [2022-11-16 10:58:40,459 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3520 (_ BitVec 1)) (v_nondet_tree_~n~0.base_257 (_ BitVec 32))) (= |c_#valid| (store (store |c_old(#valid)| c_nondet_tree_~n~0.base v_ArrVal_3520) v_nondet_tree_~n~0.base_257 (_ bv1 1)))) is different from true [2022-11-16 10:58:42,536 WARN L855 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32)) (v_ArrVal_3520 (_ BitVec 1)) (v_nondet_tree_~n~0.base_257 (_ BitVec 32))) (let ((.cse0 (store (store |c_old(#valid)| nondet_tree_~n~0.base v_ArrVal_3520) v_nondet_tree_~n~0.base_257 (_ bv1 1)))) (and (= (bvadd (_ bv1 1) (select .cse0 nondet_tree_~n~0.base)) (_ bv0 1)) (= |c_#valid| .cse0)))) is different from true [2022-11-16 10:58:42,607 INFO L321 Elim1Store]: treesize reduction 46, result has 29.2 percent of original size [2022-11-16 10:58:42,607 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 2 case distinctions, treesize of input 31 treesize of output 45 [2022-11-16 10:58:42,632 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 51 proven. 6 refuted. 0 times theorem prover too weak. 46 trivial. 34 not checked. [2022-11-16 10:58:42,632 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 10:58:42,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1027966668] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 10:58:42,868 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 10:58:42,869 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2022-11-16 10:58:42,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957435184] [2022-11-16 10:58:42,869 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 10:58:42,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-16 10:58:42,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 10:58:42,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-16 10:58:42,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=43, Unknown=9, NotChecked=126, Total=210 [2022-11-16 10:58:42,871 INFO L87 Difference]: Start difference. First operand 292 states and 382 transitions. Second operand has 13 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 9 states have call successors, (14), 2 states have call predecessors, (14), 6 states have return successors, (14), 7 states have call predecessors, (14), 9 states have call successors, (14) [2022-11-16 10:58:46,993 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (= (store |c_old(#valid)| nondet_tree_~n~0.base (_ bv1 1)) |c_#valid|)) (exists ((v_ArrVal_3403 (_ BitVec 1)) (nondet_tree_~n~0.base (_ BitVec 32))) (and (= (store |c_old(#valid)| nondet_tree_~n~0.base v_ArrVal_3403) |c_#valid|) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base))))) is different from true [2022-11-16 10:58:54,672 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((nondet_tree_~n~0.base (_ BitVec 32)) (v_ArrVal_3520 (_ BitVec 1)) (v_nondet_tree_~n~0.base_257 (_ BitVec 32))) (let ((.cse0 (store (store |c_old(#valid)| nondet_tree_~n~0.base v_ArrVal_3520) v_nondet_tree_~n~0.base_257 (_ bv1 1)))) (and (= (bvadd (_ bv1 1) (select .cse0 nondet_tree_~n~0.base)) (_ bv0 1)) (= |c_#valid| .cse0)))) (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (= (store |c_old(#valid)| nondet_tree_~n~0.base (_ bv1 1)) |c_#valid|)) (exists ((v_ArrVal_3403 (_ BitVec 1)) (nondet_tree_~n~0.base (_ BitVec 32))) (and (= (store |c_old(#valid)| nondet_tree_~n~0.base v_ArrVal_3403) |c_#valid|) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base))))) is different from true [2022-11-16 10:58:57,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 10:58:57,606 INFO L93 Difference]: Finished difference Result 296 states and 386 transitions. [2022-11-16 10:58:57,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-16 10:58:57,607 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 9 states have call successors, (14), 2 states have call predecessors, (14), 6 states have return successors, (14), 7 states have call predecessors, (14), 9 states have call successors, (14) Word has length 59 [2022-11-16 10:58:57,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 10:58:57,610 INFO L225 Difference]: With dead ends: 296 [2022-11-16 10:58:57,610 INFO L226 Difference]: Without dead ends: 296 [2022-11-16 10:58:57,610 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 109 SyntacticMatches, 7 SemanticMatches, 19 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 18.3s TimeCoverageRelationStatistics Valid=69, Invalid=85, Unknown=14, NotChecked=252, Total=420 [2022-11-16 10:58:57,611 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 93 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 1982 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1722 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-16 10:58:57,611 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 318 Invalid, 1982 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 244 Invalid, 0 Unknown, 1722 Unchecked, 0.6s Time] [2022-11-16 10:58:57,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2022-11-16 10:58:57,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 291. [2022-11-16 10:58:57,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 176 states have (on average 1.3977272727272727) internal successors, (246), 230 states have internal predecessors, (246), 38 states have call successors, (38), 16 states have call predecessors, (38), 26 states have return successors, (96), 44 states have call predecessors, (96), 38 states have call successors, (96) [2022-11-16 10:58:57,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 380 transitions. [2022-11-16 10:58:57,624 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 380 transitions. Word has length 59 [2022-11-16 10:58:57,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 10:58:57,624 INFO L495 AbstractCegarLoop]: Abstraction has 291 states and 380 transitions. [2022-11-16 10:58:57,625 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 9 states have call successors, (14), 2 states have call predecessors, (14), 6 states have return successors, (14), 7 states have call predecessors, (14), 9 states have call successors, (14) [2022-11-16 10:58:57,625 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 380 transitions. [2022-11-16 10:58:57,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-11-16 10:58:57,626 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 10:58:57,626 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-16 10:58:57,634 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (45)] Forceful destruction successful, exit code 0 [2022-11-16 10:58:57,844 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/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 (44)] Forceful destruction successful, exit code 0 [2022-11-16 10:58:58,033 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt,44 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/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-16 10:58:58,034 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting minErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [nondet_treeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2022-11-16 10:58:58,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:58:58,034 INFO L85 PathProgramCache]: Analyzing trace with hash -1322566655, now seen corresponding path program 1 times [2022-11-16 10:58:58,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 10:58:58,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1803372209] [2022-11-16 10:58:58,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:58:58,035 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-16 10:58:58,035 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 10:58:58,040 INFO L229 MonitoredProcess]: Starting monitored process 46 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/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-16 10:58:58,041 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/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 (46)] Waiting until timeout for monitored process [2022-11-16 10:58:58,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:58:58,325 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 29 conjunts are in the unsatisfiable core [2022-11-16 10:58:58,327 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 10:58:58,372 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-16 10:58:58,381 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-16 10:58:58,831 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-16 10:58:58,836 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-16 10:58:58,961 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-16 10:58:58,961 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 10:58:59,353 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-16 10:58:59,353 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 10:58:59,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1803372209] [2022-11-16 10:58:59,353 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1803372209] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 10:58:59,354 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 10:58:59,354 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 14 [2022-11-16 10:58:59,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774238495] [2022-11-16 10:58:59,354 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 10:58:59,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-16 10:58:59,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 10:58:59,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-16 10:58:59,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2022-11-16 10:58:59,356 INFO L87 Difference]: Start difference. First operand 291 states and 380 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-16 10:59:00,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 10:59:00,523 INFO L93 Difference]: Finished difference Result 343 states and 455 transitions. [2022-11-16 10:59:00,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-16 10:59:00,525 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-16 10:59:00,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 10:59:00,526 INFO L225 Difference]: With dead ends: 343 [2022-11-16 10:59:00,526 INFO L226 Difference]: Without dead ends: 343 [2022-11-16 10:59:00,527 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=60, Invalid=320, Unknown=0, NotChecked=0, Total=380 [2022-11-16 10:59:00,527 INFO L413 NwaCegarLoop]: 194 mSDtfsCounter, 54 mSDsluCounter, 1941 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 2135 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 57 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-16 10:59:00,527 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 2135 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 303 Invalid, 0 Unknown, 57 Unchecked, 0.9s Time] [2022-11-16 10:59:00,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2022-11-16 10:59:00,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 329. [2022-11-16 10:59:00,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 205 states have (on average 1.395121951219512) internal successors, (286), 259 states have internal predecessors, (286), 43 states have call successors, (43), 19 states have call predecessors, (43), 30 states have return successors, (115), 50 states have call predecessors, (115), 43 states have call successors, (115) [2022-11-16 10:59:00,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 444 transitions. [2022-11-16 10:59:00,542 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 444 transitions. Word has length 38 [2022-11-16 10:59:00,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 10:59:00,542 INFO L495 AbstractCegarLoop]: Abstraction has 329 states and 444 transitions. [2022-11-16 10:59:00,542 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-16 10:59:00,542 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 444 transitions. [2022-11-16 10:59:00,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-11-16 10:59:00,544 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 10:59:00,544 INFO L195 NwaCegarLoop]: trace histogram [6, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1] [2022-11-16 10:59:00,558 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/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 (46)] Forceful destruction successful, exit code 0 [2022-11-16 10:59:00,758 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/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-16 10:59:00,758 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting nondet_treeErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [nondet_treeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2022-11-16 10:59:00,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:59:00,758 INFO L85 PathProgramCache]: Analyzing trace with hash 2043418542, now seen corresponding path program 5 times [2022-11-16 10:59:00,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 10:59:00,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1550937619] [2022-11-16 10:59:00,759 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-16 10:59:00,759 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-16 10:59:00,759 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 10:59:00,760 INFO L229 MonitoredProcess]: Starting monitored process 47 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/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-16 10:59:00,764 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/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 (47)] Waiting until timeout for monitored process [2022-11-16 10:59:01,323 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2022-11-16 10:59:01,323 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 10:59:01,340 INFO L263 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 24 conjunts are in the unsatisfiable core [2022-11-16 10:59:01,342 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 10:59:01,347 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-16 10:59:01,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 5 [2022-11-16 10:59:01,421 WARN L855 $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_3663 (_ BitVec 32))) (= (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_3663) |c_#length|)))) is different from true [2022-11-16 10:59:01,455 WARN L855 $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-16 10:59:01,511 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3663 (_ BitVec 32)) (v_nondet_tree_~n~0.base_271 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| v_nondet_tree_~n~0.base_271)) (= (store (store |c_old(#length)| v_nondet_tree_~n~0.base_271 v_ArrVal_3663) nondet_tree_~n~0.base (_ bv12 32)) |c_#length|))) is different from true [2022-11-16 10:59:01,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 10:59:01,620 INFO L321 Elim1Store]: treesize reduction 24, result has 38.5 percent of original size [2022-11-16 10:59:01,620 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-16 10:59:01,634 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-16 10:59:01,635 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-16 10:59:01,693 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 21 proven. 5 refuted. 0 times theorem prover too weak. 23 trivial. 40 not checked. [2022-11-16 10:59:01,693 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 10:59:04,115 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 10:59:04,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1550937619] [2022-11-16 10:59:04,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1550937619] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 10:59:04,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1784020222] [2022-11-16 10:59:04,116 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-16 10:59:04,116 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-16 10:59:04,116 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/cvc4 [2022-11-16 10:59:04,117 INFO L229 MonitoredProcess]: Starting monitored process 48 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-16 10:59:04,122 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (48)] Waiting until timeout for monitored process [2022-11-16 10:59:04,817 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-16 10:59:04,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2000150537] [2022-11-16 10:59:04,817 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-16 10:59:04,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 10:59:04,817 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 10:59:04,818 INFO L229 MonitoredProcess]: Starting monitored process 49 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 10:59:04,822 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Waiting until timeout for monitored process [2022-11-16 10:59:04,824 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (48)] Forceful destruction successful, exit code 1 [2022-11-16 10:59:13,463 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2022-11-16 10:59:13,464 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 10:59:13,475 INFO L263 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 27 conjunts are in the unsatisfiable core [2022-11-16 10:59:13,477 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 10:59:13,482 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-16 10:59:13,488 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-16 10:59:13,534 WARN L855 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_3868 (_ BitVec 32))) (= (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_3868) |c_#length|)) (exists ((v_ArrVal_3867 (_ BitVec 1))) (= |c_#valid| (store |c_old(#valid)| nondet_tree_~n~0.base v_ArrVal_3867))) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-16 10:59:13,574 WARN L855 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_3869 (_ BitVec 32))) (= (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_3869) |c_#length|)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-16 10:59:13,611 WARN L855 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32)) (v_ArrVal_3869 (_ BitVec 32))) (and (= (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_3869) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-16 10:59:13,704 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3867 (_ BitVec 1)) (v_nondet_tree_~n~0.base_282 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32)) (v_ArrVal_3869 (_ BitVec 32)) (v_ArrVal_3868 (_ BitVec 32))) (and (= (select (store |c_old(#valid)| v_nondet_tree_~n~0.base_282 v_ArrVal_3867) nondet_tree_~n~0.base) (_ bv0 1)) (= (store (store |c_old(#length)| v_nondet_tree_~n~0.base_282 v_ArrVal_3868) nondet_tree_~n~0.base v_ArrVal_3869) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| v_nondet_tree_~n~0.base_282)))) is different from true [2022-11-16 10:59:13,880 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 10:59:13,882 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 10:59:13,913 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-16 10:59:13,913 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 1 case distinctions, treesize of input 15 treesize of output 23 [2022-11-16 10:59:13,972 INFO L321 Elim1Store]: treesize reduction 17, result has 45.2 percent of original size [2022-11-16 10:59:13,972 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-16 10:59:14,015 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 21 proven. 8 refuted. 0 times theorem prover too weak. 20 trivial. 40 not checked. [2022-11-16 10:59:14,015 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 10:59:18,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2000150537] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 10:59:18,156 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 10:59:18,156 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 12 [2022-11-16 10:59:18,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062382459] [2022-11-16 10:59:18,156 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 10:59:18,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-16 10:59:18,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 10:59:18,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-16 10:59:18,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=8, NotChecked=154, Total=272 [2022-11-16 10:59:18,157 INFO L87 Difference]: Start difference. First operand 329 states and 444 transitions. Second operand has 13 states, 12 states have (on average 3.75) internal successors, (45), 12 states have internal predecessors, (45), 10 states have call successors, (12), 3 states have call predecessors, (12), 5 states have return successors, (11), 5 states have call predecessors, (11), 9 states have call successors, (11) [2022-11-16 10:59:18,278 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (= (store |c_old(#length)| nondet_tree_~n~0.base (_ bv12 32)) |c_#length|)) (exists ((nondet_tree_~n~0.base (_ BitVec 32)) (v_ArrVal_3869 (_ BitVec 32))) (and (= (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_3869) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base))))) is different from true [2022-11-16 10:59:18,755 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3867 (_ BitVec 1)) (v_nondet_tree_~n~0.base_282 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32)) (v_ArrVal_3869 (_ BitVec 32)) (v_ArrVal_3868 (_ BitVec 32))) (and (= (select (store |c_old(#valid)| v_nondet_tree_~n~0.base_282 v_ArrVal_3867) nondet_tree_~n~0.base) (_ bv0 1)) (= (store (store |c_old(#length)| v_nondet_tree_~n~0.base_282 v_ArrVal_3868) nondet_tree_~n~0.base v_ArrVal_3869) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| v_nondet_tree_~n~0.base_282)))) (exists ((v_ArrVal_3663 (_ BitVec 32)) (v_nondet_tree_~n~0.base_271 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| v_nondet_tree_~n~0.base_271)) (= (store (store |c_old(#length)| v_nondet_tree_~n~0.base_271 v_ArrVal_3663) nondet_tree_~n~0.base (_ bv12 32)) |c_#length|)))) is different from true [2022-11-16 10:59:18,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 10:59:18,978 INFO L93 Difference]: Finished difference Result 363 states and 511 transitions. [2022-11-16 10:59:18,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-16 10:59:18,979 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.75) internal successors, (45), 12 states have internal predecessors, (45), 10 states have call successors, (12), 3 states have call predecessors, (12), 5 states have return successors, (11), 5 states have call predecessors, (11), 9 states have call successors, (11) Word has length 49 [2022-11-16 10:59:18,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 10:59:18,981 INFO L225 Difference]: With dead ends: 363 [2022-11-16 10:59:18,981 INFO L226 Difference]: Without dead ends: 363 [2022-11-16 10:59:18,982 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 98 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=12, NotChecked=252, Total=420 [2022-11-16 10:59:18,989 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 176 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 1757 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1442 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-16 10:59:18,989 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 189 Invalid, 1757 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 270 Invalid, 0 Unknown, 1442 Unchecked, 0.6s Time] [2022-11-16 10:59:18,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2022-11-16 10:59:18,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 363. [2022-11-16 10:59:19,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 363 states, 229 states have (on average 1.3580786026200873) internal successors, (311), 284 states have internal predecessors, (311), 49 states have call successors, (49), 20 states have call predecessors, (49), 34 states have return successors, (151), 58 states have call predecessors, (151), 49 states have call successors, (151) [2022-11-16 10:59:19,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 511 transitions. [2022-11-16 10:59:19,003 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 511 transitions. Word has length 49 [2022-11-16 10:59:19,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 10:59:19,004 INFO L495 AbstractCegarLoop]: Abstraction has 363 states and 511 transitions. [2022-11-16 10:59:19,004 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.75) internal successors, (45), 12 states have internal predecessors, (45), 10 states have call successors, (12), 3 states have call predecessors, (12), 5 states have return successors, (11), 5 states have call predecessors, (11), 9 states have call successors, (11) [2022-11-16 10:59:19,004 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 511 transitions. [2022-11-16 10:59:19,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-11-16 10:59:19,005 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 10:59:19,006 INFO L195 NwaCegarLoop]: trace histogram [6, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1] [2022-11-16 10:59:19,022 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Forceful destruction successful, exit code 0 [2022-11-16 10:59:19,235 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/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 (47)] Forceful destruction successful, exit code 0 [2022-11-16 10:59:19,422 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 49 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,47 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/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-16 10:59:19,422 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting nondet_treeErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [nondet_treeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2022-11-16 10:59:19,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:59:19,423 INFO L85 PathProgramCache]: Analyzing trace with hash -65137490, now seen corresponding path program 6 times [2022-11-16 10:59:19,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 10:59:19,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1587842485] [2022-11-16 10:59:19,423 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-11-16 10:59:19,423 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-16 10:59:19,423 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 10:59:19,424 INFO L229 MonitoredProcess]: Starting monitored process 50 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/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-16 10:59:19,425 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/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 (50)] Waiting until timeout for monitored process [2022-11-16 10:59:19,956 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-11-16 10:59:19,957 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 10:59:19,971 INFO L263 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 26 conjunts are in the unsatisfiable core [2022-11-16 10:59:19,973 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 10:59:19,978 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-16 10:59:19,983 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-16 10:59:20,096 WARN L855 $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_3982 (_ BitVec 32))) (= (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_3982) |c_#length|)))) is different from true [2022-11-16 10:59:20,126 WARN L855 $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-16 10:59:20,185 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3982 (_ BitVec 32)) (v_nondet_tree_~n~0.base_293 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32))) (and (= (select |c_old(#valid)| v_nondet_tree_~n~0.base_293) (_ bv0 1)) (= |c_#length| (store (store |c_old(#length)| v_nondet_tree_~n~0.base_293 v_ArrVal_3982) nondet_tree_~n~0.base (_ bv12 32))))) is different from true [2022-11-16 10:59:20,256 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 10:59:20,300 INFO L321 Elim1Store]: treesize reduction 24, result has 38.5 percent of original size [2022-11-16 10:59:20,300 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-16 10:59:20,323 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-16 10:59:20,324 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-16 10:59:20,360 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 21 proven. 14 refuted. 0 times theorem prover too weak. 14 trivial. 40 not checked. [2022-11-16 10:59:20,360 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 10:59:20,701 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 10:59:20,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1587842485] [2022-11-16 10:59:20,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1587842485] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 10:59:20,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1967630884] [2022-11-16 10:59:20,702 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-11-16 10:59:20,702 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-16 10:59:20,702 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/cvc4 [2022-11-16 10:59:20,703 INFO L229 MonitoredProcess]: Starting monitored process 51 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-16 10:59:20,705 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (51)] Waiting until timeout for monitored process [2022-11-16 10:59:21,331 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-16 10:59:21,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1295351206] [2022-11-16 10:59:21,331 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-11-16 10:59:21,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 10:59:21,331 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 10:59:21,343 INFO L229 MonitoredProcess]: Starting monitored process 52 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 10:59:21,343 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (51)] Forceful destruction successful, exit code 1 [2022-11-16 10:59:21,347 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Waiting until timeout for monitored process [2022-11-16 10:59:25,434 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-11-16 10:59:25,434 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 10:59:25,443 INFO L263 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 27 conjunts are in the unsatisfiable core [2022-11-16 10:59:25,445 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 10:59:25,449 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-16 10:59:25,613 WARN L855 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_4187 (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_4187))) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-16 10:59:25,649 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_4187 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32))) (and (= |c_#length| (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_4187)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-16 10:59:25,737 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_4187 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32)) (v_nondet_tree_~n~0.base_304 (_ BitVec 32))) (and (= (store (store |c_old(#length)| v_nondet_tree_~n~0.base_304 (_ bv12 32)) nondet_tree_~n~0.base v_ArrVal_4187) |c_#length|) (= (select (store |c_old(#valid)| v_nondet_tree_~n~0.base_304 (_ bv1 1)) nondet_tree_~n~0.base) (_ bv0 1)))) is different from true [2022-11-16 10:59:25,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 10:59:25,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 10:59:25,874 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 10:59:25,875 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 1 case distinctions, treesize of input 15 treesize of output 19 [2022-11-16 10:59:25,895 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-16 10:59:25,896 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 17 treesize of output 17 [2022-11-16 10:59:25,917 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 23 proven. 9 refuted. 0 times theorem prover too weak. 20 trivial. 37 not checked. [2022-11-16 10:59:25,917 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 10:59:37,686 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1295351206] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 10:59:37,686 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 10:59:37,686 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 13 [2022-11-16 10:59:37,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880875725] [2022-11-16 10:59:37,686 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 10:59:37,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-16 10:59:37,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 10:59:37,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-16 10:59:37,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=86, Unknown=10, NotChecked=138, Total=272 [2022-11-16 10:59:37,688 INFO L87 Difference]: Start difference. First operand 363 states and 511 transitions. Second operand has 14 states, 13 states have (on average 3.923076923076923) internal successors, (51), 14 states have internal predecessors, (51), 10 states have call successors, (13), 3 states have call predecessors, (13), 6 states have return successors, (12), 6 states have call predecessors, (12), 9 states have call successors, (12) [2022-11-16 10:59:38,031 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (= (store |c_old(#length)| nondet_tree_~n~0.base (_ bv12 32)) |c_#length|)) (exists ((v_ArrVal_4187 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32))) (and (= |c_#length| (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_4187)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base))))) is different from true [2022-11-16 10:59:38,473 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3982 (_ BitVec 32)) (v_nondet_tree_~n~0.base_293 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32))) (and (= (select |c_old(#valid)| v_nondet_tree_~n~0.base_293) (_ bv0 1)) (= |c_#length| (store (store |c_old(#length)| v_nondet_tree_~n~0.base_293 v_ArrVal_3982) nondet_tree_~n~0.base (_ bv12 32))))) (exists ((v_ArrVal_4187 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32)) (v_nondet_tree_~n~0.base_304 (_ BitVec 32))) (and (= (store (store |c_old(#length)| v_nondet_tree_~n~0.base_304 (_ bv12 32)) nondet_tree_~n~0.base v_ArrVal_4187) |c_#length|) (= (select (store |c_old(#valid)| v_nondet_tree_~n~0.base_304 (_ bv1 1)) nondet_tree_~n~0.base) (_ bv0 1))))) is different from true [2022-11-16 10:59:38,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 10:59:38,751 INFO L93 Difference]: Finished difference Result 384 states and 548 transitions. [2022-11-16 10:59:38,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-16 10:59:38,752 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.923076923076923) internal successors, (51), 14 states have internal predecessors, (51), 10 states have call successors, (13), 3 states have call predecessors, (13), 6 states have return successors, (12), 6 states have call predecessors, (12), 9 states have call successors, (12) Word has length 49 [2022-11-16 10:59:38,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 10:59:38,755 INFO L225 Difference]: With dead ends: 384 [2022-11-16 10:59:38,755 INFO L226 Difference]: Without dead ends: 384 [2022-11-16 10:59:38,756 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 87 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 12.1s TimeCoverageRelationStatistics Valid=79, Invalid=149, Unknown=14, NotChecked=264, Total=506 [2022-11-16 10:59:38,756 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 174 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 1874 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1565 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-16 10:59:38,756 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 250 Invalid, 1874 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 266 Invalid, 0 Unknown, 1565 Unchecked, 0.7s Time] [2022-11-16 10:59:38,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2022-11-16 10:59:38,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 379. [2022-11-16 10:59:38,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 240 states have (on average 1.3458333333333334) internal successors, (323), 296 states have internal predecessors, (323), 52 states have call successors, (52), 21 states have call predecessors, (52), 36 states have return successors, (166), 61 states have call predecessors, (166), 52 states have call successors, (166) [2022-11-16 10:59:38,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 541 transitions. [2022-11-16 10:59:38,772 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 541 transitions. Word has length 49 [2022-11-16 10:59:38,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 10:59:38,772 INFO L495 AbstractCegarLoop]: Abstraction has 379 states and 541 transitions. [2022-11-16 10:59:38,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.923076923076923) internal successors, (51), 14 states have internal predecessors, (51), 10 states have call successors, (13), 3 states have call predecessors, (13), 6 states have return successors, (12), 6 states have call predecessors, (12), 9 states have call successors, (12) [2022-11-16 10:59:38,772 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 541 transitions. [2022-11-16 10:59:38,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-16 10:59:38,774 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 10:59:38,774 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-16 10:59:38,792 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Forceful destruction successful, exit code 0 [2022-11-16 10:59:39,010 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/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 (50)] Forceful destruction successful, exit code 0 [2022-11-16 10:59:39,192 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 52 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,50 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/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-16 10:59:39,193 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting minErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [nondet_treeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2022-11-16 10:59:39,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:59:39,193 INFO L85 PathProgramCache]: Analyzing trace with hash 1134522260, now seen corresponding path program 2 times [2022-11-16 10:59:39,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 10:59:39,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [602737968] [2022-11-16 10:59:39,194 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 10:59:39,194 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-16 10:59:39,194 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 10:59:39,195 INFO L229 MonitoredProcess]: Starting monitored process 53 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/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-16 10:59:39,197 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/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 (53)] Waiting until timeout for monitored process [2022-11-16 10:59:39,566 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 10:59:39,566 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 10:59:39,576 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 33 conjunts are in the unsatisfiable core [2022-11-16 10:59:39,578 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 10:59:39,582 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-16 10:59:39,650 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-16 10:59:39,718 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2022-11-16 10:59:39,939 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-11-16 10:59:40,061 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 15 proven. 22 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-16 10:59:40,061 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 10:59:40,823 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 9 proven. 28 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-16 10:59:40,823 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 10:59:40,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [602737968] [2022-11-16 10:59:40,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [602737968] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 10:59:40,823 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 10:59:40,823 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 17 [2022-11-16 10:59:40,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673227365] [2022-11-16 10:59:40,824 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 10:59:40,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-16 10:59:40,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 10:59:40,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-16 10:59:40,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2022-11-16 10:59:40,825 INFO L87 Difference]: Start difference. First operand 379 states and 541 transitions. Second operand has 18 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 14 states have internal predecessors, (35), 5 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2022-11-16 10:59:46,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 10:59:46,012 INFO L93 Difference]: Finished difference Result 414 states and 589 transitions. [2022-11-16 10:59:46,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-16 10:59:46,013 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 14 states have internal predecessors, (35), 5 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) Word has length 45 [2022-11-16 10:59:46,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 10:59:46,015 INFO L225 Difference]: With dead ends: 414 [2022-11-16 10:59:46,016 INFO L226 Difference]: Without dead ends: 414 [2022-11-16 10:59:46,016 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 71 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=115, Invalid=755, Unknown=0, NotChecked=0, Total=870 [2022-11-16 10:59:46,017 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 155 mSDsluCounter, 992 mSDsCounter, 0 mSdLazyCounter, 2385 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 1114 SdHoareTripleChecker+Invalid, 2687 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 2385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 254 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2022-11-16 10:59:46,017 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 1114 Invalid, 2687 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 2385 Invalid, 0 Unknown, 254 Unchecked, 4.5s Time] [2022-11-16 10:59:46,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2022-11-16 10:59:46,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 393. [2022-11-16 10:59:46,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 251 states have (on average 1.3545816733067728) internal successors, (340), 307 states have internal predecessors, (340), 54 states have call successors, (54), 22 states have call predecessors, (54), 37 states have return successors, (168), 63 states have call predecessors, (168), 54 states have call successors, (168) [2022-11-16 10:59:46,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 562 transitions. [2022-11-16 10:59:46,033 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 562 transitions. Word has length 45 [2022-11-16 10:59:46,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 10:59:46,033 INFO L495 AbstractCegarLoop]: Abstraction has 393 states and 562 transitions. [2022-11-16 10:59:46,034 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 14 states have internal predecessors, (35), 5 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2022-11-16 10:59:46,034 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 562 transitions. [2022-11-16 10:59:46,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-16 10:59:46,035 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 10:59:46,035 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-16 10:59:46,054 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/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 (53)] Ended with exit code 0 [2022-11-16 10:59:46,249 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 53 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/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-16 10:59:46,249 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting minErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [nondet_treeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2022-11-16 10:59:46,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:59:46,250 INFO L85 PathProgramCache]: Analyzing trace with hash 1134522261, now seen corresponding path program 1 times [2022-11-16 10:59:46,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 10:59:46,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [464592581] [2022-11-16 10:59:46,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:59:46,250 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-16 10:59:46,250 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 10:59:46,251 INFO L229 MonitoredProcess]: Starting monitored process 54 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/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-16 10:59:46,252 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/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 (54)] Waiting until timeout for monitored process [2022-11-16 10:59:46,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:59:46,649 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 46 conjunts are in the unsatisfiable core [2022-11-16 10:59:46,652 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 10:59:46,656 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-16 10:59:46,788 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-16 10:59:46,797 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-16 10:59:46,904 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-16 10:59:46,912 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 25 treesize of output 24 [2022-11-16 10:59:47,237 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-16 10:59:47,240 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 21 treesize of output 9 [2022-11-16 10:59:47,416 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 15 proven. 22 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-16 10:59:47,417 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 10:59:53,545 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 9 proven. 28 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-16 10:59:53,545 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 10:59:53,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [464592581] [2022-11-16 10:59:53,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [464592581] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 10:59:53,546 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 10:59:53,546 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 29 [2022-11-16 10:59:53,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255027600] [2022-11-16 10:59:53,546 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 10:59:53,546 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-11-16 10:59:53,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 10:59:53,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-11-16 10:59:53,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=797, Unknown=0, NotChecked=0, Total=870 [2022-11-16 10:59:53,548 INFO L87 Difference]: Start difference. First operand 393 states and 562 transitions. Second operand has 30 states, 25 states have (on average 2.28) internal successors, (57), 22 states have internal predecessors, (57), 9 states have call successors, (12), 9 states have call predecessors, (12), 8 states have return successors, (10), 8 states have call predecessors, (10), 5 states have call successors, (10) [2022-11-16 11:00:03,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:00:03,282 INFO L93 Difference]: Finished difference Result 442 states and 630 transitions. [2022-11-16 11:00:03,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-16 11:00:03,283 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 25 states have (on average 2.28) internal successors, (57), 22 states have internal predecessors, (57), 9 states have call successors, (12), 9 states have call predecessors, (12), 8 states have return successors, (10), 8 states have call predecessors, (10), 5 states have call successors, (10) Word has length 45 [2022-11-16 11:00:03,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:00:03,285 INFO L225 Difference]: With dead ends: 442 [2022-11-16 11:00:03,285 INFO L226 Difference]: Without dead ends: 440 [2022-11-16 11:00:03,286 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=133, Invalid=1349, Unknown=0, NotChecked=0, Total=1482 [2022-11-16 11:00:03,286 INFO L413 NwaCegarLoop]: 228 mSDtfsCounter, 101 mSDsluCounter, 2969 mSDsCounter, 0 mSdLazyCounter, 2003 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 3197 SdHoareTripleChecker+Invalid, 2436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 2003 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 407 IncrementalHoareTripleChecker+Unchecked, 8.2s IncrementalHoareTripleChecker+Time [2022-11-16 11:00:03,286 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 3197 Invalid, 2436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 2003 Invalid, 0 Unknown, 407 Unchecked, 8.2s Time] [2022-11-16 11:00:03,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2022-11-16 11:00:03,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 424. [2022-11-16 11:00:03,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 424 states, 275 states have (on average 1.3454545454545455) internal successors, (370), 330 states have internal predecessors, (370), 59 states have call successors, (59), 25 states have call predecessors, (59), 39 states have return successors, (173), 68 states have call predecessors, (173), 59 states have call successors, (173) [2022-11-16 11:00:03,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 602 transitions. [2022-11-16 11:00:03,302 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 602 transitions. Word has length 45 [2022-11-16 11:00:03,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:00:03,303 INFO L495 AbstractCegarLoop]: Abstraction has 424 states and 602 transitions. [2022-11-16 11:00:03,303 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 25 states have (on average 2.28) internal successors, (57), 22 states have internal predecessors, (57), 9 states have call successors, (12), 9 states have call predecessors, (12), 8 states have return successors, (10), 8 states have call predecessors, (10), 5 states have call successors, (10) [2022-11-16 11:00:03,303 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 602 transitions. [2022-11-16 11:00:03,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-16 11:00:03,304 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:00:03,304 INFO L195 NwaCegarLoop]: trace histogram [6, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1] [2022-11-16 11:00:03,319 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/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 (54)] Forceful destruction successful, exit code 0 [2022-11-16 11:00:03,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 54 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/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-16 11:00:03,519 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting nondet_treeErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [nondet_treeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2022-11-16 11:00:03,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:00:03,519 INFO L85 PathProgramCache]: Analyzing trace with hash -1996074282, now seen corresponding path program 7 times [2022-11-16 11:00:03,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:00:03,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [442956939] [2022-11-16 11:00:03,520 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-16 11:00:03,520 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-16 11:00:03,520 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:00:03,521 INFO L229 MonitoredProcess]: Starting monitored process 55 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/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-16 11:00:03,565 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/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 (55)] Waiting until timeout for monitored process [2022-11-16 11:00:04,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:00:04,026 INFO L263 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 24 conjunts are in the unsatisfiable core [2022-11-16 11:00:04,028 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:00:04,033 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-16 11:00:04,039 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-16 11:00:04,118 WARN L855 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_4431 (_ BitVec 32))) (= (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_4431) |c_#length|)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-16 11:00:04,168 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_4431 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32))) (and (= (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_4431) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-16 11:00:04,193 WARN L855 $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-16 11:00:04,264 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_4431 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32)) (v_nondet_tree_~n~0.base_337 (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| v_nondet_tree_~n~0.base_337)) (= (store (store |c_old(#length)| v_nondet_tree_~n~0.base_337 v_ArrVal_4431) nondet_tree_~n~0.base (_ bv12 32)) |c_#length|))) is different from true [2022-11-16 11:00:04,304 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:00:04,343 INFO L321 Elim1Store]: treesize reduction 24, result has 38.5 percent of original size [2022-11-16 11:00:04,343 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-16 11:00:04,359 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-16 11:00:04,360 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-16 11:00:04,421 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 22 trivial. 40 not checked. [2022-11-16 11:00:04,422 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:00:06,950 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:00:06,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [442956939] [2022-11-16 11:00:06,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [442956939] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:00:06,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [140684169] [2022-11-16 11:00:06,951 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-16 11:00:06,951 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-16 11:00:06,951 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/cvc4 [2022-11-16 11:00:06,952 INFO L229 MonitoredProcess]: Starting monitored process 56 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-16 11:00:06,953 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (56)] Waiting until timeout for monitored process [2022-11-16 11:00:07,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:00:07,693 INFO L263 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 25 conjunts are in the unsatisfiable core [2022-11-16 11:00:07,695 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:00:07,699 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-16 11:00:07,706 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-16 11:00:07,752 WARN L855 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_4520 (_ BitVec 32))) (= (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_4520) |c_#length|)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-16 11:00:07,789 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_4520 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32))) (and (= (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_4520) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-16 11:00:07,876 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_4520 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32)) (v_nondet_tree_~n~0.base_348 (_ BitVec 32))) (and (= (select |c_old(#valid)| v_nondet_tree_~n~0.base_348) (_ bv0 1)) (= |c_#length| (store (store |c_old(#length)| v_nondet_tree_~n~0.base_348 v_ArrVal_4520) nondet_tree_~n~0.base (_ bv12 32))))) is different from true [2022-11-16 11:00:07,912 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:00:07,955 INFO L321 Elim1Store]: treesize reduction 24, result has 38.5 percent of original size [2022-11-16 11:00:07,956 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-16 11:00:07,977 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-16 11:00:07,978 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-16 11:00:08,030 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 22 trivial. 40 not checked. [2022-11-16 11:00:08,030 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:00:13,260 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [140684169] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:00:13,260 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:00:13,260 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2022-11-16 11:00:13,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314441304] [2022-11-16 11:00:13,260 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:00:13,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-16 11:00:13,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:00:13,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-16 11:00:13,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=84, Unknown=10, NotChecked=168, Total=306 [2022-11-16 11:00:13,261 INFO L87 Difference]: Start difference. First operand 424 states and 602 transitions. Second operand has 13 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 states have internal predecessors, (34), 8 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (9), 6 states have call predecessors, (9), 7 states have call successors, (9) [2022-11-16 11:00:13,384 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (= (store |c_old(#length)| nondet_tree_~n~0.base (_ bv12 32)) |c_#length|)) (exists ((v_ArrVal_4431 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32))) (and (= (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_4431) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) (exists ((v_ArrVal_4520 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32))) (and (= (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_4520) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base))))) is different from true [2022-11-16 11:00:13,610 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4431 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32)) (v_nondet_tree_~n~0.base_337 (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| v_nondet_tree_~n~0.base_337)) (= (store (store |c_old(#length)| v_nondet_tree_~n~0.base_337 v_ArrVal_4431) nondet_tree_~n~0.base (_ bv12 32)) |c_#length|))) (exists ((v_ArrVal_4520 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32)) (v_nondet_tree_~n~0.base_348 (_ BitVec 32))) (and (= (select |c_old(#valid)| v_nondet_tree_~n~0.base_348) (_ bv0 1)) (= |c_#length| (store (store |c_old(#length)| v_nondet_tree_~n~0.base_348 v_ArrVal_4520) nondet_tree_~n~0.base (_ bv12 32)))))) is different from true [2022-11-16 11:00:14,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:00:14,548 INFO L93 Difference]: Finished difference Result 441 states and 638 transitions. [2022-11-16 11:00:14,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-16 11:00:14,549 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 states have internal predecessors, (34), 8 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (9), 6 states have call predecessors, (9), 7 states have call successors, (9) Word has length 45 [2022-11-16 11:00:14,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:00:14,552 INFO L225 Difference]: With dead ends: 441 [2022-11-16 11:00:14,552 INFO L226 Difference]: Without dead ends: 441 [2022-11-16 11:00:14,552 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 88 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=65, Invalid=113, Unknown=14, NotChecked=270, Total=462 [2022-11-16 11:00:14,553 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 96 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 450 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 1925 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1457 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:00:14,553 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 255 Invalid, 1925 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 450 Invalid, 0 Unknown, 1457 Unchecked, 1.1s Time] [2022-11-16 11:00:14,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2022-11-16 11:00:14,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 436. [2022-11-16 11:00:14,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 436 states, 283 states have (on average 1.3356890459363957) internal successors, (378), 339 states have internal predecessors, (378), 62 states have call successors, (62), 25 states have call predecessors, (62), 40 states have return successors, (191), 71 states have call predecessors, (191), 62 states have call successors, (191) [2022-11-16 11:00:14,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 631 transitions. [2022-11-16 11:00:14,570 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 631 transitions. Word has length 45 [2022-11-16 11:00:14,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:00:14,571 INFO L495 AbstractCegarLoop]: Abstraction has 436 states and 631 transitions. [2022-11-16 11:00:14,571 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 states have internal predecessors, (34), 8 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (9), 6 states have call predecessors, (9), 7 states have call successors, (9) [2022-11-16 11:00:14,571 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 631 transitions. [2022-11-16 11:00:14,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-11-16 11:00:14,573 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:00:14,573 INFO L195 NwaCegarLoop]: trace histogram [8, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1] [2022-11-16 11:00:14,592 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (56)] Forceful destruction successful, exit code 0 [2022-11-16 11:00:14,789 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/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 (55)] Ended with exit code 0 [2022-11-16 11:00:14,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 56 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt,55 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/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-16 11:00:14,981 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting nondet_treeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [nondet_treeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2022-11-16 11:00:14,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:00:14,981 INFO L85 PathProgramCache]: Analyzing trace with hash 1034333406, now seen corresponding path program 4 times [2022-11-16 11:00:14,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:00:14,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1841780755] [2022-11-16 11:00:14,981 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-16 11:00:14,982 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-16 11:00:14,982 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:00:14,983 INFO L229 MonitoredProcess]: Starting monitored process 57 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/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-16 11:00:14,986 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/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 (57)] Waiting until timeout for monitored process [2022-11-16 11:00:15,519 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-16 11:00:15,519 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 11:00:15,535 INFO L263 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 23 conjunts are in the unsatisfiable core [2022-11-16 11:00:15,537 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:00:15,540 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-16 11:00:15,573 WARN L855 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_4654 (_ BitVec 1))) (= |c_#valid| (store |c_old(#valid)| nondet_tree_~n~0.base v_ArrVal_4654))) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-16 11:00:15,598 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_4655 (_ BitVec 1))) (= (store |c_old(#valid)| c_nondet_tree_~n~0.base v_ArrVal_4655) |c_#valid|)) is different from true [2022-11-16 11:00:15,613 WARN L855 $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-16 11:00:15,663 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_4655 (_ BitVec 1)) (v_nondet_tree_~n~0.base_359 (_ BitVec 32))) (= |c_#valid| (store (store |c_old(#valid)| c_nondet_tree_~n~0.base v_ArrVal_4655) v_nondet_tree_~n~0.base_359 (_ bv1 1)))) is different from true [2022-11-16 11:00:15,728 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_4655 (_ BitVec 1)) (nondet_tree_~n~0.base (_ BitVec 32)) (v_nondet_tree_~n~0.base_359 (_ BitVec 32))) (let ((.cse0 (store (store |c_old(#valid)| nondet_tree_~n~0.base v_ArrVal_4655) v_nondet_tree_~n~0.base_359 (_ bv1 1)))) (and (= (_ bv0 1) (bvadd (select .cse0 nondet_tree_~n~0.base) (_ bv1 1))) (= .cse0 |c_#valid|)))) is different from true [2022-11-16 11:00:18,045 INFO L321 Elim1Store]: treesize reduction 100, result has 27.0 percent of original size [2022-11-16 11:00:18,045 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 5 case distinctions, treesize of input 39 treesize of output 66 [2022-11-16 11:00:18,075 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 57 proven. 11 refuted. 0 times theorem prover too weak. 36 trivial. 55 not checked. [2022-11-16 11:00:18,076 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:00:19,851 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:00:19,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1841780755] [2022-11-16 11:00:19,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1841780755] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:00:19,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1320288169] [2022-11-16 11:00:19,851 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-16 11:00:19,851 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-16 11:00:19,852 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/cvc4 [2022-11-16 11:00:19,855 INFO L229 MonitoredProcess]: Starting monitored process 58 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-16 11:00:19,857 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (58)] Waiting until timeout for monitored process [2022-11-16 11:00:20,785 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-16 11:00:20,785 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 11:00:20,816 INFO L263 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 24 conjunts are in the unsatisfiable core [2022-11-16 11:00:20,818 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:00:20,830 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-16 11:00:20,853 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_4795 (_ BitVec 1))) (= |c_#valid| (store |c_old(#valid)| c_nondet_tree_~n~0.base v_ArrVal_4795))) is different from true [2022-11-16 11:00:20,892 WARN L855 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_4796 (_ BitVec 1))) (= (store |c_old(#valid)| nondet_tree_~n~0.base v_ArrVal_4796) |c_#valid|)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-16 11:00:25,221 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_nondet_tree_~n~0.base_380 (_ BitVec 32)) (v_nondet_tree_~n~0.base_381 (_ BitVec 32)) (v_ArrVal_4795 (_ BitVec 1)) (v_ArrVal_4796 (_ BitVec 1))) (let ((.cse0 (store |c_old(#valid)| c_nondet_tree_~n~0.base v_ArrVal_4795))) (and (= |c_#valid| (store (store .cse0 v_nondet_tree_~n~0.base_380 v_ArrVal_4796) v_nondet_tree_~n~0.base_381 (_ bv1 1))) (= (_ bv0 1) (select .cse0 v_nondet_tree_~n~0.base_380))))) is different from true [2022-11-16 11:00:31,604 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_nondet_tree_~n~0.base_380 (_ BitVec 32)) (v_nondet_tree_~n~0.base_381 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32)) (v_ArrVal_4795 (_ BitVec 1)) (v_ArrVal_4796 (_ BitVec 1))) (let ((.cse1 (store |c_old(#valid)| nondet_tree_~n~0.base v_ArrVal_4795))) (let ((.cse0 (store (store .cse1 v_nondet_tree_~n~0.base_380 v_ArrVal_4796) v_nondet_tree_~n~0.base_381 (_ bv1 1)))) (and (= (_ bv0 1) (bvadd (select .cse0 nondet_tree_~n~0.base) (_ bv1 1))) (= (select .cse1 v_nondet_tree_~n~0.base_380) (_ bv0 1)) (= .cse0 |c_#valid|))))) is different from true [2022-11-16 11:00:31,831 INFO L321 Elim1Store]: treesize reduction 94, result has 31.4 percent of original size [2022-11-16 11:00:31,832 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 5 case distinctions, treesize of input 115 treesize of output 148 [2022-11-16 11:00:31,932 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 57 proven. 11 refuted. 0 times theorem prover too weak. 36 trivial. 55 not checked. [2022-11-16 11:00:31,932 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:00:32,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1320288169] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:00:32,288 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:00:32,288 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2022-11-16 11:00:32,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244686176] [2022-11-16 11:00:32,289 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:00:32,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-16 11:00:32,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:00:32,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-16 11:00:32,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=53, Unknown=15, NotChecked=198, Total=306 [2022-11-16 11:00:32,290 INFO L87 Difference]: Start difference. First operand 436 states and 631 transitions. Second operand has 17 states, 16 states have (on average 3.4375) internal successors, (55), 15 states have internal predecessors, (55), 11 states have call successors, (14), 2 states have call predecessors, (14), 7 states have return successors, (13), 9 states have call predecessors, (13), 11 states have call successors, (13) [2022-11-16 11:01:13,080 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_nondet_tree_~n~0.base_360 (_ BitVec 32)) (v_ArrVal_4655 (_ BitVec 1)) (nondet_tree_~n~0.base (_ BitVec 32)) (v_ArrVal_4654 (_ BitVec 1)) (v_nondet_tree_~n~0.base_359 (_ BitVec 32))) (let ((.cse0 (store (store (store |c_old(#valid)| v_nondet_tree_~n~0.base_360 v_ArrVal_4654) nondet_tree_~n~0.base v_ArrVal_4655) v_nondet_tree_~n~0.base_359 (_ bv1 1)))) (and (= (_ bv0 1) (bvadd (_ bv1 1) (select .cse0 nondet_tree_~n~0.base))) (= (select |c_old(#valid)| v_nondet_tree_~n~0.base_360) (_ bv0 1)) (= |c_#valid| .cse0)))) (exists ((v_nondet_tree_~n~0.base_380 (_ BitVec 32)) (v_nondet_tree_~n~0.base_381 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32)) (v_ArrVal_4795 (_ BitVec 1)) (v_ArrVal_4796 (_ BitVec 1))) (let ((.cse2 (store |c_old(#valid)| nondet_tree_~n~0.base v_ArrVal_4795))) (let ((.cse1 (store (store .cse2 v_nondet_tree_~n~0.base_380 v_ArrVal_4796) v_nondet_tree_~n~0.base_381 (_ bv1 1)))) (and (= (_ bv0 1) (bvadd (select .cse1 nondet_tree_~n~0.base) (_ bv1 1))) (= (select .cse2 v_nondet_tree_~n~0.base_380) (_ bv0 1)) (= .cse1 |c_#valid|)))))) is different from true [2022-11-16 11:01:13,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:01:13,311 INFO L93 Difference]: Finished difference Result 446 states and 668 transitions. [2022-11-16 11:01:13,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-16 11:01:13,312 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.4375) internal successors, (55), 15 states have internal predecessors, (55), 11 states have call successors, (14), 2 states have call predecessors, (14), 7 states have return successors, (13), 9 states have call predecessors, (13), 11 states have call successors, (13) Word has length 63 [2022-11-16 11:01:13,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:01:13,315 INFO L225 Difference]: With dead ends: 446 [2022-11-16 11:01:13,316 INFO L226 Difference]: Without dead ends: 446 [2022-11-16 11:01:13,316 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 118 SyntacticMatches, 9 SemanticMatches, 20 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 54.5s TimeCoverageRelationStatistics Valid=60, Invalid=86, Unknown=26, NotChecked=290, Total=462 [2022-11-16 11:01:13,316 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 92 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 2495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2245 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-16 11:01:13,317 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 372 Invalid, 2495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 235 Invalid, 0 Unknown, 2245 Unchecked, 0.6s Time] [2022-11-16 11:01:13,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2022-11-16 11:01:13,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 441. [2022-11-16 11:01:13,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 441 states, 287 states have (on average 1.3344947735191637) internal successors, (383), 342 states have internal predecessors, (383), 62 states have call successors, (62), 25 states have call predecessors, (62), 41 states have return successors, (217), 73 states have call predecessors, (217), 62 states have call successors, (217) [2022-11-16 11:01:13,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 662 transitions. [2022-11-16 11:01:13,335 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 662 transitions. Word has length 63 [2022-11-16 11:01:13,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:01:13,335 INFO L495 AbstractCegarLoop]: Abstraction has 441 states and 662 transitions. [2022-11-16 11:01:13,336 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.4375) internal successors, (55), 15 states have internal predecessors, (55), 11 states have call successors, (14), 2 states have call predecessors, (14), 7 states have return successors, (13), 9 states have call predecessors, (13), 11 states have call successors, (13) [2022-11-16 11:01:13,336 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 662 transitions. [2022-11-16 11:01:13,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-11-16 11:01:13,337 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:01:13,338 INFO L195 NwaCegarLoop]: trace histogram [10, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1] [2022-11-16 11:01:13,359 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/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 (57)] Forceful destruction successful, exit code 0 [2022-11-16 11:01:13,562 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (58)] Forceful destruction successful, exit code 0 [2022-11-16 11:01:13,753 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 57 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/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,58 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt [2022-11-16 11:01:13,754 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting nondet_treeErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [nondet_treeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2022-11-16 11:01:13,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:01:13,754 INFO L85 PathProgramCache]: Analyzing trace with hash -585482029, now seen corresponding path program 4 times [2022-11-16 11:01:13,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:01:13,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1007045707] [2022-11-16 11:01:13,755 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-16 11:01:13,755 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 11:01:13,755 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:01:13,756 INFO L229 MonitoredProcess]: Starting monitored process 59 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/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-16 11:01:13,757 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/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 (59)] Waiting until timeout for monitored process [2022-11-16 11:01:14,477 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-16 11:01:14,477 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 11:01:14,499 INFO L263 TraceCheckSpWp]: Trace formula consists of 518 conjuncts, 29 conjunts are in the unsatisfiable core [2022-11-16 11:01:14,502 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:01:14,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-16 11:01:14,522 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-16 11:01:14,595 WARN L855 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_4966 (_ BitVec 32))) (= (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_4966) |c_#length|)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-16 11:01:14,697 WARN L855 $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-16 11:01:14,814 WARN L855 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32)) (v_nondet_tree_~n~0.base_401 (_ BitVec 32)) (v_ArrVal_4967 (_ BitVec 32))) (and (= (store (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_4967) v_nondet_tree_~n~0.base_401 (_ bv12 32)) |c_#length|) (bvule (_ bv8 32) (select |c_#length| nondet_tree_~n~0.base)))) is different from true [2022-11-16 11:01:14,863 WARN L855 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32)) (v_nondet_tree_~n~0.base_401 (_ BitVec 32)) (v_ArrVal_4967 (_ BitVec 32))) (let ((.cse0 (store (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_4967) v_nondet_tree_~n~0.base_401 (_ bv12 32)))) (and (= .cse0 |c_#length|) (bvule (_ bv8 32) (select .cse0 nondet_tree_~n~0.base))))) is different from true [2022-11-16 11:01:14,923 WARN L855 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32)) (v_nondet_tree_~n~0.base_401 (_ BitVec 32)) (v_nondet_tree_~n~0.base_402 (_ BitVec 32)) (v_ArrVal_4967 (_ BitVec 32)) (v_ArrVal_4966 (_ BitVec 32))) (let ((.cse0 (store (store (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_4966) v_nondet_tree_~n~0.base_402 v_ArrVal_4967) v_nondet_tree_~n~0.base_401 (_ bv12 32)))) (and (bvule (_ bv8 32) (select .cse0 v_nondet_tree_~n~0.base_402)) (= .cse0 |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base))))) is different from true [2022-11-16 11:01:15,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:01:15,189 INFO L321 Elim1Store]: treesize reduction 59, result has 34.4 percent of original size [2022-11-16 11:01:15,189 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 30 treesize of output 51 [2022-11-16 11:01:15,220 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-16 11:01:15,220 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-16 11:01:15,339 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 127 proven. 9 refuted. 1 times theorem prover too weak. 49 trivial. 62 not checked. [2022-11-16 11:01:15,340 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:01:18,586 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:01:18,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1007045707] [2022-11-16 11:01:18,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1007045707] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:01:18,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1221506874] [2022-11-16 11:01:18,587 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-16 11:01:18,587 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-16 11:01:18,587 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/cvc4 [2022-11-16 11:01:18,588 INFO L229 MonitoredProcess]: Starting monitored process 60 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-16 11:01:18,590 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (60)] Waiting until timeout for monitored process [2022-11-16 11:01:19,834 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-16 11:01:19,834 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 11:01:19,867 INFO L263 TraceCheckSpWp]: Trace formula consists of 518 conjuncts, 31 conjunts are in the unsatisfiable core [2022-11-16 11:01:19,870 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:01:19,880 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-16 11:01:19,889 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-16 11:01:19,953 WARN L855 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_5137 (_ BitVec 32))) (= (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_5137) |c_#length|)) (exists ((v_ArrVal_5138 (_ BitVec 1))) (= |c_#valid| (store |c_old(#valid)| nondet_tree_~n~0.base v_ArrVal_5138))) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-16 11:01:20,008 WARN L855 $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_5139 (_ BitVec 32))) (= (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_5139) |c_#length|)))) is different from true [2022-11-16 11:01:20,139 WARN L855 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32)) (v_nondet_tree_~n~0.base_422 (_ BitVec 32)) (v_ArrVal_5139 (_ BitVec 32))) (and (= (store (store |c_old(#length)| v_nondet_tree_~n~0.base_422 v_ArrVal_5139) nondet_tree_~n~0.base (_ bv12 32)) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| v_nondet_tree_~n~0.base_422)))) is different from true [2022-11-16 11:01:20,257 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5137 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32)) (v_nondet_tree_~n~0.base_423 (_ BitVec 32)) (v_ArrVal_5138 (_ BitVec 1)) (v_nondet_tree_~n~0.base_422 (_ BitVec 32)) (v_ArrVal_5139 (_ BitVec 32))) (and (= (_ bv0 1) (select (store |c_old(#valid)| nondet_tree_~n~0.base v_ArrVal_5138) v_nondet_tree_~n~0.base_422)) (= (store (store (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_5137) v_nondet_tree_~n~0.base_422 v_ArrVal_5139) v_nondet_tree_~n~0.base_423 (_ bv12 32)) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-16 11:01:20,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:01:20,435 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:01:20,545 INFO L321 Elim1Store]: treesize reduction 47, result has 36.5 percent of original size [2022-11-16 11:01:20,545 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-16 11:01:20,629 INFO L321 Elim1Store]: treesize reduction 17, result has 45.2 percent of original size [2022-11-16 11:01:20,630 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-16 11:01:20,753 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 127 proven. 10 refuted. 0 times theorem prover too weak. 45 trivial. 66 not checked. [2022-11-16 11:01:20,754 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:01:29,446 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1221506874] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:01:29,446 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:01:29,446 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 17 [2022-11-16 11:01:29,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895454172] [2022-11-16 11:01:29,446 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:01:29,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-16 11:01:29,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:01:29,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-16 11:01:29,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=101, Unknown=18, NotChecked=252, Total=420 [2022-11-16 11:01:29,448 INFO L87 Difference]: Start difference. First operand 441 states and 662 transitions. Second operand has 18 states, 17 states have (on average 3.411764705882353) internal successors, (58), 14 states have internal predecessors, (58), 11 states have call successors, (14), 3 states have call predecessors, (14), 7 states have return successors, (14), 9 states have call predecessors, (14), 11 states have call successors, (14) [2022-11-16 11:01:36,621 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((nondet_tree_~n~0.base (_ BitVec 32)) (v_nondet_tree_~n~0.base_401 (_ BitVec 32)) (v_ArrVal_4967 (_ BitVec 32))) (and (= (store (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_4967) v_nondet_tree_~n~0.base_401 (_ bv12 32)) |c_#length|) (bvule (_ bv8 32) (select |c_#length| nondet_tree_~n~0.base)))) (exists ((nondet_tree_~n~0.base (_ BitVec 32)) (v_nondet_tree_~n~0.base_422 (_ BitVec 32)) (v_ArrVal_5139 (_ BitVec 32))) (and (= (store (store |c_old(#length)| v_nondet_tree_~n~0.base_422 v_ArrVal_5139) nondet_tree_~n~0.base (_ bv12 32)) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| v_nondet_tree_~n~0.base_422))))) is different from true [2022-11-16 11:01:36,627 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((nondet_tree_~n~0.base (_ BitVec 32)) (v_nondet_tree_~n~0.base_401 (_ BitVec 32)) (v_ArrVal_4967 (_ BitVec 32))) (let ((.cse0 (store (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_4967) v_nondet_tree_~n~0.base_401 (_ bv12 32)))) (and (= .cse0 |c_#length|) (bvule (_ bv8 32) (select .cse0 nondet_tree_~n~0.base))))) (exists ((nondet_tree_~n~0.base (_ BitVec 32)) (v_nondet_tree_~n~0.base_422 (_ BitVec 32)) (v_ArrVal_5139 (_ BitVec 32))) (and (= (store (store |c_old(#length)| v_nondet_tree_~n~0.base_422 v_ArrVal_5139) nondet_tree_~n~0.base (_ bv12 32)) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| v_nondet_tree_~n~0.base_422))))) is different from true [2022-11-16 11:01:36,635 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((nondet_tree_~n~0.base (_ BitVec 32)) (v_nondet_tree_~n~0.base_401 (_ BitVec 32)) (v_nondet_tree_~n~0.base_402 (_ BitVec 32)) (v_ArrVal_4967 (_ BitVec 32)) (v_ArrVal_4966 (_ BitVec 32))) (let ((.cse0 (store (store (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_4966) v_nondet_tree_~n~0.base_402 v_ArrVal_4967) v_nondet_tree_~n~0.base_401 (_ bv12 32)))) (and (bvule (_ bv8 32) (select .cse0 v_nondet_tree_~n~0.base_402)) (= .cse0 |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base))))) (exists ((v_ArrVal_5137 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32)) (v_nondet_tree_~n~0.base_423 (_ BitVec 32)) (v_ArrVal_5138 (_ BitVec 1)) (v_nondet_tree_~n~0.base_422 (_ BitVec 32)) (v_ArrVal_5139 (_ BitVec 32))) (and (= (_ bv0 1) (select (store |c_old(#valid)| nondet_tree_~n~0.base v_ArrVal_5138) v_nondet_tree_~n~0.base_422)) (= (store (store (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_5137) v_nondet_tree_~n~0.base_422 v_ArrVal_5139) v_nondet_tree_~n~0.base_423 (_ bv12 32)) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base))))) is different from true [2022-11-16 11:01:36,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:01:36,929 INFO L93 Difference]: Finished difference Result 452 states and 680 transitions. [2022-11-16 11:01:36,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-16 11:01:36,930 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 3.411764705882353) internal successors, (58), 14 states have internal predecessors, (58), 11 states have call successors, (14), 3 states have call predecessors, (14), 7 states have return successors, (14), 9 states have call predecessors, (14), 11 states have call successors, (14) Word has length 77 [2022-11-16 11:01:36,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:01:36,932 INFO L225 Difference]: With dead ends: 452 [2022-11-16 11:01:36,932 INFO L226 Difference]: Without dead ends: 452 [2022-11-16 11:01:36,932 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 139 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 17.8s TimeCoverageRelationStatistics Valid=79, Invalid=153, Unknown=26, NotChecked=444, Total=702 [2022-11-16 11:01:36,933 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 98 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 2757 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2433 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-16 11:01:36,933 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 356 Invalid, 2757 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 306 Invalid, 0 Unknown, 2433 Unchecked, 0.8s Time] [2022-11-16 11:01:36,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2022-11-16 11:01:36,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 448. [2022-11-16 11:01:36,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 448 states, 292 states have (on average 1.3253424657534247) internal successors, (387), 347 states have internal predecessors, (387), 63 states have call successors, (63), 25 states have call predecessors, (63), 42 states have return successors, (224), 75 states have call predecessors, (224), 63 states have call successors, (224) [2022-11-16 11:01:36,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 674 transitions. [2022-11-16 11:01:36,951 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 674 transitions. Word has length 77 [2022-11-16 11:01:36,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:01:36,952 INFO L495 AbstractCegarLoop]: Abstraction has 448 states and 674 transitions. [2022-11-16 11:01:36,952 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 3.411764705882353) internal successors, (58), 14 states have internal predecessors, (58), 11 states have call successors, (14), 3 states have call predecessors, (14), 7 states have return successors, (14), 9 states have call predecessors, (14), 11 states have call successors, (14) [2022-11-16 11:01:36,952 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 674 transitions. [2022-11-16 11:01:36,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-11-16 11:01:36,954 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:01:36,954 INFO L195 NwaCegarLoop]: trace histogram [8, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1] [2022-11-16 11:01:36,965 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (60)] Forceful destruction successful, exit code 0 [2022-11-16 11:01:37,177 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/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 (59)] Forceful destruction successful, exit code 0 [2022-11-16 11:01:37,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 60 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt,59 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/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-16 11:01:37,365 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting nondet_treeErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [nondet_treeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2022-11-16 11:01:37,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:01:37,366 INFO L85 PathProgramCache]: Analyzing trace with hash -1392256822, now seen corresponding path program 8 times [2022-11-16 11:01:37,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:01:37,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1627347688] [2022-11-16 11:01:37,366 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 11:01:37,367 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-16 11:01:37,367 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:01:37,367 INFO L229 MonitoredProcess]: Starting monitored process 61 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/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-16 11:01:37,369 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/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 (61)] Waiting until timeout for monitored process [2022-11-16 11:01:37,975 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 11:01:37,975 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 11:01:37,990 INFO L263 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 32 conjunts are in the unsatisfiable core [2022-11-16 11:01:37,993 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:01:38,000 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-16 11:01:38,007 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-16 11:01:38,143 WARN L855 $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_5266 (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_5266))))) is different from true [2022-11-16 11:01:38,185 WARN L855 $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-16 11:01:38,266 WARN L855 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32)) (v_nondet_tree_~n~0.base_443 (_ BitVec 32))) (= (store (store |c_old(#length)| nondet_tree_~n~0.base (_ bv12 32)) v_nondet_tree_~n~0.base_443 (_ bv12 32)) |c_#length|)) is different from true [2022-11-16 11:01:38,322 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5266 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32)) (v_nondet_tree_~n~0.base_443 (_ BitVec 32)) (v_nondet_tree_~n~0.base_444 (_ BitVec 32))) (and (= (store (store (store |c_old(#length)| v_nondet_tree_~n~0.base_444 v_ArrVal_5266) nondet_tree_~n~0.base (_ bv12 32)) v_nondet_tree_~n~0.base_443 (_ bv12 32)) |c_#length|) (= (select |c_old(#valid)| v_nondet_tree_~n~0.base_444) (_ bv0 1)))) is different from true [2022-11-16 11:01:38,429 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:01:38,525 INFO L321 Elim1Store]: treesize reduction 67, result has 25.6 percent of original size [2022-11-16 11:01:38,525 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-16 11:01:38,551 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-16 11:01:38,551 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-16 11:01:38,597 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 8 proven. 20 refuted. 0 times theorem prover too weak. 31 trivial. 78 not checked. [2022-11-16 11:01:38,598 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:01:39,196 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:01:39,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1627347688] [2022-11-16 11:01:39,196 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1627347688] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:01:39,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1233416081] [2022-11-16 11:01:39,196 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 11:01:39,196 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-16 11:01:39,197 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/cvc4 [2022-11-16 11:01:39,198 INFO L229 MonitoredProcess]: Starting monitored process 62 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-16 11:01:39,204 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (62)] Waiting until timeout for monitored process [2022-11-16 11:01:40,178 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 11:01:40,178 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 11:01:40,188 INFO L263 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 35 conjunts are in the unsatisfiable core [2022-11-16 11:01:40,191 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:01:40,196 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-16 11:01:40,203 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-16 11:01:40,312 WARN L855 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_5387 (_ BitVec 1))) (= |c_#valid| (store |c_old(#valid)| nondet_tree_~n~0.base v_ArrVal_5387))) (exists ((v_ArrVal_5386 (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_5386))) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-16 11:01:40,355 WARN L855 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_5388 (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_5388))) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-16 11:01:40,451 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5388 (_ BitVec 32)) (v_nondet_tree_~n~0.base_464 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32))) (and (= (store (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_5388) v_nondet_tree_~n~0.base_464 (_ bv12 32)) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-16 11:01:40,566 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5388 (_ BitVec 32)) (v_ArrVal_5386 (_ BitVec 32)) (v_nondet_tree_~n~0.base_464 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32)) (v_nondet_tree_~n~0.base_465 (_ BitVec 32)) (v_ArrVal_5387 (_ BitVec 1))) (and (= (store (store (store |c_old(#length)| v_nondet_tree_~n~0.base_465 v_ArrVal_5386) nondet_tree_~n~0.base v_ArrVal_5388) v_nondet_tree_~n~0.base_464 (_ bv12 32)) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| v_nondet_tree_~n~0.base_465)) (= (_ bv0 1) (select (store |c_old(#valid)| v_nondet_tree_~n~0.base_465 v_ArrVal_5387) nondet_tree_~n~0.base)))) is different from true [2022-11-16 11:01:40,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:01:40,747 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:01:40,847 INFO L321 Elim1Store]: treesize reduction 47, result has 36.5 percent of original size [2022-11-16 11:01:40,848 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-16 11:01:40,910 INFO L321 Elim1Store]: treesize reduction 17, result has 45.2 percent of original size [2022-11-16 11:01:40,910 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-16 11:01:40,962 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 8 proven. 23 refuted. 0 times theorem prover too weak. 25 trivial. 81 not checked. [2022-11-16 11:01:40,963 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:01:45,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1233416081] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:01:45,657 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:01:45,657 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 13 [2022-11-16 11:01:45,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563875590] [2022-11-16 11:01:45,657 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:01:45,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-16 11:01:45,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:01:45,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-16 11:01:45,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=57, Unknown=9, NotChecked=168, Total=272 [2022-11-16 11:01:45,659 INFO L87 Difference]: Start difference. First operand 448 states and 674 transitions. Second operand has 14 states, 13 states have (on average 3.769230769230769) internal successors, (49), 13 states have internal predecessors, (49), 10 states have call successors, (12), 3 states have call predecessors, (12), 7 states have return successors, (13), 7 states have call predecessors, (13), 9 states have call successors, (13) [2022-11-16 11:01:46,348 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((nondet_tree_~n~0.base (_ BitVec 32)) (v_nondet_tree_~n~0.base_443 (_ BitVec 32))) (= (store (store |c_old(#length)| nondet_tree_~n~0.base (_ bv12 32)) v_nondet_tree_~n~0.base_443 (_ bv12 32)) |c_#length|)) (exists ((v_ArrVal_5388 (_ BitVec 32)) (v_nondet_tree_~n~0.base_464 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32))) (and (= (store (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_5388) v_nondet_tree_~n~0.base_464 (_ bv12 32)) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base))))) is different from true [2022-11-16 11:01:46,355 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5266 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32)) (v_nondet_tree_~n~0.base_443 (_ BitVec 32)) (v_nondet_tree_~n~0.base_444 (_ BitVec 32))) (and (= (store (store (store |c_old(#length)| v_nondet_tree_~n~0.base_444 v_ArrVal_5266) nondet_tree_~n~0.base (_ bv12 32)) v_nondet_tree_~n~0.base_443 (_ bv12 32)) |c_#length|) (= (select |c_old(#valid)| v_nondet_tree_~n~0.base_444) (_ bv0 1)))) (exists ((v_ArrVal_5388 (_ BitVec 32)) (v_ArrVal_5386 (_ BitVec 32)) (v_nondet_tree_~n~0.base_464 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32)) (v_nondet_tree_~n~0.base_465 (_ BitVec 32)) (v_ArrVal_5387 (_ BitVec 1))) (and (= (store (store (store |c_old(#length)| v_nondet_tree_~n~0.base_465 v_ArrVal_5386) nondet_tree_~n~0.base v_ArrVal_5388) v_nondet_tree_~n~0.base_464 (_ bv12 32)) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| v_nondet_tree_~n~0.base_465)) (= (_ bv0 1) (select (store |c_old(#valid)| v_nondet_tree_~n~0.base_465 v_ArrVal_5387) nondet_tree_~n~0.base))))) is different from true [2022-11-16 11:01:46,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:01:46,623 INFO L93 Difference]: Finished difference Result 454 states and 682 transitions. [2022-11-16 11:01:46,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-16 11:01:46,624 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.769230769230769) internal successors, (49), 13 states have internal predecessors, (49), 10 states have call successors, (12), 3 states have call predecessors, (12), 7 states have return successors, (13), 7 states have call predecessors, (13), 9 states have call successors, (13) Word has length 59 [2022-11-16 11:01:46,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:01:46,627 INFO L225 Difference]: With dead ends: 454 [2022-11-16 11:01:46,627 INFO L226 Difference]: Without dead ends: 454 [2022-11-16 11:01:46,628 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 106 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=57, Invalid=80, Unknown=13, NotChecked=270, Total=420 [2022-11-16 11:01:46,628 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 175 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 1935 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1623 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-16 11:01:46,629 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 186 Invalid, 1935 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 268 Invalid, 0 Unknown, 1623 Unchecked, 0.8s Time] [2022-11-16 11:01:46,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2022-11-16 11:01:46,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 449. [2022-11-16 11:01:46,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 449 states, 293 states have (on average 1.3276450511945392) internal successors, (389), 347 states have internal predecessors, (389), 63 states have call successors, (63), 25 states have call predecessors, (63), 42 states have return successors, (224), 76 states have call predecessors, (224), 63 states have call successors, (224) [2022-11-16 11:01:46,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 676 transitions. [2022-11-16 11:01:46,660 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 676 transitions. Word has length 59 [2022-11-16 11:01:46,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:01:46,660 INFO L495 AbstractCegarLoop]: Abstraction has 449 states and 676 transitions. [2022-11-16 11:01:46,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.769230769230769) internal successors, (49), 13 states have internal predecessors, (49), 10 states have call successors, (12), 3 states have call predecessors, (12), 7 states have return successors, (13), 7 states have call predecessors, (13), 9 states have call successors, (13) [2022-11-16 11:01:46,661 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 676 transitions. [2022-11-16 11:01:46,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-11-16 11:01:46,663 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:01:46,663 INFO L195 NwaCegarLoop]: trace histogram [11, 7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 4, 4, 1, 1, 1, 1] [2022-11-16 11:01:46,685 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/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 (61)] Forceful destruction successful, exit code 0 [2022-11-16 11:01:46,886 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (62)] Forceful destruction successful, exit code 0 [2022-11-16 11:01:47,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 61 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/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,62 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt [2022-11-16 11:01:47,080 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting nondet_treeErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [nondet_treeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2022-11-16 11:01:47,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:01:47,080 INFO L85 PathProgramCache]: Analyzing trace with hash 1516386267, now seen corresponding path program 5 times [2022-11-16 11:01:47,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:01:47,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [189631197] [2022-11-16 11:01:47,081 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-16 11:01:47,081 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-16 11:01:47,081 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:01:47,082 INFO L229 MonitoredProcess]: Starting monitored process 63 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/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-16 11:01:47,084 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/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 (63)] Waiting until timeout for monitored process [2022-11-16 11:01:48,429 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2022-11-16 11:01:48,429 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 11:01:48,461 INFO L263 TraceCheckSpWp]: Trace formula consists of 592 conjuncts, 26 conjunts are in the unsatisfiable core [2022-11-16 11:01:48,463 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:01:48,475 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-16 11:01:48,576 WARN L855 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_5584 (_ BitVec 1))) (= |c_#valid| (store |c_old(#valid)| nondet_tree_~n~0.base v_ArrVal_5584))) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-16 11:01:48,601 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5585 (_ BitVec 1))) (= (store |c_old(#valid)| c_nondet_tree_~n~0.base v_ArrVal_5585) |c_#valid|)) is different from true [2022-11-16 11:01:48,668 WARN L855 $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-16 11:01:53,117 INFO L321 Elim1Store]: treesize reduction 123, result has 21.7 percent of original size [2022-11-16 11:01:53,118 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 8 case distinctions, treesize of input 34 treesize of output 56 [2022-11-16 11:01:53,199 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 163 proven. 44 refuted. 0 times theorem prover too weak. 81 trivial. 37 not checked. [2022-11-16 11:01:53,200 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:01:55,533 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:01:55,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [189631197] [2022-11-16 11:01:55,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [189631197] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:01:55,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1588834259] [2022-11-16 11:01:55,534 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-16 11:01:55,534 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-16 11:01:55,534 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/cvc4 [2022-11-16 11:01:55,535 INFO L229 MonitoredProcess]: Starting monitored process 64 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-16 11:01:55,537 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (64)] Waiting until timeout for monitored process [2022-11-16 11:01:57,718 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2022-11-16 11:01:57,718 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 11:01:57,773 INFO L263 TraceCheckSpWp]: Trace formula consists of 592 conjuncts, 25 conjunts are in the unsatisfiable core [2022-11-16 11:01:57,789 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:01:57,794 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-16 11:01:57,843 WARN L855 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_5774 (_ BitVec 1))) (= |c_#valid| (store |c_old(#valid)| nondet_tree_~n~0.base v_ArrVal_5774))) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-16 11:01:57,874 WARN L855 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_5775 (_ BitVec 1))) (= (store |c_old(#valid)| nondet_tree_~n~0.base v_ArrVal_5775) |c_#valid|)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-16 11:01:57,901 WARN L855 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_5776 (_ BitVec 1))) (= |c_#valid| (store |c_old(#valid)| nondet_tree_~n~0.base v_ArrVal_5776))) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-16 11:01:57,939 WARN L855 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32)) (v_ArrVal_5776 (_ BitVec 1))) (and (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)) (= |c_#valid| (store |c_old(#valid)| nondet_tree_~n~0.base v_ArrVal_5776)))) is different from true [2022-11-16 11:01:58,008 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_nondet_tree_~n~0.base_506 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32)) (v_ArrVal_5776 (_ BitVec 1)) (v_ArrVal_5775 (_ BitVec 1))) (let ((.cse0 (store |c_old(#valid)| nondet_tree_~n~0.base v_ArrVal_5775))) (and (= (select .cse0 v_nondet_tree_~n~0.base_506) (_ bv0 1)) (= |c_#valid| (store .cse0 v_nondet_tree_~n~0.base_506 v_ArrVal_5776)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base))))) is different from true [2022-11-16 11:01:58,133 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_nondet_tree_~n~0.base_506 (_ BitVec 32)) (v_nondet_tree_~n~0.base_507 (_ BitVec 32)) (v_ArrVal_5774 (_ BitVec 1)) (nondet_tree_~n~0.base (_ BitVec 32)) (v_ArrVal_5776 (_ BitVec 1)) (v_ArrVal_5775 (_ BitVec 1))) (let ((.cse0 (store |c_old(#valid)| v_nondet_tree_~n~0.base_507 v_ArrVal_5774))) (let ((.cse1 (store .cse0 nondet_tree_~n~0.base v_ArrVal_5775))) (and (= (_ bv0 1) (select .cse0 nondet_tree_~n~0.base)) (= |c_#valid| (store .cse1 v_nondet_tree_~n~0.base_506 v_ArrVal_5776)) (= (select .cse1 v_nondet_tree_~n~0.base_506) (_ bv0 1)) (= (_ bv0 1) (select |c_old(#valid)| v_nondet_tree_~n~0.base_507)))))) is different from true [2022-11-16 11:01:58,450 INFO L321 Elim1Store]: treesize reduction 132, result has 29.4 percent of original size [2022-11-16 11:01:58,451 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 11 case distinctions, treesize of input 87 treesize of output 128 [2022-11-16 11:01:58,522 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 163 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 81 not checked. [2022-11-16 11:01:58,522 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:02:07,695 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1588834259] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:02:07,695 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:02:07,695 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 17 [2022-11-16 11:02:07,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867012943] [2022-11-16 11:02:07,695 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:02:07,696 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-16 11:02:07,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:02:07,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-16 11:02:07,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=85, Unknown=17, NotChecked=234, Total=380 [2022-11-16 11:02:07,696 INFO L87 Difference]: Start difference. First operand 449 states and 676 transitions. Second operand has 18 states, 17 states have (on average 4.0) internal successors, (68), 17 states have internal predecessors, (68), 14 states have call successors, (17), 2 states have call predecessors, (17), 8 states have return successors, (17), 10 states have call predecessors, (17), 14 states have call successors, (17) [2022-11-16 11:02:17,897 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (= (store |c_old(#valid)| nondet_tree_~n~0.base (_ bv1 1)) |c_#valid|)) (exists ((v_nondet_tree_~n~0.base_485 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32)) (v_ArrVal_5584 (_ BitVec 1))) (and (= |c_#valid| (store (store |c_old(#valid)| v_nondet_tree_~n~0.base_485 v_ArrVal_5584) nondet_tree_~n~0.base (_ bv1 1))) (= (_ bv0 1) (select |c_old(#valid)| v_nondet_tree_~n~0.base_485)))) (exists ((nondet_tree_~n~0.base (_ BitVec 32)) (v_ArrVal_5776 (_ BitVec 1))) (and (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)) (= |c_#valid| (store |c_old(#valid)| nondet_tree_~n~0.base v_ArrVal_5776))))) is different from true [2022-11-16 11:02:18,280 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_nondet_tree_~n~0.base_506 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32)) (v_ArrVal_5776 (_ BitVec 1)) (v_ArrVal_5775 (_ BitVec 1))) (let ((.cse0 (store |c_old(#valid)| nondet_tree_~n~0.base v_ArrVal_5775))) (and (= (select .cse0 v_nondet_tree_~n~0.base_506) (_ bv0 1)) (= |c_#valid| (store .cse0 v_nondet_tree_~n~0.base_506 v_ArrVal_5776)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base))))) (exists ((v_nondet_tree_~n~0.base_485 (_ BitVec 32)) (v_nondet_tree_~n~0.base_486 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32)) (v_ArrVal_5584 (_ BitVec 1))) (let ((.cse1 (store |c_old(#valid)| v_nondet_tree_~n~0.base_486 (_ bv1 1)))) (and (= (_ bv0 1) (select |c_old(#valid)| v_nondet_tree_~n~0.base_486)) (= (_ bv0 1) (select .cse1 v_nondet_tree_~n~0.base_485)) (= |c_#valid| (store (store .cse1 v_nondet_tree_~n~0.base_485 v_ArrVal_5584) nondet_tree_~n~0.base (_ bv1 1)))))) (exists ((v_nondet_tree_~n~0.base_485 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32)) (v_ArrVal_5584 (_ BitVec 1))) (and (= |c_#valid| (store (store |c_old(#valid)| v_nondet_tree_~n~0.base_485 v_ArrVal_5584) nondet_tree_~n~0.base (_ bv1 1))) (= (_ bv0 1) (select |c_old(#valid)| v_nondet_tree_~n~0.base_485))))) is different from true [2022-11-16 11:02:18,290 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_nondet_tree_~n~0.base_485 (_ BitVec 32)) (v_nondet_tree_~n~0.base_486 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32)) (v_ArrVal_5584 (_ BitVec 1))) (let ((.cse0 (store |c_old(#valid)| v_nondet_tree_~n~0.base_486 (_ bv1 1)))) (and (= (_ bv0 1) (select |c_old(#valid)| v_nondet_tree_~n~0.base_486)) (= (_ bv0 1) (select .cse0 v_nondet_tree_~n~0.base_485)) (= |c_#valid| (store (store .cse0 v_nondet_tree_~n~0.base_485 v_ArrVal_5584) nondet_tree_~n~0.base (_ bv1 1)))))) (exists ((v_nondet_tree_~n~0.base_506 (_ BitVec 32)) (v_nondet_tree_~n~0.base_507 (_ BitVec 32)) (v_ArrVal_5774 (_ BitVec 1)) (nondet_tree_~n~0.base (_ BitVec 32)) (v_ArrVal_5776 (_ BitVec 1)) (v_ArrVal_5775 (_ BitVec 1))) (let ((.cse1 (store |c_old(#valid)| v_nondet_tree_~n~0.base_507 v_ArrVal_5774))) (let ((.cse2 (store .cse1 nondet_tree_~n~0.base v_ArrVal_5775))) (and (= (_ bv0 1) (select .cse1 nondet_tree_~n~0.base)) (= |c_#valid| (store .cse2 v_nondet_tree_~n~0.base_506 v_ArrVal_5776)) (= (select .cse2 v_nondet_tree_~n~0.base_506) (_ bv0 1)) (= (_ bv0 1) (select |c_old(#valid)| v_nondet_tree_~n~0.base_507))))))) is different from true [2022-11-16 11:02:18,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:02:18,508 INFO L93 Difference]: Finished difference Result 454 states and 682 transitions. [2022-11-16 11:02:18,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-16 11:02:18,509 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 4.0) internal successors, (68), 17 states have internal predecessors, (68), 14 states have call successors, (17), 2 states have call predecessors, (17), 8 states have return successors, (17), 10 states have call predecessors, (17), 14 states have call successors, (17) Word has length 87 [2022-11-16 11:02:18,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:02:18,512 INFO L225 Difference]: With dead ends: 454 [2022-11-16 11:02:18,512 INFO L226 Difference]: Without dead ends: 454 [2022-11-16 11:02:18,512 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 25.4s TimeCoverageRelationStatistics Valid=74, Invalid=130, Unknown=26, NotChecked=420, Total=650 [2022-11-16 11:02:18,512 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 88 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 2515 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2266 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-16 11:02:18,512 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 388 Invalid, 2515 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 234 Invalid, 0 Unknown, 2266 Unchecked, 0.6s Time] [2022-11-16 11:02:18,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2022-11-16 11:02:18,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 444. [2022-11-16 11:02:18,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 444 states, 289 states have (on average 1.328719723183391) internal successors, (384), 344 states have internal predecessors, (384), 63 states have call successors, (63), 25 states have call predecessors, (63), 41 states have return successors, (215), 74 states have call predecessors, (215), 63 states have call successors, (215) [2022-11-16 11:02:18,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 662 transitions. [2022-11-16 11:02:18,531 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 662 transitions. Word has length 87 [2022-11-16 11:02:18,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:02:18,532 INFO L495 AbstractCegarLoop]: Abstraction has 444 states and 662 transitions. [2022-11-16 11:02:18,532 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 4.0) internal successors, (68), 17 states have internal predecessors, (68), 14 states have call successors, (17), 2 states have call predecessors, (17), 8 states have return successors, (17), 10 states have call predecessors, (17), 14 states have call successors, (17) [2022-11-16 11:02:18,532 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 662 transitions. [2022-11-16 11:02:18,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-11-16 11:02:18,534 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:02:18,535 INFO L195 NwaCegarLoop]: trace histogram [5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:02:18,551 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (64)] Forceful destruction successful, exit code 0 [2022-11-16 11:02:18,764 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/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 (63)] Forceful destruction successful, exit code 0 [2022-11-16 11:02:18,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 64 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt,63 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/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-16 11:02:18,951 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting minErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [nondet_treeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2022-11-16 11:02:18,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:02:18,951 INFO L85 PathProgramCache]: Analyzing trace with hash 1454919710, now seen corresponding path program 1 times [2022-11-16 11:02:18,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:02:18,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1925154401] [2022-11-16 11:02:18,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:02:18,952 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-16 11:02:18,952 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:02:18,954 INFO L229 MonitoredProcess]: Starting monitored process 65 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/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-16 11:02:18,955 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/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 (65)] Waiting until timeout for monitored process [2022-11-16 11:02:19,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:02:19,390 INFO L263 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-16 11:02:19,391 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:02:19,767 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 21 proven. 7 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-16 11:02:19,767 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:02:21,469 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 8 treesize of output 6 [2022-11-16 11:02:21,660 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 13 proven. 5 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-11-16 11:02:21,660 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:02:21,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1925154401] [2022-11-16 11:02:21,660 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1925154401] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:02:21,660 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:02:21,660 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 19 [2022-11-16 11:02:21,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836598812] [2022-11-16 11:02:21,661 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:02:21,661 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-16 11:02:21,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:02:21,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-16 11:02:21,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2022-11-16 11:02:21,662 INFO L87 Difference]: Start difference. First operand 444 states and 662 transitions. Second operand has 20 states, 17 states have (on average 3.0) internal successors, (51), 15 states have internal predecessors, (51), 7 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (10), 8 states have call predecessors, (10), 5 states have call successors, (10) [2022-11-16 11:02:31,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:02:31,422 INFO L93 Difference]: Finished difference Result 488 states and 726 transitions. [2022-11-16 11:02:31,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-16 11:02:31,423 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 3.0) internal successors, (51), 15 states have internal predecessors, (51), 7 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (10), 8 states have call predecessors, (10), 5 states have call successors, (10) Word has length 48 [2022-11-16 11:02:31,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:02:31,425 INFO L225 Difference]: With dead ends: 488 [2022-11-16 11:02:31,425 INFO L226 Difference]: Without dead ends: 488 [2022-11-16 11:02:31,426 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 81 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=125, Invalid=687, Unknown=0, NotChecked=0, Total=812 [2022-11-16 11:02:31,426 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 189 mSDsluCounter, 700 mSDsCounter, 0 mSdLazyCounter, 1815 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 782 SdHoareTripleChecker+Invalid, 2182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 1815 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 315 IncrementalHoareTripleChecker+Unchecked, 8.8s IncrementalHoareTripleChecker+Time [2022-11-16 11:02:31,426 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 782 Invalid, 2182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 1815 Invalid, 0 Unknown, 315 Unchecked, 8.8s Time] [2022-11-16 11:02:31,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2022-11-16 11:02:31,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 450. [2022-11-16 11:02:31,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 450 states, 293 states have (on average 1.31740614334471) internal successors, (386), 349 states have internal predecessors, (386), 63 states have call successors, (63), 26 states have call predecessors, (63), 43 states have return successors, (219), 74 states have call predecessors, (219), 63 states have call successors, (219) [2022-11-16 11:02:31,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 668 transitions. [2022-11-16 11:02:31,441 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 668 transitions. Word has length 48 [2022-11-16 11:02:31,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:02:31,442 INFO L495 AbstractCegarLoop]: Abstraction has 450 states and 668 transitions. [2022-11-16 11:02:31,442 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 17 states have (on average 3.0) internal successors, (51), 15 states have internal predecessors, (51), 7 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (10), 8 states have call predecessors, (10), 5 states have call successors, (10) [2022-11-16 11:02:31,442 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 668 transitions. [2022-11-16 11:02:31,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-16 11:02:31,444 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:02:31,444 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-16 11:02:31,463 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/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 (65)] Forceful destruction successful, exit code 0 [2022-11-16 11:02:31,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 65 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/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-16 11:02:31,659 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting minErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [nondet_treeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2022-11-16 11:02:31,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:02:31,660 INFO L85 PathProgramCache]: Analyzing trace with hash 1592442388, now seen corresponding path program 3 times [2022-11-16 11:02:31,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:02:31,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1788965954] [2022-11-16 11:02:31,660 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-16 11:02:31,660 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-16 11:02:31,660 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:02:31,661 INFO L229 MonitoredProcess]: Starting monitored process 66 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/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-16 11:02:31,663 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/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 (66)] Waiting until timeout for monitored process [2022-11-16 11:02:32,206 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-11-16 11:02:32,206 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 11:02:32,218 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 58 conjunts are in the unsatisfiable core [2022-11-16 11:02:32,222 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:02:32,225 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-16 11:02:32,325 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-16 11:02:32,334 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-16 11:02:32,658 WARN L855 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_5920 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| nondet_tree_~n~0.base v_ArrVal_5920))) (exists ((v_ArrVal_5921 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| nondet_tree_~n~0.base v_ArrVal_5921))) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-16 11:02:32,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:02:32,696 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-16 11:02:32,703 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:02:32,704 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-16 11:02:32,726 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-16 11:02:32,726 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-16 11:02:32,782 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-16 11:02:32,793 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-16 11:02:33,179 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-16 11:02:33,185 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-16 11:02:33,347 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-16 11:02:33,347 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:02:35,597 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:02:35,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1788965954] [2022-11-16 11:02:35,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1788965954] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:02:35,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1137608984] [2022-11-16 11:02:35,598 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-16 11:02:35,598 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-16 11:02:35,598 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/cvc4 [2022-11-16 11:02:35,599 INFO L229 MonitoredProcess]: Starting monitored process 67 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-16 11:02:35,601 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (67)] Waiting until timeout for monitored process [2022-11-16 11:02:36,501 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-11-16 11:02:36,502 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 11:02:36,507 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 66 conjunts are in the unsatisfiable core [2022-11-16 11:02:36,511 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:02:36,756 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-16 11:02:36,764 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-16 11:02:37,303 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2022-11-16 11:02:37,314 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2022-11-16 11:02:37,533 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 20 [2022-11-16 11:02:37,557 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 20 [2022-11-16 11:02:37,569 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimArr_4 (Array (_ BitVec 32) (_ BitVec 32)))) (and (= (select v_arrayElimArr_4 (_ bv4 32)) (_ bv0 32)) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| c_nondet_tree_~n~0.base v_arrayElimArr_4)))) (exists ((v_arrayElimArr_3 (Array (_ BitVec 32) (_ BitVec 32)))) (and (= (store |c_old(#memory_$Pointer$.base)| c_nondet_tree_~n~0.base v_arrayElimArr_3) |c_#memory_$Pointer$.base|) (= (select v_arrayElimArr_3 (_ bv4 32)) (_ bv0 32))))) is different from true [2022-11-16 11:02:37,589 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimArr_3 (Array (_ BitVec 32) (_ BitVec 32)))) (and (= (select v_arrayElimArr_3 (_ bv4 32)) (_ bv0 32)) (= (store |c_old(#memory_$Pointer$.base)| |c_nondet_tree_#res.base| v_arrayElimArr_3) |c_#memory_$Pointer$.base|))) (exists ((v_arrayElimArr_4 (Array (_ BitVec 32) (_ BitVec 32)))) (and (= (store |c_old(#memory_$Pointer$.offset)| |c_nondet_tree_#res.base| v_arrayElimArr_4) |c_#memory_$Pointer$.offset|) (= (select v_arrayElimArr_4 (_ bv4 32)) (_ bv0 32))))) is different from true [2022-11-16 11:02:37,641 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-16 11:02:37,641 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 1 case distinctions, treesize of input 16 treesize of output 22 [2022-11-16 11:02:37,650 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 7 treesize of output 3 [2022-11-16 11:02:37,689 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-16 11:02:37,689 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 1 case distinctions, treesize of input 16 treesize of output 22 [2022-11-16 11:02:37,695 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 7 treesize of output 3 [2022-11-16 11:02:37,900 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:02:37,901 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 11:02:37,905 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-16 11:02:37,905 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2022-11-16 11:02:37,912 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:02:37,913 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 11:02:37,916 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-16 11:02:37,916 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2022-11-16 11:02:39,014 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-16 11:02:39,014 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 20 [2022-11-16 11:02:39,025 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-16 11:02:39,026 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 22 treesize of output 10 [2022-11-16 11:02:39,042 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 15 proven. 13 refuted. 0 times theorem prover too weak. 4 trivial. 9 not checked. [2022-11-16 11:02:39,043 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:02:45,901 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:02:45,901 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 25 [2022-11-16 11:02:45,926 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:02:45,927 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 25 [2022-11-16 11:02:45,952 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv4 32) c_nondet_tree_~n~0.offset))) (and (forall ((v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32))) (|v_nondet_tree_#t~ret9.base_617| (_ BitVec 32))) (or (= (_ bv0 32) (select (select (store |c_#memory_$Pointer$.base| |v_nondet_tree_#t~ret9.base_617| v_arrayElimArr_6) c_nondet_tree_~n~0.base) .cse0)) (not (= (select v_arrayElimArr_6 (_ bv4 32)) (_ bv0 32))))) (forall ((v_arrayElimArr_5 (Array (_ BitVec 32) (_ BitVec 32))) (|v_nondet_tree_#t~ret9.base_617| (_ BitVec 32))) (or (= (select (select (store |c_#memory_$Pointer$.offset| |v_nondet_tree_#t~ret9.base_617| v_arrayElimArr_5) c_nondet_tree_~n~0.base) .cse0) (_ bv0 32)) (not (= (select v_arrayElimArr_5 (_ bv4 32)) (_ bv0 32))))))) is different from false [2022-11-16 11:02:45,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1137608984] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:02:45,956 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:02:45,956 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 24] total 39 [2022-11-16 11:02:45,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622840146] [2022-11-16 11:02:45,957 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:02:45,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-11-16 11:02:45,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:02:45,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-11-16 11:02:45,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=1218, Unknown=15, NotChecked=292, Total=1640 [2022-11-16 11:02:45,959 INFO L87 Difference]: Start difference. First operand 450 states and 668 transitions. Second operand has 39 states, 36 states have (on average 1.5833333333333333) internal successors, (57), 28 states have internal predecessors, (57), 11 states have call successors, (12), 7 states have call predecessors, (12), 8 states have return successors, (10), 9 states have call predecessors, (10), 8 states have call successors, (10) [2022-11-16 11:02:55,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:02:55,215 INFO L93 Difference]: Finished difference Result 519 states and 763 transitions. [2022-11-16 11:02:55,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-16 11:02:55,216 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 36 states have (on average 1.5833333333333333) internal successors, (57), 28 states have internal predecessors, (57), 11 states have call successors, (12), 7 states have call predecessors, (12), 8 states have return successors, (10), 9 states have call predecessors, (10), 8 states have call successors, (10) Word has length 45 [2022-11-16 11:02:55,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:02:55,220 INFO L225 Difference]: With dead ends: 519 [2022-11-16 11:02:55,220 INFO L226 Difference]: Without dead ends: 519 [2022-11-16 11:02:55,221 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 84 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 796 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=287, Invalid=3012, Unknown=23, NotChecked=460, Total=3782 [2022-11-16 11:02:55,222 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 223 mSDsluCounter, 1824 mSDsCounter, 0 mSdLazyCounter, 2844 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 1944 SdHoareTripleChecker+Invalid, 4165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 2844 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1241 IncrementalHoareTripleChecker+Unchecked, 7.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:02:55,223 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 1944 Invalid, 4165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 2844 Invalid, 0 Unknown, 1241 Unchecked, 7.1s Time] [2022-11-16 11:02:55,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2022-11-16 11:02:55,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 470. [2022-11-16 11:02:55,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 470 states, 308 states have (on average 1.3084415584415585) internal successors, (403), 364 states have internal predecessors, (403), 66 states have call successors, (66), 28 states have call predecessors, (66), 45 states have return successors, (223), 77 states have call predecessors, (223), 66 states have call successors, (223) [2022-11-16 11:02:55,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 692 transitions. [2022-11-16 11:02:55,245 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 692 transitions. Word has length 45 [2022-11-16 11:02:55,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:02:55,246 INFO L495 AbstractCegarLoop]: Abstraction has 470 states and 692 transitions. [2022-11-16 11:02:55,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 36 states have (on average 1.5833333333333333) internal successors, (57), 28 states have internal predecessors, (57), 11 states have call successors, (12), 7 states have call predecessors, (12), 8 states have return successors, (10), 9 states have call predecessors, (10), 8 states have call successors, (10) [2022-11-16 11:02:55,246 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 692 transitions. [2022-11-16 11:02:55,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-11-16 11:02:55,249 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:02:55,249 INFO L195 NwaCegarLoop]: trace histogram [9, 7, 7, 7, 7, 6, 5, 5, 5, 5, 4, 3, 3, 1, 1, 1, 1] [2022-11-16 11:02:55,269 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (67)] Forceful destruction successful, exit code 0 [2022-11-16 11:02:55,473 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/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 (66)] Forceful destruction successful, exit code 0 [2022-11-16 11:02:55,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 67 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt,66 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/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-16 11:02:55,663 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting nondet_treeErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [nondet_treeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2022-11-16 11:02:55,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:02:55,663 INFO L85 PathProgramCache]: Analyzing trace with hash 540792256, now seen corresponding path program 9 times [2022-11-16 11:02:55,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:02:55,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1180577903] [2022-11-16 11:02:55,664 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-16 11:02:55,664 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-16 11:02:55,664 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:02:55,665 INFO L229 MonitoredProcess]: Starting monitored process 68 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/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-16 11:02:55,667 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/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 (68)] Waiting until timeout for monitored process [2022-11-16 11:02:56,356 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-11-16 11:02:56,356 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 11:02:56,372 INFO L263 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 25 conjunts are in the unsatisfiable core [2022-11-16 11:02:56,375 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:02:56,379 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-16 11:02:56,553 WARN L855 $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-16 11:02:56,685 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-16 11:02:56,685 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-16 11:02:56,701 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_nondet_tree_~n~0.base_560 (_ BitVec 32))) (and (not (= v_nondet_tree_~n~0.base_560 c_nondet_tree_~n~0.base)) (= (store (store |c_old(#length)| c_nondet_tree_~n~0.base (_ bv12 32)) v_nondet_tree_~n~0.base_560 (_ bv12 32)) |c_#length|))) is different from true [2022-11-16 11:02:56,732 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_nondet_tree_~n~0.base_560 (_ BitVec 32)) (|nondet_tree_#res.base| (_ BitVec 32))) (and (not (= v_nondet_tree_~n~0.base_560 |nondet_tree_#res.base|)) (= (store (store |c_old(#length)| |nondet_tree_#res.base| (_ bv12 32)) v_nondet_tree_~n~0.base_560 (_ bv12 32)) |c_#length|))) is different from true [2022-11-16 11:02:56,808 INFO L321 Elim1Store]: treesize reduction 31, result has 13.9 percent of original size [2022-11-16 11:02:56,809 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 1 case distinctions, treesize of input 15 treesize of output 19 [2022-11-16 11:02:56,886 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 140 proven. 8 refuted. 0 times theorem prover too weak. 70 trivial. 34 not checked. [2022-11-16 11:02:56,886 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:02:57,302 INFO L321 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2022-11-16 11:02:57,302 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 15 treesize of output 14 [2022-11-16 11:02:57,483 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:02:57,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1180577903] [2022-11-16 11:02:57,484 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1180577903] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:02:57,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [611996956] [2022-11-16 11:02:57,484 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-16 11:02:57,484 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-16 11:02:57,484 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/cvc4 [2022-11-16 11:02:57,485 INFO L229 MonitoredProcess]: Starting monitored process 69 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-16 11:02:57,487 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (69)] Waiting until timeout for monitored process [2022-11-16 11:02:58,629 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-11-16 11:02:58,629 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 11:02:58,660 INFO L263 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 35 conjunts are in the unsatisfiable core [2022-11-16 11:02:58,663 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:02:58,669 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-16 11:02:58,676 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-16 11:02:59,244 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6442 (_ BitVec 32)) (v_ArrVal_6441 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32))) (and (= (store (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_6441) |c_nondet_tree_#t~ret9.base| v_ArrVal_6442) |c_#length|) (= (_ bv0 1) (select (store |c_old(#valid)| nondet_tree_~n~0.base (_ bv1 1)) |c_nondet_tree_#t~ret9.base|)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-16 11:02:59,268 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6442 (_ BitVec 32)) (v_ArrVal_6441 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32)) (|nondet_tree_#t~ret9.base| (_ BitVec 32))) (and (= (store (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_6441) |nondet_tree_#t~ret9.base| v_ArrVal_6442) |c_#length|) (= (_ bv0 1) (select (store |c_old(#valid)| nondet_tree_~n~0.base (_ bv1 1)) |nondet_tree_#t~ret9.base|)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-16 11:02:59,318 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:02:59,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:02:59,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:02:59,323 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 0 case distinctions, treesize of input 15 treesize of output 19 [2022-11-16 11:02:59,367 INFO L321 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2022-11-16 11:02:59,367 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-16 11:02:59,373 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 137 proven. 39 refuted. 4 times theorem prover too weak. 59 trivial. 13 not checked. [2022-11-16 11:02:59,374 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:03:00,003 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [611996956] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:03:00,003 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:03:00,003 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 17 [2022-11-16 11:03:00,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240393662] [2022-11-16 11:03:00,003 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:03:00,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-16 11:03:00,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:03:00,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-16 11:03:00,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=202, Unknown=6, NotChecked=160, Total=420 [2022-11-16 11:03:00,005 INFO L87 Difference]: Start difference. First operand 470 states and 692 transitions. Second operand has 18 states, 17 states have (on average 3.4705882352941178) internal successors, (59), 16 states have internal predecessors, (59), 9 states have call successors, (15), 3 states have call predecessors, (15), 7 states have return successors, (14), 10 states have call predecessors, (14), 9 states have call successors, (14) [2022-11-16 11:03:00,552 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6442 (_ BitVec 32)) (v_ArrVal_6441 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32))) (and (= (store (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_6441) |c_nondet_tree_#t~ret9.base| v_ArrVal_6442) |c_#length|) (= (_ bv0 1) (select (store |c_old(#valid)| nondet_tree_~n~0.base (_ bv1 1)) |c_nondet_tree_#t~ret9.base|)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) (exists ((v_nondet_tree_~n~0.base_560 (_ BitVec 32))) (and (not (= v_nondet_tree_~n~0.base_560 c_nondet_tree_~n~0.base)) (= (store (store |c_old(#length)| c_nondet_tree_~n~0.base (_ bv12 32)) v_nondet_tree_~n~0.base_560 (_ bv12 32)) |c_#length|)))) is different from true [2022-11-16 11:03:00,565 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_nondet_tree_~n~0.base_560 (_ BitVec 32))) (and (not (= v_nondet_tree_~n~0.base_560 c_nondet_tree_~n~0.base)) (= (store (store |c_old(#length)| c_nondet_tree_~n~0.base (_ bv12 32)) v_nondet_tree_~n~0.base_560 (_ bv12 32)) |c_#length|))) (exists ((v_ArrVal_6442 (_ BitVec 32)) (v_ArrVal_6441 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32)) (|nondet_tree_#t~ret9.base| (_ BitVec 32))) (and (= (store (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_6441) |nondet_tree_#t~ret9.base| v_ArrVal_6442) |c_#length|) (= (_ bv0 1) (select (store |c_old(#valid)| nondet_tree_~n~0.base (_ bv1 1)) |nondet_tree_#t~ret9.base|)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base))))) is different from true [2022-11-16 11:03:00,576 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_nondet_tree_~n~0.base_560 (_ BitVec 32)) (|nondet_tree_#res.base| (_ BitVec 32))) (and (not (= v_nondet_tree_~n~0.base_560 |nondet_tree_#res.base|)) (= (store (store |c_old(#length)| |nondet_tree_#res.base| (_ bv12 32)) v_nondet_tree_~n~0.base_560 (_ bv12 32)) |c_#length|))) (exists ((v_ArrVal_6442 (_ BitVec 32)) (v_ArrVal_6441 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32)) (|nondet_tree_#t~ret9.base| (_ BitVec 32))) (and (= (store (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_6441) |nondet_tree_#t~ret9.base| v_ArrVal_6442) |c_#length|) (= (_ bv0 1) (select (store |c_old(#valid)| nondet_tree_~n~0.base (_ bv1 1)) |nondet_tree_#t~ret9.base|)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base))))) is different from true [2022-11-16 11:03:01,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:03:01,670 INFO L93 Difference]: Finished difference Result 475 states and 699 transitions. [2022-11-16 11:03:01,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-16 11:03:01,671 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 3.4705882352941178) internal successors, (59), 16 states have internal predecessors, (59), 9 states have call successors, (15), 3 states have call predecessors, (15), 7 states have return successors, (14), 10 states have call predecessors, (14), 9 states have call successors, (14) Word has length 77 [2022-11-16 11:03:01,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:03:01,673 INFO L225 Difference]: With dead ends: 475 [2022-11-16 11:03:01,673 INFO L226 Difference]: Without dead ends: 475 [2022-11-16 11:03:01,673 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 138 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=77, Invalid=287, Unknown=10, NotChecked=328, Total=702 [2022-11-16 11:03:01,674 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 176 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 547 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 2350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1759 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-16 11:03:01,674 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 458 Invalid, 2350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 547 Invalid, 0 Unknown, 1759 Unchecked, 1.3s Time] [2022-11-16 11:03:01,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2022-11-16 11:03:01,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 470. [2022-11-16 11:03:01,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 470 states, 308 states have (on average 1.3084415584415585) internal successors, (403), 364 states have internal predecessors, (403), 66 states have call successors, (66), 28 states have call predecessors, (66), 45 states have return successors, (223), 77 states have call predecessors, (223), 66 states have call successors, (223) [2022-11-16 11:03:01,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 692 transitions. [2022-11-16 11:03:01,699 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 692 transitions. Word has length 77 [2022-11-16 11:03:01,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:03:01,700 INFO L495 AbstractCegarLoop]: Abstraction has 470 states and 692 transitions. [2022-11-16 11:03:01,700 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 3.4705882352941178) internal successors, (59), 16 states have internal predecessors, (59), 9 states have call successors, (15), 3 states have call predecessors, (15), 7 states have return successors, (14), 10 states have call predecessors, (14), 9 states have call successors, (14) [2022-11-16 11:03:01,700 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 692 transitions. [2022-11-16 11:03:01,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-11-16 11:03:01,703 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:03:01,703 INFO L195 NwaCegarLoop]: trace histogram [11, 8, 8, 8, 8, 7, 7, 6, 6, 6, 4, 4, 4, 1, 1, 1, 1] [2022-11-16 11:03:01,727 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/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 (68)] Forceful destruction successful, exit code 0 [2022-11-16 11:03:01,924 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (69)] Forceful destruction successful, exit code 0 [2022-11-16 11:03:02,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 68 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/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,69 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt [2022-11-16 11:03:02,114 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting nondet_treeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [nondet_treeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2022-11-16 11:03:02,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:03:02,114 INFO L85 PathProgramCache]: Analyzing trace with hash -1191813520, now seen corresponding path program 5 times [2022-11-16 11:03:02,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:03:02,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [439278759] [2022-11-16 11:03:02,115 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-16 11:03:02,115 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-16 11:03:02,115 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:03:02,116 INFO L229 MonitoredProcess]: Starting monitored process 70 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/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-16 11:03:02,122 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/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 (70)] Waiting until timeout for monitored process [2022-11-16 11:03:03,812 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2022-11-16 11:03:03,812 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 11:03:03,843 INFO L263 TraceCheckSpWp]: Trace formula consists of 635 conjuncts, 23 conjunts are in the unsatisfiable core [2022-11-16 11:03:03,845 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:03:03,859 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-16 11:03:03,891 WARN L855 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_6652 (_ BitVec 1))) (= |c_#valid| (store |c_old(#valid)| nondet_tree_~n~0.base v_ArrVal_6652))) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-16 11:03:03,923 WARN L855 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32)) (v_ArrVal_6652 (_ BitVec 1))) (and (= |c_#valid| (store |c_old(#valid)| nondet_tree_~n~0.base v_ArrVal_6652)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-16 11:03:03,946 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6653 (_ BitVec 1))) (= (store |c_old(#valid)| c_nondet_tree_~n~0.base v_ArrVal_6653) |c_#valid|)) is different from true [2022-11-16 11:03:03,961 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6654 (_ BitVec 1))) (= (store |c_old(#valid)| c_nondet_tree_~n~0.base v_ArrVal_6654) |c_#valid|)) is different from true [2022-11-16 11:03:04,030 WARN L855 $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-16 11:03:04,049 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_nondet_tree_~n~0.base_580 (_ BitVec 32)) (v_ArrVal_6653 (_ BitVec 1))) (= |c_#valid| (store (store |c_old(#valid)| c_nondet_tree_~n~0.base v_ArrVal_6653) v_nondet_tree_~n~0.base_580 (_ bv1 1)))) is different from true [2022-11-16 11:03:08,306 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 11:03:08,412 INFO L321 Elim1Store]: treesize reduction 88, result has 29.6 percent of original size [2022-11-16 11:03:08,412 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 5 case distinctions, treesize of input 25 treesize of output 52 [2022-11-16 11:03:08,431 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 196 proven. 19 refuted. 0 times theorem prover too weak. 100 trivial. 47 not checked. [2022-11-16 11:03:08,431 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:03:09,905 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:03:09,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [439278759] [2022-11-16 11:03:09,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [439278759] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:03:09,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1657832625] [2022-11-16 11:03:09,906 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-16 11:03:09,906 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-16 11:03:09,906 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/cvc4 [2022-11-16 11:03:09,907 INFO L229 MonitoredProcess]: Starting monitored process 71 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-16 11:03:09,909 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (71)] Waiting until timeout for monitored process [2022-11-16 11:03:11,698 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-16 11:03:11,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1497539550] [2022-11-16 11:03:11,698 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-16 11:03:11,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:03:11,699 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:03:11,702 INFO L229 MonitoredProcess]: Starting monitored process 72 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:03:11,719 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (71)] Ended with exit code 1 [2022-11-16 11:03:11,720 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (72)] Waiting until timeout for monitored process [2022-11-16 11:04:52,617 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2022-11-16 11:04:52,617 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 11:04:52,651 INFO L263 TraceCheckSpWp]: Trace formula consists of 635 conjuncts, 24 conjunts are in the unsatisfiable core [2022-11-16 11:04:52,655 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:04:52,659 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-16 11:04:52,843 WARN L855 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_7066 (_ BitVec 1))) (= |c_#valid| (store |c_old(#valid)| nondet_tree_~n~0.base v_ArrVal_7066))) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-16 11:04:52,874 WARN L855 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_7067 (_ BitVec 1))) (= |c_#valid| (store |c_old(#valid)| nondet_tree_~n~0.base v_ArrVal_7067))) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-16 11:04:52,914 WARN L855 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32)) (v_ArrVal_7067 (_ BitVec 1))) (and (= |c_#valid| (store |c_old(#valid)| nondet_tree_~n~0.base v_ArrVal_7067)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-16 11:04:53,005 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_7066 (_ BitVec 1)) (v_nondet_tree_~n~0.base_610 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32)) (v_ArrVal_7067 (_ BitVec 1))) (let ((.cse0 (store |c_old(#valid)| v_nondet_tree_~n~0.base_610 v_ArrVal_7066))) (and (= (_ bv0 1) (select |c_old(#valid)| v_nondet_tree_~n~0.base_610)) (= |c_#valid| (store .cse0 nondet_tree_~n~0.base v_ArrVal_7067)) (= (_ bv0 1) (select .cse0 nondet_tree_~n~0.base))))) is different from true [2022-11-16 11:04:58,828 INFO L321 Elim1Store]: treesize reduction 144, result has 23.0 percent of original size [2022-11-16 11:04:58,829 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 11 case distinctions, treesize of input 114 treesize of output 141 [2022-11-16 11:04:58,952 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 195 proven. 11 refuted. 0 times theorem prover too weak. 104 trivial. 52 not checked. [2022-11-16 11:04:58,952 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:05:01,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1497539550] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:05:01,405 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:05:01,405 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 20 [2022-11-16 11:05:01,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763990121] [2022-11-16 11:05:01,406 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:05:01,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-11-16 11:05:01,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:05:01,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-11-16 11:05:01,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=123, Unknown=15, NotChecked=310, Total=506 [2022-11-16 11:05:01,407 INFO L87 Difference]: Start difference. First operand 470 states and 692 transitions. Second operand has 21 states, 20 states have (on average 3.35) internal successors, (67), 20 states have internal predecessors, (67), 14 states have call successors, (16), 2 states have call predecessors, (16), 8 states have return successors, (16), 12 states have call predecessors, (16), 14 states have call successors, (16) [2022-11-16 11:05:05,563 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((nondet_tree_~n~0.base (_ BitVec 32)) (v_ArrVal_6652 (_ BitVec 1))) (and (= |c_#valid| (store |c_old(#valid)| nondet_tree_~n~0.base v_ArrVal_6652)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (= (bvadd (select |c_#valid| nondet_tree_~n~0.base) (_ bv1 1)) (_ bv0 1)) (exists ((v_ArrVal_7065 (_ BitVec 1))) (= |c_#valid| (store |c_old(#valid)| nondet_tree_~n~0.base v_ArrVal_7065))) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) (exists ((nondet_tree_~n~0.base (_ BitVec 32)) (v_ArrVal_7067 (_ BitVec 1))) (and (= |c_#valid| (store |c_old(#valid)| nondet_tree_~n~0.base v_ArrVal_7067)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base))))) is different from true [2022-11-16 11:05:05,567 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (= (store |c_old(#valid)| nondet_tree_~n~0.base (_ bv1 1)) |c_#valid|)) (exists ((nondet_tree_~n~0.base (_ BitVec 32)) (v_ArrVal_7067 (_ BitVec 1))) (and (= |c_#valid| (store |c_old(#valid)| nondet_tree_~n~0.base v_ArrVal_7067)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base))))) is different from true [2022-11-16 11:05:06,012 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7066 (_ BitVec 1)) (v_nondet_tree_~n~0.base_610 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32)) (v_ArrVal_7067 (_ BitVec 1))) (let ((.cse0 (store |c_old(#valid)| v_nondet_tree_~n~0.base_610 v_ArrVal_7066))) (and (= (_ bv0 1) (select |c_old(#valid)| v_nondet_tree_~n~0.base_610)) (= |c_#valid| (store .cse0 nondet_tree_~n~0.base v_ArrVal_7067)) (= (_ bv0 1) (select .cse0 nondet_tree_~n~0.base))))) (exists ((v_nondet_tree_~n~0.base_580 (_ BitVec 32)) (v_ArrVal_6653 (_ BitVec 1))) (= |c_#valid| (store (store |c_old(#valid)| c_nondet_tree_~n~0.base v_ArrVal_6653) v_nondet_tree_~n~0.base_580 (_ bv1 1))))) is different from true [2022-11-16 11:05:06,019 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7066 (_ BitVec 1)) (v_nondet_tree_~n~0.base_610 (_ BitVec 32)) (nondet_tree_~n~0.base (_ BitVec 32)) (v_ArrVal_7067 (_ BitVec 1))) (let ((.cse0 (store |c_old(#valid)| v_nondet_tree_~n~0.base_610 v_ArrVal_7066))) (and (= (_ bv0 1) (select |c_old(#valid)| v_nondet_tree_~n~0.base_610)) (= |c_#valid| (store .cse0 nondet_tree_~n~0.base v_ArrVal_7067)) (= (_ bv0 1) (select .cse0 nondet_tree_~n~0.base))))) (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (= (bvadd (select |c_#valid| nondet_tree_~n~0.base) (_ bv1 1)) (_ bv0 1)) (exists ((v_nondet_tree_~n~0.base_580 (_ BitVec 32)) (v_ArrVal_6653 (_ BitVec 1))) (= |c_#valid| (store (store |c_old(#valid)| nondet_tree_~n~0.base v_ArrVal_6653) v_nondet_tree_~n~0.base_580 (_ bv1 1))))))) is different from true [2022-11-16 11:05:06,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:05:06,252 INFO L93 Difference]: Finished difference Result 484 states and 742 transitions. [2022-11-16 11:05:06,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-16 11:05:06,253 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 3.35) internal successors, (67), 20 states have internal predecessors, (67), 14 states have call successors, (16), 2 states have call predecessors, (16), 8 states have return successors, (16), 12 states have call predecessors, (16), 14 states have call successors, (16) Word has length 91 [2022-11-16 11:05:06,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:05:06,256 INFO L225 Difference]: With dead ends: 484 [2022-11-16 11:05:06,257 INFO L226 Difference]: Without dead ends: 484 [2022-11-16 11:05:06,257 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 165 SyntacticMatches, 5 SemanticMatches, 26 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 17.1s TimeCoverageRelationStatistics Valid=76, Invalid=142, Unknown=20, NotChecked=518, Total=756 [2022-11-16 11:05:06,258 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 91 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 2876 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2627 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-16 11:05:06,258 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 441 Invalid, 2876 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 234 Invalid, 0 Unknown, 2627 Unchecked, 0.7s Time] [2022-11-16 11:05:06,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2022-11-16 11:05:06,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 479. [2022-11-16 11:05:06,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 479 states, 315 states have (on average 1.3047619047619048) internal successors, (411), 370 states have internal predecessors, (411), 66 states have call successors, (66), 28 states have call predecessors, (66), 47 states have return successors, (259), 80 states have call predecessors, (259), 66 states have call successors, (259) [2022-11-16 11:05:06,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 736 transitions. [2022-11-16 11:05:06,278 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 736 transitions. Word has length 91 [2022-11-16 11:05:06,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:05:06,279 INFO L495 AbstractCegarLoop]: Abstraction has 479 states and 736 transitions. [2022-11-16 11:05:06,279 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 3.35) internal successors, (67), 20 states have internal predecessors, (67), 14 states have call successors, (16), 2 states have call predecessors, (16), 8 states have return successors, (16), 12 states have call predecessors, (16), 14 states have call successors, (16) [2022-11-16 11:05:06,279 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 736 transitions. [2022-11-16 11:05:06,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-11-16 11:05:06,282 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:05:06,282 INFO L195 NwaCegarLoop]: trace histogram [11, 8, 8, 8, 8, 7, 7, 6, 6, 6, 4, 4, 4, 1, 1, 1, 1] [2022-11-16 11:05:06,319 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/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 (70)] Forceful destruction successful, exit code 0 [2022-11-16 11:05:06,548 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (72)] Forceful destruction successful, exit code 0 [2022-11-16 11:05:06,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 70 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/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,72 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:05:06,695 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting nondet_treeErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [nondet_treeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, nondet_treeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2022-11-16 11:05:06,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:05:06,696 INFO L85 PathProgramCache]: Analyzing trace with hash -1191813519, now seen corresponding path program 5 times [2022-11-16 11:05:06,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:05:06,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1591022515] [2022-11-16 11:05:06,696 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-16 11:05:06,697 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-16 11:05:06,697 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:05:06,698 INFO L229 MonitoredProcess]: Starting monitored process 73 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/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-16 11:05:06,736 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/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 (73)] Waiting until timeout for monitored process [2022-11-16 11:05:08,806 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2022-11-16 11:05:08,806 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 11:05:08,843 INFO L263 TraceCheckSpWp]: Trace formula consists of 635 conjuncts, 28 conjunts are in the unsatisfiable core [2022-11-16 11:05:08,846 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:05:08,864 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-16 11:05:08,872 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-16 11:05:08,964 WARN L855 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_7282 (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_7282))) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-16 11:05:09,016 WARN L855 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32)) (v_ArrVal_7282 (_ BitVec 32))) (and (= |c_#length| (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_7282)) (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)))) is different from true [2022-11-16 11:05:09,058 WARN L855 $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-16 11:05:09,140 WARN L855 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32)) (v_nondet_tree_~n~0.base_631 (_ BitVec 32))) (= |c_#length| (store (store |c_old(#length)| nondet_tree_~n~0.base (_ bv12 32)) v_nondet_tree_~n~0.base_631 (_ bv12 32)))) is different from true [2022-11-16 11:05:09,194 WARN L855 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base (_ BitVec 32)) (v_nondet_tree_~n~0.base_632 (_ BitVec 32)) (v_nondet_tree_~n~0.base_631 (_ BitVec 32)) (v_ArrVal_7282 (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| nondet_tree_~n~0.base)) (= (store (store (store |c_old(#length)| nondet_tree_~n~0.base v_ArrVal_7282) v_nondet_tree_~n~0.base_632 (_ bv12 32)) v_nondet_tree_~n~0.base_631 (_ bv12 32)) |c_#length|))) is different from true [2022-11-16 11:05:09,250 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:05:09,346 INFO L321 Elim1Store]: treesize reduction 67, result has 25.6 percent of original size [2022-11-16 11:05:09,346 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-16 11:05:09,368 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-16 11:05:09,368 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-16 11:05:09,424 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 196 proven. 6 refuted. 0 times theorem prover too weak. 97 trivial. 63 not checked. [2022-11-16 11:05:09,425 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:05:11,962 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:05:11,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1591022515] [2022-11-16 11:05:11,963 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1591022515] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:05:11,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1837159160] [2022-11-16 11:05:11,963 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-16 11:05:11,963 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-16 11:05:11,963 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/cvc4 [2022-11-16 11:05:11,964 INFO L229 MonitoredProcess]: Starting monitored process 74 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-16 11:05:11,967 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (74)] Waiting until timeout for monitored process [2022-11-16 11:05:14,005 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-16 11:05:14,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [194272576] [2022-11-16 11:05:14,006 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-16 11:05:14,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:05:14,006 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:05:14,010 INFO L229 MonitoredProcess]: Starting monitored process 75 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:05:14,027 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (74)] Ended with exit code 1 [2022-11-16 11:05:14,028 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f938416-68ba-48bb-bd7d-a14849e39d84/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (75)] Waiting until timeout for monitored process