./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/ldv-memsafety/memleaks_test18.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 53f42b1a Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d32aa0-c8be-46b3-99dd-0695538a2725/bin/uautomizer-DQz5hQGWxF/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d32aa0-c8be-46b3-99dd-0695538a2725/bin/uautomizer-DQz5hQGWxF/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d32aa0-c8be-46b3-99dd-0695538a2725/bin/uautomizer-DQz5hQGWxF/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d32aa0-c8be-46b3-99dd-0695538a2725/bin/uautomizer-DQz5hQGWxF/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/ldv-memsafety/memleaks_test18.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d32aa0-c8be-46b3-99dd-0695538a2725/bin/uautomizer-DQz5hQGWxF/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d32aa0-c8be-46b3-99dd-0695538a2725/bin/uautomizer-DQz5hQGWxF --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 98678a21a2b37b871d00192aacebe14c4ee9cc87b75400dd7a4adc0ccfa93151 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-53f42b1 [2021-11-20 06:16:37,642 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-20 06:16:37,645 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-20 06:16:37,674 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-20 06:16:37,674 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-20 06:16:37,676 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-20 06:16:37,678 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-20 06:16:37,680 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-20 06:16:37,682 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-20 06:16:37,683 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-20 06:16:37,685 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-20 06:16:37,686 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-20 06:16:37,687 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-20 06:16:37,688 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-20 06:16:37,690 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-20 06:16:37,691 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-20 06:16:37,692 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-20 06:16:37,693 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-20 06:16:37,695 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-20 06:16:37,698 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-20 06:16:37,699 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-20 06:16:37,701 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-20 06:16:37,702 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-20 06:16:37,704 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-20 06:16:37,707 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-20 06:16:37,707 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-20 06:16:37,708 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-20 06:16:37,709 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-20 06:16:37,709 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-20 06:16:37,710 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-20 06:16:37,711 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-20 06:16:37,712 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-20 06:16:37,713 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-20 06:16:37,714 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-20 06:16:37,715 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-20 06:16:37,715 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-20 06:16:37,716 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-20 06:16:37,716 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-20 06:16:37,717 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-20 06:16:37,718 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-20 06:16:37,718 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-20 06:16:37,719 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d32aa0-c8be-46b3-99dd-0695538a2725/bin/uautomizer-DQz5hQGWxF/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2021-11-20 06:16:37,743 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-20 06:16:37,744 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-20 06:16:37,744 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-20 06:16:37,744 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-20 06:16:37,745 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-20 06:16:37,745 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-20 06:16:37,746 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-20 06:16:37,746 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-20 06:16:37,746 INFO L138 SettingsManager]: * Use SBE=true [2021-11-20 06:16:37,746 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-20 06:16:37,747 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-20 06:16:37,747 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-11-20 06:16:37,747 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-20 06:16:37,747 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-20 06:16:37,747 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-20 06:16:37,747 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-11-20 06:16:37,748 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-11-20 06:16:37,748 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-11-20 06:16:37,748 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-20 06:16:37,748 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-20 06:16:37,748 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-20 06:16:37,749 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-20 06:16:37,749 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-20 06:16:37,749 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-20 06:16:37,749 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-20 06:16:37,749 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-20 06:16:37,750 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-20 06:16:37,750 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-20 06:16:37,750 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-20 06:16:37,750 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-20 06:16:37,750 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-20 06:16:37,751 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_e4d32aa0-c8be-46b3-99dd-0695538a2725/bin/uautomizer-DQz5hQGWxF/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_e4d32aa0-c8be-46b3-99dd-0695538a2725/bin/uautomizer-DQz5hQGWxF 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-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 98678a21a2b37b871d00192aacebe14c4ee9cc87b75400dd7a4adc0ccfa93151 [2021-11-20 06:16:37,996 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-20 06:16:38,032 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-20 06:16:38,035 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-20 06:16:38,036 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-20 06:16:38,037 INFO L275 PluginConnector]: CDTParser initialized [2021-11-20 06:16:38,038 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d32aa0-c8be-46b3-99dd-0695538a2725/bin/uautomizer-DQz5hQGWxF/../../sv-benchmarks/c/ldv-memsafety/memleaks_test18.i [2021-11-20 06:16:38,108 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d32aa0-c8be-46b3-99dd-0695538a2725/bin/uautomizer-DQz5hQGWxF/data/0e0e8b13f/7a9cd9e25ca44140a84cace84361ec75/FLAGf362f37bd [2021-11-20 06:16:38,680 INFO L306 CDTParser]: Found 1 translation units. [2021-11-20 06:16:38,681 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d32aa0-c8be-46b3-99dd-0695538a2725/sv-benchmarks/c/ldv-memsafety/memleaks_test18.i [2021-11-20 06:16:38,704 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d32aa0-c8be-46b3-99dd-0695538a2725/bin/uautomizer-DQz5hQGWxF/data/0e0e8b13f/7a9cd9e25ca44140a84cace84361ec75/FLAGf362f37bd [2021-11-20 06:16:38,938 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d32aa0-c8be-46b3-99dd-0695538a2725/bin/uautomizer-DQz5hQGWxF/data/0e0e8b13f/7a9cd9e25ca44140a84cace84361ec75 [2021-11-20 06:16:38,948 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-20 06:16:38,951 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-20 06:16:38,954 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-20 06:16:38,954 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-20 06:16:38,958 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-20 06:16:38,960 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 06:16:38" (1/1) ... [2021-11-20 06:16:38,962 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f3bccc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:16:38, skipping insertion in model container [2021-11-20 06:16:38,963 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 06:16:38" (1/1) ... [2021-11-20 06:16:38,970 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-20 06:16:39,037 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-20 06:16:39,417 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-20 06:16:39,436 ERROR L326 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types where the value type is smaller than the cast-to type while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2021-11-20 06:16:39,439 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@26231b80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:16:39, skipping insertion in model container [2021-11-20 06:16:39,440 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-20 06:16:39,440 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2021-11-20 06:16:39,442 INFO L158 Benchmark]: Toolchain (without parser) took 489.85ms. Allocated memory was 77.6MB in the beginning and 107.0MB in the end (delta: 29.4MB). Free memory was 39.2MB in the beginning and 77.8MB in the end (delta: -38.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2021-11-20 06:16:39,445 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 77.6MB. Free memory was 57.0MB in the beginning and 57.0MB in the end (delta: 44.9kB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-20 06:16:39,447 INFO L158 Benchmark]: CACSL2BoogieTranslator took 485.98ms. Allocated memory was 77.6MB in the beginning and 107.0MB in the end (delta: 29.4MB). Free memory was 39.0MB in the beginning and 78.1MB in the end (delta: -39.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2021-11-20 06:16:39,449 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 77.6MB. Free memory was 57.0MB in the beginning and 57.0MB in the end (delta: 44.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 485.98ms. Allocated memory was 77.6MB in the beginning and 107.0MB in the end (delta: 29.4MB). Free memory was 39.0MB in the beginning and 78.1MB in the end (delta: -39.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 576]: Unsupported Syntax Found a cast between two array/pointer types where the value type is smaller than the cast-to type while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d32aa0-c8be-46b3-99dd-0695538a2725/bin/uautomizer-DQz5hQGWxF/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d32aa0-c8be-46b3-99dd-0695538a2725/bin/uautomizer-DQz5hQGWxF/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d32aa0-c8be-46b3-99dd-0695538a2725/bin/uautomizer-DQz5hQGWxF/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d32aa0-c8be-46b3-99dd-0695538a2725/bin/uautomizer-DQz5hQGWxF/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/ldv-memsafety/memleaks_test18.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d32aa0-c8be-46b3-99dd-0695538a2725/bin/uautomizer-DQz5hQGWxF/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d32aa0-c8be-46b3-99dd-0695538a2725/bin/uautomizer-DQz5hQGWxF --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 98678a21a2b37b871d00192aacebe14c4ee9cc87b75400dd7a4adc0ccfa93151 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-53f42b1 [2021-11-20 06:16:41,721 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-20 06:16:41,724 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-20 06:16:41,776 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-20 06:16:41,777 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-20 06:16:41,781 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-20 06:16:41,783 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-20 06:16:41,790 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-20 06:16:41,793 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-20 06:16:41,800 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-20 06:16:41,802 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-20 06:16:41,804 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-20 06:16:41,804 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-20 06:16:41,808 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-20 06:16:41,810 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-20 06:16:41,816 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-20 06:16:41,818 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-20 06:16:41,819 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-20 06:16:41,821 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-20 06:16:41,831 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-20 06:16:41,833 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-20 06:16:41,834 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-20 06:16:41,837 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-20 06:16:41,839 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-20 06:16:41,848 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-20 06:16:41,849 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-20 06:16:41,849 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-20 06:16:41,851 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-20 06:16:41,852 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-20 06:16:41,853 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-20 06:16:41,853 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-20 06:16:41,854 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-20 06:16:41,856 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-20 06:16:41,857 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-20 06:16:41,858 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-20 06:16:41,859 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-20 06:16:41,860 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-20 06:16:41,860 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-20 06:16:41,860 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-20 06:16:41,862 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-20 06:16:41,863 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-20 06:16:41,868 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d32aa0-c8be-46b3-99dd-0695538a2725/bin/uautomizer-DQz5hQGWxF/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2021-11-20 06:16:41,910 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-20 06:16:41,910 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-20 06:16:41,911 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-20 06:16:41,911 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-20 06:16:41,912 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-20 06:16:41,913 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-20 06:16:41,914 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-20 06:16:41,914 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-20 06:16:41,915 INFO L138 SettingsManager]: * Use SBE=true [2021-11-20 06:16:41,915 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-20 06:16:41,916 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-20 06:16:41,916 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-11-20 06:16:41,917 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-20 06:16:41,917 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-20 06:16:41,917 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-20 06:16:41,917 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-11-20 06:16:41,918 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-11-20 06:16:41,918 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-11-20 06:16:41,918 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-20 06:16:41,918 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-20 06:16:41,919 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-11-20 06:16:41,919 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-11-20 06:16:41,919 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-20 06:16:41,919 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-20 06:16:41,919 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-20 06:16:41,920 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-20 06:16:41,920 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-20 06:16:41,920 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-20 06:16:41,921 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-20 06:16:41,921 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-20 06:16:41,921 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-11-20 06:16:41,921 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-11-20 06:16:41,922 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-20 06:16:41,922 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-20 06:16:41,922 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_e4d32aa0-c8be-46b3-99dd-0695538a2725/bin/uautomizer-DQz5hQGWxF/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_e4d32aa0-c8be-46b3-99dd-0695538a2725/bin/uautomizer-DQz5hQGWxF 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-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 98678a21a2b37b871d00192aacebe14c4ee9cc87b75400dd7a4adc0ccfa93151 [2021-11-20 06:16:42,315 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-20 06:16:42,335 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-20 06:16:42,338 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-20 06:16:42,339 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-20 06:16:42,340 INFO L275 PluginConnector]: CDTParser initialized [2021-11-20 06:16:42,341 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d32aa0-c8be-46b3-99dd-0695538a2725/bin/uautomizer-DQz5hQGWxF/../../sv-benchmarks/c/ldv-memsafety/memleaks_test18.i [2021-11-20 06:16:42,419 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d32aa0-c8be-46b3-99dd-0695538a2725/bin/uautomizer-DQz5hQGWxF/data/d8866a5cd/3d2607049f3740cc8a438d537df86c56/FLAG19f0d975f [2021-11-20 06:16:43,030 INFO L306 CDTParser]: Found 1 translation units. [2021-11-20 06:16:43,031 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d32aa0-c8be-46b3-99dd-0695538a2725/sv-benchmarks/c/ldv-memsafety/memleaks_test18.i [2021-11-20 06:16:43,049 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d32aa0-c8be-46b3-99dd-0695538a2725/bin/uautomizer-DQz5hQGWxF/data/d8866a5cd/3d2607049f3740cc8a438d537df86c56/FLAG19f0d975f [2021-11-20 06:16:43,246 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d32aa0-c8be-46b3-99dd-0695538a2725/bin/uautomizer-DQz5hQGWxF/data/d8866a5cd/3d2607049f3740cc8a438d537df86c56 [2021-11-20 06:16:43,250 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-20 06:16:43,252 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-20 06:16:43,254 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-20 06:16:43,254 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-20 06:16:43,257 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-20 06:16:43,258 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 06:16:43" (1/1) ... [2021-11-20 06:16:43,260 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23528277 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:16:43, skipping insertion in model container [2021-11-20 06:16:43,260 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 06:16:43" (1/1) ... [2021-11-20 06:16:43,267 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-20 06:16:43,337 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-20 06:16:43,851 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-20 06:16:43,868 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2021-11-20 06:16:43,876 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-20 06:16:43,936 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-20 06:16:43,951 INFO L203 MainTranslator]: Completed pre-run [2021-11-20 06:16:44,010 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-20 06:16:44,060 INFO L208 MainTranslator]: Completed translation [2021-11-20 06:16:44,060 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:16:44 WrapperNode [2021-11-20 06:16:44,060 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-20 06:16:44,062 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-20 06:16:44,062 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-20 06:16:44,062 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-20 06:16:44,069 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:16:44" (1/1) ... [2021-11-20 06:16:44,114 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:16:44" (1/1) ... [2021-11-20 06:16:44,135 INFO L137 Inliner]: procedures = 165, calls = 73, calls flagged for inlining = 21, calls inlined = 3, statements flattened = 52 [2021-11-20 06:16:44,136 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-20 06:16:44,137 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-20 06:16:44,137 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-20 06:16:44,137 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-20 06:16:44,148 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:16:44" (1/1) ... [2021-11-20 06:16:44,148 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:16:44" (1/1) ... [2021-11-20 06:16:44,151 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:16:44" (1/1) ... [2021-11-20 06:16:44,152 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:16:44" (1/1) ... [2021-11-20 06:16:44,169 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:16:44" (1/1) ... [2021-11-20 06:16:44,173 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:16:44" (1/1) ... [2021-11-20 06:16:44,175 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:16:44" (1/1) ... [2021-11-20 06:16:44,194 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-20 06:16:44,195 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-20 06:16:44,195 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-20 06:16:44,195 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-20 06:16:44,196 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:16:44" (1/1) ... [2021-11-20 06:16:44,210 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-20 06:16:44,229 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d32aa0-c8be-46b3-99dd-0695538a2725/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:16:44,245 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d32aa0-c8be-46b3-99dd-0695538a2725/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-20 06:16:44,268 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d32aa0-c8be-46b3-99dd-0695538a2725/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-20 06:16:44,296 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2021-11-20 06:16:44,296 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2021-11-20 06:16:44,296 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-20 06:16:44,296 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-20 06:16:44,296 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-20 06:16:44,297 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-20 06:16:44,297 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-20 06:16:44,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-20 06:16:44,299 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-20 06:16:44,299 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-20 06:16:44,445 INFO L236 CfgBuilder]: Building ICFG [2021-11-20 06:16:44,447 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-20 06:16:44,719 INFO L277 CfgBuilder]: Performing block encoding [2021-11-20 06:16:44,725 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-20 06:16:44,729 INFO L301 CfgBuilder]: Removed 2 assume(true) statements. [2021-11-20 06:16:44,731 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:16:44 BoogieIcfgContainer [2021-11-20 06:16:44,733 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-20 06:16:44,735 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-20 06:16:44,736 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-20 06:16:44,739 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-20 06:16:44,739 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 06:16:43" (1/3) ... [2021-11-20 06:16:44,740 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@607f8226 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 06:16:44, skipping insertion in model container [2021-11-20 06:16:44,740 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:16:44" (2/3) ... [2021-11-20 06:16:44,741 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@607f8226 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 06:16:44, skipping insertion in model container [2021-11-20 06:16:44,742 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:16:44" (3/3) ... [2021-11-20 06:16:44,743 INFO L111 eAbstractionObserver]: Analyzing ICFG memleaks_test18.i [2021-11-20 06:16:44,749 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-20 06:16:44,749 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2021-11-20 06:16:44,810 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-20 06:16:44,824 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-11-20 06:16:44,824 INFO L340 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2021-11-20 06:16:44,840 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 25 states have (on average 1.72) internal successors, (43), 36 states have internal predecessors, (43), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-20 06:16:44,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-20 06:16:44,847 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:16:44,848 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:16:44,849 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 7 more)] === [2021-11-20 06:16:44,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:16:44,856 INFO L85 PathProgramCache]: Analyzing trace with hash 1121278797, now seen corresponding path program 1 times [2021-11-20 06:16:44,867 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-20 06:16:44,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1511079089] [2021-11-20 06:16:44,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:16:44,869 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-20 06:16:44,869 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d32aa0-c8be-46b3-99dd-0695538a2725/bin/uautomizer-DQz5hQGWxF/mathsat [2021-11-20 06:16:44,872 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d32aa0-c8be-46b3-99dd-0695538a2725/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-20 06:16:44,905 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d32aa0-c8be-46b3-99dd-0695538a2725/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-11-20 06:16:44,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:16:44,980 INFO L263 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-20 06:16:44,986 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:16:45,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 06:16:45,106 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 06:16:45,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 06:16:45,206 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-20 06:16:45,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1511079089] [2021-11-20 06:16:45,206 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1511079089] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-20 06:16:45,207 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-20 06:16:45,207 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2021-11-20 06:16:45,208 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765115957] [2021-11-20 06:16:45,209 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-20 06:16:45,213 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-20 06:16:45,213 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-20 06:16:45,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-20 06:16:45,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-20 06:16:45,257 INFO L87 Difference]: Start difference. First operand has 40 states, 25 states have (on average 1.72) internal successors, (43), 36 states have internal predecessors, (43), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-20 06:16:45,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:16:45,436 INFO L93 Difference]: Finished difference Result 74 states and 85 transitions. [2021-11-20 06:16:45,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-20 06:16:45,440 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2021-11-20 06:16:45,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:16:45,448 INFO L225 Difference]: With dead ends: 74 [2021-11-20 06:16:45,448 INFO L226 Difference]: Without dead ends: 70 [2021-11-20 06:16:45,450 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-20 06:16:45,460 INFO L933 BasicCegarLoop]: 45 mSDtfsCounter, 33 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-20 06:16:45,462 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 163 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-20 06:16:45,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2021-11-20 06:16:45,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 42. [2021-11-20 06:16:45,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 27 states have (on average 1.5555555555555556) internal successors, (42), 37 states have internal predecessors, (42), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2021-11-20 06:16:45,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2021-11-20 06:16:45,515 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 48 transitions. Word has length 11 [2021-11-20 06:16:45,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:16:45,517 INFO L470 AbstractCegarLoop]: Abstraction has 42 states and 48 transitions. [2021-11-20 06:16:45,518 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-20 06:16:45,518 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2021-11-20 06:16:45,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-20 06:16:45,520 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:16:45,520 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:16:45,535 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d32aa0-c8be-46b3-99dd-0695538a2725/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-11-20 06:16:45,730 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d32aa0-c8be-46b3-99dd-0695538a2725/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 [2021-11-20 06:16:45,730 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 7 more)] === [2021-11-20 06:16:45,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:16:45,733 INFO L85 PathProgramCache]: Analyzing trace with hash 2008782478, now seen corresponding path program 1 times [2021-11-20 06:16:45,737 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-20 06:16:45,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1830245872] [2021-11-20 06:16:45,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:16:45,739 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-20 06:16:45,739 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d32aa0-c8be-46b3-99dd-0695538a2725/bin/uautomizer-DQz5hQGWxF/mathsat [2021-11-20 06:16:45,740 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d32aa0-c8be-46b3-99dd-0695538a2725/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-20 06:16:45,747 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d32aa0-c8be-46b3-99dd-0695538a2725/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-11-20 06:16:45,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:16:45,791 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-20 06:16:45,793 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:16:45,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 06:16:45,864 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 06:16:45,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 06:16:45,911 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-20 06:16:45,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1830245872] [2021-11-20 06:16:45,912 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1830245872] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-20 06:16:45,913 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-20 06:16:45,913 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-11-20 06:16:45,913 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929694717] [2021-11-20 06:16:45,913 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-20 06:16:45,914 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-20 06:16:45,915 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-20 06:16:45,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-20 06:16:45,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-20 06:16:45,917 INFO L87 Difference]: Start difference. First operand 42 states and 48 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-20 06:16:46,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:16:46,039 INFO L93 Difference]: Finished difference Result 69 states and 79 transitions. [2021-11-20 06:16:46,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-20 06:16:46,039 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2021-11-20 06:16:46,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:16:46,041 INFO L225 Difference]: With dead ends: 69 [2021-11-20 06:16:46,041 INFO L226 Difference]: Without dead ends: 67 [2021-11-20 06:16:46,041 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-20 06:16:46,043 INFO L933 BasicCegarLoop]: 67 mSDtfsCounter, 26 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-20 06:16:46,043 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 145 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-20 06:16:46,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2021-11-20 06:16:46,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 38. [2021-11-20 06:16:46,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 24 states have (on average 1.5833333333333333) internal successors, (38), 34 states have internal predecessors, (38), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-20 06:16:46,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2021-11-20 06:16:46,051 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 11 [2021-11-20 06:16:46,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:16:46,051 INFO L470 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2021-11-20 06:16:46,051 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-20 06:16:46,052 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2021-11-20 06:16:46,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-20 06:16:46,052 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:16:46,052 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:16:46,069 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d32aa0-c8be-46b3-99dd-0695538a2725/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-11-20 06:16:46,263 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d32aa0-c8be-46b3-99dd-0695538a2725/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 [2021-11-20 06:16:46,264 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 7 more)] === [2021-11-20 06:16:46,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:16:46,264 INFO L85 PathProgramCache]: Analyzing trace with hash -539289096, now seen corresponding path program 1 times [2021-11-20 06:16:46,264 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-20 06:16:46,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1937716074] [2021-11-20 06:16:46,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:16:46,265 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-20 06:16:46,265 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d32aa0-c8be-46b3-99dd-0695538a2725/bin/uautomizer-DQz5hQGWxF/mathsat [2021-11-20 06:16:46,266 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d32aa0-c8be-46b3-99dd-0695538a2725/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-20 06:16:46,298 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d32aa0-c8be-46b3-99dd-0695538a2725/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-11-20 06:16:46,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:16:46,316 INFO L263 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-20 06:16:46,318 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:16:46,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 06:16:46,368 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 06:16:46,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 06:16:46,420 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-20 06:16:46,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1937716074] [2021-11-20 06:16:46,420 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1937716074] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-20 06:16:46,421 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-20 06:16:46,421 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-11-20 06:16:46,421 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003685620] [2021-11-20 06:16:46,421 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-20 06:16:46,421 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-20 06:16:46,422 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-20 06:16:46,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-20 06:16:46,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-11-20 06:16:46,423 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-20 06:16:46,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:16:46,514 INFO L93 Difference]: Finished difference Result 89 states and 95 transitions. [2021-11-20 06:16:46,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-20 06:16:46,515 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 13 [2021-11-20 06:16:46,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:16:46,518 INFO L225 Difference]: With dead ends: 89 [2021-11-20 06:16:46,519 INFO L226 Difference]: Without dead ends: 89 [2021-11-20 06:16:46,519 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2021-11-20 06:16:46,520 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 188 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-20 06:16:46,522 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [189 Valid, 97 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-20 06:16:46,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2021-11-20 06:16:46,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 45. [2021-11-20 06:16:46,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 30 states have (on average 1.5666666666666667) internal successors, (47), 40 states have internal predecessors, (47), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-20 06:16:46,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 53 transitions. [2021-11-20 06:16:46,539 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 53 transitions. Word has length 13 [2021-11-20 06:16:46,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:16:46,540 INFO L470 AbstractCegarLoop]: Abstraction has 45 states and 53 transitions. [2021-11-20 06:16:46,540 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-20 06:16:46,540 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 53 transitions. [2021-11-20 06:16:46,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-20 06:16:46,541 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:16:46,542 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:16:46,553 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d32aa0-c8be-46b3-99dd-0695538a2725/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-11-20 06:16:46,755 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d32aa0-c8be-46b3-99dd-0695538a2725/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 [2021-11-20 06:16:46,755 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 7 more)] === [2021-11-20 06:16:46,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:16:46,756 INFO L85 PathProgramCache]: Analyzing trace with hash 1099978464, now seen corresponding path program 1 times [2021-11-20 06:16:46,757 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-20 06:16:46,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [826266802] [2021-11-20 06:16:46,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:16:46,757 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-20 06:16:46,757 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d32aa0-c8be-46b3-99dd-0695538a2725/bin/uautomizer-DQz5hQGWxF/mathsat [2021-11-20 06:16:46,758 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d32aa0-c8be-46b3-99dd-0695538a2725/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-20 06:16:46,780 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d32aa0-c8be-46b3-99dd-0695538a2725/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-11-20 06:16:46,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:16:46,824 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 8 conjunts are in the unsatisfiable core [2021-11-20 06:16:46,826 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:16:46,861 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-11-20 06:16:46,993 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-11-20 06:16:46,994 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 25 treesize of output 32 [2021-11-20 06:16:47,107 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 06:16:47,107 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 06:16:57,958 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 06:16:57,958 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-20 06:16:57,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [826266802] [2021-11-20 06:16:57,958 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [826266802] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 06:16:57,958 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-20 06:16:57,958 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2021-11-20 06:16:57,959 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939514269] [2021-11-20 06:16:57,959 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-20 06:16:57,959 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-20 06:16:57,959 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-20 06:16:57,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-20 06:16:57,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=119, Unknown=5, NotChecked=0, Total=156 [2021-11-20 06:16:57,960 INFO L87 Difference]: Start difference. First operand 45 states and 53 transitions. Second operand has 13 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2021-11-20 06:16:58,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:16:58,091 INFO L93 Difference]: Finished difference Result 78 states and 102 transitions. [2021-11-20 06:16:58,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-20 06:16:58,092 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 18 [2021-11-20 06:16:58,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:16:58,094 INFO L225 Difference]: With dead ends: 78 [2021-11-20 06:16:58,094 INFO L226 Difference]: Without dead ends: 78 [2021-11-20 06:16:58,095 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=39, Invalid=138, Unknown=5, NotChecked=0, Total=182 [2021-11-20 06:16:58,095 INFO L933 BasicCegarLoop]: 51 mSDtfsCounter, 34 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 119 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-20 06:16:58,096 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 319 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 62 Invalid, 0 Unknown, 119 Unchecked, 0.1s Time] [2021-11-20 06:16:58,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2021-11-20 06:16:58,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 58. [2021-11-20 06:16:58,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 40 states have (on average 1.475) internal successors, (59), 50 states have internal predecessors, (59), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2021-11-20 06:16:58,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 68 transitions. [2021-11-20 06:16:58,105 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 68 transitions. Word has length 18 [2021-11-20 06:16:58,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:16:58,106 INFO L470 AbstractCegarLoop]: Abstraction has 58 states and 68 transitions. [2021-11-20 06:16:58,106 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2021-11-20 06:16:58,106 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 68 transitions. [2021-11-20 06:16:58,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-20 06:16:58,107 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:16:58,107 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:16:58,121 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d32aa0-c8be-46b3-99dd-0695538a2725/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-11-20 06:16:58,318 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d32aa0-c8be-46b3-99dd-0695538a2725/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 [2021-11-20 06:16:58,318 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 7 more)] === [2021-11-20 06:16:58,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:16:58,319 INFO L85 PathProgramCache]: Analyzing trace with hash 1099978465, now seen corresponding path program 1 times [2021-11-20 06:16:58,319 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-20 06:16:58,319 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [376228197] [2021-11-20 06:16:58,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:16:58,320 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-20 06:16:58,320 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d32aa0-c8be-46b3-99dd-0695538a2725/bin/uautomizer-DQz5hQGWxF/mathsat [2021-11-20 06:16:58,321 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d32aa0-c8be-46b3-99dd-0695538a2725/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-20 06:16:58,324 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d32aa0-c8be-46b3-99dd-0695538a2725/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-11-20 06:16:58,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:16:58,391 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 18 conjunts are in the unsatisfiable core [2021-11-20 06:16:58,392 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:16:58,420 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-11-20 06:16:58,428 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-11-20 06:17:00,753 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-20 06:17:00,754 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 29 treesize of output 31 [2021-11-20 06:17:00,766 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-20 06:17:00,767 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 23 treesize of output 23 [2021-11-20 06:17:00,837 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 06:17:00,837 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 06:17:20,306 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 29 treesize of output 27 [2021-11-20 06:17:21,032 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 28 treesize of output 26 [2021-11-20 06:17:21,226 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 06:17:21,226 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-20 06:17:21,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [376228197] [2021-11-20 06:17:21,227 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [376228197] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 06:17:21,227 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-20 06:17:21,227 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 19 [2021-11-20 06:17:21,227 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422199195] [2021-11-20 06:17:21,227 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-20 06:17:21,228 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-11-20 06:17:21,228 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-20 06:17:21,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-11-20 06:17:21,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=323, Unknown=7, NotChecked=0, Total=380 [2021-11-20 06:17:21,230 INFO L87 Difference]: Start difference. First operand 58 states and 68 transitions. Second operand has 20 states, 17 states have (on average 1.588235294117647) internal successors, (27), 18 states have internal predecessors, (27), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-11-20 06:17:28,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:17:28,283 INFO L93 Difference]: Finished difference Result 141 states and 161 transitions. [2021-11-20 06:17:28,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-20 06:17:28,285 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 1.588235294117647) internal successors, (27), 18 states have internal predecessors, (27), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 18 [2021-11-20 06:17:28,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:17:28,287 INFO L225 Difference]: With dead ends: 141 [2021-11-20 06:17:28,287 INFO L226 Difference]: Without dead ends: 141 [2021-11-20 06:17:28,287 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 22.9s TimeCoverageRelationStatistics Valid=69, Invalid=427, Unknown=10, NotChecked=0, Total=506 [2021-11-20 06:17:28,288 INFO L933 BasicCegarLoop]: 56 mSDtfsCounter, 84 mSDsluCounter, 537 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 593 SdHoareTripleChecker+Invalid, 592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 319 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-11-20 06:17:28,289 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [86 Valid, 593 Invalid, 592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 261 Invalid, 0 Unknown, 319 Unchecked, 0.7s Time] [2021-11-20 06:17:28,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2021-11-20 06:17:28,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 74. [2021-11-20 06:17:28,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 54 states have (on average 1.462962962962963) internal successors, (79), 65 states have internal predecessors, (79), 5 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (10), 6 states have call predecessors, (10), 5 states have call successors, (10) [2021-11-20 06:17:28,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 94 transitions. [2021-11-20 06:17:28,300 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 94 transitions. Word has length 18 [2021-11-20 06:17:28,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:17:28,301 INFO L470 AbstractCegarLoop]: Abstraction has 74 states and 94 transitions. [2021-11-20 06:17:28,301 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 17 states have (on average 1.588235294117647) internal successors, (27), 18 states have internal predecessors, (27), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-11-20 06:17:28,301 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 94 transitions. [2021-11-20 06:17:28,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-20 06:17:28,302 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:17:28,303 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:17:28,314 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d32aa0-c8be-46b3-99dd-0695538a2725/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-11-20 06:17:28,509 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d32aa0-c8be-46b3-99dd-0695538a2725/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 [2021-11-20 06:17:28,510 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 7 more)] === [2021-11-20 06:17:28,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:17:28,511 INFO L85 PathProgramCache]: Analyzing trace with hash 594419839, now seen corresponding path program 1 times [2021-11-20 06:17:28,511 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-20 06:17:28,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1069848750] [2021-11-20 06:17:28,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:17:28,511 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-20 06:17:28,512 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d32aa0-c8be-46b3-99dd-0695538a2725/bin/uautomizer-DQz5hQGWxF/mathsat [2021-11-20 06:17:28,512 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d32aa0-c8be-46b3-99dd-0695538a2725/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-20 06:17:28,517 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d32aa0-c8be-46b3-99dd-0695538a2725/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-11-20 06:17:28,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:17:28,553 INFO L263 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 7 conjunts are in the unsatisfiable core [2021-11-20 06:17:28,555 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:17:28,650 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 06:17:28,650 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 06:17:28,746 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-20 06:17:28,747 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-20 06:17:28,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1069848750] [2021-11-20 06:17:28,747 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1069848750] provided 1 perfect and 1 imperfect interpolant sequences [2021-11-20 06:17:28,747 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-20 06:17:28,747 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 5 [2021-11-20 06:17:28,747 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693914714] [2021-11-20 06:17:28,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 06:17:28,748 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-20 06:17:28,748 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-20 06:17:28,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-20 06:17:28,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-20 06:17:28,749 INFO L87 Difference]: Start difference. First operand 74 states and 94 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-20 06:17:28,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:17:28,808 INFO L93 Difference]: Finished difference Result 66 states and 81 transitions. [2021-11-20 06:17:28,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-20 06:17:28,810 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2021-11-20 06:17:28,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:17:28,811 INFO L225 Difference]: With dead ends: 66 [2021-11-20 06:17:28,811 INFO L226 Difference]: Without dead ends: 62 [2021-11-20 06:17:28,812 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-20 06:17:28,812 INFO L933 BasicCegarLoop]: 44 mSDtfsCounter, 0 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-20 06:17:28,813 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 156 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-20 06:17:28,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2021-11-20 06:17:28,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2021-11-20 06:17:28,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 45 states have (on average 1.4666666666666666) internal successors, (66), 55 states have internal predecessors, (66), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2021-11-20 06:17:28,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 77 transitions. [2021-11-20 06:17:28,819 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 77 transitions. Word has length 18 [2021-11-20 06:17:28,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:17:28,819 INFO L470 AbstractCegarLoop]: Abstraction has 62 states and 77 transitions. [2021-11-20 06:17:28,819 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-20 06:17:28,820 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 77 transitions. [2021-11-20 06:17:28,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-20 06:17:28,820 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:17:28,820 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:17:28,837 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d32aa0-c8be-46b3-99dd-0695538a2725/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2021-11-20 06:17:29,031 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d32aa0-c8be-46b3-99dd-0695538a2725/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 [2021-11-20 06:17:29,031 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 7 more)] === [2021-11-20 06:17:29,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:17:29,032 INFO L85 PathProgramCache]: Analyzing trace with hash 517297676, now seen corresponding path program 1 times [2021-11-20 06:17:29,032 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-20 06:17:29,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [688449833] [2021-11-20 06:17:29,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:17:29,032 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-20 06:17:29,032 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d32aa0-c8be-46b3-99dd-0695538a2725/bin/uautomizer-DQz5hQGWxF/mathsat [2021-11-20 06:17:29,033 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d32aa0-c8be-46b3-99dd-0695538a2725/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-20 06:17:29,038 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d32aa0-c8be-46b3-99dd-0695538a2725/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-11-20 06:17:29,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:17:29,082 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-20 06:17:29,084 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:17:29,145 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-20 06:17:29,146 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 06:17:29,203 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-20 06:17:29,204 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-20 06:17:29,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [688449833] [2021-11-20 06:17:29,204 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [688449833] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-20 06:17:29,204 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-20 06:17:29,204 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2021-11-20 06:17:29,204 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223746404] [2021-11-20 06:17:29,204 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-20 06:17:29,205 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-20 06:17:29,205 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-20 06:17:29,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-20 06:17:29,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-20 06:17:29,206 INFO L87 Difference]: Start difference. First operand 62 states and 77 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-20 06:17:29,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:17:29,260 INFO L93 Difference]: Finished difference Result 99 states and 119 transitions. [2021-11-20 06:17:29,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-20 06:17:29,260 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 20 [2021-11-20 06:17:29,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:17:29,262 INFO L225 Difference]: With dead ends: 99 [2021-11-20 06:17:29,262 INFO L226 Difference]: Without dead ends: 99 [2021-11-20 06:17:29,262 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-20 06:17:29,263 INFO L933 BasicCegarLoop]: 61 mSDtfsCounter, 27 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-20 06:17:29,263 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 216 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-20 06:17:29,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2021-11-20 06:17:29,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 66. [2021-11-20 06:17:29,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 49 states have (on average 1.4285714285714286) internal successors, (70), 57 states have internal predecessors, (70), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (7), 6 states have call predecessors, (7), 4 states have call successors, (7) [2021-11-20 06:17:29,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 81 transitions. [2021-11-20 06:17:29,270 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 81 transitions. Word has length 20 [2021-11-20 06:17:29,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:17:29,271 INFO L470 AbstractCegarLoop]: Abstraction has 66 states and 81 transitions. [2021-11-20 06:17:29,271 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-20 06:17:29,271 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 81 transitions. [2021-11-20 06:17:29,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-20 06:17:29,272 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:17:29,272 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:17:29,288 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d32aa0-c8be-46b3-99dd-0695538a2725/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2021-11-20 06:17:29,489 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d32aa0-c8be-46b3-99dd-0695538a2725/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 [2021-11-20 06:17:29,490 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 7 more)] === [2021-11-20 06:17:29,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:17:29,490 INFO L85 PathProgramCache]: Analyzing trace with hash -2034859285, now seen corresponding path program 1 times [2021-11-20 06:17:29,490 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-20 06:17:29,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2052011304] [2021-11-20 06:17:29,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:17:29,491 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-20 06:17:29,491 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d32aa0-c8be-46b3-99dd-0695538a2725/bin/uautomizer-DQz5hQGWxF/mathsat [2021-11-20 06:17:29,492 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d32aa0-c8be-46b3-99dd-0695538a2725/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-20 06:17:29,510 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d32aa0-c8be-46b3-99dd-0695538a2725/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-11-20 06:17:29,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:17:29,556 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-20 06:17:29,566 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:17:29,621 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-20 06:17:29,621 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 06:17:29,695 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-20 06:17:29,695 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-20 06:17:29,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2052011304] [2021-11-20 06:17:29,696 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2052011304] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-20 06:17:29,696 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-20 06:17:29,696 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-11-20 06:17:29,696 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225432850] [2021-11-20 06:17:29,696 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-20 06:17:29,697 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-20 06:17:29,697 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-20 06:17:29,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-20 06:17:29,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-20 06:17:29,697 INFO L87 Difference]: Start difference. First operand 66 states and 81 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-20 06:17:29,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:17:29,792 INFO L93 Difference]: Finished difference Result 68 states and 76 transitions. [2021-11-20 06:17:29,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-20 06:17:29,793 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 20 [2021-11-20 06:17:29,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:17:29,793 INFO L225 Difference]: With dead ends: 68 [2021-11-20 06:17:29,793 INFO L226 Difference]: Without dead ends: 68 [2021-11-20 06:17:29,794 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-20 06:17:29,795 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 27 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-20 06:17:29,795 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 157 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-20 06:17:29,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2021-11-20 06:17:29,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 61. [2021-11-20 06:17:29,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 44 states have (on average 1.3409090909090908) internal successors, (59), 52 states have internal predecessors, (59), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (7), 6 states have call predecessors, (7), 4 states have call successors, (7) [2021-11-20 06:17:29,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 70 transitions. [2021-11-20 06:17:29,801 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 70 transitions. Word has length 20 [2021-11-20 06:17:29,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:17:29,801 INFO L470 AbstractCegarLoop]: Abstraction has 61 states and 70 transitions. [2021-11-20 06:17:29,801 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-20 06:17:29,802 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 70 transitions. [2021-11-20 06:17:29,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-11-20 06:17:29,802 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:17:29,803 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:17:29,817 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d32aa0-c8be-46b3-99dd-0695538a2725/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2021-11-20 06:17:30,017 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d32aa0-c8be-46b3-99dd-0695538a2725/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 [2021-11-20 06:17:30,017 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 7 more)] === [2021-11-20 06:17:30,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:17:30,017 INFO L85 PathProgramCache]: Analyzing trace with hash 1343870148, now seen corresponding path program 1 times [2021-11-20 06:17:30,018 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-20 06:17:30,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [87337238] [2021-11-20 06:17:30,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:17:30,018 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-20 06:17:30,018 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d32aa0-c8be-46b3-99dd-0695538a2725/bin/uautomizer-DQz5hQGWxF/mathsat [2021-11-20 06:17:30,019 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d32aa0-c8be-46b3-99dd-0695538a2725/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-20 06:17:30,020 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d32aa0-c8be-46b3-99dd-0695538a2725/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2021-11-20 06:17:30,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:17:30,057 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-20 06:17:30,058 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:17:30,282 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 06:17:30,282 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 06:17:30,437 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-20 06:17:30,437 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-20 06:17:30,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [87337238] [2021-11-20 06:17:30,438 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [87337238] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 06:17:30,438 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-20 06:17:30,438 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 9 [2021-11-20 06:17:30,438 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779992152] [2021-11-20 06:17:30,438 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-20 06:17:30,439 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-20 06:17:30,439 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-20 06:17:30,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-20 06:17:30,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2021-11-20 06:17:30,440 INFO L87 Difference]: Start difference. First operand 61 states and 70 transitions. Second operand has 10 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 8 states have internal predecessors, (33), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-11-20 06:17:30,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:17:30,582 INFO L93 Difference]: Finished difference Result 60 states and 69 transitions. [2021-11-20 06:17:30,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-20 06:17:30,583 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 8 states have internal predecessors, (33), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 21 [2021-11-20 06:17:30,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:17:30,584 INFO L225 Difference]: With dead ends: 60 [2021-11-20 06:17:30,584 INFO L226 Difference]: Without dead ends: 60 [2021-11-20 06:17:30,584 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2021-11-20 06:17:30,585 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 35 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 11 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-20 06:17:30,585 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 81 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 61 Invalid, 0 Unknown, 11 Unchecked, 0.1s Time] [2021-11-20 06:17:30,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2021-11-20 06:17:30,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2021-11-20 06:17:30,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 44 states have (on average 1.3181818181818181) internal successors, (58), 51 states have internal predecessors, (58), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (7), 6 states have call predecessors, (7), 4 states have call successors, (7) [2021-11-20 06:17:30,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 69 transitions. [2021-11-20 06:17:30,589 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 69 transitions. Word has length 21 [2021-11-20 06:17:30,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:17:30,590 INFO L470 AbstractCegarLoop]: Abstraction has 60 states and 69 transitions. [2021-11-20 06:17:30,590 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 8 states have internal predecessors, (33), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-11-20 06:17:30,590 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 69 transitions. [2021-11-20 06:17:30,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-11-20 06:17:30,591 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:17:30,591 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:17:30,608 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d32aa0-c8be-46b3-99dd-0695538a2725/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2021-11-20 06:17:30,801 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d32aa0-c8be-46b3-99dd-0695538a2725/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 [2021-11-20 06:17:30,802 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 7 more)] === [2021-11-20 06:17:30,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:17:30,802 INFO L85 PathProgramCache]: Analyzing trace with hash -1289698277, now seen corresponding path program 1 times [2021-11-20 06:17:30,802 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-20 06:17:30,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [412722223] [2021-11-20 06:17:30,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:17:30,802 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-20 06:17:30,803 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d32aa0-c8be-46b3-99dd-0695538a2725/bin/uautomizer-DQz5hQGWxF/mathsat [2021-11-20 06:17:30,803 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d32aa0-c8be-46b3-99dd-0695538a2725/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-20 06:17:30,806 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d32aa0-c8be-46b3-99dd-0695538a2725/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2021-11-20 06:17:30,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:17:30,842 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-20 06:17:30,844 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:17:30,856 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-11-20 06:17:30,961 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 06:17:30,961 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 06:17:31,143 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 06:17:31,143 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-20 06:17:31,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [412722223] [2021-11-20 06:17:31,143 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [412722223] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 06:17:31,144 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-20 06:17:31,144 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2021-11-20 06:17:31,144 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555994755] [2021-11-20 06:17:31,144 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-20 06:17:31,144 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-20 06:17:31,145 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-20 06:17:31,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-20 06:17:31,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-11-20 06:17:31,145 INFO L87 Difference]: Start difference. First operand 60 states and 69 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-11-20 06:17:31,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:17:31,312 INFO L93 Difference]: Finished difference Result 70 states and 80 transitions. [2021-11-20 06:17:31,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-20 06:17:31,313 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2021-11-20 06:17:31,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:17:31,314 INFO L225 Difference]: With dead ends: 70 [2021-11-20 06:17:31,314 INFO L226 Difference]: Without dead ends: 70 [2021-11-20 06:17:31,314 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-11-20 06:17:31,315 INFO L933 BasicCegarLoop]: 36 mSDtfsCounter, 13 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 22 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-20 06:17:31,315 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 124 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 69 Invalid, 0 Unknown, 22 Unchecked, 0.2s Time] [2021-11-20 06:17:31,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2021-11-20 06:17:31,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 65. [2021-11-20 06:17:31,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 49 states have (on average 1.346938775510204) internal successors, (66), 56 states have internal predecessors, (66), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (7), 6 states have call predecessors, (7), 4 states have call successors, (7) [2021-11-20 06:17:31,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 77 transitions. [2021-11-20 06:17:31,320 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 77 transitions. Word has length 22 [2021-11-20 06:17:31,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:17:31,320 INFO L470 AbstractCegarLoop]: Abstraction has 65 states and 77 transitions. [2021-11-20 06:17:31,320 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-11-20 06:17:31,320 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 77 transitions. [2021-11-20 06:17:31,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-20 06:17:31,321 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:17:31,321 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:17:31,338 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d32aa0-c8be-46b3-99dd-0695538a2725/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2021-11-20 06:17:31,522 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d32aa0-c8be-46b3-99dd-0695538a2725/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 [2021-11-20 06:17:31,522 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 7 more)] === [2021-11-20 06:17:31,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:17:31,523 INFO L85 PathProgramCache]: Analyzing trace with hash 1845507550, now seen corresponding path program 1 times [2021-11-20 06:17:31,523 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-20 06:17:31,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1931058388] [2021-11-20 06:17:31,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:17:31,523 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-20 06:17:31,523 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d32aa0-c8be-46b3-99dd-0695538a2725/bin/uautomizer-DQz5hQGWxF/mathsat [2021-11-20 06:17:31,524 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d32aa0-c8be-46b3-99dd-0695538a2725/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-20 06:17:31,525 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d32aa0-c8be-46b3-99dd-0695538a2725/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2021-11-20 06:17:31,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:17:31,570 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 11 conjunts are in the unsatisfiable core [2021-11-20 06:17:31,572 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:17:31,806 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-20 06:17:31,806 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 06:17:40,344 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_old_#valid#1_BEFORE_CALL_6| (Array (_ BitVec 32) (_ BitVec 1))) (|v_ldv_malloc_#res.base_72| (_ BitVec 32))) (or (= (store |c_#valid| |v_ldv_malloc_#res.base_72| (_ bv0 1)) |v_ULTIMATE.start_main_old_#valid#1_BEFORE_CALL_6|) (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_ldv_malloc_#res.base_72|)))) (exists ((|v_ULTIMATE.start_entry_point_#t~ret38#1.base_44| (_ BitVec 32))) (and (not (= |v_ULTIMATE.start_main_old_#valid#1_BEFORE_CALL_6| (store |c_old(#valid)| |v_ULTIMATE.start_entry_point_#t~ret38#1.base_44| (_ bv0 1)))) (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_ULTIMATE.start_entry_point_#t~ret38#1.base_44|)))))))) is different from false [2021-11-20 06:17:40,414 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2021-11-20 06:17:40,414 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-20 06:17:40,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1931058388] [2021-11-20 06:17:40,415 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1931058388] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 06:17:40,415 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-20 06:17:40,415 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 12 [2021-11-20 06:17:40,415 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383185549] [2021-11-20 06:17:40,415 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-20 06:17:40,416 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-20 06:17:40,416 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-20 06:17:40,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-20 06:17:40,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=93, Unknown=14, NotChecked=20, Total=156 [2021-11-20 06:17:40,417 INFO L87 Difference]: Start difference. First operand 65 states and 77 transitions. Second operand has 13 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-11-20 06:17:40,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:17:40,788 INFO L93 Difference]: Finished difference Result 95 states and 114 transitions. [2021-11-20 06:17:40,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-20 06:17:40,789 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 24 [2021-11-20 06:17:40,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:17:40,790 INFO L225 Difference]: With dead ends: 95 [2021-11-20 06:17:40,790 INFO L226 Difference]: Without dead ends: 88 [2021-11-20 06:17:40,790 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=35, Invalid=111, Unknown=14, NotChecked=22, Total=182 [2021-11-20 06:17:40,791 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 16 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 96 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-20 06:17:40,791 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 304 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 159 Invalid, 0 Unknown, 96 Unchecked, 0.3s Time] [2021-11-20 06:17:40,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2021-11-20 06:17:40,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 78. [2021-11-20 06:17:40,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 60 states have (on average 1.35) internal successors, (81), 67 states have internal predecessors, (81), 6 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (11), 8 states have call predecessors, (11), 6 states have call successors, (11) [2021-11-20 06:17:40,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 98 transitions. [2021-11-20 06:17:40,799 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 98 transitions. Word has length 24 [2021-11-20 06:17:40,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:17:40,800 INFO L470 AbstractCegarLoop]: Abstraction has 78 states and 98 transitions. [2021-11-20 06:17:40,800 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-11-20 06:17:40,800 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 98 transitions. [2021-11-20 06:17:40,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-20 06:17:40,801 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:17:40,802 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:17:40,813 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d32aa0-c8be-46b3-99dd-0695538a2725/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2021-11-20 06:17:41,008 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d32aa0-c8be-46b3-99dd-0695538a2725/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 [2021-11-20 06:17:41,009 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 7 more)] === [2021-11-20 06:17:41,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:17:41,009 INFO L85 PathProgramCache]: Analyzing trace with hash 2918772, now seen corresponding path program 1 times [2021-11-20 06:17:41,009 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-20 06:17:41,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [506311530] [2021-11-20 06:17:41,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:17:41,009 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-20 06:17:41,010 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d32aa0-c8be-46b3-99dd-0695538a2725/bin/uautomizer-DQz5hQGWxF/mathsat [2021-11-20 06:17:41,010 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d32aa0-c8be-46b3-99dd-0695538a2725/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-20 06:17:41,011 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d32aa0-c8be-46b3-99dd-0695538a2725/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2021-11-20 06:17:41,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:17:41,081 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 26 conjunts are in the unsatisfiable core [2021-11-20 06:17:41,083 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:17:41,118 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-11-20 06:17:41,124 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-11-20 06:17:43,449 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-20 06:17:43,449 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 32 treesize of output 34 [2021-11-20 06:17:43,463 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-20 06:17:43,463 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 26 treesize of output 26 [2021-11-20 06:17:43,743 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-20 06:17:43,743 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 35 treesize of output 37 [2021-11-20 06:17:43,756 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-20 06:17:43,757 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 29 treesize of output 29 [2021-11-20 06:17:43,835 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-20 06:17:43,835 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 06:17:51,750 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ldv_malloc_#res.base_76| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_13| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_7| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_5| (_ BitVec 32))) (or (and (let ((.cse0 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_7| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_5| .cse0) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_5| (_ bv4 32) .cse0))) (forall ((ldv_malloc_~size (_ BitVec 32))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_5| (_ bv4 32) (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_7| (_ bv4 32))) (select (store |c_#length| |v_ldv_malloc_#res.base_76| ldv_malloc_~size) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_13|)))) (exists ((|v_ldv_malloc_#res.base_75| (_ BitVec 32))) (and (or (not (let ((.cse1 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_7| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_5| .cse1) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_5| (_ bv4 32) .cse1)))) (exists ((v_ldv_malloc_~size_69 (_ BitVec 32))) (not (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_5| (_ bv4 32) (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_7| (_ bv4 32))) (select (store |c_old(#length)| |v_ldv_malloc_#res.base_75| v_ldv_malloc_~size_69) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_13|))))) (= (_ bv0 1) (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_ldv_malloc_#res.base_75|))))))) (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_ldv_malloc_#res.base_76|)))))) is different from false [2021-11-20 06:17:55,624 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-11-20 06:17:55,624 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 45 treesize of output 44 [2021-11-20 06:18:10,324 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_8| (_ BitVec 32)) (|v_ldv_malloc_#res.base_75| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_6| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_14| (_ BitVec 32))) (or (and (forall ((v_ldv_malloc_~size_69 (_ BitVec 32))) (bvule (bvadd (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_8| (_ bv4 32)) |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_6| (_ bv8 32)) (select (store |c_#length| |v_ldv_malloc_#res.base_75| v_ldv_malloc_~size_69) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_14|))) (let ((.cse0 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_8| (_ bv4 32)))) (bvule (bvadd .cse0 |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_6| (_ bv4 32)) (bvadd .cse0 |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_6| (_ bv8 32))))) (exists ((|v_ldv_malloc_#res.base_79| (_ BitVec 32)) (|v_ldv_malloc_#res.base_75| (_ BitVec 32))) (and (or (exists ((v_ldv_malloc_~size_69 (_ BitVec 32)) (v_ldv_malloc_~size_73 (_ BitVec 32))) (not (bvule (bvadd (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_8| (_ bv4 32)) |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_6| (_ bv8 32)) (select (store (store |c_old(#length)| |v_ldv_malloc_#res.base_79| v_ldv_malloc_~size_73) |v_ldv_malloc_#res.base_75| v_ldv_malloc_~size_69) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_14|)))) (not (let ((.cse1 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_8| (_ bv4 32)))) (bvule (bvadd .cse1 |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_6| (_ bv4 32)) (bvadd .cse1 |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_6| (_ bv8 32)))))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_ldv_malloc_#res.base_79|)))))) (not (= |v_ldv_malloc_#res.base_75| |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_14|)))) (= |v_ldv_malloc_#res.base_75| |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_14|))) is different from false [2021-11-20 06:18:27,176 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_8| (_ BitVec 32)) (|v_ldv_malloc_#res.base_75| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_6| (_ BitVec 32)) (|v_ldv_malloc_#res.base_80| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_14| (_ BitVec 32))) (or (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_ldv_malloc_#res.base_80|)))) (and (forall ((ldv_malloc_~size (_ BitVec 32)) (v_ldv_malloc_~size_69 (_ BitVec 32))) (bvule (bvadd (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_8| (_ bv4 32)) |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_6| (_ bv8 32)) (select (store (store |c_#length| |v_ldv_malloc_#res.base_80| ldv_malloc_~size) |v_ldv_malloc_#res.base_75| v_ldv_malloc_~size_69) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_14|))) (let ((.cse0 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_8| (_ bv4 32)))) (bvule (bvadd .cse0 |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_6| (_ bv4 32)) (bvadd .cse0 |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_6| (_ bv8 32))))) (exists ((|v_ldv_malloc_#res.base_79| (_ BitVec 32)) (|v_ldv_malloc_#res.base_75| (_ BitVec 32))) (and (or (exists ((v_ldv_malloc_~size_69 (_ BitVec 32)) (v_ldv_malloc_~size_73 (_ BitVec 32))) (not (bvule (bvadd (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_8| (_ bv4 32)) |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_6| (_ bv8 32)) (select (store (store |c_old(#length)| |v_ldv_malloc_#res.base_79| v_ldv_malloc_~size_73) |v_ldv_malloc_#res.base_75| v_ldv_malloc_~size_69) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_14|)))) (not (let ((.cse1 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_8| (_ bv4 32)))) (bvule (bvadd .cse1 |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_6| (_ bv4 32)) (bvadd .cse1 |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_6| (_ bv8 32)))))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_ldv_malloc_#res.base_79|)))))) (not (= |v_ldv_malloc_#res.base_75| |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_14|)))) (= |v_ldv_malloc_#res.base_75| |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_14|))) is different from false [2021-11-20 06:18:37,984 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 61 treesize of output 59 [2021-11-20 06:18:38,903 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 60 treesize of output 58 [2021-11-20 06:18:39,082 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2021-11-20 06:18:39,082 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-20 06:18:39,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [506311530] [2021-11-20 06:18:39,082 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [506311530] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 06:18:39,082 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-20 06:18:39,082 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15] total 26 [2021-11-20 06:18:39,082 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898760755] [2021-11-20 06:18:39,082 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-20 06:18:39,083 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2021-11-20 06:18:39,083 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-20 06:18:39,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-11-20 06:18:39,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=475, Unknown=11, NotChecked=138, Total=702 [2021-11-20 06:18:39,084 INFO L87 Difference]: Start difference. First operand 78 states and 98 transitions. Second operand has 27 states, 24 states have (on average 1.6666666666666667) internal successors, (40), 25 states have internal predecessors, (40), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-11-20 06:18:43,312 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ldv_malloc_#res.base_76| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_13| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_7| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_5| (_ BitVec 32))) (or (and (let ((.cse0 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_7| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_5| .cse0) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_5| (_ bv4 32) .cse0))) (forall ((ldv_malloc_~size (_ BitVec 32))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_5| (_ bv4 32) (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_7| (_ bv4 32))) (select (store |c_#length| |v_ldv_malloc_#res.base_76| ldv_malloc_~size) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_13|)))) (exists ((|v_ldv_malloc_#res.base_75| (_ BitVec 32))) (and (or (not (let ((.cse1 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_7| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_5| .cse1) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_5| (_ bv4 32) .cse1)))) (exists ((v_ldv_malloc_~size_69 (_ BitVec 32))) (not (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_5| (_ bv4 32) (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_7| (_ bv4 32))) (select (store |c_old(#length)| |v_ldv_malloc_#res.base_75| v_ldv_malloc_~size_69) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_13|))))) (= (_ bv0 1) (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_ldv_malloc_#res.base_75|))))))) (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_ldv_malloc_#res.base_76|)))))) (forall ((|v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_8| (_ BitVec 32)) (|v_ldv_malloc_#res.base_75| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_6| (_ BitVec 32)) (|v_ldv_malloc_#res.base_80| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_14| (_ BitVec 32))) (or (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_ldv_malloc_#res.base_80|)))) (and (forall ((ldv_malloc_~size (_ BitVec 32)) (v_ldv_malloc_~size_69 (_ BitVec 32))) (bvule (bvadd (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_8| (_ bv4 32)) |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_6| (_ bv8 32)) (select (store (store |c_#length| |v_ldv_malloc_#res.base_80| ldv_malloc_~size) |v_ldv_malloc_#res.base_75| v_ldv_malloc_~size_69) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_14|))) (let ((.cse2 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_8| (_ bv4 32)))) (bvule (bvadd .cse2 |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_6| (_ bv4 32)) (bvadd .cse2 |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_6| (_ bv8 32))))) (exists ((|v_ldv_malloc_#res.base_79| (_ BitVec 32)) (|v_ldv_malloc_#res.base_75| (_ BitVec 32))) (and (or (exists ((v_ldv_malloc_~size_69 (_ BitVec 32)) (v_ldv_malloc_~size_73 (_ BitVec 32))) (not (bvule (bvadd (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_8| (_ bv4 32)) |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_6| (_ bv8 32)) (select (store (store |c_old(#length)| |v_ldv_malloc_#res.base_79| v_ldv_malloc_~size_73) |v_ldv_malloc_#res.base_75| v_ldv_malloc_~size_69) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_14|)))) (not (let ((.cse3 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_8| (_ bv4 32)))) (bvule (bvadd .cse3 |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_6| (_ bv4 32)) (bvadd .cse3 |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_6| (_ bv8 32)))))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_ldv_malloc_#res.base_79|)))))) (not (= |v_ldv_malloc_#res.base_75| |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_14|)))) (= |v_ldv_malloc_#res.base_75| |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_14|))) (= |c_old(#valid)| |c_#valid|) (= |c_#length| |c_old(#length)|)) is different from false [2021-11-20 06:18:45,348 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ldv_malloc_#res.base_76| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_13| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_7| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_5| (_ BitVec 32))) (or (and (let ((.cse0 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_7| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_5| .cse0) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_5| (_ bv4 32) .cse0))) (forall ((ldv_malloc_~size (_ BitVec 32))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_5| (_ bv4 32) (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_7| (_ bv4 32))) (select (store |c_#length| |v_ldv_malloc_#res.base_76| ldv_malloc_~size) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_13|)))) (exists ((|v_ldv_malloc_#res.base_75| (_ BitVec 32))) (and (or (not (let ((.cse1 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_7| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_5| .cse1) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_5| (_ bv4 32) .cse1)))) (exists ((v_ldv_malloc_~size_69 (_ BitVec 32))) (not (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_5| (_ bv4 32) (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_7| (_ bv4 32))) (select (store |c_old(#length)| |v_ldv_malloc_#res.base_75| v_ldv_malloc_~size_69) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_13|))))) (= (_ bv0 1) (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_ldv_malloc_#res.base_75|))))))) (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_ldv_malloc_#res.base_76|)))))) (forall ((|v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_8| (_ BitVec 32)) (|v_ldv_malloc_#res.base_75| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_6| (_ BitVec 32)) (|v_ldv_malloc_#res.base_80| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_14| (_ BitVec 32))) (or (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_ldv_malloc_#res.base_80|)))) (and (forall ((ldv_malloc_~size (_ BitVec 32)) (v_ldv_malloc_~size_69 (_ BitVec 32))) (bvule (bvadd (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_8| (_ bv4 32)) |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_6| (_ bv8 32)) (select (store (store |c_#length| |v_ldv_malloc_#res.base_80| ldv_malloc_~size) |v_ldv_malloc_#res.base_75| v_ldv_malloc_~size_69) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_14|))) (let ((.cse2 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_8| (_ bv4 32)))) (bvule (bvadd .cse2 |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_6| (_ bv4 32)) (bvadd .cse2 |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_6| (_ bv8 32))))) (exists ((|v_ldv_malloc_#res.base_79| (_ BitVec 32)) (|v_ldv_malloc_#res.base_75| (_ BitVec 32))) (and (or (exists ((v_ldv_malloc_~size_69 (_ BitVec 32)) (v_ldv_malloc_~size_73 (_ BitVec 32))) (not (bvule (bvadd (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_8| (_ bv4 32)) |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_6| (_ bv8 32)) (select (store (store |c_old(#length)| |v_ldv_malloc_#res.base_79| v_ldv_malloc_~size_73) |v_ldv_malloc_#res.base_75| v_ldv_malloc_~size_69) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_14|)))) (not (let ((.cse3 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_8| (_ bv4 32)))) (bvule (bvadd .cse3 |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_6| (_ bv4 32)) (bvadd .cse3 |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_6| (_ bv8 32)))))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_ldv_malloc_#res.base_79|)))))) (not (= |v_ldv_malloc_#res.base_75| |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_14|)))) (= |v_ldv_malloc_#res.base_75| |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_14|))) (= |c_old(#valid)| |c_#valid|) (= c_ldv_malloc_~size |c_ldv_malloc_#in~size|) (= |c_#length| |c_old(#length)|)) is different from false [2021-11-20 06:18:47,386 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((ldv_malloc_~size (_ BitVec 32)) (|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (store |c_old(#length)| |ldv_malloc_#res.base| ldv_malloc_~size) |c_#length|) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |ldv_malloc_#res.base|)))))))) (forall ((|v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_8| (_ BitVec 32)) (|v_ldv_malloc_#res.base_75| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_6| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_14| (_ BitVec 32))) (or (and (forall ((v_ldv_malloc_~size_69 (_ BitVec 32))) (bvule (bvadd (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_8| (_ bv4 32)) |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_6| (_ bv8 32)) (select (store |c_#length| |v_ldv_malloc_#res.base_75| v_ldv_malloc_~size_69) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_14|))) (let ((.cse0 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_8| (_ bv4 32)))) (bvule (bvadd .cse0 |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_6| (_ bv4 32)) (bvadd .cse0 |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_6| (_ bv8 32))))) (exists ((|v_ldv_malloc_#res.base_79| (_ BitVec 32)) (|v_ldv_malloc_#res.base_75| (_ BitVec 32))) (and (or (exists ((v_ldv_malloc_~size_69 (_ BitVec 32)) (v_ldv_malloc_~size_73 (_ BitVec 32))) (not (bvule (bvadd (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_8| (_ bv4 32)) |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_6| (_ bv8 32)) (select (store (store |c_old(#length)| |v_ldv_malloc_#res.base_79| v_ldv_malloc_~size_73) |v_ldv_malloc_#res.base_75| v_ldv_malloc_~size_69) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_14|)))) (not (let ((.cse1 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_8| (_ bv4 32)))) (bvule (bvadd .cse1 |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_6| (_ bv4 32)) (bvadd .cse1 |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_6| (_ bv8 32)))))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_ldv_malloc_#res.base_79|)))))) (not (= |v_ldv_malloc_#res.base_75| |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_14|)))) (= |v_ldv_malloc_#res.base_75| |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_14|))) (= (select |c_#length| |c_ldv_malloc_#res.base|) |c_ldv_malloc_#in~size|) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |c_ldv_malloc_#res.base|))) (= |c_ldv_malloc_#res.offset| (_ bv0 32))) is different from false [2021-11-20 06:18:50,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:18:50,514 INFO L93 Difference]: Finished difference Result 118 states and 143 transitions. [2021-11-20 06:18:50,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-20 06:18:50,515 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 24 states have (on average 1.6666666666666667) internal successors, (40), 25 states have internal predecessors, (40), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 28 [2021-11-20 06:18:50,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:18:50,517 INFO L225 Difference]: With dead ends: 118 [2021-11-20 06:18:50,517 INFO L226 Difference]: Without dead ends: 118 [2021-11-20 06:18:50,518 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 29 SyntacticMatches, 3 SemanticMatches, 31 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 37.0s TimeCoverageRelationStatistics Valid=101, Invalid=611, Unknown=14, NotChecked=330, Total=1056 [2021-11-20 06:18:50,519 INFO L933 BasicCegarLoop]: 47 mSDtfsCounter, 45 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 580 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 390 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-20 06:18:50,519 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 531 Invalid, 580 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 183 Invalid, 0 Unknown, 390 Unchecked, 0.5s Time] [2021-11-20 06:18:50,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2021-11-20 06:18:50,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 92. [2021-11-20 06:18:50,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 71 states have (on average 1.323943661971831) internal successors, (94), 78 states have internal predecessors, (94), 7 states have call successors, (7), 3 states have call predecessors, (7), 5 states have return successors, (13), 10 states have call predecessors, (13), 7 states have call successors, (13) [2021-11-20 06:18:50,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 114 transitions. [2021-11-20 06:18:50,526 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 114 transitions. Word has length 28 [2021-11-20 06:18:50,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:18:50,527 INFO L470 AbstractCegarLoop]: Abstraction has 92 states and 114 transitions. [2021-11-20 06:18:50,527 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 24 states have (on average 1.6666666666666667) internal successors, (40), 25 states have internal predecessors, (40), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-11-20 06:18:50,527 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 114 transitions. [2021-11-20 06:18:50,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-20 06:18:50,528 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:18:50,529 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:18:50,542 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d32aa0-c8be-46b3-99dd-0695538a2725/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2021-11-20 06:18:50,733 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d32aa0-c8be-46b3-99dd-0695538a2725/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 [2021-11-20 06:18:50,733 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 7 more)] === [2021-11-20 06:18:50,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:18:50,733 INFO L85 PathProgramCache]: Analyzing trace with hash -507615405, now seen corresponding path program 1 times [2021-11-20 06:18:50,734 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-20 06:18:50,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1266758774] [2021-11-20 06:18:50,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:18:50,734 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-20 06:18:50,734 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d32aa0-c8be-46b3-99dd-0695538a2725/bin/uautomizer-DQz5hQGWxF/mathsat [2021-11-20 06:18:50,735 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d32aa0-c8be-46b3-99dd-0695538a2725/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-20 06:18:50,736 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d32aa0-c8be-46b3-99dd-0695538a2725/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2021-11-20 06:18:50,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:18:50,784 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 7 conjunts are in the unsatisfiable core [2021-11-20 06:18:50,785 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:18:50,881 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 06:18:50,881 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 06:18:50,992 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-11-20 06:18:50,992 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-20 06:18:50,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1266758774] [2021-11-20 06:18:50,992 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1266758774] provided 1 perfect and 1 imperfect interpolant sequences [2021-11-20 06:18:50,992 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-20 06:18:50,992 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 5 [2021-11-20 06:18:50,992 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321526451] [2021-11-20 06:18:50,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 06:18:50,993 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-20 06:18:50,993 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-20 06:18:50,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-20 06:18:50,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-20 06:18:50,993 INFO L87 Difference]: Start difference. First operand 92 states and 114 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, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2021-11-20 06:18:51,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:18:51,020 INFO L93 Difference]: Finished difference Result 101 states and 114 transitions. [2021-11-20 06:18:51,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-20 06:18:51,021 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, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 28 [2021-11-20 06:18:51,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:18:51,022 INFO L225 Difference]: With dead ends: 101 [2021-11-20 06:18:51,022 INFO L226 Difference]: Without dead ends: 99 [2021-11-20 06:18:51,022 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-20 06:18:51,023 INFO L933 BasicCegarLoop]: 61 mSDtfsCounter, 21 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-20 06:18:51,023 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 213 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-20 06:18:51,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2021-11-20 06:18:51,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 72. [2021-11-20 06:18:51,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 53 states have (on average 1.3018867924528301) internal successors, (69), 62 states have internal predecessors, (69), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8) [2021-11-20 06:18:51,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 82 transitions. [2021-11-20 06:18:51,029 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 82 transitions. Word has length 28 [2021-11-20 06:18:51,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:18:51,029 INFO L470 AbstractCegarLoop]: Abstraction has 72 states and 82 transitions. [2021-11-20 06:18:51,030 INFO L471 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, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2021-11-20 06:18:51,030 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 82 transitions. [2021-11-20 06:18:51,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-20 06:18:51,031 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:18:51,031 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:18:51,042 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d32aa0-c8be-46b3-99dd-0695538a2725/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2021-11-20 06:18:51,242 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d32aa0-c8be-46b3-99dd-0695538a2725/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 [2021-11-20 06:18:51,242 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 7 more)] === [2021-11-20 06:18:51,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:18:51,243 INFO L85 PathProgramCache]: Analyzing trace with hash 252730508, now seen corresponding path program 1 times [2021-11-20 06:18:51,243 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-20 06:18:51,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [274917368] [2021-11-20 06:18:51,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:18:51,243 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-20 06:18:51,243 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d32aa0-c8be-46b3-99dd-0695538a2725/bin/uautomizer-DQz5hQGWxF/mathsat [2021-11-20 06:18:51,246 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d32aa0-c8be-46b3-99dd-0695538a2725/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-20 06:18:51,247 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d32aa0-c8be-46b3-99dd-0695538a2725/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2021-11-20 06:18:51,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:18:51,291 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-20 06:18:51,291 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:18:51,370 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-11-20 06:18:51,370 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 06:18:51,460 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-11-20 06:18:51,461 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-20 06:18:51,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [274917368] [2021-11-20 06:18:51,461 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [274917368] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 06:18:51,461 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-20 06:18:51,461 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2021-11-20 06:18:51,461 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266552269] [2021-11-20 06:18:51,461 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-20 06:18:51,462 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-20 06:18:51,462 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-20 06:18:51,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-20 06:18:51,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-11-20 06:18:51,462 INFO L87 Difference]: Start difference. First operand 72 states and 82 transitions. Second operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-11-20 06:18:51,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:18:51,837 INFO L93 Difference]: Finished difference Result 160 states and 175 transitions. [2021-11-20 06:18:51,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-20 06:18:51,838 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Word has length 30 [2021-11-20 06:18:51,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:18:51,839 INFO L225 Difference]: With dead ends: 160 [2021-11-20 06:18:51,839 INFO L226 Difference]: Without dead ends: 160 [2021-11-20 06:18:51,840 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2021-11-20 06:18:51,840 INFO L933 BasicCegarLoop]: 53 mSDtfsCounter, 137 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-20 06:18:51,841 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [137 Valid, 215 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-20 06:18:51,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2021-11-20 06:18:51,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 79. [2021-11-20 06:18:51,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 59 states have (on average 1.2881355932203389) internal successors, (76), 68 states have internal predecessors, (76), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (10), 7 states have call predecessors, (10), 6 states have call successors, (10) [2021-11-20 06:18:51,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 92 transitions. [2021-11-20 06:18:51,846 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 92 transitions. Word has length 30 [2021-11-20 06:18:51,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:18:51,847 INFO L470 AbstractCegarLoop]: Abstraction has 79 states and 92 transitions. [2021-11-20 06:18:51,847 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-11-20 06:18:51,847 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 92 transitions. [2021-11-20 06:18:51,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-20 06:18:51,848 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:18:51,848 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:18:51,864 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d32aa0-c8be-46b3-99dd-0695538a2725/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2021-11-20 06:18:52,059 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d32aa0-c8be-46b3-99dd-0695538a2725/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 [2021-11-20 06:18:52,060 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 7 more)] === [2021-11-20 06:18:52,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:18:52,060 INFO L85 PathProgramCache]: Analyzing trace with hash 252730558, now seen corresponding path program 1 times [2021-11-20 06:18:52,060 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-20 06:18:52,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [543202225] [2021-11-20 06:18:52,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:18:52,061 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-20 06:18:52,061 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d32aa0-c8be-46b3-99dd-0695538a2725/bin/uautomizer-DQz5hQGWxF/mathsat [2021-11-20 06:18:52,061 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d32aa0-c8be-46b3-99dd-0695538a2725/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-20 06:18:52,062 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d32aa0-c8be-46b3-99dd-0695538a2725/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2021-11-20 06:18:52,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:18:52,118 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 10 conjunts are in the unsatisfiable core [2021-11-20 06:18:52,119 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:18:52,466 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-20 06:18:52,466 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 06:18:53,249 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 11 treesize of output 9 [2021-11-20 06:18:53,768 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-20 06:18:53,768 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-20 06:18:53,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [543202225] [2021-11-20 06:18:53,768 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [543202225] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 06:18:53,768 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-20 06:18:53,768 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2021-11-20 06:18:53,768 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380933943] [2021-11-20 06:18:53,769 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-20 06:18:53,769 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-11-20 06:18:53,769 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-20 06:18:53,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-11-20 06:18:53,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2021-11-20 06:18:53,770 INFO L87 Difference]: Start difference. First operand 79 states and 92 transitions. Second operand has 18 states, 17 states have (on average 2.411764705882353) internal successors, (41), 16 states have internal predecessors, (41), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2021-11-20 06:18:55,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:18:55,354 INFO L93 Difference]: Finished difference Result 111 states and 121 transitions. [2021-11-20 06:18:55,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-20 06:18:55,355 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.411764705882353) internal successors, (41), 16 states have internal predecessors, (41), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 30 [2021-11-20 06:18:55,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:18:55,356 INFO L225 Difference]: With dead ends: 111 [2021-11-20 06:18:55,356 INFO L226 Difference]: Without dead ends: 111 [2021-11-20 06:18:55,357 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=112, Invalid=488, Unknown=0, NotChecked=0, Total=600 [2021-11-20 06:18:55,358 INFO L933 BasicCegarLoop]: 39 mSDtfsCounter, 107 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 40 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2021-11-20 06:18:55,358 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [107 Valid, 357 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 340 Invalid, 0 Unknown, 40 Unchecked, 1.0s Time] [2021-11-20 06:18:55,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2021-11-20 06:18:55,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 78. [2021-11-20 06:18:55,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 59 states have (on average 1.2372881355932204) internal successors, (73), 67 states have internal predecessors, (73), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (10), 7 states have call predecessors, (10), 6 states have call successors, (10) [2021-11-20 06:18:55,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 89 transitions. [2021-11-20 06:18:55,363 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 89 transitions. Word has length 30 [2021-11-20 06:18:55,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:18:55,364 INFO L470 AbstractCegarLoop]: Abstraction has 78 states and 89 transitions. [2021-11-20 06:18:55,364 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.411764705882353) internal successors, (41), 16 states have internal predecessors, (41), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2021-11-20 06:18:55,364 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 89 transitions. [2021-11-20 06:18:55,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-20 06:18:55,365 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:18:55,365 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:18:55,392 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d32aa0-c8be-46b3-99dd-0695538a2725/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2021-11-20 06:18:55,590 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d32aa0-c8be-46b3-99dd-0695538a2725/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 [2021-11-20 06:18:55,591 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 7 more)] === [2021-11-20 06:18:55,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:18:55,591 INFO L85 PathProgramCache]: Analyzing trace with hash -755287307, now seen corresponding path program 1 times [2021-11-20 06:18:55,591 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-20 06:18:55,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1026830913] [2021-11-20 06:18:55,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:18:55,592 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-20 06:18:55,592 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d32aa0-c8be-46b3-99dd-0695538a2725/bin/uautomizer-DQz5hQGWxF/mathsat [2021-11-20 06:18:55,594 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d32aa0-c8be-46b3-99dd-0695538a2725/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-20 06:18:55,594 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d32aa0-c8be-46b3-99dd-0695538a2725/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2021-11-20 06:18:55,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:18:55,656 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 12 conjunts are in the unsatisfiable core [2021-11-20 06:18:55,660 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:18:55,782 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 11 [2021-11-20 06:18:55,995 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-11-20 06:18:56,012 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-20 06:18:56,012 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 06:18:56,287 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-11-20 06:18:56,287 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-20 06:18:56,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1026830913] [2021-11-20 06:18:56,288 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1026830913] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 06:18:56,288 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-20 06:18:56,288 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 17 [2021-11-20 06:18:56,288 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992682628] [2021-11-20 06:18:56,288 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-20 06:18:56,289 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-11-20 06:18:56,289 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-20 06:18:56,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-11-20 06:18:56,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2021-11-20 06:18:56,290 INFO L87 Difference]: Start difference. First operand 78 states and 89 transitions. Second operand has 18 states, 17 states have (on average 2.235294117647059) internal successors, (38), 15 states have internal predecessors, (38), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2021-11-20 06:18:57,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:18:57,265 INFO L93 Difference]: Finished difference Result 117 states and 126 transitions. [2021-11-20 06:18:57,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-11-20 06:18:57,266 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.235294117647059) internal successors, (38), 15 states have internal predecessors, (38), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 31 [2021-11-20 06:18:57,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:18:57,267 INFO L225 Difference]: With dead ends: 117 [2021-11-20 06:18:57,267 INFO L226 Difference]: Without dead ends: 115 [2021-11-20 06:18:57,268 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=161, Invalid=769, Unknown=0, NotChecked=0, Total=930 [2021-11-20 06:18:57,269 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 206 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 38 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-20 06:18:57,269 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [207 Valid, 250 Invalid, 340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 281 Invalid, 0 Unknown, 38 Unchecked, 0.5s Time] [2021-11-20 06:18:57,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2021-11-20 06:18:57,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 83. [2021-11-20 06:18:57,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 63 states have (on average 1.2222222222222223) internal successors, (77), 71 states have internal predecessors, (77), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (10), 7 states have call predecessors, (10), 6 states have call successors, (10) [2021-11-20 06:18:57,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 93 transitions. [2021-11-20 06:18:57,282 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 93 transitions. Word has length 31 [2021-11-20 06:18:57,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:18:57,283 INFO L470 AbstractCegarLoop]: Abstraction has 83 states and 93 transitions. [2021-11-20 06:18:57,283 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.235294117647059) internal successors, (38), 15 states have internal predecessors, (38), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2021-11-20 06:18:57,283 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 93 transitions. [2021-11-20 06:18:57,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-20 06:18:57,288 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:18:57,288 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:18:57,304 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d32aa0-c8be-46b3-99dd-0695538a2725/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2021-11-20 06:18:57,499 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d32aa0-c8be-46b3-99dd-0695538a2725/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 [2021-11-20 06:18:57,499 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 7 more)] === [2021-11-20 06:18:57,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:18:57,500 INFO L85 PathProgramCache]: Analyzing trace with hash -1939069955, now seen corresponding path program 1 times [2021-11-20 06:18:57,500 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-20 06:18:57,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [932023750] [2021-11-20 06:18:57,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:18:57,500 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-20 06:18:57,500 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d32aa0-c8be-46b3-99dd-0695538a2725/bin/uautomizer-DQz5hQGWxF/mathsat [2021-11-20 06:18:57,501 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d32aa0-c8be-46b3-99dd-0695538a2725/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-20 06:18:57,508 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d32aa0-c8be-46b3-99dd-0695538a2725/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2021-11-20 06:18:57,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:18:57,563 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 15 conjunts are in the unsatisfiable core [2021-11-20 06:18:57,564 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:18:58,066 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-11-20 06:18:58,612 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-11-20 06:18:58,670 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 06:18:58,670 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 06:18:59,125 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-11-20 06:18:59,126 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-20 06:18:59,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [932023750] [2021-11-20 06:18:59,126 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [932023750] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 06:18:59,126 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-20 06:18:59,126 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 8] total 22 [2021-11-20 06:18:59,127 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972788873] [2021-11-20 06:18:59,127 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-20 06:18:59,127 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-11-20 06:18:59,127 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-20 06:18:59,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-11-20 06:18:59,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=412, Unknown=0, NotChecked=0, Total=506 [2021-11-20 06:18:59,128 INFO L87 Difference]: Start difference. First operand 83 states and 93 transitions. Second operand has 23 states, 22 states have (on average 2.227272727272727) internal successors, (49), 20 states have internal predecessors, (49), 5 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2021-11-20 06:19:00,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:19:00,152 INFO L93 Difference]: Finished difference Result 121 states and 131 transitions. [2021-11-20 06:19:00,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-11-20 06:19:00,155 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.227272727272727) internal successors, (49), 20 states have internal predecessors, (49), 5 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 32 [2021-11-20 06:19:00,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:19:00,156 INFO L225 Difference]: With dead ends: 121 [2021-11-20 06:19:00,156 INFO L226 Difference]: Without dead ends: 121 [2021-11-20 06:19:00,157 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=142, Invalid=728, Unknown=0, NotChecked=0, Total=870 [2021-11-20 06:19:00,158 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 94 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 279 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-11-20 06:19:00,158 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [94 Valid, 373 Invalid, 513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 217 Invalid, 0 Unknown, 279 Unchecked, 0.6s Time] [2021-11-20 06:19:00,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2021-11-20 06:19:00,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 84. [2021-11-20 06:19:00,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 64 states have (on average 1.21875) internal successors, (78), 72 states have internal predecessors, (78), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (10), 7 states have call predecessors, (10), 6 states have call successors, (10) [2021-11-20 06:19:00,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 94 transitions. [2021-11-20 06:19:00,163 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 94 transitions. Word has length 32 [2021-11-20 06:19:00,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:19:00,163 INFO L470 AbstractCegarLoop]: Abstraction has 84 states and 94 transitions. [2021-11-20 06:19:00,164 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.227272727272727) internal successors, (49), 20 states have internal predecessors, (49), 5 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2021-11-20 06:19:00,164 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 94 transitions. [2021-11-20 06:19:00,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-11-20 06:19:00,164 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:19:00,165 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:19:00,177 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d32aa0-c8be-46b3-99dd-0695538a2725/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2021-11-20 06:19:00,373 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d32aa0-c8be-46b3-99dd-0695538a2725/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 [2021-11-20 06:19:00,373 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 7 more)] === [2021-11-20 06:19:00,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:19:00,373 INFO L85 PathProgramCache]: Analyzing trace with hash 18373623, now seen corresponding path program 1 times [2021-11-20 06:19:00,374 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-20 06:19:00,374 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [275102405] [2021-11-20 06:19:00,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:19:00,374 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-20 06:19:00,374 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d32aa0-c8be-46b3-99dd-0695538a2725/bin/uautomizer-DQz5hQGWxF/mathsat [2021-11-20 06:19:00,375 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d32aa0-c8be-46b3-99dd-0695538a2725/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-20 06:19:00,376 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d32aa0-c8be-46b3-99dd-0695538a2725/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2021-11-20 06:19:00,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:19:00,430 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 14 conjunts are in the unsatisfiable core [2021-11-20 06:19:00,431 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:19:00,487 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-11-20 06:19:00,578 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 25 treesize of output 21 [2021-11-20 06:19:00,659 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 9 [2021-11-20 06:19:00,783 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 15 [2021-11-20 06:19:00,808 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-20 06:19:00,808 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 06:19:01,199 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-20 06:19:01,199 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-20 06:19:01,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [275102405] [2021-11-20 06:19:01,200 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [275102405] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 06:19:01,200 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-20 06:19:01,200 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 19 [2021-11-20 06:19:01,200 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636219104] [2021-11-20 06:19:01,200 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-20 06:19:01,200 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-11-20 06:19:01,201 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-20 06:19:01,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-11-20 06:19:01,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=328, Unknown=0, NotChecked=0, Total=380 [2021-11-20 06:19:01,202 INFO L87 Difference]: Start difference. First operand 84 states and 94 transitions. Second operand has 20 states, 19 states have (on average 2.3157894736842106) internal successors, (44), 17 states have internal predecessors, (44), 4 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2021-11-20 06:19:02,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:19:02,357 INFO L93 Difference]: Finished difference Result 104 states and 115 transitions. [2021-11-20 06:19:02,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-11-20 06:19:02,358 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.3157894736842106) internal successors, (44), 17 states have internal predecessors, (44), 4 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 33 [2021-11-20 06:19:02,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:19:02,358 INFO L225 Difference]: With dead ends: 104 [2021-11-20 06:19:02,358 INFO L226 Difference]: Without dead ends: 104 [2021-11-20 06:19:02,359 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 47 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 228 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=166, Invalid=1024, Unknown=0, NotChecked=0, Total=1190 [2021-11-20 06:19:02,360 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 94 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 476 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 47 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-11-20 06:19:02,360 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [95 Valid, 249 Invalid, 541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 476 Invalid, 0 Unknown, 47 Unchecked, 0.6s Time] [2021-11-20 06:19:02,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2021-11-20 06:19:02,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 85. [2021-11-20 06:19:02,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 65 states have (on average 1.2153846153846153) internal successors, (79), 73 states have internal predecessors, (79), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (10), 7 states have call predecessors, (10), 6 states have call successors, (10) [2021-11-20 06:19:02,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 95 transitions. [2021-11-20 06:19:02,365 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 95 transitions. Word has length 33 [2021-11-20 06:19:02,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:19:02,365 INFO L470 AbstractCegarLoop]: Abstraction has 85 states and 95 transitions. [2021-11-20 06:19:02,366 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.3157894736842106) internal successors, (44), 17 states have internal predecessors, (44), 4 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2021-11-20 06:19:02,366 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 95 transitions. [2021-11-20 06:19:02,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-20 06:19:02,366 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:19:02,367 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:19:02,381 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d32aa0-c8be-46b3-99dd-0695538a2725/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2021-11-20 06:19:02,578 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d32aa0-c8be-46b3-99dd-0695538a2725/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 [2021-11-20 06:19:02,578 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 7 more)] === [2021-11-20 06:19:02,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:19:02,578 INFO L85 PathProgramCache]: Analyzing trace with hash 1907841251, now seen corresponding path program 1 times [2021-11-20 06:19:02,579 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-20 06:19:02,579 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1073770340] [2021-11-20 06:19:02,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:19:02,579 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-20 06:19:02,579 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d32aa0-c8be-46b3-99dd-0695538a2725/bin/uautomizer-DQz5hQGWxF/mathsat [2021-11-20 06:19:02,580 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d32aa0-c8be-46b3-99dd-0695538a2725/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-20 06:19:02,584 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d32aa0-c8be-46b3-99dd-0695538a2725/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2021-11-20 06:19:02,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:19:02,648 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-20 06:19:02,649 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:19:02,750 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-11-20 06:19:02,750 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 06:19:02,914 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-11-20 06:19:02,914 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-20 06:19:02,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1073770340] [2021-11-20 06:19:02,915 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1073770340] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 06:19:02,915 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-20 06:19:02,915 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2021-11-20 06:19:02,915 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102279719] [2021-11-20 06:19:02,915 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-20 06:19:02,916 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-20 06:19:02,916 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-20 06:19:02,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-20 06:19:02,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-11-20 06:19:02,917 INFO L87 Difference]: Start difference. First operand 85 states and 95 transitions. Second operand has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-11-20 06:19:03,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:19:03,076 INFO L93 Difference]: Finished difference Result 102 states and 111 transitions. [2021-11-20 06:19:03,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-20 06:19:03,077 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Word has length 36 [2021-11-20 06:19:03,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:19:03,077 INFO L225 Difference]: With dead ends: 102 [2021-11-20 06:19:03,078 INFO L226 Difference]: Without dead ends: 102 [2021-11-20 06:19:03,078 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2021-11-20 06:19:03,079 INFO L933 BasicCegarLoop]: 36 mSDtfsCounter, 45 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-20 06:19:03,079 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 197 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-20 06:19:03,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2021-11-20 06:19:03,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 95. [2021-11-20 06:19:03,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 75 states have (on average 1.1866666666666668) internal successors, (89), 82 states have internal predecessors, (89), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (10), 8 states have call predecessors, (10), 6 states have call successors, (10) [2021-11-20 06:19:03,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 105 transitions. [2021-11-20 06:19:03,084 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 105 transitions. Word has length 36 [2021-11-20 06:19:03,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:19:03,084 INFO L470 AbstractCegarLoop]: Abstraction has 95 states and 105 transitions. [2021-11-20 06:19:03,084 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-11-20 06:19:03,084 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 105 transitions. [2021-11-20 06:19:03,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-11-20 06:19:03,085 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:19:03,085 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 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] [2021-11-20 06:19:03,097 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d32aa0-c8be-46b3-99dd-0695538a2725/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (20)] Ended with exit code 0 [2021-11-20 06:19:03,293 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d32aa0-c8be-46b3-99dd-0695538a2725/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 [2021-11-20 06:19:03,293 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 7 more)] === [2021-11-20 06:19:03,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:19:03,293 INFO L85 PathProgramCache]: Analyzing trace with hash -515638253, now seen corresponding path program 1 times [2021-11-20 06:19:03,294 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-20 06:19:03,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [291596420] [2021-11-20 06:19:03,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:19:03,294 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-20 06:19:03,294 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d32aa0-c8be-46b3-99dd-0695538a2725/bin/uautomizer-DQz5hQGWxF/mathsat [2021-11-20 06:19:03,295 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d32aa0-c8be-46b3-99dd-0695538a2725/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-20 06:19:03,311 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d32aa0-c8be-46b3-99dd-0695538a2725/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2021-11-20 06:19:03,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:19:03,369 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 22 conjunts are in the unsatisfiable core [2021-11-20 06:19:03,371 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:19:03,381 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-11-20 06:19:03,535 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-11-20 06:19:03,535 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 24 treesize of output 31 [2021-11-20 06:19:03,654 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 29 treesize of output 25 [2021-11-20 06:19:03,803 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-11-20 06:19:03,803 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 38 treesize of output 30 [2021-11-20 06:19:08,050 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 23 [2021-11-20 06:19:08,122 INFO L354 Elim1Store]: treesize reduction 20, result has 28.6 percent of original size [2021-11-20 06:19:08,122 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 35 treesize of output 38 [2021-11-20 06:19:08,205 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 06:19:08,205 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 06:19:17,123 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 06:19:17,123 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-20 06:19:17,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [291596420] [2021-11-20 06:19:17,123 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [291596420] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 06:19:17,124 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-20 06:19:17,124 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 27 [2021-11-20 06:19:17,124 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663817512] [2021-11-20 06:19:17,124 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-20 06:19:17,124 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2021-11-20 06:19:17,124 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-20 06:19:17,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-11-20 06:19:17,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=658, Unknown=5, NotChecked=0, Total=756 [2021-11-20 06:19:17,125 INFO L87 Difference]: Start difference. First operand 95 states and 105 transitions. Second operand has 28 states, 27 states have (on average 2.259259259259259) internal successors, (61), 24 states have internal predecessors, (61), 5 states have call successors, (5), 5 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2021-11-20 06:20:01,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:20:01,862 INFO L93 Difference]: Finished difference Result 151 states and 166 transitions. [2021-11-20 06:20:01,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-11-20 06:20:01,863 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.259259259259259) internal successors, (61), 24 states have internal predecessors, (61), 5 states have call successors, (5), 5 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 38 [2021-11-20 06:20:01,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:20:01,864 INFO L225 Difference]: With dead ends: 151 [2021-11-20 06:20:01,864 INFO L226 Difference]: Without dead ends: 151 [2021-11-20 06:20:01,865 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 47 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 569 ImplicationChecksByTransitivity, 56.6s TimeCoverageRelationStatistics Valid=296, Invalid=2032, Unknown=24, NotChecked=0, Total=2352 [2021-11-20 06:20:01,866 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 168 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 672 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 988 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 672 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 245 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2021-11-20 06:20:01,866 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [168 Valid, 310 Invalid, 988 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 672 Invalid, 0 Unknown, 245 Unchecked, 1.0s Time] [2021-11-20 06:20:01,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2021-11-20 06:20:01,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 98. [2021-11-20 06:20:01,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 78 states have (on average 1.205128205128205) internal successors, (94), 85 states have internal predecessors, (94), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (10), 8 states have call predecessors, (10), 6 states have call successors, (10) [2021-11-20 06:20:01,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 110 transitions. [2021-11-20 06:20:01,872 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 110 transitions. Word has length 38 [2021-11-20 06:20:01,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:20:01,872 INFO L470 AbstractCegarLoop]: Abstraction has 98 states and 110 transitions. [2021-11-20 06:20:01,872 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.259259259259259) internal successors, (61), 24 states have internal predecessors, (61), 5 states have call successors, (5), 5 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2021-11-20 06:20:01,873 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 110 transitions. [2021-11-20 06:20:01,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-11-20 06:20:01,873 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:20:01,873 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:20:01,885 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d32aa0-c8be-46b3-99dd-0695538a2725/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (21)] Ended with exit code 0 [2021-11-20 06:20:02,083 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d32aa0-c8be-46b3-99dd-0695538a2725/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 [2021-11-20 06:20:02,084 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 7 more)] === [2021-11-20 06:20:02,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:20:02,084 INFO L85 PathProgramCache]: Analyzing trace with hash -939657047, now seen corresponding path program 1 times [2021-11-20 06:20:02,084 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-20 06:20:02,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1413909368] [2021-11-20 06:20:02,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:20:02,085 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-20 06:20:02,085 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d32aa0-c8be-46b3-99dd-0695538a2725/bin/uautomizer-DQz5hQGWxF/mathsat [2021-11-20 06:20:02,085 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d32aa0-c8be-46b3-99dd-0695538a2725/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-20 06:20:02,090 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d32aa0-c8be-46b3-99dd-0695538a2725/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2021-11-20 06:20:02,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:20:02,145 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-20 06:20:02,146 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:20:02,290 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-11-20 06:20:02,290 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 06:20:02,462 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-11-20 06:20:02,462 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-20 06:20:02,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1413909368] [2021-11-20 06:20:02,462 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1413909368] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 06:20:02,462 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-20 06:20:02,462 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2021-11-20 06:20:02,462 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555938552] [2021-11-20 06:20:02,462 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-20 06:20:02,463 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-20 06:20:02,463 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-20 06:20:02,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-20 06:20:02,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-11-20 06:20:02,464 INFO L87 Difference]: Start difference. First operand 98 states and 110 transitions. Second operand has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-11-20 06:20:02,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:20:02,706 INFO L93 Difference]: Finished difference Result 239 states and 260 transitions. [2021-11-20 06:20:02,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-20 06:20:02,707 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 39 [2021-11-20 06:20:02,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:20:02,708 INFO L225 Difference]: With dead ends: 239 [2021-11-20 06:20:02,708 INFO L226 Difference]: Without dead ends: 239 [2021-11-20 06:20:02,709 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2021-11-20 06:20:02,709 INFO L933 BasicCegarLoop]: 57 mSDtfsCounter, 376 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 377 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-20 06:20:02,710 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [377 Valid, 265 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-20 06:20:02,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2021-11-20 06:20:02,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 109. [2021-11-20 06:20:02,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 88 states have (on average 1.1818181818181819) internal successors, (104), 94 states have internal predecessors, (104), 7 states have call successors, (7), 4 states have call predecessors, (7), 6 states have return successors, (12), 10 states have call predecessors, (12), 7 states have call successors, (12) [2021-11-20 06:20:02,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 123 transitions. [2021-11-20 06:20:02,716 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 123 transitions. Word has length 39 [2021-11-20 06:20:02,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:20:02,717 INFO L470 AbstractCegarLoop]: Abstraction has 109 states and 123 transitions. [2021-11-20 06:20:02,717 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-11-20 06:20:02,717 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 123 transitions. [2021-11-20 06:20:02,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-11-20 06:20:02,718 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:20:02,718 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 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, 1, 1] [2021-11-20 06:20:02,727 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d32aa0-c8be-46b3-99dd-0695538a2725/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2021-11-20 06:20:02,925 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d32aa0-c8be-46b3-99dd-0695538a2725/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 [2021-11-20 06:20:02,928 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 7 more)] === [2021-11-20 06:20:02,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:20:02,928 INFO L85 PathProgramCache]: Analyzing trace with hash -1607118890, now seen corresponding path program 1 times [2021-11-20 06:20:02,928 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-20 06:20:02,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [322494234] [2021-11-20 06:20:02,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:20:02,929 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-20 06:20:02,929 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d32aa0-c8be-46b3-99dd-0695538a2725/bin/uautomizer-DQz5hQGWxF/mathsat [2021-11-20 06:20:02,929 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d32aa0-c8be-46b3-99dd-0695538a2725/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-20 06:20:02,932 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d32aa0-c8be-46b3-99dd-0695538a2725/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2021-11-20 06:20:02,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:20:02,997 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 26 conjunts are in the unsatisfiable core [2021-11-20 06:20:02,998 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:20:03,339 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 37 treesize of output 33 [2021-11-20 06:20:03,508 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-11-20 06:20:03,508 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 34 treesize of output 26 [2021-11-20 06:20:07,777 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 39 treesize of output 27 [2021-11-20 06:20:14,092 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-20 06:20:14,092 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 06:20:25,077 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_30| (_ BitVec 32)) (|v_ULTIMATE.start_main_old_#valid#1_BEFORE_CALL_11| (Array (_ BitVec 32) (_ BitVec 1)))) (or (= (store (store |c_#valid| |c_ldv_malloc_#res.base| (_ bv0 1)) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_30| (_ bv0 1)) |v_ULTIMATE.start_main_old_#valid#1_BEFORE_CALL_11|) (exists ((|v_ULTIMATE.start_entry_point_#t~ret40#1.base_107| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (select |c_old(#valid)| |v_ULTIMATE.start_entry_point_#t~ret40#1.base_107|))) (not (= (store (store |c_old(#valid)| |v_ULTIMATE.start_entry_point_#t~ret40#1.base_107| (_ bv0 1)) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_30| (_ bv0 1)) |v_ULTIMATE.start_main_old_#valid#1_BEFORE_CALL_11|)))))) is different from false [2021-11-20 06:20:39,428 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_old_#valid#1_BEFORE_CALL_12| (Array (_ BitVec 32) (_ BitVec 1))) (|v_ULTIMATE.start_entry_point_#t~ret40#1.base_107| (_ BitVec 32))) (or (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_ULTIMATE.start_entry_point_#t~ret40#1.base_107|)))) (exists ((|v_ULTIMATE.start_entry_point_#t~ret38#1.base_71| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_#t~ret40#1.base_107| (_ BitVec 32))) (let ((.cse0 (store |c_old(#valid)| |v_ULTIMATE.start_entry_point_#t~ret38#1.base_71| (_ bv1 1)))) (and (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select .cse0 |v_ULTIMATE.start_entry_point_#t~ret40#1.base_107|)))))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_ULTIMATE.start_entry_point_#t~ret38#1.base_71|)))))) (not (= (store (store .cse0 |v_ULTIMATE.start_entry_point_#t~ret40#1.base_107| (_ bv0 1)) |v_ULTIMATE.start_entry_point_#t~ret38#1.base_71| (_ bv0 1)) |v_ULTIMATE.start_main_old_#valid#1_BEFORE_CALL_12|))))) (= (store (store |c_#valid| |v_ULTIMATE.start_entry_point_#t~ret40#1.base_107| (_ bv0 1)) |c_ldv_malloc_#res.base| (_ bv0 1)) |v_ULTIMATE.start_main_old_#valid#1_BEFORE_CALL_12|))) is different from false [2021-11-20 06:20:39,682 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_old_#valid#1_BEFORE_CALL_12| (Array (_ BitVec 32) (_ BitVec 1))) (|v_ULTIMATE.start_entry_point_#t~ret40#1.base_107| (_ BitVec 32)) (|v_ldv_malloc_#res.base_187| (_ BitVec 32))) (let ((.cse0 (store |c_#valid| |v_ldv_malloc_#res.base_187| (_ bv1 1)))) (or (= (store (store .cse0 |v_ULTIMATE.start_entry_point_#t~ret40#1.base_107| (_ bv0 1)) |v_ldv_malloc_#res.base_187| (_ bv0 1)) |v_ULTIMATE.start_main_old_#valid#1_BEFORE_CALL_12|) (exists ((|v_ULTIMATE.start_entry_point_#t~ret38#1.base_71| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_#t~ret40#1.base_107| (_ BitVec 32))) (let ((.cse1 (store |c_old(#valid)| |v_ULTIMATE.start_entry_point_#t~ret38#1.base_71| (_ bv1 1)))) (and (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select .cse1 |v_ULTIMATE.start_entry_point_#t~ret40#1.base_107|)))))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_ULTIMATE.start_entry_point_#t~ret38#1.base_71|)))))) (not (= (store (store .cse1 |v_ULTIMATE.start_entry_point_#t~ret40#1.base_107| (_ bv0 1)) |v_ULTIMATE.start_entry_point_#t~ret38#1.base_71| (_ bv0 1)) |v_ULTIMATE.start_main_old_#valid#1_BEFORE_CALL_12|))))) (not (= (_ bv0 1) (bvneg (select .cse0 |v_ULTIMATE.start_entry_point_#t~ret40#1.base_107|)))) (not (= (_ bv0 1) (bvneg (bvneg (select |c_#valid| |v_ldv_malloc_#res.base_187|)))))))) is different from false [2021-11-20 06:20:39,845 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2021-11-20 06:20:39,845 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-20 06:20:39,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [322494234] [2021-11-20 06:20:39,846 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [322494234] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 06:20:39,846 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-20 06:20:39,846 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 32 [2021-11-20 06:20:39,846 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339188788] [2021-11-20 06:20:39,846 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-20 06:20:39,846 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2021-11-20 06:20:39,846 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-20 06:20:39,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2021-11-20 06:20:39,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=775, Unknown=20, NotChecked=174, Total=1056 [2021-11-20 06:20:39,847 INFO L87 Difference]: Start difference. First operand 109 states and 123 transitions. Second operand has 33 states, 31 states have (on average 2.129032258064516) internal successors, (66), 29 states have internal predecessors, (66), 6 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-11-20 06:20:41,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:20:41,040 INFO L93 Difference]: Finished difference Result 114 states and 127 transitions. [2021-11-20 06:20:41,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-11-20 06:20:41,041 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 31 states have (on average 2.129032258064516) internal successors, (66), 29 states have internal predecessors, (66), 6 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 40 [2021-11-20 06:20:41,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:20:41,042 INFO L225 Difference]: With dead ends: 114 [2021-11-20 06:20:41,042 INFO L226 Difference]: Without dead ends: 97 [2021-11-20 06:20:41,043 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 46 SyntacticMatches, 5 SemanticMatches, 36 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 36.0s TimeCoverageRelationStatistics Valid=120, Invalid=1062, Unknown=20, NotChecked=204, Total=1406 [2021-11-20 06:20:41,043 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 22 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 267 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-11-20 06:20:41,044 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 398 Invalid, 595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 325 Invalid, 0 Unknown, 267 Unchecked, 0.6s Time] [2021-11-20 06:20:41,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2021-11-20 06:20:41,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2021-11-20 06:20:41,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 77 states have (on average 1.1948051948051948) internal successors, (92), 83 states have internal predecessors, (92), 7 states have call successors, (7), 4 states have call predecessors, (7), 5 states have return successors, (11), 9 states have call predecessors, (11), 7 states have call successors, (11) [2021-11-20 06:20:41,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 110 transitions. [2021-11-20 06:20:41,047 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 110 transitions. Word has length 40 [2021-11-20 06:20:41,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:20:41,048 INFO L470 AbstractCegarLoop]: Abstraction has 97 states and 110 transitions. [2021-11-20 06:20:41,049 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 31 states have (on average 2.129032258064516) internal successors, (66), 29 states have internal predecessors, (66), 6 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-11-20 06:20:41,049 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 110 transitions. [2021-11-20 06:20:41,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-11-20 06:20:41,049 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:20:41,050 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:20:41,065 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d32aa0-c8be-46b3-99dd-0695538a2725/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (23)] Ended with exit code 0 [2021-11-20 06:20:41,261 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d32aa0-c8be-46b3-99dd-0695538a2725/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 [2021-11-20 06:20:41,261 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 7 more)] === [2021-11-20 06:20:41,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:20:41,261 INFO L85 PathProgramCache]: Analyzing trace with hash -1589564234, now seen corresponding path program 2 times [2021-11-20 06:20:41,262 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-20 06:20:41,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [192887517] [2021-11-20 06:20:41,262 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-20 06:20:41,262 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-20 06:20:41,262 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d32aa0-c8be-46b3-99dd-0695538a2725/bin/uautomizer-DQz5hQGWxF/mathsat [2021-11-20 06:20:41,263 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d32aa0-c8be-46b3-99dd-0695538a2725/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-20 06:20:41,264 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d32aa0-c8be-46b3-99dd-0695538a2725/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2021-11-20 06:20:41,321 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-20 06:20:41,321 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 06:20:41,325 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 11 conjunts are in the unsatisfiable core [2021-11-20 06:20:41,326 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:20:41,762 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-11-20 06:20:41,763 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 06:20:42,221 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 34 treesize of output 30 [2021-11-20 06:20:44,595 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-11-20 06:20:44,596 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-20 06:20:44,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [192887517] [2021-11-20 06:20:44,596 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [192887517] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 06:20:44,596 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-20 06:20:44,596 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 20 [2021-11-20 06:20:44,597 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105478552] [2021-11-20 06:20:44,597 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-20 06:20:44,597 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-11-20 06:20:44,597 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-20 06:20:44,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-11-20 06:20:44,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=346, Unknown=0, NotChecked=0, Total=420 [2021-11-20 06:20:44,598 INFO L87 Difference]: Start difference. First operand 97 states and 110 transitions. Second operand has 21 states, 20 states have (on average 2.9) internal successors, (58), 19 states have internal predecessors, (58), 7 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) [2021-11-20 06:20:53,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:20:53,327 INFO L93 Difference]: Finished difference Result 227 states and 239 transitions. [2021-11-20 06:20:53,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-11-20 06:20:53,328 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.9) internal successors, (58), 19 states have internal predecessors, (58), 7 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) Word has length 46 [2021-11-20 06:20:53,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:20:53,329 INFO L225 Difference]: With dead ends: 227 [2021-11-20 06:20:53,329 INFO L226 Difference]: Without dead ends: 227 [2021-11-20 06:20:53,330 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 410 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=468, Invalid=1512, Unknown=0, NotChecked=0, Total=1980 [2021-11-20 06:20:53,331 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 891 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 449 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 891 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2021-11-20 06:20:53,332 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [891 Valid, 391 Invalid, 544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 449 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2021-11-20 06:20:53,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2021-11-20 06:20:53,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 120. [2021-11-20 06:20:53,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 100 states have (on average 1.24) internal successors, (124), 105 states have internal predecessors, (124), 7 states have call successors, (7), 4 states have call predecessors, (7), 5 states have return successors, (11), 10 states have call predecessors, (11), 7 states have call successors, (11) [2021-11-20 06:20:53,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 142 transitions. [2021-11-20 06:20:53,338 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 142 transitions. Word has length 46 [2021-11-20 06:20:53,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:20:53,338 INFO L470 AbstractCegarLoop]: Abstraction has 120 states and 142 transitions. [2021-11-20 06:20:53,339 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.9) internal successors, (58), 19 states have internal predecessors, (58), 7 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) [2021-11-20 06:20:53,339 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 142 transitions. [2021-11-20 06:20:53,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-11-20 06:20:53,339 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:20:53,340 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:20:53,370 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d32aa0-c8be-46b3-99dd-0695538a2725/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2021-11-20 06:20:53,570 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d32aa0-c8be-46b3-99dd-0695538a2725/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 [2021-11-20 06:20:53,570 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 7 more)] === [2021-11-20 06:20:53,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:20:53,570 INFO L85 PathProgramCache]: Analyzing trace with hash -899085478, now seen corresponding path program 2 times [2021-11-20 06:20:53,571 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-20 06:20:53,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [847117776] [2021-11-20 06:20:53,571 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-20 06:20:53,571 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-20 06:20:53,571 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d32aa0-c8be-46b3-99dd-0695538a2725/bin/uautomizer-DQz5hQGWxF/mathsat [2021-11-20 06:20:53,572 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d32aa0-c8be-46b3-99dd-0695538a2725/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-20 06:20:53,575 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d32aa0-c8be-46b3-99dd-0695538a2725/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2021-11-20 06:20:53,660 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-20 06:20:53,660 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 06:20:53,665 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 42 conjunts are in the unsatisfiable core [2021-11-20 06:20:53,667 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:20:53,693 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-11-20 06:20:53,699 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-11-20 06:20:55,965 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-20 06:20:55,966 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 29 treesize of output 31 [2021-11-20 06:20:55,975 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-20 06:20:55,975 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 23 treesize of output 23 [2021-11-20 06:20:56,186 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-20 06:20:56,186 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 31 treesize of output 33 [2021-11-20 06:20:56,199 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-20 06:20:56,199 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 25 [2021-11-20 06:20:56,390 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-20 06:20:56,390 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 32 treesize of output 34 [2021-11-20 06:20:56,400 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-20 06:20:56,401 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 26 treesize of output 26 [2021-11-20 06:20:56,627 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-20 06:20:56,627 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 32 treesize of output 34 [2021-11-20 06:20:56,637 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-20 06:20:56,638 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 26 treesize of output 26 [2021-11-20 06:20:56,699 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 4 proven. 45 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-11-20 06:20:56,699 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 06:21:20,221 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-11-20 06:21:20,221 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 47 treesize of output 46 [2021-11-20 06:21:34,852 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ldv_malloc_#res.base_203| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_51| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_37| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_36| (_ BitVec 32))) (or (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_36| |v_ldv_malloc_#res.base_203|) (exists ((|v_ldv_malloc_#res.base_203| (_ BitVec 32)) (|v_ldv_malloc_#res.base_207| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_ldv_malloc_#res.base_207|))))) (not (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_36| |v_ldv_malloc_#res.base_203|)) (or (exists ((v_ldv_malloc_~size_194 (_ BitVec 32)) (v_ldv_malloc_~size_190 (_ BitVec 32))) (not (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_37| (_ bv8 32) (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_51| (_ bv4 32))) (select (store (store |c_old(#length)| |v_ldv_malloc_#res.base_207| v_ldv_malloc_~size_194) |v_ldv_malloc_#res.base_203| v_ldv_malloc_~size_190) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_36|)))) (not (let ((.cse0 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_51| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_37| (_ bv4 32) .cse0) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_37| (_ bv8 32) .cse0))))))) (and (let ((.cse1 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_51| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_37| (_ bv4 32) .cse1) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_37| (_ bv8 32) .cse1))) (forall ((v_ldv_malloc_~size_190 (_ BitVec 32))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_37| (_ bv8 32) (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_51| (_ bv4 32))) (select (store |c_#length| |v_ldv_malloc_#res.base_203| v_ldv_malloc_~size_190) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_36|)))))) is different from false [2021-11-20 06:21:51,651 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ldv_malloc_#res.base_203| (_ BitVec 32)) (|v_ldv_malloc_#res.base_208| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_51| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_37| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_36| (_ BitVec 32))) (or (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_36| |v_ldv_malloc_#res.base_203|) (exists ((|v_ldv_malloc_#res.base_203| (_ BitVec 32)) (|v_ldv_malloc_#res.base_207| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_ldv_malloc_#res.base_207|))))) (not (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_36| |v_ldv_malloc_#res.base_203|)) (or (exists ((v_ldv_malloc_~size_194 (_ BitVec 32)) (v_ldv_malloc_~size_190 (_ BitVec 32))) (not (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_37| (_ bv8 32) (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_51| (_ bv4 32))) (select (store (store |c_old(#length)| |v_ldv_malloc_#res.base_207| v_ldv_malloc_~size_194) |v_ldv_malloc_#res.base_203| v_ldv_malloc_~size_190) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_36|)))) (not (let ((.cse0 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_51| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_37| (_ bv4 32) .cse0) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_37| (_ bv8 32) .cse0))))))) (and (let ((.cse1 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_51| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_37| (_ bv4 32) .cse1) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_37| (_ bv8 32) .cse1))) (forall ((ldv_malloc_~size (_ BitVec 32)) (v_ldv_malloc_~size_190 (_ BitVec 32))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_37| (_ bv8 32) (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_51| (_ bv4 32))) (select (store (store |c_#length| |v_ldv_malloc_#res.base_208| ldv_malloc_~size) |v_ldv_malloc_#res.base_203| v_ldv_malloc_~size_190) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_36|)))) (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_ldv_malloc_#res.base_208|)))))) is different from false [2021-11-20 06:22:05,627 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-11-20 06:22:05,627 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 50 treesize of output 49 [2021-11-20 06:22:31,334 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ldv_malloc_#res.base_203| (_ BitVec 32)) (|v_ldv_malloc_#res.base_207| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_38| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_52| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_37| (_ BitVec 32))) (or (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_37| |v_ldv_malloc_#res.base_203|) (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_37| |v_ldv_malloc_#res.base_207|) (exists ((|v_ldv_malloc_#res.base_203| (_ BitVec 32)) (|v_ldv_malloc_#res.base_211| (_ BitVec 32)) (|v_ldv_malloc_#res.base_207| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_ldv_malloc_#res.base_211|)))) (not (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_37| |v_ldv_malloc_#res.base_203|)) (or (exists ((v_ldv_malloc_~size_198 (_ BitVec 32)) (v_ldv_malloc_~size_194 (_ BitVec 32)) (v_ldv_malloc_~size_190 (_ BitVec 32))) (not (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_38| (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_52| (_ bv4 32)) (_ bv12 32)) (select (store (store (store |c_old(#length)| |v_ldv_malloc_#res.base_211| v_ldv_malloc_~size_198) |v_ldv_malloc_#res.base_207| v_ldv_malloc_~size_194) |v_ldv_malloc_#res.base_203| v_ldv_malloc_~size_190) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_37|)))) (not (let ((.cse0 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_52| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_38| .cse0 (_ bv8 32)) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_38| .cse0 (_ bv12 32)))))) (not (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_37| |v_ldv_malloc_#res.base_207|)))) (and (let ((.cse1 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_52| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_38| .cse1 (_ bv8 32)) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_38| .cse1 (_ bv12 32)))) (forall ((v_ldv_malloc_~size_194 (_ BitVec 32)) (v_ldv_malloc_~size_190 (_ BitVec 32))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_38| (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_52| (_ bv4 32)) (_ bv12 32)) (select (store (store |c_#length| |v_ldv_malloc_#res.base_207| v_ldv_malloc_~size_194) |v_ldv_malloc_#res.base_203| v_ldv_malloc_~size_190) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_37|)))))) is different from false [2021-11-20 06:22:57,201 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ldv_malloc_#res.base_203| (_ BitVec 32)) (|v_ldv_malloc_#res.base_212| (_ BitVec 32)) (|v_ldv_malloc_#res.base_207| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_38| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_52| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_37| (_ BitVec 32))) (or (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_ldv_malloc_#res.base_212|)))) (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_37| |v_ldv_malloc_#res.base_203|) (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_37| |v_ldv_malloc_#res.base_207|) (and (let ((.cse0 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_52| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_38| .cse0 (_ bv8 32)) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_38| .cse0 (_ bv12 32)))) (forall ((ldv_malloc_~size (_ BitVec 32)) (v_ldv_malloc_~size_194 (_ BitVec 32)) (v_ldv_malloc_~size_190 (_ BitVec 32))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_38| (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_52| (_ bv4 32)) (_ bv12 32)) (select (store (store (store |c_#length| |v_ldv_malloc_#res.base_212| ldv_malloc_~size) |v_ldv_malloc_#res.base_207| v_ldv_malloc_~size_194) |v_ldv_malloc_#res.base_203| v_ldv_malloc_~size_190) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_37|)))) (exists ((|v_ldv_malloc_#res.base_203| (_ BitVec 32)) (|v_ldv_malloc_#res.base_211| (_ BitVec 32)) (|v_ldv_malloc_#res.base_207| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_ldv_malloc_#res.base_211|)))) (not (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_37| |v_ldv_malloc_#res.base_203|)) (or (exists ((v_ldv_malloc_~size_198 (_ BitVec 32)) (v_ldv_malloc_~size_194 (_ BitVec 32)) (v_ldv_malloc_~size_190 (_ BitVec 32))) (not (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_38| (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_52| (_ bv4 32)) (_ bv12 32)) (select (store (store (store |c_old(#length)| |v_ldv_malloc_#res.base_211| v_ldv_malloc_~size_198) |v_ldv_malloc_#res.base_207| v_ldv_malloc_~size_194) |v_ldv_malloc_#res.base_203| v_ldv_malloc_~size_190) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_37|)))) (not (let ((.cse1 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_52| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_38| .cse1 (_ bv8 32)) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_38| .cse1 (_ bv12 32)))))) (not (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_37| |v_ldv_malloc_#res.base_207|)))))) is different from false [2021-11-20 06:23:22,079 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-11-20 06:23:22,079 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 57 treesize of output 56 [2021-11-20 06:23:54,291 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ldv_malloc_#res.base_203| (_ BitVec 32)) (|v_ldv_malloc_#res.base_211| (_ BitVec 32)) (|v_ldv_malloc_#res.base_207| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_53| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_39| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_38| (_ BitVec 32))) (or (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_38| |v_ldv_malloc_#res.base_203|) (exists ((|v_ldv_malloc_#res.base_203| (_ BitVec 32)) (|v_ldv_malloc_#res.base_211| (_ BitVec 32)) (|v_ldv_malloc_#res.base_207| (_ BitVec 32)) (|v_ldv_malloc_#res.base_215| (_ BitVec 32))) (and (not (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_38| |v_ldv_malloc_#res.base_207|)) (not (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_38| |v_ldv_malloc_#res.base_211|)) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_ldv_malloc_#res.base_215|))))))) (not (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_38| |v_ldv_malloc_#res.base_203|)) (or (exists ((v_ldv_malloc_~size_202 (_ BitVec 32)) (v_ldv_malloc_~size_198 (_ BitVec 32)) (v_ldv_malloc_~size_194 (_ BitVec 32)) (v_ldv_malloc_~size_190 (_ BitVec 32))) (not (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_39| (_ bv16 32) (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_53| (_ bv4 32))) (select (store (store (store (store |c_old(#length)| |v_ldv_malloc_#res.base_215| v_ldv_malloc_~size_202) |v_ldv_malloc_#res.base_211| v_ldv_malloc_~size_198) |v_ldv_malloc_#res.base_207| v_ldv_malloc_~size_194) |v_ldv_malloc_#res.base_203| v_ldv_malloc_~size_190) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_38|)))) (not (let ((.cse0 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_53| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_39| .cse0 (_ bv12 32)) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_39| (_ bv16 32) .cse0))))))) (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_38| |v_ldv_malloc_#res.base_207|) (and (let ((.cse1 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_53| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_39| .cse1 (_ bv12 32)) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_39| (_ bv16 32) .cse1))) (forall ((v_ldv_malloc_~size_198 (_ BitVec 32)) (v_ldv_malloc_~size_194 (_ BitVec 32)) (v_ldv_malloc_~size_190 (_ BitVec 32))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_39| (_ bv16 32) (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_53| (_ bv4 32))) (select (store (store (store |c_#length| |v_ldv_malloc_#res.base_211| v_ldv_malloc_~size_198) |v_ldv_malloc_#res.base_207| v_ldv_malloc_~size_194) |v_ldv_malloc_#res.base_203| v_ldv_malloc_~size_190) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_38|)))) (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_38| |v_ldv_malloc_#res.base_211|))) is different from false [2021-11-20 06:24:31,391 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ldv_malloc_#res.base_203| (_ BitVec 32)) (|v_ldv_malloc_#res.base_211| (_ BitVec 32)) (|v_ldv_malloc_#res.base_207| (_ BitVec 32)) (|v_ldv_malloc_#res.base_216| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_53| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_39| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_ldv_malloc_#res.base_216|)))) (and (forall ((ldv_malloc_~size (_ BitVec 32)) (v_ldv_malloc_~size_198 (_ BitVec 32)) (v_ldv_malloc_~size_194 (_ BitVec 32)) (v_ldv_malloc_~size_190 (_ BitVec 32))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_39| (_ bv16 32) (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_53| (_ bv4 32))) (select (store (store (store (store |c_#length| |v_ldv_malloc_#res.base_216| ldv_malloc_~size) |v_ldv_malloc_#res.base_211| v_ldv_malloc_~size_198) |v_ldv_malloc_#res.base_207| v_ldv_malloc_~size_194) |v_ldv_malloc_#res.base_203| v_ldv_malloc_~size_190) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_38|))) (let ((.cse0 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_53| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_39| .cse0 (_ bv12 32)) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_39| (_ bv16 32) .cse0)))) (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_38| |v_ldv_malloc_#res.base_203|) (exists ((|v_ldv_malloc_#res.base_203| (_ BitVec 32)) (|v_ldv_malloc_#res.base_211| (_ BitVec 32)) (|v_ldv_malloc_#res.base_207| (_ BitVec 32)) (|v_ldv_malloc_#res.base_215| (_ BitVec 32))) (and (not (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_38| |v_ldv_malloc_#res.base_207|)) (not (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_38| |v_ldv_malloc_#res.base_211|)) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_ldv_malloc_#res.base_215|))))))) (not (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_38| |v_ldv_malloc_#res.base_203|)) (or (exists ((v_ldv_malloc_~size_202 (_ BitVec 32)) (v_ldv_malloc_~size_198 (_ BitVec 32)) (v_ldv_malloc_~size_194 (_ BitVec 32)) (v_ldv_malloc_~size_190 (_ BitVec 32))) (not (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_39| (_ bv16 32) (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_53| (_ bv4 32))) (select (store (store (store (store |c_old(#length)| |v_ldv_malloc_#res.base_215| v_ldv_malloc_~size_202) |v_ldv_malloc_#res.base_211| v_ldv_malloc_~size_198) |v_ldv_malloc_#res.base_207| v_ldv_malloc_~size_194) |v_ldv_malloc_#res.base_203| v_ldv_malloc_~size_190) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_38|)))) (not (let ((.cse1 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_53| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_39| .cse1 (_ bv12 32)) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_39| (_ bv16 32) .cse1))))))) (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_38| |v_ldv_malloc_#res.base_207|) (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_38| |v_ldv_malloc_#res.base_211|))) is different from false [2021-11-20 06:24:51,763 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 1692 treesize of output 1690 [2021-11-20 06:24:54,305 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 842 treesize of output 840 [2021-11-20 06:24:54,627 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 4 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 33 not checked. [2021-11-20 06:24:54,627 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-20 06:24:54,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [847117776] [2021-11-20 06:24:54,627 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [847117776] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 06:24:54,627 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-20 06:24:54,627 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 25] total 40 [2021-11-20 06:24:54,628 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528061567] [2021-11-20 06:24:54,628 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-20 06:24:54,628 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2021-11-20 06:24:54,628 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-20 06:24:54,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2021-11-20 06:24:54,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=1014, Unknown=40, NotChecked=426, Total=1640 [2021-11-20 06:24:54,630 INFO L87 Difference]: Start difference. First operand 120 states and 142 transitions. Second operand has 41 states, 38 states have (on average 1.736842105263158) internal successors, (66), 39 states have internal predecessors, (66), 10 states have call successors, (10), 6 states have call predecessors, (10), 7 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2021-11-20 06:24:57,198 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ldv_malloc_#res.base_203| (_ BitVec 32)) (|v_ldv_malloc_#res.base_211| (_ BitVec 32)) (|v_ldv_malloc_#res.base_207| (_ BitVec 32)) (|v_ldv_malloc_#res.base_216| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_53| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_39| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_ldv_malloc_#res.base_216|)))) (and (forall ((ldv_malloc_~size (_ BitVec 32)) (v_ldv_malloc_~size_198 (_ BitVec 32)) (v_ldv_malloc_~size_194 (_ BitVec 32)) (v_ldv_malloc_~size_190 (_ BitVec 32))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_39| (_ bv16 32) (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_53| (_ bv4 32))) (select (store (store (store (store |c_#length| |v_ldv_malloc_#res.base_216| ldv_malloc_~size) |v_ldv_malloc_#res.base_211| v_ldv_malloc_~size_198) |v_ldv_malloc_#res.base_207| v_ldv_malloc_~size_194) |v_ldv_malloc_#res.base_203| v_ldv_malloc_~size_190) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_38|))) (let ((.cse0 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_53| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_39| .cse0 (_ bv12 32)) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_39| (_ bv16 32) .cse0)))) (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_38| |v_ldv_malloc_#res.base_203|) (exists ((|v_ldv_malloc_#res.base_203| (_ BitVec 32)) (|v_ldv_malloc_#res.base_211| (_ BitVec 32)) (|v_ldv_malloc_#res.base_207| (_ BitVec 32)) (|v_ldv_malloc_#res.base_215| (_ BitVec 32))) (and (not (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_38| |v_ldv_malloc_#res.base_207|)) (not (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_38| |v_ldv_malloc_#res.base_211|)) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_ldv_malloc_#res.base_215|))))))) (not (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_38| |v_ldv_malloc_#res.base_203|)) (or (exists ((v_ldv_malloc_~size_202 (_ BitVec 32)) (v_ldv_malloc_~size_198 (_ BitVec 32)) (v_ldv_malloc_~size_194 (_ BitVec 32)) (v_ldv_malloc_~size_190 (_ BitVec 32))) (not (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_39| (_ bv16 32) (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_53| (_ bv4 32))) (select (store (store (store (store |c_old(#length)| |v_ldv_malloc_#res.base_215| v_ldv_malloc_~size_202) |v_ldv_malloc_#res.base_211| v_ldv_malloc_~size_198) |v_ldv_malloc_#res.base_207| v_ldv_malloc_~size_194) |v_ldv_malloc_#res.base_203| v_ldv_malloc_~size_190) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_38|)))) (not (let ((.cse1 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_53| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_39| .cse1 (_ bv12 32)) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_39| (_ bv16 32) .cse1))))))) (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_38| |v_ldv_malloc_#res.base_207|) (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_38| |v_ldv_malloc_#res.base_211|))) (= |c_old(#valid)| |c_#valid|) (= |c_#length| |c_old(#length)|) (forall ((|v_ldv_malloc_#res.base_203| (_ BitVec 32)) (|v_ldv_malloc_#res.base_208| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_51| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_37| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_36| (_ BitVec 32))) (or (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_36| |v_ldv_malloc_#res.base_203|) (exists ((|v_ldv_malloc_#res.base_203| (_ BitVec 32)) (|v_ldv_malloc_#res.base_207| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_ldv_malloc_#res.base_207|))))) (not (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_36| |v_ldv_malloc_#res.base_203|)) (or (exists ((v_ldv_malloc_~size_194 (_ BitVec 32)) (v_ldv_malloc_~size_190 (_ BitVec 32))) (not (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_37| (_ bv8 32) (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_51| (_ bv4 32))) (select (store (store |c_old(#length)| |v_ldv_malloc_#res.base_207| v_ldv_malloc_~size_194) |v_ldv_malloc_#res.base_203| v_ldv_malloc_~size_190) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_36|)))) (not (let ((.cse2 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_51| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_37| (_ bv4 32) .cse2) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_37| (_ bv8 32) .cse2))))))) (and (let ((.cse3 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_51| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_37| (_ bv4 32) .cse3) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_37| (_ bv8 32) .cse3))) (forall ((ldv_malloc_~size (_ BitVec 32)) (v_ldv_malloc_~size_190 (_ BitVec 32))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_37| (_ bv8 32) (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_51| (_ bv4 32))) (select (store (store |c_#length| |v_ldv_malloc_#res.base_208| ldv_malloc_~size) |v_ldv_malloc_#res.base_203| v_ldv_malloc_~size_190) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_36|)))) (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_ldv_malloc_#res.base_208|)))))) (forall ((|v_ldv_malloc_#res.base_203| (_ BitVec 32)) (|v_ldv_malloc_#res.base_212| (_ BitVec 32)) (|v_ldv_malloc_#res.base_207| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_38| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_52| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_37| (_ BitVec 32))) (or (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_ldv_malloc_#res.base_212|)))) (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_37| |v_ldv_malloc_#res.base_203|) (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_37| |v_ldv_malloc_#res.base_207|) (and (let ((.cse4 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_52| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_38| .cse4 (_ bv8 32)) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_38| .cse4 (_ bv12 32)))) (forall ((ldv_malloc_~size (_ BitVec 32)) (v_ldv_malloc_~size_194 (_ BitVec 32)) (v_ldv_malloc_~size_190 (_ BitVec 32))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_38| (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_52| (_ bv4 32)) (_ bv12 32)) (select (store (store (store |c_#length| |v_ldv_malloc_#res.base_212| ldv_malloc_~size) |v_ldv_malloc_#res.base_207| v_ldv_malloc_~size_194) |v_ldv_malloc_#res.base_203| v_ldv_malloc_~size_190) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_37|)))) (exists ((|v_ldv_malloc_#res.base_203| (_ BitVec 32)) (|v_ldv_malloc_#res.base_211| (_ BitVec 32)) (|v_ldv_malloc_#res.base_207| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_ldv_malloc_#res.base_211|)))) (not (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_37| |v_ldv_malloc_#res.base_203|)) (or (exists ((v_ldv_malloc_~size_198 (_ BitVec 32)) (v_ldv_malloc_~size_194 (_ BitVec 32)) (v_ldv_malloc_~size_190 (_ BitVec 32))) (not (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_38| (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_52| (_ bv4 32)) (_ bv12 32)) (select (store (store (store |c_old(#length)| |v_ldv_malloc_#res.base_211| v_ldv_malloc_~size_198) |v_ldv_malloc_#res.base_207| v_ldv_malloc_~size_194) |v_ldv_malloc_#res.base_203| v_ldv_malloc_~size_190) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_37|)))) (not (let ((.cse5 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_52| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_38| .cse5 (_ bv8 32)) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_38| .cse5 (_ bv12 32)))))) (not (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_37| |v_ldv_malloc_#res.base_207|))))))) is different from false [2021-11-20 06:24:59,266 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ldv_malloc_#res.base_203| (_ BitVec 32)) (|v_ldv_malloc_#res.base_211| (_ BitVec 32)) (|v_ldv_malloc_#res.base_207| (_ BitVec 32)) (|v_ldv_malloc_#res.base_216| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_53| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_39| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_ldv_malloc_#res.base_216|)))) (and (forall ((ldv_malloc_~size (_ BitVec 32)) (v_ldv_malloc_~size_198 (_ BitVec 32)) (v_ldv_malloc_~size_194 (_ BitVec 32)) (v_ldv_malloc_~size_190 (_ BitVec 32))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_39| (_ bv16 32) (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_53| (_ bv4 32))) (select (store (store (store (store |c_#length| |v_ldv_malloc_#res.base_216| ldv_malloc_~size) |v_ldv_malloc_#res.base_211| v_ldv_malloc_~size_198) |v_ldv_malloc_#res.base_207| v_ldv_malloc_~size_194) |v_ldv_malloc_#res.base_203| v_ldv_malloc_~size_190) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_38|))) (let ((.cse0 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_53| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_39| .cse0 (_ bv12 32)) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_39| (_ bv16 32) .cse0)))) (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_38| |v_ldv_malloc_#res.base_203|) (exists ((|v_ldv_malloc_#res.base_203| (_ BitVec 32)) (|v_ldv_malloc_#res.base_211| (_ BitVec 32)) (|v_ldv_malloc_#res.base_207| (_ BitVec 32)) (|v_ldv_malloc_#res.base_215| (_ BitVec 32))) (and (not (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_38| |v_ldv_malloc_#res.base_207|)) (not (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_38| |v_ldv_malloc_#res.base_211|)) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_ldv_malloc_#res.base_215|))))))) (not (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_38| |v_ldv_malloc_#res.base_203|)) (or (exists ((v_ldv_malloc_~size_202 (_ BitVec 32)) (v_ldv_malloc_~size_198 (_ BitVec 32)) (v_ldv_malloc_~size_194 (_ BitVec 32)) (v_ldv_malloc_~size_190 (_ BitVec 32))) (not (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_39| (_ bv16 32) (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_53| (_ bv4 32))) (select (store (store (store (store |c_old(#length)| |v_ldv_malloc_#res.base_215| v_ldv_malloc_~size_202) |v_ldv_malloc_#res.base_211| v_ldv_malloc_~size_198) |v_ldv_malloc_#res.base_207| v_ldv_malloc_~size_194) |v_ldv_malloc_#res.base_203| v_ldv_malloc_~size_190) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_38|)))) (not (let ((.cse1 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_53| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_39| .cse1 (_ bv12 32)) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_39| (_ bv16 32) .cse1))))))) (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_38| |v_ldv_malloc_#res.base_207|) (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_38| |v_ldv_malloc_#res.base_211|))) (= |c_old(#valid)| |c_#valid|) (= c_ldv_malloc_~size |c_ldv_malloc_#in~size|) (= |c_#length| |c_old(#length)|) (forall ((|v_ldv_malloc_#res.base_203| (_ BitVec 32)) (|v_ldv_malloc_#res.base_208| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_51| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_37| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_36| (_ BitVec 32))) (or (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_36| |v_ldv_malloc_#res.base_203|) (exists ((|v_ldv_malloc_#res.base_203| (_ BitVec 32)) (|v_ldv_malloc_#res.base_207| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_ldv_malloc_#res.base_207|))))) (not (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_36| |v_ldv_malloc_#res.base_203|)) (or (exists ((v_ldv_malloc_~size_194 (_ BitVec 32)) (v_ldv_malloc_~size_190 (_ BitVec 32))) (not (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_37| (_ bv8 32) (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_51| (_ bv4 32))) (select (store (store |c_old(#length)| |v_ldv_malloc_#res.base_207| v_ldv_malloc_~size_194) |v_ldv_malloc_#res.base_203| v_ldv_malloc_~size_190) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_36|)))) (not (let ((.cse2 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_51| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_37| (_ bv4 32) .cse2) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_37| (_ bv8 32) .cse2))))))) (and (let ((.cse3 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_51| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_37| (_ bv4 32) .cse3) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_37| (_ bv8 32) .cse3))) (forall ((ldv_malloc_~size (_ BitVec 32)) (v_ldv_malloc_~size_190 (_ BitVec 32))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_37| (_ bv8 32) (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_51| (_ bv4 32))) (select (store (store |c_#length| |v_ldv_malloc_#res.base_208| ldv_malloc_~size) |v_ldv_malloc_#res.base_203| v_ldv_malloc_~size_190) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_36|)))) (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_ldv_malloc_#res.base_208|)))))) (forall ((|v_ldv_malloc_#res.base_203| (_ BitVec 32)) (|v_ldv_malloc_#res.base_212| (_ BitVec 32)) (|v_ldv_malloc_#res.base_207| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_38| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_52| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_37| (_ BitVec 32))) (or (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_ldv_malloc_#res.base_212|)))) (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_37| |v_ldv_malloc_#res.base_203|) (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_37| |v_ldv_malloc_#res.base_207|) (and (let ((.cse4 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_52| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_38| .cse4 (_ bv8 32)) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_38| .cse4 (_ bv12 32)))) (forall ((ldv_malloc_~size (_ BitVec 32)) (v_ldv_malloc_~size_194 (_ BitVec 32)) (v_ldv_malloc_~size_190 (_ BitVec 32))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_38| (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_52| (_ bv4 32)) (_ bv12 32)) (select (store (store (store |c_#length| |v_ldv_malloc_#res.base_212| ldv_malloc_~size) |v_ldv_malloc_#res.base_207| v_ldv_malloc_~size_194) |v_ldv_malloc_#res.base_203| v_ldv_malloc_~size_190) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_37|)))) (exists ((|v_ldv_malloc_#res.base_203| (_ BitVec 32)) (|v_ldv_malloc_#res.base_211| (_ BitVec 32)) (|v_ldv_malloc_#res.base_207| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_ldv_malloc_#res.base_211|)))) (not (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_37| |v_ldv_malloc_#res.base_203|)) (or (exists ((v_ldv_malloc_~size_198 (_ BitVec 32)) (v_ldv_malloc_~size_194 (_ BitVec 32)) (v_ldv_malloc_~size_190 (_ BitVec 32))) (not (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_38| (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_52| (_ bv4 32)) (_ bv12 32)) (select (store (store (store |c_old(#length)| |v_ldv_malloc_#res.base_211| v_ldv_malloc_~size_198) |v_ldv_malloc_#res.base_207| v_ldv_malloc_~size_194) |v_ldv_malloc_#res.base_203| v_ldv_malloc_~size_190) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_37|)))) (not (let ((.cse5 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_52| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_38| .cse5 (_ bv8 32)) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_38| .cse5 (_ bv12 32)))))) (not (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_37| |v_ldv_malloc_#res.base_207|))))))) is different from false [2021-11-20 06:25:01,321 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((ldv_malloc_~size (_ BitVec 32)) (|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (store |c_old(#length)| |ldv_malloc_#res.base| ldv_malloc_~size) |c_#length|) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |ldv_malloc_#res.base|)))))))) (forall ((|v_ldv_malloc_#res.base_203| (_ BitVec 32)) (|v_ldv_malloc_#res.base_207| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_38| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_52| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_37| (_ BitVec 32))) (or (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_37| |v_ldv_malloc_#res.base_203|) (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_37| |v_ldv_malloc_#res.base_207|) (exists ((|v_ldv_malloc_#res.base_203| (_ BitVec 32)) (|v_ldv_malloc_#res.base_211| (_ BitVec 32)) (|v_ldv_malloc_#res.base_207| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_ldv_malloc_#res.base_211|)))) (not (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_37| |v_ldv_malloc_#res.base_203|)) (or (exists ((v_ldv_malloc_~size_198 (_ BitVec 32)) (v_ldv_malloc_~size_194 (_ BitVec 32)) (v_ldv_malloc_~size_190 (_ BitVec 32))) (not (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_38| (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_52| (_ bv4 32)) (_ bv12 32)) (select (store (store (store |c_old(#length)| |v_ldv_malloc_#res.base_211| v_ldv_malloc_~size_198) |v_ldv_malloc_#res.base_207| v_ldv_malloc_~size_194) |v_ldv_malloc_#res.base_203| v_ldv_malloc_~size_190) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_37|)))) (not (let ((.cse0 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_52| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_38| .cse0 (_ bv8 32)) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_38| .cse0 (_ bv12 32)))))) (not (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_37| |v_ldv_malloc_#res.base_207|)))) (and (let ((.cse1 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_52| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_38| .cse1 (_ bv8 32)) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_38| .cse1 (_ bv12 32)))) (forall ((v_ldv_malloc_~size_194 (_ BitVec 32)) (v_ldv_malloc_~size_190 (_ BitVec 32))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_38| (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_52| (_ bv4 32)) (_ bv12 32)) (select (store (store |c_#length| |v_ldv_malloc_#res.base_207| v_ldv_malloc_~size_194) |v_ldv_malloc_#res.base_203| v_ldv_malloc_~size_190) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_37|)))))) (forall ((|v_ldv_malloc_#res.base_203| (_ BitVec 32)) (|v_ldv_malloc_#res.base_211| (_ BitVec 32)) (|v_ldv_malloc_#res.base_207| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_53| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_39| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_38| (_ BitVec 32))) (or (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_38| |v_ldv_malloc_#res.base_203|) (exists ((|v_ldv_malloc_#res.base_203| (_ BitVec 32)) (|v_ldv_malloc_#res.base_211| (_ BitVec 32)) (|v_ldv_malloc_#res.base_207| (_ BitVec 32)) (|v_ldv_malloc_#res.base_215| (_ BitVec 32))) (and (not (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_38| |v_ldv_malloc_#res.base_207|)) (not (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_38| |v_ldv_malloc_#res.base_211|)) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_ldv_malloc_#res.base_215|))))))) (not (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_38| |v_ldv_malloc_#res.base_203|)) (or (exists ((v_ldv_malloc_~size_202 (_ BitVec 32)) (v_ldv_malloc_~size_198 (_ BitVec 32)) (v_ldv_malloc_~size_194 (_ BitVec 32)) (v_ldv_malloc_~size_190 (_ BitVec 32))) (not (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_39| (_ bv16 32) (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_53| (_ bv4 32))) (select (store (store (store (store |c_old(#length)| |v_ldv_malloc_#res.base_215| v_ldv_malloc_~size_202) |v_ldv_malloc_#res.base_211| v_ldv_malloc_~size_198) |v_ldv_malloc_#res.base_207| v_ldv_malloc_~size_194) |v_ldv_malloc_#res.base_203| v_ldv_malloc_~size_190) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_38|)))) (not (let ((.cse2 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_53| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_39| .cse2 (_ bv12 32)) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_39| (_ bv16 32) .cse2))))))) (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_38| |v_ldv_malloc_#res.base_207|) (and (let ((.cse3 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_53| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_39| .cse3 (_ bv12 32)) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_39| (_ bv16 32) .cse3))) (forall ((v_ldv_malloc_~size_198 (_ BitVec 32)) (v_ldv_malloc_~size_194 (_ BitVec 32)) (v_ldv_malloc_~size_190 (_ BitVec 32))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_39| (_ bv16 32) (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_53| (_ bv4 32))) (select (store (store (store |c_#length| |v_ldv_malloc_#res.base_211| v_ldv_malloc_~size_198) |v_ldv_malloc_#res.base_207| v_ldv_malloc_~size_194) |v_ldv_malloc_#res.base_203| v_ldv_malloc_~size_190) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_38|)))) (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_38| |v_ldv_malloc_#res.base_211|))) (= (select |c_#length| |c_ldv_malloc_#res.base|) |c_ldv_malloc_#in~size|) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |c_ldv_malloc_#res.base|))) (= |c_ldv_malloc_#res.offset| (_ bv0 32)) (forall ((|v_ldv_malloc_#res.base_203| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_51| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_37| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_36| (_ BitVec 32))) (or (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_36| |v_ldv_malloc_#res.base_203|) (exists ((|v_ldv_malloc_#res.base_203| (_ BitVec 32)) (|v_ldv_malloc_#res.base_207| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_ldv_malloc_#res.base_207|))))) (not (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_36| |v_ldv_malloc_#res.base_203|)) (or (exists ((v_ldv_malloc_~size_194 (_ BitVec 32)) (v_ldv_malloc_~size_190 (_ BitVec 32))) (not (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_37| (_ bv8 32) (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_51| (_ bv4 32))) (select (store (store |c_old(#length)| |v_ldv_malloc_#res.base_207| v_ldv_malloc_~size_194) |v_ldv_malloc_#res.base_203| v_ldv_malloc_~size_190) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_36|)))) (not (let ((.cse4 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_51| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_37| (_ bv4 32) .cse4) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_37| (_ bv8 32) .cse4))))))) (and (let ((.cse5 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_51| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_37| (_ bv4 32) .cse5) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_37| (_ bv8 32) .cse5))) (forall ((v_ldv_malloc_~size_190 (_ BitVec 32))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_37| (_ bv8 32) (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_51| (_ bv4 32))) (select (store |c_#length| |v_ldv_malloc_#res.base_203| v_ldv_malloc_~size_190) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_36|))))))) is different from false [2021-11-20 06:25:40,435 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ldv_malloc_#res.base_204| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_35| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_36| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_50| (_ BitVec 32))) (or (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_ldv_malloc_#res.base_204|)))) (exists ((|v_ldv_malloc_#res.base_203| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_ldv_malloc_#res.base_203|)))))) (or (exists ((v_ldv_malloc_~size_190 (_ BitVec 32))) (not (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_36| (_ bv4 32) (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_50| (_ bv4 32))) (select (store |c_old(#length)| |v_ldv_malloc_#res.base_203| v_ldv_malloc_~size_190) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_35|)))) (not (let ((.cse0 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_50| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_36| .cse0) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_36| (_ bv4 32) .cse0))))))) (and (forall ((ldv_malloc_~size (_ BitVec 32))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_36| (_ bv4 32) (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_50| (_ bv4 32))) (select (store |c_#length| |v_ldv_malloc_#res.base_204| ldv_malloc_~size) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_35|))) (let ((.cse1 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_50| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_36| .cse1) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_36| (_ bv4 32) .cse1)))))) (forall ((|v_ldv_malloc_#res.base_203| (_ BitVec 32)) (|v_ldv_malloc_#res.base_208| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_51| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_37| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_36| (_ BitVec 32))) (or (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_36| |v_ldv_malloc_#res.base_203|) (exists ((|v_ldv_malloc_#res.base_203| (_ BitVec 32)) (|v_ldv_malloc_#res.base_207| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_ldv_malloc_#res.base_207|))))) (not (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_36| |v_ldv_malloc_#res.base_203|)) (or (exists ((v_ldv_malloc_~size_194 (_ BitVec 32)) (v_ldv_malloc_~size_190 (_ BitVec 32))) (not (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_37| (_ bv8 32) (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_51| (_ bv4 32))) (select (store (store |c_old(#length)| |v_ldv_malloc_#res.base_207| v_ldv_malloc_~size_194) |v_ldv_malloc_#res.base_203| v_ldv_malloc_~size_190) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_36|)))) (not (let ((.cse2 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_51| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_37| (_ bv4 32) .cse2) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_37| (_ bv8 32) .cse2))))))) (and (let ((.cse3 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_51| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_37| (_ bv4 32) .cse3) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_37| (_ bv8 32) .cse3))) (forall ((ldv_malloc_~size (_ BitVec 32)) (v_ldv_malloc_~size_190 (_ BitVec 32))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_37| (_ bv8 32) (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_51| (_ bv4 32))) (select (store (store |c_#length| |v_ldv_malloc_#res.base_208| ldv_malloc_~size) |v_ldv_malloc_#res.base_203| v_ldv_malloc_~size_190) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_36|)))) (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_ldv_malloc_#res.base_208|)))))) (forall ((|v_ldv_malloc_#res.base_203| (_ BitVec 32)) (|v_ldv_malloc_#res.base_212| (_ BitVec 32)) (|v_ldv_malloc_#res.base_207| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_38| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_52| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_37| (_ BitVec 32))) (or (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_ldv_malloc_#res.base_212|)))) (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_37| |v_ldv_malloc_#res.base_203|) (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_37| |v_ldv_malloc_#res.base_207|) (and (let ((.cse4 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_52| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_38| .cse4 (_ bv8 32)) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_38| .cse4 (_ bv12 32)))) (forall ((ldv_malloc_~size (_ BitVec 32)) (v_ldv_malloc_~size_194 (_ BitVec 32)) (v_ldv_malloc_~size_190 (_ BitVec 32))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_38| (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_52| (_ bv4 32)) (_ bv12 32)) (select (store (store (store |c_#length| |v_ldv_malloc_#res.base_212| ldv_malloc_~size) |v_ldv_malloc_#res.base_207| v_ldv_malloc_~size_194) |v_ldv_malloc_#res.base_203| v_ldv_malloc_~size_190) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_37|)))) (exists ((|v_ldv_malloc_#res.base_203| (_ BitVec 32)) (|v_ldv_malloc_#res.base_211| (_ BitVec 32)) (|v_ldv_malloc_#res.base_207| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_ldv_malloc_#res.base_211|)))) (not (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_37| |v_ldv_malloc_#res.base_203|)) (or (exists ((v_ldv_malloc_~size_198 (_ BitVec 32)) (v_ldv_malloc_~size_194 (_ BitVec 32)) (v_ldv_malloc_~size_190 (_ BitVec 32))) (not (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_38| (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_52| (_ bv4 32)) (_ bv12 32)) (select (store (store (store |c_old(#length)| |v_ldv_malloc_#res.base_211| v_ldv_malloc_~size_198) |v_ldv_malloc_#res.base_207| v_ldv_malloc_~size_194) |v_ldv_malloc_#res.base_203| v_ldv_malloc_~size_190) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_37|)))) (not (let ((.cse5 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_52| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_38| .cse5 (_ bv8 32)) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_38| .cse5 (_ bv12 32)))))) (not (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_37| |v_ldv_malloc_#res.base_207|))))))) is different from false [2021-11-20 06:25:42,551 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ldv_malloc_#res.base_204| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_35| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_36| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_50| (_ BitVec 32))) (or (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_ldv_malloc_#res.base_204|)))) (exists ((|v_ldv_malloc_#res.base_203| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_ldv_malloc_#res.base_203|)))))) (or (exists ((v_ldv_malloc_~size_190 (_ BitVec 32))) (not (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_36| (_ bv4 32) (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_50| (_ bv4 32))) (select (store |c_old(#length)| |v_ldv_malloc_#res.base_203| v_ldv_malloc_~size_190) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_35|)))) (not (let ((.cse0 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_50| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_36| .cse0) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_36| (_ bv4 32) .cse0))))))) (and (forall ((ldv_malloc_~size (_ BitVec 32))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_36| (_ bv4 32) (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_50| (_ bv4 32))) (select (store |c_#length| |v_ldv_malloc_#res.base_204| ldv_malloc_~size) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_35|))) (let ((.cse1 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_50| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_36| .cse1) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_36| (_ bv4 32) .cse1)))))) (= c_ldv_malloc_~size |c_ldv_malloc_#in~size|) (forall ((|v_ldv_malloc_#res.base_203| (_ BitVec 32)) (|v_ldv_malloc_#res.base_208| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_51| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_37| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_36| (_ BitVec 32))) (or (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_36| |v_ldv_malloc_#res.base_203|) (exists ((|v_ldv_malloc_#res.base_203| (_ BitVec 32)) (|v_ldv_malloc_#res.base_207| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_ldv_malloc_#res.base_207|))))) (not (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_36| |v_ldv_malloc_#res.base_203|)) (or (exists ((v_ldv_malloc_~size_194 (_ BitVec 32)) (v_ldv_malloc_~size_190 (_ BitVec 32))) (not (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_37| (_ bv8 32) (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_51| (_ bv4 32))) (select (store (store |c_old(#length)| |v_ldv_malloc_#res.base_207| v_ldv_malloc_~size_194) |v_ldv_malloc_#res.base_203| v_ldv_malloc_~size_190) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_36|)))) (not (let ((.cse2 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_51| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_37| (_ bv4 32) .cse2) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_37| (_ bv8 32) .cse2))))))) (and (let ((.cse3 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_51| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_37| (_ bv4 32) .cse3) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_37| (_ bv8 32) .cse3))) (forall ((ldv_malloc_~size (_ BitVec 32)) (v_ldv_malloc_~size_190 (_ BitVec 32))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_37| (_ bv8 32) (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_51| (_ bv4 32))) (select (store (store |c_#length| |v_ldv_malloc_#res.base_208| ldv_malloc_~size) |v_ldv_malloc_#res.base_203| v_ldv_malloc_~size_190) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_36|)))) (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_ldv_malloc_#res.base_208|)))))) (forall ((|v_ldv_malloc_#res.base_203| (_ BitVec 32)) (|v_ldv_malloc_#res.base_212| (_ BitVec 32)) (|v_ldv_malloc_#res.base_207| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_38| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_52| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_37| (_ BitVec 32))) (or (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_ldv_malloc_#res.base_212|)))) (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_37| |v_ldv_malloc_#res.base_203|) (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_37| |v_ldv_malloc_#res.base_207|) (and (let ((.cse4 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_52| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_38| .cse4 (_ bv8 32)) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_38| .cse4 (_ bv12 32)))) (forall ((ldv_malloc_~size (_ BitVec 32)) (v_ldv_malloc_~size_194 (_ BitVec 32)) (v_ldv_malloc_~size_190 (_ BitVec 32))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_38| (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_52| (_ bv4 32)) (_ bv12 32)) (select (store (store (store |c_#length| |v_ldv_malloc_#res.base_212| ldv_malloc_~size) |v_ldv_malloc_#res.base_207| v_ldv_malloc_~size_194) |v_ldv_malloc_#res.base_203| v_ldv_malloc_~size_190) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_37|)))) (exists ((|v_ldv_malloc_#res.base_203| (_ BitVec 32)) (|v_ldv_malloc_#res.base_211| (_ BitVec 32)) (|v_ldv_malloc_#res.base_207| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_ldv_malloc_#res.base_211|)))) (not (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_37| |v_ldv_malloc_#res.base_203|)) (or (exists ((v_ldv_malloc_~size_198 (_ BitVec 32)) (v_ldv_malloc_~size_194 (_ BitVec 32)) (v_ldv_malloc_~size_190 (_ BitVec 32))) (not (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_38| (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_52| (_ bv4 32)) (_ bv12 32)) (select (store (store (store |c_old(#length)| |v_ldv_malloc_#res.base_211| v_ldv_malloc_~size_198) |v_ldv_malloc_#res.base_207| v_ldv_malloc_~size_194) |v_ldv_malloc_#res.base_203| v_ldv_malloc_~size_190) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_37|)))) (not (let ((.cse5 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_52| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_38| .cse5 (_ bv8 32)) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_38| .cse5 (_ bv12 32)))))) (not (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_37| |v_ldv_malloc_#res.base_207|))))))) is different from false [2021-11-20 06:25:44,608 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_35| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_36| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_50| (_ BitVec 32))) (or (exists ((|v_ldv_malloc_#res.base_203| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_ldv_malloc_#res.base_203|)))))) (or (exists ((v_ldv_malloc_~size_190 (_ BitVec 32))) (not (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_36| (_ bv4 32) (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_50| (_ bv4 32))) (select (store |c_old(#length)| |v_ldv_malloc_#res.base_203| v_ldv_malloc_~size_190) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_35|)))) (not (let ((.cse0 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_50| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_36| .cse0) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_36| (_ bv4 32) .cse0))))))) (let ((.cse1 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_50| (_ bv4 32)))) (let ((.cse2 (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_36| (_ bv4 32) .cse1))) (and (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_36| .cse1) .cse2) (bvule .cse2 (select |c_#length| |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_35|))))))) (forall ((|v_ldv_malloc_#res.base_203| (_ BitVec 32)) (|v_ldv_malloc_#res.base_207| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_38| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_52| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_37| (_ BitVec 32))) (or (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_37| |v_ldv_malloc_#res.base_203|) (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_37| |v_ldv_malloc_#res.base_207|) (exists ((|v_ldv_malloc_#res.base_203| (_ BitVec 32)) (|v_ldv_malloc_#res.base_211| (_ BitVec 32)) (|v_ldv_malloc_#res.base_207| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_ldv_malloc_#res.base_211|)))) (not (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_37| |v_ldv_malloc_#res.base_203|)) (or (exists ((v_ldv_malloc_~size_198 (_ BitVec 32)) (v_ldv_malloc_~size_194 (_ BitVec 32)) (v_ldv_malloc_~size_190 (_ BitVec 32))) (not (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_38| (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_52| (_ bv4 32)) (_ bv12 32)) (select (store (store (store |c_old(#length)| |v_ldv_malloc_#res.base_211| v_ldv_malloc_~size_198) |v_ldv_malloc_#res.base_207| v_ldv_malloc_~size_194) |v_ldv_malloc_#res.base_203| v_ldv_malloc_~size_190) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_37|)))) (not (let ((.cse3 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_52| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_38| .cse3 (_ bv8 32)) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_38| .cse3 (_ bv12 32)))))) (not (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_37| |v_ldv_malloc_#res.base_207|)))) (and (let ((.cse4 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_52| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_38| .cse4 (_ bv8 32)) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_38| .cse4 (_ bv12 32)))) (forall ((v_ldv_malloc_~size_194 (_ BitVec 32)) (v_ldv_malloc_~size_190 (_ BitVec 32))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_38| (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_52| (_ bv4 32)) (_ bv12 32)) (select (store (store |c_#length| |v_ldv_malloc_#res.base_207| v_ldv_malloc_~size_194) |v_ldv_malloc_#res.base_203| v_ldv_malloc_~size_190) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_37|)))))) (= (select |c_#length| |c_ldv_malloc_#res.base|) |c_ldv_malloc_#in~size|) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |c_ldv_malloc_#res.base|))) (= |c_ldv_malloc_#res.offset| (_ bv0 32)) (forall ((|v_ldv_malloc_#res.base_203| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_51| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_37| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_36| (_ BitVec 32))) (or (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_36| |v_ldv_malloc_#res.base_203|) (exists ((|v_ldv_malloc_#res.base_203| (_ BitVec 32)) (|v_ldv_malloc_#res.base_207| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_ldv_malloc_#res.base_207|))))) (not (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_36| |v_ldv_malloc_#res.base_203|)) (or (exists ((v_ldv_malloc_~size_194 (_ BitVec 32)) (v_ldv_malloc_~size_190 (_ BitVec 32))) (not (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_37| (_ bv8 32) (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_51| (_ bv4 32))) (select (store (store |c_old(#length)| |v_ldv_malloc_#res.base_207| v_ldv_malloc_~size_194) |v_ldv_malloc_#res.base_203| v_ldv_malloc_~size_190) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_36|)))) (not (let ((.cse5 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_51| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_37| (_ bv4 32) .cse5) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_37| (_ bv8 32) .cse5))))))) (and (let ((.cse6 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_51| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_37| (_ bv4 32) .cse6) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_37| (_ bv8 32) .cse6))) (forall ((v_ldv_malloc_~size_190 (_ BitVec 32))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_37| (_ bv8 32) (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_51| (_ bv4 32))) (select (store |c_#length| |v_ldv_malloc_#res.base_203| v_ldv_malloc_~size_190) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_36|))))))) is different from false [2021-11-20 06:26:27,209 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ldv_malloc_#res.base_204| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_35| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_36| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_50| (_ BitVec 32))) (or (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_ldv_malloc_#res.base_204|)))) (exists ((|v_ldv_malloc_#res.base_203| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_ldv_malloc_#res.base_203|)))))) (or (exists ((v_ldv_malloc_~size_190 (_ BitVec 32))) (not (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_36| (_ bv4 32) (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_50| (_ bv4 32))) (select (store |c_old(#length)| |v_ldv_malloc_#res.base_203| v_ldv_malloc_~size_190) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_35|)))) (not (let ((.cse0 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_50| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_36| .cse0) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_36| (_ bv4 32) .cse0))))))) (and (forall ((ldv_malloc_~size (_ BitVec 32))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_36| (_ bv4 32) (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_50| (_ bv4 32))) (select (store |c_#length| |v_ldv_malloc_#res.base_204| ldv_malloc_~size) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_35|))) (let ((.cse1 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_50| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_36| .cse1) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_36| (_ bv4 32) .cse1)))))) (forall ((|v_ldv_malloc_#res.base_203| (_ BitVec 32)) (|v_ldv_malloc_#res.base_208| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_51| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_37| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_36| (_ BitVec 32))) (or (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_36| |v_ldv_malloc_#res.base_203|) (exists ((|v_ldv_malloc_#res.base_203| (_ BitVec 32)) (|v_ldv_malloc_#res.base_207| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_ldv_malloc_#res.base_207|))))) (not (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_36| |v_ldv_malloc_#res.base_203|)) (or (exists ((v_ldv_malloc_~size_194 (_ BitVec 32)) (v_ldv_malloc_~size_190 (_ BitVec 32))) (not (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_37| (_ bv8 32) (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_51| (_ bv4 32))) (select (store (store |c_old(#length)| |v_ldv_malloc_#res.base_207| v_ldv_malloc_~size_194) |v_ldv_malloc_#res.base_203| v_ldv_malloc_~size_190) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_36|)))) (not (let ((.cse2 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_51| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_37| (_ bv4 32) .cse2) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_37| (_ bv8 32) .cse2))))))) (and (let ((.cse3 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_51| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_37| (_ bv4 32) .cse3) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_37| (_ bv8 32) .cse3))) (forall ((ldv_malloc_~size (_ BitVec 32)) (v_ldv_malloc_~size_190 (_ BitVec 32))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_37| (_ bv8 32) (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_51| (_ bv4 32))) (select (store (store |c_#length| |v_ldv_malloc_#res.base_208| ldv_malloc_~size) |v_ldv_malloc_#res.base_203| v_ldv_malloc_~size_190) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_36|)))) (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_ldv_malloc_#res.base_208|))))))) is different from false [2021-11-20 06:26:29,301 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ldv_malloc_#res.base_204| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_35| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_36| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_50| (_ BitVec 32))) (or (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_ldv_malloc_#res.base_204|)))) (exists ((|v_ldv_malloc_#res.base_203| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_ldv_malloc_#res.base_203|)))))) (or (exists ((v_ldv_malloc_~size_190 (_ BitVec 32))) (not (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_36| (_ bv4 32) (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_50| (_ bv4 32))) (select (store |c_old(#length)| |v_ldv_malloc_#res.base_203| v_ldv_malloc_~size_190) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_35|)))) (not (let ((.cse0 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_50| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_36| .cse0) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_36| (_ bv4 32) .cse0))))))) (and (forall ((ldv_malloc_~size (_ BitVec 32))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_36| (_ bv4 32) (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_50| (_ bv4 32))) (select (store |c_#length| |v_ldv_malloc_#res.base_204| ldv_malloc_~size) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_35|))) (let ((.cse1 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_50| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_36| .cse1) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_36| (_ bv4 32) .cse1)))))) (= c_ldv_malloc_~size |c_ldv_malloc_#in~size|) (forall ((|v_ldv_malloc_#res.base_203| (_ BitVec 32)) (|v_ldv_malloc_#res.base_208| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_51| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_37| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_36| (_ BitVec 32))) (or (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_36| |v_ldv_malloc_#res.base_203|) (exists ((|v_ldv_malloc_#res.base_203| (_ BitVec 32)) (|v_ldv_malloc_#res.base_207| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_ldv_malloc_#res.base_207|))))) (not (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_36| |v_ldv_malloc_#res.base_203|)) (or (exists ((v_ldv_malloc_~size_194 (_ BitVec 32)) (v_ldv_malloc_~size_190 (_ BitVec 32))) (not (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_37| (_ bv8 32) (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_51| (_ bv4 32))) (select (store (store |c_old(#length)| |v_ldv_malloc_#res.base_207| v_ldv_malloc_~size_194) |v_ldv_malloc_#res.base_203| v_ldv_malloc_~size_190) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_36|)))) (not (let ((.cse2 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_51| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_37| (_ bv4 32) .cse2) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_37| (_ bv8 32) .cse2))))))) (and (let ((.cse3 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_51| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_37| (_ bv4 32) .cse3) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_37| (_ bv8 32) .cse3))) (forall ((ldv_malloc_~size (_ BitVec 32)) (v_ldv_malloc_~size_190 (_ BitVec 32))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_37| (_ bv8 32) (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_51| (_ bv4 32))) (select (store (store |c_#length| |v_ldv_malloc_#res.base_208| ldv_malloc_~size) |v_ldv_malloc_#res.base_203| v_ldv_malloc_~size_190) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_36|)))) (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_ldv_malloc_#res.base_208|))))))) is different from false [2021-11-20 06:26:31,334 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_35| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_36| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_50| (_ BitVec 32))) (or (exists ((|v_ldv_malloc_#res.base_203| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_ldv_malloc_#res.base_203|)))))) (or (exists ((v_ldv_malloc_~size_190 (_ BitVec 32))) (not (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_36| (_ bv4 32) (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_50| (_ bv4 32))) (select (store |c_old(#length)| |v_ldv_malloc_#res.base_203| v_ldv_malloc_~size_190) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_35|)))) (not (let ((.cse0 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_50| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_36| .cse0) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_36| (_ bv4 32) .cse0))))))) (let ((.cse1 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_50| (_ bv4 32)))) (let ((.cse2 (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_36| (_ bv4 32) .cse1))) (and (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_36| .cse1) .cse2) (bvule .cse2 (select |c_#length| |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_35|))))))) (= (select |c_#length| |c_ldv_malloc_#res.base|) |c_ldv_malloc_#in~size|) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |c_ldv_malloc_#res.base|))) (= |c_ldv_malloc_#res.offset| (_ bv0 32)) (forall ((|v_ldv_malloc_#res.base_203| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_51| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_37| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_36| (_ BitVec 32))) (or (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_36| |v_ldv_malloc_#res.base_203|) (exists ((|v_ldv_malloc_#res.base_203| (_ BitVec 32)) (|v_ldv_malloc_#res.base_207| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_ldv_malloc_#res.base_207|))))) (not (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_36| |v_ldv_malloc_#res.base_203|)) (or (exists ((v_ldv_malloc_~size_194 (_ BitVec 32)) (v_ldv_malloc_~size_190 (_ BitVec 32))) (not (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_37| (_ bv8 32) (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_51| (_ bv4 32))) (select (store (store |c_old(#length)| |v_ldv_malloc_#res.base_207| v_ldv_malloc_~size_194) |v_ldv_malloc_#res.base_203| v_ldv_malloc_~size_190) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_36|)))) (not (let ((.cse3 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_51| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_37| (_ bv4 32) .cse3) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_37| (_ bv8 32) .cse3))))))) (and (let ((.cse4 (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_51| (_ bv4 32)))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_37| (_ bv4 32) .cse4) (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_37| (_ bv8 32) .cse4))) (forall ((v_ldv_malloc_~size_190 (_ BitVec 32))) (bvule (bvadd |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_37| (_ bv8 32) (bvmul |v_ULTIMATE.start_entry_point_~i~0#1_BEFORE_CALL_51| (_ bv4 32))) (select (store |c_#length| |v_ldv_malloc_#res.base_203| v_ldv_malloc_~size_190) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_36|))))))) is different from false [2021-11-20 06:27:17,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:27:17,831 INFO L93 Difference]: Finished difference Result 150 states and 173 transitions. [2021-11-20 06:27:17,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2021-11-20 06:27:17,832 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 38 states have (on average 1.736842105263158) internal successors, (66), 39 states have internal predecessors, (66), 10 states have call successors, (10), 6 states have call predecessors, (10), 7 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Word has length 48 [2021-11-20 06:27:17,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:27:17,833 INFO L225 Difference]: With dead ends: 150 [2021-11-20 06:27:17,833 INFO L226 Difference]: Without dead ends: 150 [2021-11-20 06:27:17,835 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 15 IntricatePredicates, 0 DeprecatedPredicates, 414 ImplicationChecksByTransitivity, 248.4s TimeCoverageRelationStatistics Valid=328, Invalid=2089, Unknown=93, NotChecked=1650, Total=4160 [2021-11-20 06:27:17,836 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 52 mSDsluCounter, 623 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 669 SdHoareTripleChecker+Invalid, 660 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 564 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-20 06:27:17,836 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [53 Valid, 669 Invalid, 660 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 91 Invalid, 0 Unknown, 564 Unchecked, 0.2s Time] [2021-11-20 06:27:17,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2021-11-20 06:27:17,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2021-11-20 06:27:17,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 122 states have (on average 1.221311475409836) internal successors, (149), 129 states have internal predecessors, (149), 9 states have call successors, (9), 8 states have call predecessors, (9), 11 states have return successors, (15), 12 states have call predecessors, (15), 9 states have call successors, (15) [2021-11-20 06:27:17,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 173 transitions. [2021-11-20 06:27:17,842 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 173 transitions. Word has length 48 [2021-11-20 06:27:17,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:27:17,843 INFO L470 AbstractCegarLoop]: Abstraction has 150 states and 173 transitions. [2021-11-20 06:27:17,843 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 38 states have (on average 1.736842105263158) internal successors, (66), 39 states have internal predecessors, (66), 10 states have call successors, (10), 6 states have call predecessors, (10), 7 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2021-11-20 06:27:17,843 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 173 transitions. [2021-11-20 06:27:17,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-11-20 06:27:17,844 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:27:17,844 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:27:17,865 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d32aa0-c8be-46b3-99dd-0695538a2725/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (25)] Ended with exit code 0 [2021-11-20 06:27:18,056 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d32aa0-c8be-46b3-99dd-0695538a2725/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 [2021-11-20 06:27:18,057 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 7 more)] === [2021-11-20 06:27:18,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:27:18,057 INFO L85 PathProgramCache]: Analyzing trace with hash -2031851011, now seen corresponding path program 1 times [2021-11-20 06:27:18,057 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-20 06:27:18,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1869667142] [2021-11-20 06:27:18,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:27:18,058 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-20 06:27:18,058 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d32aa0-c8be-46b3-99dd-0695538a2725/bin/uautomizer-DQz5hQGWxF/mathsat [2021-11-20 06:27:18,058 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d32aa0-c8be-46b3-99dd-0695538a2725/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-20 06:27:18,059 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d32aa0-c8be-46b3-99dd-0695538a2725/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2021-11-20 06:27:18,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:27:18,153 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 15 conjunts are in the unsatisfiable core [2021-11-20 06:27:18,154 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:27:18,330 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 11 [2021-11-20 06:27:18,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 06:27:18,601 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-11-20 06:27:19,004 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-11-20 06:27:19,041 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 8 proven. 25 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-11-20 06:27:19,041 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 06:27:21,730 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 6 proven. 17 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-11-20 06:27:21,730 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-20 06:27:21,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1869667142] [2021-11-20 06:27:21,730 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1869667142] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 06:27:21,730 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-20 06:27:21,731 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10] total 21 [2021-11-20 06:27:21,731 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525946398] [2021-11-20 06:27:21,731 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-20 06:27:21,731 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2021-11-20 06:27:21,731 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-20 06:27:21,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-11-20 06:27:21,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=398, Unknown=0, NotChecked=0, Total=462 [2021-11-20 06:27:21,732 INFO L87 Difference]: Start difference. First operand 150 states and 173 transitions. Second operand has 22 states, 21 states have (on average 2.9047619047619047) internal successors, (61), 19 states have internal predecessors, (61), 6 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (8), 8 states have call predecessors, (8), 6 states have call successors, (8) [2021-11-20 06:27:24,833 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-20 06:27:26,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:27:26,170 INFO L93 Difference]: Finished difference Result 182 states and 201 transitions. [2021-11-20 06:27:26,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2021-11-20 06:27:26,171 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.9047619047619047) internal successors, (61), 19 states have internal predecessors, (61), 6 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (8), 8 states have call predecessors, (8), 6 states have call successors, (8) Word has length 47 [2021-11-20 06:27:26,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:27:26,172 INFO L225 Difference]: With dead ends: 182 [2021-11-20 06:27:26,172 INFO L226 Difference]: Without dead ends: 182 [2021-11-20 06:27:26,173 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 75 SyntacticMatches, 4 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 575 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=303, Invalid=1859, Unknown=0, NotChecked=0, Total=2162 [2021-11-20 06:27:26,174 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 257 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 446 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 524 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 48 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2021-11-20 06:27:26,174 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [258 Valid, 367 Invalid, 524 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 446 Invalid, 0 Unknown, 48 Unchecked, 2.7s Time] [2021-11-20 06:27:26,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2021-11-20 06:27:26,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 157. [2021-11-20 06:27:26,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 127 states have (on average 1.2125984251968505) internal successors, (154), 135 states have internal predecessors, (154), 9 states have call successors, (9), 9 states have call predecessors, (9), 13 states have return successors, (15), 12 states have call predecessors, (15), 9 states have call successors, (15) [2021-11-20 06:27:26,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 178 transitions. [2021-11-20 06:27:26,180 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 178 transitions. Word has length 47 [2021-11-20 06:27:26,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:27:26,180 INFO L470 AbstractCegarLoop]: Abstraction has 157 states and 178 transitions. [2021-11-20 06:27:26,181 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.9047619047619047) internal successors, (61), 19 states have internal predecessors, (61), 6 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (8), 8 states have call predecessors, (8), 6 states have call successors, (8) [2021-11-20 06:27:26,181 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 178 transitions. [2021-11-20 06:27:26,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-11-20 06:27:26,182 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:27:26,182 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:27:26,193 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d32aa0-c8be-46b3-99dd-0695538a2725/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (26)] Forceful destruction successful, exit code 0 [2021-11-20 06:27:26,385 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d32aa0-c8be-46b3-99dd-0695538a2725/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 [2021-11-20 06:27:26,388 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 7 more)] === [2021-11-20 06:27:26,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:27:26,388 INFO L85 PathProgramCache]: Analyzing trace with hash 1437128181, now seen corresponding path program 1 times [2021-11-20 06:27:26,389 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-20 06:27:26,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [677040611] [2021-11-20 06:27:26,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:27:26,389 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-20 06:27:26,390 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d32aa0-c8be-46b3-99dd-0695538a2725/bin/uautomizer-DQz5hQGWxF/mathsat [2021-11-20 06:27:26,390 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d32aa0-c8be-46b3-99dd-0695538a2725/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-20 06:27:26,439 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d32aa0-c8be-46b3-99dd-0695538a2725/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2021-11-20 06:27:26,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:27:26,528 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 15 conjunts are in the unsatisfiable core [2021-11-20 06:27:26,530 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:27:26,790 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-11-20 06:27:27,121 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 06:27:27,122 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 28 treesize of output 27 [2021-11-20 06:27:27,634 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-11-20 06:27:27,684 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 8 proven. 28 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-20 06:27:27,684 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 06:27:30,584 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-11-20 06:27:30,584 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-20 06:27:30,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [677040611] [2021-11-20 06:27:30,584 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [677040611] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 06:27:30,584 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-20 06:27:30,584 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10] total 22 [2021-11-20 06:27:30,585 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085586335] [2021-11-20 06:27:30,585 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-20 06:27:30,585 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-11-20 06:27:30,585 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-20 06:27:30,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-11-20 06:27:30,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=440, Unknown=0, NotChecked=0, Total=506 [2021-11-20 06:27:30,586 INFO L87 Difference]: Start difference. First operand 157 states and 178 transitions. Second operand has 23 states, 22 states have (on average 2.909090909090909) internal successors, (64), 20 states have internal predecessors, (64), 6 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (8), 8 states have call predecessors, (8), 6 states have call successors, (8) [2021-11-20 06:27:35,205 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-20 06:27:36,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:27:36,853 INFO L93 Difference]: Finished difference Result 184 states and 203 transitions. [2021-11-20 06:27:36,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-11-20 06:27:36,855 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.909090909090909) internal successors, (64), 20 states have internal predecessors, (64), 6 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (8), 8 states have call predecessors, (8), 6 states have call successors, (8) Word has length 48 [2021-11-20 06:27:36,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:27:36,857 INFO L225 Difference]: With dead ends: 184 [2021-11-20 06:27:36,857 INFO L226 Difference]: Without dead ends: 184 [2021-11-20 06:27:36,859 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 76 SyntacticMatches, 5 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 612 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=340, Invalid=2012, Unknown=0, NotChecked=0, Total=2352 [2021-11-20 06:27:36,859 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 296 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 576 mSolverCounterSat, 50 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 693 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 576 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 66 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2021-11-20 06:27:36,860 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [297 Valid, 247 Invalid, 693 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 576 Invalid, 1 Unknown, 66 Unchecked, 3.6s Time] [2021-11-20 06:27:36,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2021-11-20 06:27:36,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 158. [2021-11-20 06:27:36,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 128 states have (on average 1.203125) internal successors, (154), 136 states have internal predecessors, (154), 9 states have call successors, (9), 9 states have call predecessors, (9), 13 states have return successors, (15), 12 states have call predecessors, (15), 9 states have call successors, (15) [2021-11-20 06:27:36,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 178 transitions. [2021-11-20 06:27:36,868 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 178 transitions. Word has length 48 [2021-11-20 06:27:36,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:27:36,869 INFO L470 AbstractCegarLoop]: Abstraction has 158 states and 178 transitions. [2021-11-20 06:27:36,869 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.909090909090909) internal successors, (64), 20 states have internal predecessors, (64), 6 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (8), 8 states have call predecessors, (8), 6 states have call successors, (8) [2021-11-20 06:27:36,869 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 178 transitions. [2021-11-20 06:27:36,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-11-20 06:27:36,870 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:27:36,870 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:27:36,896 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d32aa0-c8be-46b3-99dd-0695538a2725/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (27)] Forceful destruction successful, exit code 0 [2021-11-20 06:27:37,083 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d32aa0-c8be-46b3-99dd-0695538a2725/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 [2021-11-20 06:27:37,084 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 7 more)] === [2021-11-20 06:27:37,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:27:37,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1601300735, now seen corresponding path program 1 times [2021-11-20 06:27:37,084 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-20 06:27:37,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1406912828] [2021-11-20 06:27:37,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:27:37,085 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-20 06:27:37,085 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d32aa0-c8be-46b3-99dd-0695538a2725/bin/uautomizer-DQz5hQGWxF/mathsat [2021-11-20 06:27:37,085 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d32aa0-c8be-46b3-99dd-0695538a2725/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-20 06:27:37,089 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d32aa0-c8be-46b3-99dd-0695538a2725/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2021-11-20 06:27:37,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:27:37,182 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 25 conjunts are in the unsatisfiable core [2021-11-20 06:27:37,183 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:27:37,261 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-11-20 06:27:37,399 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 25 treesize of output 21 [2021-11-20 06:27:37,517 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 16 treesize of output 10 [2021-11-20 06:27:37,630 INFO L354 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2021-11-20 06:27:37,631 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 34 treesize of output 45 [2021-11-20 06:27:37,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 06:27:37,863 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 58 treesize of output 53 [2021-11-20 06:27:38,148 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-11-20 06:27:38,148 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 60 treesize of output 48 [2021-11-20 06:27:38,838 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 06:27:38,843 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 56 [2021-11-20 06:27:39,218 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-20 06:27:39,218 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 45 treesize of output 33 [2021-11-20 06:27:39,363 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 12 proven. 29 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-20 06:27:39,363 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 06:27:44,562 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 59 treesize of output 57 [2021-11-20 06:27:45,164 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 18 proven. 23 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-20 06:27:45,164 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-20 06:27:45,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1406912828] [2021-11-20 06:27:45,165 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1406912828] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 06:27:45,165 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-20 06:27:45,165 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 18] total 38 [2021-11-20 06:27:45,165 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849233907] [2021-11-20 06:27:45,165 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-20 06:27:45,166 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2021-11-20 06:27:45,166 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-20 06:27:45,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2021-11-20 06:27:45,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=1343, Unknown=1, NotChecked=0, Total=1482 [2021-11-20 06:27:45,167 INFO L87 Difference]: Start difference. First operand 158 states and 178 transitions. Second operand has 39 states, 38 states have (on average 1.9736842105263157) internal successors, (75), 34 states have internal predecessors, (75), 6 states have call successors, (7), 5 states have call predecessors, (7), 7 states have return successors, (8), 8 states have call predecessors, (8), 6 states have call successors, (8) [2021-11-20 06:27:58,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:27:58,072 INFO L93 Difference]: Finished difference Result 176 states and 197 transitions. [2021-11-20 06:27:58,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2021-11-20 06:27:58,073 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 1.9736842105263157) internal successors, (75), 34 states have internal predecessors, (75), 6 states have call successors, (7), 5 states have call predecessors, (7), 7 states have return successors, (8), 8 states have call predecessors, (8), 6 states have call successors, (8) Word has length 49 [2021-11-20 06:27:58,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:27:58,074 INFO L225 Difference]: With dead ends: 176 [2021-11-20 06:27:58,074 INFO L226 Difference]: Without dead ends: 176 [2021-11-20 06:27:58,076 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 60 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 705 ImplicationChecksByTransitivity, 18.2s TimeCoverageRelationStatistics Valid=209, Invalid=2139, Unknown=4, NotChecked=0, Total=2352 [2021-11-20 06:27:58,076 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 26 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 306 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-11-20 06:27:58,076 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 366 Invalid, 679 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 365 Invalid, 0 Unknown, 306 Unchecked, 0.8s Time] [2021-11-20 06:27:58,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2021-11-20 06:27:58,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 170. [2021-11-20 06:27:58,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 140 states have (on average 1.1928571428571428) internal successors, (167), 148 states have internal predecessors, (167), 9 states have call successors, (9), 9 states have call predecessors, (9), 13 states have return successors, (15), 12 states have call predecessors, (15), 9 states have call successors, (15) [2021-11-20 06:27:58,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 191 transitions. [2021-11-20 06:27:58,083 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 191 transitions. Word has length 49 [2021-11-20 06:27:58,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:27:58,084 INFO L470 AbstractCegarLoop]: Abstraction has 170 states and 191 transitions. [2021-11-20 06:27:58,084 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 1.9736842105263157) internal successors, (75), 34 states have internal predecessors, (75), 6 states have call successors, (7), 5 states have call predecessors, (7), 7 states have return successors, (8), 8 states have call predecessors, (8), 6 states have call successors, (8) [2021-11-20 06:27:58,084 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 191 transitions. [2021-11-20 06:27:58,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-11-20 06:27:58,085 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:27:58,085 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:27:58,106 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d32aa0-c8be-46b3-99dd-0695538a2725/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (28)] Forceful destruction successful, exit code 0 [2021-11-20 06:27:58,298 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d32aa0-c8be-46b3-99dd-0695538a2725/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 [2021-11-20 06:27:58,298 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 7 more)] === [2021-11-20 06:27:58,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:27:58,298 INFO L85 PathProgramCache]: Analyzing trace with hash 148524762, now seen corresponding path program 1 times [2021-11-20 06:27:58,299 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-20 06:27:58,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1833466674] [2021-11-20 06:27:58,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:27:58,299 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-20 06:27:58,299 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d32aa0-c8be-46b3-99dd-0695538a2725/bin/uautomizer-DQz5hQGWxF/mathsat [2021-11-20 06:27:58,300 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d32aa0-c8be-46b3-99dd-0695538a2725/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-20 06:27:58,313 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d32aa0-c8be-46b3-99dd-0695538a2725/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2021-11-20 06:27:58,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:27:58,377 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 7 conjunts are in the unsatisfiable core [2021-11-20 06:27:58,378 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:27:58,589 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-11-20 06:27:58,589 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 06:27:58,936 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-11-20 06:27:58,936 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-20 06:27:58,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1833466674] [2021-11-20 06:27:58,937 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1833466674] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 06:27:58,937 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-20 06:27:58,937 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2021-11-20 06:27:58,937 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989121842] [2021-11-20 06:27:58,937 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-20 06:27:58,937 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-20 06:27:58,937 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-20 06:27:58,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-20 06:27:58,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2021-11-20 06:27:58,938 INFO L87 Difference]: Start difference. First operand 170 states and 191 transitions. Second operand has 14 states, 14 states have (on average 4.571428571428571) internal successors, (64), 14 states have internal predecessors, (64), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2021-11-20 06:27:59,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:27:59,325 INFO L93 Difference]: Finished difference Result 170 states and 183 transitions. [2021-11-20 06:27:59,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-20 06:27:59,326 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.571428571428571) internal successors, (64), 14 states have internal predecessors, (64), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Word has length 52 [2021-11-20 06:27:59,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:27:59,328 INFO L225 Difference]: With dead ends: 170 [2021-11-20 06:27:59,328 INFO L226 Difference]: Without dead ends: 170 [2021-11-20 06:27:59,328 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2021-11-20 06:27:59,329 INFO L933 BasicCegarLoop]: 43 mSDtfsCounter, 37 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-20 06:27:59,330 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 342 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-20 06:27:59,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2021-11-20 06:27:59,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 163. [2021-11-20 06:27:59,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 133 states have (on average 1.150375939849624) internal successors, (153), 141 states have internal predecessors, (153), 9 states have call successors, (9), 9 states have call predecessors, (9), 13 states have return successors, (15), 12 states have call predecessors, (15), 9 states have call successors, (15) [2021-11-20 06:27:59,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 177 transitions. [2021-11-20 06:27:59,338 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 177 transitions. Word has length 52 [2021-11-20 06:27:59,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:27:59,338 INFO L470 AbstractCegarLoop]: Abstraction has 163 states and 177 transitions. [2021-11-20 06:27:59,338 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.571428571428571) internal successors, (64), 14 states have internal predecessors, (64), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2021-11-20 06:27:59,339 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 177 transitions. [2021-11-20 06:27:59,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-11-20 06:27:59,340 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:27:59,340 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:27:59,365 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d32aa0-c8be-46b3-99dd-0695538a2725/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (29)] Forceful destruction successful, exit code 0 [2021-11-20 06:27:59,553 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d32aa0-c8be-46b3-99dd-0695538a2725/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 [2021-11-20 06:27:59,553 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 7 more)] === [2021-11-20 06:27:59,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:27:59,553 INFO L85 PathProgramCache]: Analyzing trace with hash 998331403, now seen corresponding path program 2 times [2021-11-20 06:27:59,554 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-20 06:27:59,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1329711735] [2021-11-20 06:27:59,554 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-20 06:27:59,554 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-20 06:27:59,554 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d32aa0-c8be-46b3-99dd-0695538a2725/bin/uautomizer-DQz5hQGWxF/mathsat [2021-11-20 06:27:59,556 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d32aa0-c8be-46b3-99dd-0695538a2725/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-20 06:27:59,593 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d32aa0-c8be-46b3-99dd-0695538a2725/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (30)] Waiting until timeout for monitored process [2021-11-20 06:27:59,692 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-20 06:27:59,692 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 06:27:59,699 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 20 conjunts are in the unsatisfiable core [2021-11-20 06:27:59,701 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:27:59,710 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-11-20 06:27:59,863 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-20 06:27:59,863 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 21 treesize of output 21 [2021-11-20 06:27:59,954 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 20 treesize of output 16 [2021-11-20 06:28:02,070 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_55| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_52| (_ BitVec 32))) (not (= |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_52| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_52|) |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_55|)))) is different from true [2021-11-20 06:28:02,182 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-11-20 06:28:02,182 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 24 treesize of output 23 [2021-11-20 06:28:04,259 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_53| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_56| (_ BitVec 32))) (not (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_53|) |v_ULTIMATE.start_entry_point_~array~0#1.offset_BEFORE_CALL_56|) |v_ULTIMATE.start_entry_point_~array~0#1.base_BEFORE_CALL_53|))) is different from true [2021-11-20 06:28:04,524 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 16 treesize of output 8 [2021-11-20 06:28:04,624 INFO L354 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2021-11-20 06:28:04,624 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 20 treesize of output 25 [2021-11-20 06:28:04,734 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 16 not checked. [2021-11-20 06:28:04,735 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 06:28:04,907 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 32 treesize of output 28 [2021-11-20 06:28:06,114 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 2 proven. 36 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-11-20 06:28:06,115 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-20 06:28:06,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1329711735] [2021-11-20 06:28:06,115 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1329711735] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 06:28:06,115 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-20 06:28:06,115 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15] total 28 [2021-11-20 06:28:06,115 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523258152] [2021-11-20 06:28:06,115 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-20 06:28:06,116 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2021-11-20 06:28:06,116 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-20 06:28:06,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-11-20 06:28:06,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=636, Unknown=2, NotChecked=102, Total=812 [2021-11-20 06:28:06,117 INFO L87 Difference]: Start difference. First operand 163 states and 177 transitions. Second operand has 29 states, 28 states have (on average 2.9285714285714284) internal successors, (82), 26 states have internal predecessors, (82), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2021-11-20 06:28:21,674 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-20 06:28:27,180 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-20 06:28:29,638 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-20 06:28:31,697 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-20 06:28:36,032 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-20 06:28:38,519 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-20 06:28:40,923 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-20 06:28:42,985 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-20 06:28:45,046 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-20 06:28:47,087 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-20 06:28:49,154 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-20 06:28:53,871 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-20 06:28:55,944 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-20 06:28:58,001 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-20 06:29:00,014 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-20 06:29:00,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:29:00,592 INFO L93 Difference]: Finished difference Result 217 states and 231 transitions. [2021-11-20 06:29:00,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2021-11-20 06:29:00,592 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.9285714285714284) internal successors, (82), 26 states have internal predecessors, (82), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Word has length 54 [2021-11-20 06:29:00,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:29:00,594 INFO L225 Difference]: With dead ends: 217 [2021-11-20 06:29:00,594 INFO L226 Difference]: Without dead ends: 217 [2021-11-20 06:29:00,595 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 72 SyntacticMatches, 9 SemanticMatches, 61 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 734 ImplicationChecksByTransitivity, 26.8s TimeCoverageRelationStatistics Valid=371, Invalid=3290, Unknown=7, NotChecked=238, Total=3906 [2021-11-20 06:29:00,596 INFO L933 BasicCegarLoop]: 38 mSDtfsCounter, 166 mSDsluCounter, 533 mSDsCounter, 0 mSdLazyCounter, 1195 mSolverCounterSat, 51 mSolverCounterUnsat, 15 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 32.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 571 SdHoareTripleChecker+Invalid, 1663 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 1195 IncrementalHoareTripleChecker+Invalid, 15 IncrementalHoareTripleChecker+Unknown, 402 IncrementalHoareTripleChecker+Unchecked, 33.0s IncrementalHoareTripleChecker+Time [2021-11-20 06:29:00,597 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [166 Valid, 571 Invalid, 1663 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 1195 Invalid, 15 Unknown, 402 Unchecked, 33.0s Time] [2021-11-20 06:29:00,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2021-11-20 06:29:00,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 166. [2021-11-20 06:29:00,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 136 states have (on average 1.161764705882353) internal successors, (158), 144 states have internal predecessors, (158), 9 states have call successors, (9), 9 states have call predecessors, (9), 13 states have return successors, (15), 12 states have call predecessors, (15), 9 states have call successors, (15) [2021-11-20 06:29:00,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 182 transitions. [2021-11-20 06:29:00,605 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 182 transitions. Word has length 54 [2021-11-20 06:29:00,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:29:00,605 INFO L470 AbstractCegarLoop]: Abstraction has 166 states and 182 transitions. [2021-11-20 06:29:00,605 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.9285714285714284) internal successors, (82), 26 states have internal predecessors, (82), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2021-11-20 06:29:00,606 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 182 transitions. [2021-11-20 06:29:00,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-11-20 06:29:00,607 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:29:00,607 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:29:00,619 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d32aa0-c8be-46b3-99dd-0695538a2725/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (30)] Forceful destruction successful, exit code 0 [2021-11-20 06:29:00,813 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d32aa0-c8be-46b3-99dd-0695538a2725/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 [2021-11-20 06:29:00,813 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 7 more)] === [2021-11-20 06:29:00,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:29:00,813 INFO L85 PathProgramCache]: Analyzing trace with hash 1618774478, now seen corresponding path program 2 times [2021-11-20 06:29:00,814 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-20 06:29:00,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [331212802] [2021-11-20 06:29:00,814 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-20 06:29:00,814 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-20 06:29:00,814 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d32aa0-c8be-46b3-99dd-0695538a2725/bin/uautomizer-DQz5hQGWxF/mathsat [2021-11-20 06:29:00,815 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d32aa0-c8be-46b3-99dd-0695538a2725/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-20 06:29:00,816 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4d32aa0-c8be-46b3-99dd-0695538a2725/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (31)] Waiting until timeout for monitored process [2021-11-20 06:29:00,926 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-20 06:29:00,927 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 06:29:00,932 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 36 conjunts are in the unsatisfiable core [2021-11-20 06:29:00,934 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:29:01,303 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 38 treesize of output 34 [2021-11-20 06:29:01,555 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-11-20 06:29:01,555 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 36 treesize of output 28 [2021-11-20 06:29:10,047 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-11-20 06:29:10,048 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 73 treesize of output 64 [2021-11-20 06:29:10,376 INFO L354 Elim1Store]: treesize reduction 44, result has 2.2 percent of original size [2021-11-20 06:29:10,376 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 80 treesize of output 64 [2021-11-20 06:29:11,809 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-11-20 06:29:11,809 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 79 treesize of output 51 [2021-11-20 06:29:18,725 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 14 proven. 28 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-20 06:29:18,725 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 06:29:20,497 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 32 treesize of output 30 [2021-11-20 06:29:38,810 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 62 treesize of output 60 [2021-11-20 06:30:28,548 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-20 06:30:28,549 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 131 treesize of output 135