./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version a4ecdabc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_7a200a14-127d-42c4-bf4c-6614499ca232/bin/utaipan/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_7a200a14-127d-42c4-bf4c-6614499ca232/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_7a200a14-127d-42c4-bf4c-6614499ca232/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_7a200a14-127d-42c4-bf4c-6614499ca232/bin/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_7a200a14-127d-42c4-bf4c-6614499ca232/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_7a200a14-127d-42c4-bf4c-6614499ca232/bin/utaipan --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2f752bceed9d5d003b5c94bcbea537d2afe59777 .............................................................................................................................................. Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_7a200a14-127d-42c4-bf4c-6614499ca232/bin/utaipan/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_7a200a14-127d-42c4-bf4c-6614499ca232/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_7a200a14-127d-42c4-bf4c-6614499ca232/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_7a200a14-127d-42c4-bf4c-6614499ca232/bin/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_7a200a14-127d-42c4-bf4c-6614499ca232/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_7a200a14-127d-42c4-bf4c-6614499ca232/bin/utaipan --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2f752bceed9d5d003b5c94bcbea537d2afe59777 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN --- Real Ultimate output --- This is Ultimate 0.2.0-a4ecdab [2020-11-30 01:47:45,149 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-30 01:47:45,152 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-30 01:47:45,234 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-30 01:47:45,242 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-30 01:47:45,244 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-30 01:47:45,246 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-30 01:47:45,249 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-30 01:47:45,257 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-30 01:47:45,258 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-30 01:47:45,259 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-30 01:47:45,261 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-30 01:47:45,262 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-30 01:47:45,263 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-30 01:47:45,264 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-30 01:47:45,266 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-30 01:47:45,267 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-30 01:47:45,268 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-30 01:47:45,273 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-30 01:47:45,278 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-30 01:47:45,283 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-30 01:47:45,284 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-30 01:47:45,289 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-30 01:47:45,290 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-30 01:47:45,296 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-30 01:47:45,297 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-30 01:47:45,297 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-30 01:47:45,305 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-30 01:47:45,306 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-30 01:47:45,307 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-30 01:47:45,308 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-30 01:47:45,309 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-30 01:47:45,311 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-30 01:47:45,312 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-30 01:47:45,314 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-30 01:47:45,314 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-30 01:47:45,315 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-30 01:47:45,315 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-30 01:47:45,315 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-30 01:47:45,316 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-30 01:47:45,317 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-30 01:47:45,319 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_7a200a14-127d-42c4-bf4c-6614499ca232/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2020-11-30 01:47:45,364 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-30 01:47:45,364 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-30 01:47:45,366 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2020-11-30 01:47:45,367 INFO L138 SettingsManager]: * User list type=DISABLED [2020-11-30 01:47:45,367 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2020-11-30 01:47:45,367 INFO L138 SettingsManager]: * Explicit value domain=true [2020-11-30 01:47:45,367 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2020-11-30 01:47:45,368 INFO L138 SettingsManager]: * Octagon Domain=false [2020-11-30 01:47:45,368 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2020-11-30 01:47:45,368 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2020-11-30 01:47:45,369 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2020-11-30 01:47:45,370 INFO L138 SettingsManager]: * Interval Domain=false [2020-11-30 01:47:45,370 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2020-11-30 01:47:45,370 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2020-11-30 01:47:45,370 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2020-11-30 01:47:45,371 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-30 01:47:45,371 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-30 01:47:45,372 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-30 01:47:45,372 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-30 01:47:45,372 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-11-30 01:47:45,372 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-30 01:47:45,373 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-30 01:47:45,373 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-30 01:47:45,373 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2020-11-30 01:47:45,373 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2020-11-30 01:47:45,373 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2020-11-30 01:47:45,375 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-30 01:47:45,375 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-11-30 01:47:45,376 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-30 01:47:45,376 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-30 01:47:45,376 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-30 01:47:45,377 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-30 01:47:45,377 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-30 01:47:45,377 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-30 01:47:45,377 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-30 01:47:45,378 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-30 01:47:45,378 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2020-11-30 01:47:45,378 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-30 01:47:45,378 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-30 01:47:45,379 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-11-30 01:47:45,379 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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-vcloud-master/worker/run_dir_7a200a14-127d-42c4-bf4c-6614499ca232/bin/utaipan/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-vcloud-master/worker/run_dir_7a200a14-127d-42c4-bf4c-6614499ca232/bin/utaipan 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 -> Taipan 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 -> 2f752bceed9d5d003b5c94bcbea537d2afe59777 [2020-11-30 01:47:45,631 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-30 01:47:45,676 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-30 01:47:45,679 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-30 01:47:45,680 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-30 01:47:45,681 INFO L275 PluginConnector]: CDTParser initialized [2020-11-30 01:47:45,682 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_7a200a14-127d-42c4-bf4c-6614499ca232/bin/utaipan/../../sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-1.i [2020-11-30 01:47:45,776 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_7a200a14-127d-42c4-bf4c-6614499ca232/bin/utaipan/data/8cf388a33/50218dbe4dbe42a885ca5d24cd9cb969/FLAG173c7e380 [2020-11-30 01:47:46,335 INFO L306 CDTParser]: Found 1 translation units. [2020-11-30 01:47:46,336 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_7a200a14-127d-42c4-bf4c-6614499ca232/sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-1.i [2020-11-30 01:47:46,348 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_7a200a14-127d-42c4-bf4c-6614499ca232/bin/utaipan/data/8cf388a33/50218dbe4dbe42a885ca5d24cd9cb969/FLAG173c7e380 [2020-11-30 01:47:46,631 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_7a200a14-127d-42c4-bf4c-6614499ca232/bin/utaipan/data/8cf388a33/50218dbe4dbe42a885ca5d24cd9cb969 [2020-11-30 01:47:46,633 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-30 01:47:46,634 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-30 01:47:46,646 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-30 01:47:46,646 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-30 01:47:46,650 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-30 01:47:46,650 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 01:47:46" (1/1) ... [2020-11-30 01:47:46,653 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e3175a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:47:46, skipping insertion in model container [2020-11-30 01:47:46,654 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 01:47:46" (1/1) ... [2020-11-30 01:47:46,662 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-30 01:47:46,706 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-30 01:47:47,049 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-30 01:47:47,059 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) [2020-11-30 01:47:47,060 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@7086b192 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:47:47, skipping insertion in model container [2020-11-30 01:47:47,060 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-30 01:47:47,060 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2020-11-30 01:47:47,063 INFO L168 Benchmark]: Toolchain (without parser) took 426.89 ms. Allocated memory is still 119.5 MB. Free memory was 87.6 MB in the beginning and 94.4 MB in the end (delta: -6.7 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2020-11-30 01:47:47,063 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 77.6 MB. Free memory is still 37.4 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-11-30 01:47:47,064 INFO L168 Benchmark]: CACSL2BoogieTranslator took 414.65 ms. Allocated memory is still 119.5 MB. Free memory was 87.5 MB in the beginning and 94.4 MB in the end (delta: -6.9 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2020-11-30 01:47:47,066 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.27 ms. Allocated memory is still 77.6 MB. Free memory is still 37.4 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 414.65 ms. Allocated memory is still 119.5 MB. Free memory was 87.5 MB in the beginning and 94.4 MB in the end (delta: -6.9 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 555]: 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... ### Bit-precise run ### This is Ultimate 0.2.0-a4ecdab [2020-11-30 01:47:49,450 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-30 01:47:49,452 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-30 01:47:49,488 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-30 01:47:49,491 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-30 01:47:49,499 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-30 01:47:49,502 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-30 01:47:49,505 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-30 01:47:49,507 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-30 01:47:49,509 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-30 01:47:49,510 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-30 01:47:49,512 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-30 01:47:49,512 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-30 01:47:49,514 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-30 01:47:49,515 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-30 01:47:49,517 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-30 01:47:49,518 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-30 01:47:49,519 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-30 01:47:49,521 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-30 01:47:49,523 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-30 01:47:49,525 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-30 01:47:49,527 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-30 01:47:49,529 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-30 01:47:49,530 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-30 01:47:49,533 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-30 01:47:49,534 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-30 01:47:49,534 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-30 01:47:49,536 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-30 01:47:49,536 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-30 01:47:49,537 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-30 01:47:49,538 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-30 01:47:49,539 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-30 01:47:49,540 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-30 01:47:49,541 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-30 01:47:49,542 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-30 01:47:49,542 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-30 01:47:49,543 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-30 01:47:49,544 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-30 01:47:49,544 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-30 01:47:49,545 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-30 01:47:49,546 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-30 01:47:49,547 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_7a200a14-127d-42c4-bf4c-6614499ca232/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2020-11-30 01:47:49,575 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-30 01:47:49,575 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-30 01:47:49,576 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2020-11-30 01:47:49,577 INFO L138 SettingsManager]: * User list type=DISABLED [2020-11-30 01:47:49,577 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2020-11-30 01:47:49,577 INFO L138 SettingsManager]: * Explicit value domain=true [2020-11-30 01:47:49,578 INFO L138 SettingsManager]: * Octagon Domain=false [2020-11-30 01:47:49,578 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2020-11-30 01:47:49,578 INFO L138 SettingsManager]: * Interval Domain=false [2020-11-30 01:47:49,579 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-30 01:47:49,579 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-30 01:47:49,579 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-30 01:47:49,580 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-30 01:47:49,580 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-11-30 01:47:49,580 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-30 01:47:49,580 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-30 01:47:49,581 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-30 01:47:49,581 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2020-11-30 01:47:49,581 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2020-11-30 01:47:49,581 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2020-11-30 01:47:49,582 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-30 01:47:49,582 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-11-30 01:47:49,582 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2020-11-30 01:47:49,582 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2020-11-30 01:47:49,582 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-30 01:47:49,583 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-30 01:47:49,583 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-30 01:47:49,596 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-30 01:47:49,596 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-30 01:47:49,596 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-30 01:47:49,596 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-30 01:47:49,597 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-30 01:47:49,597 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-30 01:47:49,597 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2020-11-30 01:47:49,597 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2020-11-30 01:47:49,597 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-30 01:47:49,598 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-11-30 01:47:49,598 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-vcloud-master/worker/run_dir_7a200a14-127d-42c4-bf4c-6614499ca232/bin/utaipan/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-vcloud-master/worker/run_dir_7a200a14-127d-42c4-bf4c-6614499ca232/bin/utaipan 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 -> Taipan 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 -> 2f752bceed9d5d003b5c94bcbea537d2afe59777 [2020-11-30 01:47:49,972 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-30 01:47:50,002 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-30 01:47:50,007 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-30 01:47:50,009 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-30 01:47:50,010 INFO L275 PluginConnector]: CDTParser initialized [2020-11-30 01:47:50,011 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_7a200a14-127d-42c4-bf4c-6614499ca232/bin/utaipan/../../sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-1.i [2020-11-30 01:47:50,081 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_7a200a14-127d-42c4-bf4c-6614499ca232/bin/utaipan/data/acb3f7015/d773f27fe180408fa476c0e699fd5879/FLAG5ae1ce39a [2020-11-30 01:47:50,684 INFO L306 CDTParser]: Found 1 translation units. [2020-11-30 01:47:50,685 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_7a200a14-127d-42c4-bf4c-6614499ca232/sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-1.i [2020-11-30 01:47:50,698 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_7a200a14-127d-42c4-bf4c-6614499ca232/bin/utaipan/data/acb3f7015/d773f27fe180408fa476c0e699fd5879/FLAG5ae1ce39a [2020-11-30 01:47:50,961 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_7a200a14-127d-42c4-bf4c-6614499ca232/bin/utaipan/data/acb3f7015/d773f27fe180408fa476c0e699fd5879 [2020-11-30 01:47:50,963 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-30 01:47:50,965 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-30 01:47:50,966 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-30 01:47:50,966 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-30 01:47:50,970 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-30 01:47:50,970 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 01:47:50" (1/1) ... [2020-11-30 01:47:50,972 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ba501b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:47:50, skipping insertion in model container [2020-11-30 01:47:50,972 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 01:47:50" (1/1) ... [2020-11-30 01:47:50,980 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-30 01:47:51,017 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-30 01:47:51,339 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-30 01:47:51,374 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2020-11-30 01:47:51,395 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-30 01:47:51,475 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-30 01:47:51,487 INFO L203 MainTranslator]: Completed pre-run [2020-11-30 01:47:51,545 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-30 01:47:51,632 INFO L208 MainTranslator]: Completed translation [2020-11-30 01:47:51,633 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:47:51 WrapperNode [2020-11-30 01:47:51,633 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-30 01:47:51,634 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-30 01:47:51,635 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-30 01:47:51,635 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-30 01:47:51,642 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:47:51" (1/1) ... [2020-11-30 01:47:51,678 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:47:51" (1/1) ... [2020-11-30 01:47:51,702 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-30 01:47:51,703 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-30 01:47:51,703 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-30 01:47:51,704 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-30 01:47:51,712 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:47:51" (1/1) ... [2020-11-30 01:47:51,712 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:47:51" (1/1) ... [2020-11-30 01:47:51,716 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:47:51" (1/1) ... [2020-11-30 01:47:51,717 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:47:51" (1/1) ... [2020-11-30 01:47:51,730 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:47:51" (1/1) ... [2020-11-30 01:47:51,740 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:47:51" (1/1) ... [2020-11-30 01:47:51,748 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:47:51" (1/1) ... [2020-11-30 01:47:51,752 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-30 01:47:51,753 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-30 01:47:51,753 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-30 01:47:51,753 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-30 01:47:51,754 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:47:51" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7a200a14-127d-42c4-bf4c-6614499ca232/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-30 01:47:51,827 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-11-30 01:47:51,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-11-30 01:47:51,828 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-30 01:47:51,828 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-11-30 01:47:51,829 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-30 01:47:51,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2020-11-30 01:47:51,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2020-11-30 01:47:51,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2020-11-30 01:47:51,829 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-30 01:47:51,831 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-30 01:47:52,740 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-30 01:47:52,741 INFO L298 CfgBuilder]: Removed 13 assume(true) statements. [2020-11-30 01:47:52,743 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 01:47:52 BoogieIcfgContainer [2020-11-30 01:47:52,744 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-30 01:47:52,748 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-30 01:47:52,748 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-30 01:47:52,751 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-30 01:47:52,751 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.11 01:47:50" (1/3) ... [2020-11-30 01:47:52,752 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@137cb2fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 01:47:52, skipping insertion in model container [2020-11-30 01:47:52,752 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:47:51" (2/3) ... [2020-11-30 01:47:52,753 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@137cb2fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 01:47:52, skipping insertion in model container [2020-11-30 01:47:52,753 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 01:47:52" (3/3) ... [2020-11-30 01:47:52,759 INFO L111 eAbstractionObserver]: Analyzing ICFG optional_data_creation_test04-1.i [2020-11-30 01:47:52,771 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-30 01:47:52,776 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 46 error locations. [2020-11-30 01:47:52,789 INFO L253 AbstractCegarLoop]: Starting to check reachability of 46 error locations. [2020-11-30 01:47:52,821 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-30 01:47:52,822 INFO L378 AbstractCegarLoop]: Hoare is false [2020-11-30 01:47:52,822 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-30 01:47:52,822 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-30 01:47:52,822 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-30 01:47:52,822 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-30 01:47:52,822 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-30 01:47:52,822 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-30 01:47:52,838 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states. [2020-11-30 01:47:52,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-11-30 01:47:52,844 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:47:52,844 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-11-30 01:47:52,845 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39REQUIRES_VIOLATION]=== [2020-11-30 01:47:52,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:47:52,849 INFO L82 PathProgramCache]: Analyzing trace with hash 925637, now seen corresponding path program 1 times [2020-11-30 01:47:52,859 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-11-30 01:47:52,859 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1180768932] [2020-11-30 01:47:52,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7a200a14-127d-42c4-bf4c-6614499ca232/bin/utaipan/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2020-11-30 01:47:52,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:47:52,947 INFO L263 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 6 conjunts are in the unsatisfiable core [2020-11-30 01:47:52,952 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:47:53,042 INFO L384 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 [2020-11-30 01:47:53,042 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:47:53,049 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:47:53,050 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:47:53,050 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-11-30 01:47:53,108 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:47:53,109 INFO L384 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 17 treesize of output 39 [2020-11-30 01:47:53,110 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:47:53,136 INFO L625 ElimStorePlain]: treesize reduction 14, result has 51.7 percent of original size [2020-11-30 01:47:53,138 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 01:47:53,139 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2020-11-30 01:47:53,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:47:53,157 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 01:47:57,476 WARN L193 SmtUtils]: Spent 202.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2020-11-30 01:47:57,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:47:57,502 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1180768932] [2020-11-30 01:47:57,503 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:47:57,503 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2020-11-30 01:47:57,504 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052896067] [2020-11-30 01:47:57,508 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-30 01:47:57,508 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-11-30 01:47:57,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-30 01:47:57,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=18, Unknown=1, NotChecked=0, Total=30 [2020-11-30 01:47:57,524 INFO L87 Difference]: Start difference. First operand 97 states. Second operand 6 states. [2020-11-30 01:47:58,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:47:58,186 INFO L93 Difference]: Finished difference Result 147 states and 156 transitions. [2020-11-30 01:47:58,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-30 01:47:58,187 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2020-11-30 01:47:58,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:47:58,196 INFO L225 Difference]: With dead ends: 147 [2020-11-30 01:47:58,196 INFO L226 Difference]: Without dead ends: 145 [2020-11-30 01:47:58,198 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=17, Invalid=24, Unknown=1, NotChecked=0, Total=42 [2020-11-30 01:47:58,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2020-11-30 01:47:58,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 92. [2020-11-30 01:47:58,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2020-11-30 01:47:58,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 99 transitions. [2020-11-30 01:47:58,234 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 99 transitions. Word has length 4 [2020-11-30 01:47:58,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:47:58,235 INFO L481 AbstractCegarLoop]: Abstraction has 92 states and 99 transitions. [2020-11-30 01:47:58,235 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-30 01:47:58,235 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 99 transitions. [2020-11-30 01:47:58,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-11-30 01:47:58,235 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:47:58,236 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-11-30 01:47:58,438 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2020-11-30 01:47:58,439 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39REQUIRES_VIOLATION]=== [2020-11-30 01:47:58,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:47:58,440 INFO L82 PathProgramCache]: Analyzing trace with hash 925638, now seen corresponding path program 1 times [2020-11-30 01:47:58,441 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-11-30 01:47:58,441 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [785178365] [2020-11-30 01:47:58,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7a200a14-127d-42c4-bf4c-6614499ca232/bin/utaipan/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2020-11-30 01:47:58,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:47:58,509 INFO L263 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 10 conjunts are in the unsatisfiable core [2020-11-30 01:47:58,510 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:47:58,521 INFO L384 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 [2020-11-30 01:47:58,522 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:47:58,530 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:47:58,536 INFO L384 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 [2020-11-30 01:47:58,537 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 01:47:58,545 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:47:58,545 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:47:58,545 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2020-11-30 01:47:58,586 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:47:58,587 INFO L384 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 11 treesize of output 15 [2020-11-30 01:47:58,587 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:47:58,602 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:47:58,607 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2020-11-30 01:47:58,608 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 01:47:58,637 INFO L625 ElimStorePlain]: treesize reduction 4, result has 77.8 percent of original size [2020-11-30 01:47:58,638 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 01:47:58,638 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:14 [2020-11-30 01:47:58,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:47:58,660 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 01:47:58,724 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:48:01,075 WARN L193 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 21 [2020-11-30 01:48:01,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:48:01,110 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [785178365] [2020-11-30 01:48:01,110 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:48:01,110 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2020-11-30 01:48:01,110 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812390621] [2020-11-30 01:48:01,112 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-30 01:48:01,112 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-11-30 01:48:01,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-30 01:48:01,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-11-30 01:48:01,113 INFO L87 Difference]: Start difference. First operand 92 states and 99 transitions. Second operand 6 states. [2020-11-30 01:48:02,392 WARN L193 SmtUtils]: Spent 421.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2020-11-30 01:48:13,110 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd c_ULTIMATE.start_append_~pointerToList.offset (_ bv4 32)))) (and (bvule .cse0 (select |c_#length| c_ULTIMATE.start_append_~pointerToList.base)) (bvule c_ULTIMATE.start_append_~pointerToList.offset .cse0) (forall ((|v_ULTIMATE.start_append_#t~malloc15.base_4| (_ BitVec 32))) (or (bvule (bvadd |c_ULTIMATE.start_main_~#list~0.offset| (_ bv4 32)) (select (store |c_#length| |v_ULTIMATE.start_append_#t~malloc15.base_4| (_ bv8 32)) |c_ULTIMATE.start_main_~#list~0.base|)) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_append_#t~malloc15.base_4|))))) (or (bvule |c_ULTIMATE.start_main_~#list~0.offset| (bvadd |c_ULTIMATE.start_main_~#list~0.offset| (_ bv4 32))) (forall ((|v_ULTIMATE.start_append_#t~malloc15.base_4| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_append_#t~malloc15.base_4|))))))) is different from false [2020-11-30 01:48:29,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:48:29,135 INFO L93 Difference]: Finished difference Result 263 states and 290 transitions. [2020-11-30 01:48:29,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-30 01:48:29,138 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2020-11-30 01:48:29,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:48:29,142 INFO L225 Difference]: With dead ends: 263 [2020-11-30 01:48:29,143 INFO L226 Difference]: Without dead ends: 263 [2020-11-30 01:48:29,144 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=31, Invalid=44, Unknown=1, NotChecked=14, Total=90 [2020-11-30 01:48:29,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2020-11-30 01:48:29,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 108. [2020-11-30 01:48:29,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2020-11-30 01:48:29,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 125 transitions. [2020-11-30 01:48:29,160 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 125 transitions. Word has length 4 [2020-11-30 01:48:29,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:48:29,160 INFO L481 AbstractCegarLoop]: Abstraction has 108 states and 125 transitions. [2020-11-30 01:48:29,161 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-30 01:48:29,161 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 125 transitions. [2020-11-30 01:48:29,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-11-30 01:48:29,161 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:48:29,161 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-11-30 01:48:29,362 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2020-11-30 01:48:29,362 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39REQUIRES_VIOLATION]=== [2020-11-30 01:48:29,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:48:29,363 INFO L82 PathProgramCache]: Analyzing trace with hash 28694727, now seen corresponding path program 1 times [2020-11-30 01:48:29,364 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-11-30 01:48:29,364 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1082467594] [2020-11-30 01:48:29,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7a200a14-127d-42c4-bf4c-6614499ca232/bin/utaipan/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2020-11-30 01:48:29,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:48:29,453 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 3 conjunts are in the unsatisfiable core [2020-11-30 01:48:29,454 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:48:29,468 INFO L384 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 [2020-11-30 01:48:29,468 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:48:29,471 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:48:29,471 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:48:29,472 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-11-30 01:48:29,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:48:29,477 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 01:48:29,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:48:29,492 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1082467594] [2020-11-30 01:48:29,492 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:48:29,492 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2020-11-30 01:48:29,493 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317685566] [2020-11-30 01:48:29,493 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 01:48:29,493 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-11-30 01:48:29,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 01:48:29,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 01:48:29,494 INFO L87 Difference]: Start difference. First operand 108 states and 125 transitions. Second operand 3 states. [2020-11-30 01:48:29,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:48:29,733 INFO L93 Difference]: Finished difference Result 137 states and 150 transitions. [2020-11-30 01:48:29,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 01:48:29,733 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-11-30 01:48:29,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:48:29,735 INFO L225 Difference]: With dead ends: 137 [2020-11-30 01:48:29,735 INFO L226 Difference]: Without dead ends: 137 [2020-11-30 01:48:29,735 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 01:48:29,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2020-11-30 01:48:29,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 106. [2020-11-30 01:48:29,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2020-11-30 01:48:29,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 122 transitions. [2020-11-30 01:48:29,745 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 122 transitions. Word has length 5 [2020-11-30 01:48:29,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:48:29,745 INFO L481 AbstractCegarLoop]: Abstraction has 106 states and 122 transitions. [2020-11-30 01:48:29,745 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 01:48:29,745 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 122 transitions. [2020-11-30 01:48:29,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-11-30 01:48:29,746 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:48:29,746 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-11-30 01:48:29,955 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2020-11-30 01:48:29,955 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39REQUIRES_VIOLATION]=== [2020-11-30 01:48:29,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:48:29,956 INFO L82 PathProgramCache]: Analyzing trace with hash 28694728, now seen corresponding path program 1 times [2020-11-30 01:48:29,956 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-11-30 01:48:29,957 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1556867475] [2020-11-30 01:48:29,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7a200a14-127d-42c4-bf4c-6614499ca232/bin/utaipan/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2020-11-30 01:48:30,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:48:30,026 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 5 conjunts are in the unsatisfiable core [2020-11-30 01:48:30,027 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:48:30,040 INFO L384 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 [2020-11-30 01:48:30,040 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:48:30,045 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:48:30,046 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:48:30,046 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-11-30 01:48:30,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:48:30,065 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 01:48:30,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:48:30,105 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1556867475] [2020-11-30 01:48:30,105 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:48:30,105 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2020-11-30 01:48:30,106 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461045817] [2020-11-30 01:48:30,106 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 01:48:30,106 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-11-30 01:48:30,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 01:48:30,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-11-30 01:48:30,107 INFO L87 Difference]: Start difference. First operand 106 states and 122 transitions. Second operand 4 states. [2020-11-30 01:48:30,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:48:30,613 INFO L93 Difference]: Finished difference Result 174 states and 197 transitions. [2020-11-30 01:48:30,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-30 01:48:30,616 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2020-11-30 01:48:30,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:48:30,617 INFO L225 Difference]: With dead ends: 174 [2020-11-30 01:48:30,618 INFO L226 Difference]: Without dead ends: 174 [2020-11-30 01:48:30,618 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-11-30 01:48:30,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2020-11-30 01:48:30,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 105. [2020-11-30 01:48:30,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2020-11-30 01:48:30,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 120 transitions. [2020-11-30 01:48:30,630 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 120 transitions. Word has length 5 [2020-11-30 01:48:30,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:48:30,630 INFO L481 AbstractCegarLoop]: Abstraction has 105 states and 120 transitions. [2020-11-30 01:48:30,630 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 01:48:30,630 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 120 transitions. [2020-11-30 01:48:30,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-11-30 01:48:30,631 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:48:30,631 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:48:30,839 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2020-11-30 01:48:30,840 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39REQUIRES_VIOLATION]=== [2020-11-30 01:48:30,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:48:30,840 INFO L82 PathProgramCache]: Analyzing trace with hash 234239181, now seen corresponding path program 1 times [2020-11-30 01:48:30,841 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-11-30 01:48:30,841 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [540124142] [2020-11-30 01:48:30,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7a200a14-127d-42c4-bf4c-6614499ca232/bin/utaipan/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2020-11-30 01:48:30,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:48:30,946 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 4 conjunts are in the unsatisfiable core [2020-11-30 01:48:30,947 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:48:30,954 INFO L384 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 [2020-11-30 01:48:30,955 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:48:30,957 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:48:30,958 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:48:30,958 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-11-30 01:48:30,996 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:48:31,008 INFO L384 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 14 treesize of output 30 [2020-11-30 01:48:31,009 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:48:31,036 INFO L625 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2020-11-30 01:48:31,037 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 01:48:31,037 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:11 [2020-11-30 01:48:31,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:48:31,049 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 01:48:31,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:48:31,069 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [540124142] [2020-11-30 01:48:31,069 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:48:31,069 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2020-11-30 01:48:31,070 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139431238] [2020-11-30 01:48:31,070 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 01:48:31,070 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-11-30 01:48:31,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 01:48:31,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 01:48:31,071 INFO L87 Difference]: Start difference. First operand 105 states and 120 transitions. Second operand 3 states. [2020-11-30 01:48:31,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:48:31,383 INFO L93 Difference]: Finished difference Result 151 states and 169 transitions. [2020-11-30 01:48:31,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 01:48:31,384 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-11-30 01:48:31,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:48:31,385 INFO L225 Difference]: With dead ends: 151 [2020-11-30 01:48:31,385 INFO L226 Difference]: Without dead ends: 151 [2020-11-30 01:48:31,385 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 01:48:31,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2020-11-30 01:48:31,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 101. [2020-11-30 01:48:31,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2020-11-30 01:48:31,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 115 transitions. [2020-11-30 01:48:31,393 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 115 transitions. Word has length 9 [2020-11-30 01:48:31,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:48:31,394 INFO L481 AbstractCegarLoop]: Abstraction has 101 states and 115 transitions. [2020-11-30 01:48:31,394 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 01:48:31,394 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 115 transitions. [2020-11-30 01:48:31,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-11-30 01:48:31,394 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:48:31,395 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:48:31,606 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2020-11-30 01:48:31,606 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39REQUIRES_VIOLATION]=== [2020-11-30 01:48:31,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:48:31,608 INFO L82 PathProgramCache]: Analyzing trace with hash 234239182, now seen corresponding path program 1 times [2020-11-30 01:48:31,608 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-11-30 01:48:31,608 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [415224428] [2020-11-30 01:48:31,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7a200a14-127d-42c4-bf4c-6614499ca232/bin/utaipan/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2020-11-30 01:48:31,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:48:31,710 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 8 conjunts are in the unsatisfiable core [2020-11-30 01:48:31,711 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:48:31,720 INFO L384 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 [2020-11-30 01:48:31,721 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:48:31,729 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:48:31,741 INFO L384 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 [2020-11-30 01:48:31,741 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 01:48:31,748 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:48:31,749 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:48:31,749 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2020-11-30 01:48:31,789 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 01:48:31,790 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2020-11-30 01:48:31,791 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:48:31,805 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:48:31,818 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 01:48:31,819 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 13 treesize of output 9 [2020-11-30 01:48:31,821 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 01:48:31,829 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:48:31,830 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 01:48:31,831 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:14 [2020-11-30 01:48:31,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:48:31,850 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 01:48:31,910 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:48:36,111 WARN L193 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2020-11-30 01:48:36,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:48:36,122 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [415224428] [2020-11-30 01:48:36,122 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:48:36,122 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2020-11-30 01:48:36,122 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430055717] [2020-11-30 01:48:36,122 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-30 01:48:36,122 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-11-30 01:48:36,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-30 01:48:36,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=15, Unknown=2, NotChecked=0, Total=30 [2020-11-30 01:48:36,123 INFO L87 Difference]: Start difference. First operand 101 states and 115 transitions. Second operand 6 states. [2020-11-30 01:48:42,746 WARN L193 SmtUtils]: Spent 4.12 s on a formula simplification. DAG size of input: 25 DAG size of output: 23 [2020-11-30 01:48:43,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:48:43,971 INFO L93 Difference]: Finished difference Result 349 states and 379 transitions. [2020-11-30 01:48:43,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-30 01:48:43,972 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2020-11-30 01:48:43,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:48:43,975 INFO L225 Difference]: With dead ends: 349 [2020-11-30 01:48:43,975 INFO L226 Difference]: Without dead ends: 349 [2020-11-30 01:48:43,975 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=26, Invalid=27, Unknown=3, NotChecked=0, Total=56 [2020-11-30 01:48:43,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2020-11-30 01:48:43,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 97. [2020-11-30 01:48:43,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2020-11-30 01:48:43,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 110 transitions. [2020-11-30 01:48:43,988 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 110 transitions. Word has length 9 [2020-11-30 01:48:43,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:48:43,989 INFO L481 AbstractCegarLoop]: Abstraction has 97 states and 110 transitions. [2020-11-30 01:48:43,989 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-30 01:48:43,989 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 110 transitions. [2020-11-30 01:48:43,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-11-30 01:48:43,990 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:48:43,990 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:48:44,191 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2020-11-30 01:48:44,192 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39REQUIRES_VIOLATION]=== [2020-11-30 01:48:44,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:48:44,192 INFO L82 PathProgramCache]: Analyzing trace with hash 184732728, now seen corresponding path program 1 times [2020-11-30 01:48:44,192 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-11-30 01:48:44,193 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1052727650] [2020-11-30 01:48:44,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7a200a14-127d-42c4-bf4c-6614499ca232/bin/utaipan/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2020-11-30 01:48:44,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:48:44,272 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 4 conjunts are in the unsatisfiable core [2020-11-30 01:48:44,273 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:48:44,278 INFO L384 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 [2020-11-30 01:48:44,278 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:48:44,281 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:48:44,281 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:48:44,281 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-11-30 01:48:44,289 INFO L384 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 13 treesize of output 9 [2020-11-30 01:48:44,290 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:48:44,310 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:48:44,310 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:48:44,311 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:11 [2020-11-30 01:48:44,336 INFO L384 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 21 treesize of output 9 [2020-11-30 01:48:44,336 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:48:44,339 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:48:44,339 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:48:44,339 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:21, output treesize:5 [2020-11-30 01:48:44,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:48:44,349 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 01:48:44,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:48:44,362 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1052727650] [2020-11-30 01:48:44,362 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:48:44,362 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2020-11-30 01:48:44,362 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079923646] [2020-11-30 01:48:44,362 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-30 01:48:44,362 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-11-30 01:48:44,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-30 01:48:44,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-30 01:48:44,363 INFO L87 Difference]: Start difference. First operand 97 states and 110 transitions. Second operand 5 states. [2020-11-30 01:48:44,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:48:44,982 INFO L93 Difference]: Finished difference Result 152 states and 170 transitions. [2020-11-30 01:48:44,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-30 01:48:44,983 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-11-30 01:48:44,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:48:44,984 INFO L225 Difference]: With dead ends: 152 [2020-11-30 01:48:44,984 INFO L226 Difference]: Without dead ends: 152 [2020-11-30 01:48:44,985 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-11-30 01:48:44,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2020-11-30 01:48:44,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 100. [2020-11-30 01:48:44,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2020-11-30 01:48:44,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 115 transitions. [2020-11-30 01:48:44,990 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 115 transitions. Word has length 13 [2020-11-30 01:48:44,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:48:44,990 INFO L481 AbstractCegarLoop]: Abstraction has 100 states and 115 transitions. [2020-11-30 01:48:44,996 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-30 01:48:44,996 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 115 transitions. [2020-11-30 01:48:44,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-11-30 01:48:44,997 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:48:44,997 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:48:45,207 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2020-11-30 01:48:45,210 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39REQUIRES_VIOLATION]=== [2020-11-30 01:48:45,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:48:45,210 INFO L82 PathProgramCache]: Analyzing trace with hash 184732729, now seen corresponding path program 1 times [2020-11-30 01:48:45,211 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-11-30 01:48:45,211 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1459224791] [2020-11-30 01:48:45,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7a200a14-127d-42c4-bf4c-6614499ca232/bin/utaipan/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2020-11-30 01:48:45,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:48:45,291 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 8 conjunts are in the unsatisfiable core [2020-11-30 01:48:45,292 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:48:45,302 INFO L384 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 [2020-11-30 01:48:45,302 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:48:45,307 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:48:45,308 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:48:45,308 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-11-30 01:48:45,328 INFO L384 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 13 treesize of output 9 [2020-11-30 01:48:45,328 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:48:45,365 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:48:45,372 INFO L384 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 13 treesize of output 9 [2020-11-30 01:48:45,372 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 01:48:45,388 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:48:45,389 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:48:45,389 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:21 [2020-11-30 01:48:45,442 INFO L384 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 19 treesize of output 7 [2020-11-30 01:48:45,443 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:48:45,473 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:48:45,476 INFO L384 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 21 treesize of output 9 [2020-11-30 01:48:45,477 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 01:48:45,487 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:48:45,487 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:48:45,487 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:42, output treesize:12 [2020-11-30 01:48:45,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:48:45,516 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 01:48:45,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:48:45,882 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1459224791] [2020-11-30 01:48:45,882 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:48:45,882 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2020-11-30 01:48:45,882 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328034267] [2020-11-30 01:48:45,883 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-30 01:48:45,883 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-11-30 01:48:45,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-30 01:48:45,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-11-30 01:48:45,884 INFO L87 Difference]: Start difference. First operand 100 states and 115 transitions. Second operand 10 states. [2020-11-30 01:48:48,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:48:48,290 INFO L93 Difference]: Finished difference Result 170 states and 193 transitions. [2020-11-30 01:48:48,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-30 01:48:48,291 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 13 [2020-11-30 01:48:48,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:48:48,292 INFO L225 Difference]: With dead ends: 170 [2020-11-30 01:48:48,293 INFO L226 Difference]: Without dead ends: 170 [2020-11-30 01:48:48,293 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2020-11-30 01:48:48,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2020-11-30 01:48:48,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 100. [2020-11-30 01:48:48,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2020-11-30 01:48:48,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 113 transitions. [2020-11-30 01:48:48,298 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 113 transitions. Word has length 13 [2020-11-30 01:48:48,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:48:48,299 INFO L481 AbstractCegarLoop]: Abstraction has 100 states and 113 transitions. [2020-11-30 01:48:48,299 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-30 01:48:48,299 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 113 transitions. [2020-11-30 01:48:48,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-30 01:48:48,299 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:48:48,299 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:48:48,512 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2020-11-30 01:48:48,512 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39REQUIRES_VIOLATION]=== [2020-11-30 01:48:48,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:48:48,513 INFO L82 PathProgramCache]: Analyzing trace with hash -1960329087, now seen corresponding path program 1 times [2020-11-30 01:48:48,513 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-11-30 01:48:48,513 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1422455171] [2020-11-30 01:48:48,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7a200a14-127d-42c4-bf4c-6614499ca232/bin/utaipan/mathsat Starting monitored process 10 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with mathsat -unsat_core_generation=3 [2020-11-30 01:48:48,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:48:48,576 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 9 conjunts are in the unsatisfiable core [2020-11-30 01:48:48,578 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:48:48,604 INFO L384 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 11 treesize of output 7 [2020-11-30 01:48:48,604 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:48:48,610 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:48:48,611 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:48:48,611 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:8 [2020-11-30 01:48:48,622 INFO L384 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 [2020-11-30 01:48:48,623 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:48:48,625 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:48:48,625 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:48:48,626 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:16, output treesize:4 [2020-11-30 01:48:48,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:48:48,633 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 01:48:48,647 INFO L384 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 30 treesize of output 26 [2020-11-30 01:48:48,656 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2020-11-30 01:48:48,686 INFO L625 ElimStorePlain]: treesize reduction 9, result has 55.0 percent of original size [2020-11-30 01:48:48,686 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2020-11-30 01:48:48,686 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:11 [2020-11-30 01:48:48,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:48:48,691 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1422455171] [2020-11-30 01:48:48,691 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:48:48,692 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2020-11-30 01:48:48,692 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410304601] [2020-11-30 01:48:48,692 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-30 01:48:48,692 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-11-30 01:48:48,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-30 01:48:48,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-30 01:48:48,693 INFO L87 Difference]: Start difference. First operand 100 states and 113 transitions. Second operand 5 states. [2020-11-30 01:48:49,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:48:49,022 INFO L93 Difference]: Finished difference Result 139 states and 148 transitions. [2020-11-30 01:48:49,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 01:48:49,022 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-11-30 01:48:49,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:48:49,023 INFO L225 Difference]: With dead ends: 139 [2020-11-30 01:48:49,023 INFO L226 Difference]: Without dead ends: 139 [2020-11-30 01:48:49,023 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-11-30 01:48:49,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2020-11-30 01:48:49,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 100. [2020-11-30 01:48:49,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2020-11-30 01:48:49,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 112 transitions. [2020-11-30 01:48:49,028 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 112 transitions. Word has length 16 [2020-11-30 01:48:49,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:48:49,028 INFO L481 AbstractCegarLoop]: Abstraction has 100 states and 112 transitions. [2020-11-30 01:48:49,028 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-30 01:48:49,028 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 112 transitions. [2020-11-30 01:48:49,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-30 01:48:49,029 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:48:49,029 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:48:49,239 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 mathsat -unsat_core_generation=3 [2020-11-30 01:48:49,240 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39REQUIRES_VIOLATION]=== [2020-11-30 01:48:49,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:48:49,241 INFO L82 PathProgramCache]: Analyzing trace with hash -1960329083, now seen corresponding path program 1 times [2020-11-30 01:48:49,241 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-11-30 01:48:49,241 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1563248538] [2020-11-30 01:48:49,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7a200a14-127d-42c4-bf4c-6614499ca232/bin/utaipan/mathsat Starting monitored process 11 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with mathsat -unsat_core_generation=3 [2020-11-30 01:48:49,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:48:49,341 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 9 conjunts are in the unsatisfiable core [2020-11-30 01:48:49,342 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:48:49,352 INFO L384 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 [2020-11-30 01:48:49,352 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:48:49,360 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:48:49,360 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:48:49,360 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2020-11-30 01:48:49,386 INFO L384 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 11 treesize of output 7 [2020-11-30 01:48:49,386 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:48:49,394 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:48:49,394 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:48:49,395 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:11 [2020-11-30 01:48:49,413 INFO L384 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 19 treesize of output 11 [2020-11-30 01:48:49,414 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:48:49,416 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:48:49,417 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:48:49,417 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:7 [2020-11-30 01:48:49,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:48:49,436 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 01:48:49,448 INFO L384 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 36 treesize of output 32 [2020-11-30 01:48:49,450 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 01:48:49,490 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:48:49,490 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 01:48:49,491 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:32 [2020-11-30 01:48:49,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:48:49,725 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1563248538] [2020-11-30 01:48:49,725 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:48:49,725 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 5 [2020-11-30 01:48:49,725 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659599831] [2020-11-30 01:48:49,725 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-30 01:48:49,726 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-11-30 01:48:49,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-30 01:48:49,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-11-30 01:48:49,726 INFO L87 Difference]: Start difference. First operand 100 states and 112 transitions. Second operand 6 states. [2020-11-30 01:48:50,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:48:50,197 INFO L93 Difference]: Finished difference Result 131 states and 140 transitions. [2020-11-30 01:48:50,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-30 01:48:50,197 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2020-11-30 01:48:50,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:48:50,198 INFO L225 Difference]: With dead ends: 131 [2020-11-30 01:48:50,198 INFO L226 Difference]: Without dead ends: 131 [2020-11-30 01:48:50,199 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 19 SyntacticMatches, 7 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-11-30 01:48:50,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2020-11-30 01:48:50,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 100. [2020-11-30 01:48:50,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2020-11-30 01:48:50,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 111 transitions. [2020-11-30 01:48:50,202 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 111 transitions. Word has length 16 [2020-11-30 01:48:50,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:48:50,202 INFO L481 AbstractCegarLoop]: Abstraction has 100 states and 111 transitions. [2020-11-30 01:48:50,202 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-30 01:48:50,203 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 111 transitions. [2020-11-30 01:48:50,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-30 01:48:50,203 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:48:50,203 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:48:50,404 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 mathsat -unsat_core_generation=3 [2020-11-30 01:48:50,404 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39REQUIRES_VIOLATION]=== [2020-11-30 01:48:50,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:48:50,405 INFO L82 PathProgramCache]: Analyzing trace with hash -1960329082, now seen corresponding path program 1 times [2020-11-30 01:48:50,405 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-11-30 01:48:50,405 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1968269020] [2020-11-30 01:48:50,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7a200a14-127d-42c4-bf4c-6614499ca232/bin/utaipan/mathsat Starting monitored process 12 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with mathsat -unsat_core_generation=3 [2020-11-30 01:48:50,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:48:50,482 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 13 conjunts are in the unsatisfiable core [2020-11-30 01:48:50,484 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:48:50,493 INFO L384 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 [2020-11-30 01:48:50,494 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:48:50,513 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:48:50,514 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:48:50,514 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2020-11-30 01:48:50,551 INFO L384 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 11 treesize of output 7 [2020-11-30 01:48:50,551 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:48:50,569 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:48:50,573 INFO L384 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 11 treesize of output 7 [2020-11-30 01:48:50,573 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 01:48:50,581 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:48:50,583 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:48:50,583 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:19 [2020-11-30 01:48:50,621 INFO L384 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 [2020-11-30 01:48:50,621 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:48:50,633 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:48:50,636 INFO L384 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 17 treesize of output 9 [2020-11-30 01:48:50,636 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 01:48:50,646 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:48:50,646 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:48:50,646 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:31, output treesize:9 [2020-11-30 01:48:50,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:48:50,670 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 01:48:50,823 INFO L384 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 40 treesize of output 32 [2020-11-30 01:48:50,827 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2020-11-30 01:48:50,861 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:48:50,871 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 01:48:50,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 01:48:50,873 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 01:48:50,912 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:48:50,917 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 01:48:50,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 01:48:50,921 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-11-30 01:48:50,942 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:48:50,943 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 4 xjuncts. [2020-11-30 01:48:50,943 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:63, output treesize:21 [2020-11-30 01:48:51,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:48:51,012 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1968269020] [2020-11-30 01:48:51,012 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:48:51,012 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2020-11-30 01:48:51,012 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526078425] [2020-11-30 01:48:51,012 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-30 01:48:51,012 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-11-30 01:48:51,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-30 01:48:51,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-11-30 01:48:51,013 INFO L87 Difference]: Start difference. First operand 100 states and 111 transitions. Second operand 8 states. [2020-11-30 01:48:52,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:48:52,612 INFO L93 Difference]: Finished difference Result 235 states and 251 transitions. [2020-11-30 01:48:52,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-30 01:48:52,617 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2020-11-30 01:48:52,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:48:52,619 INFO L225 Difference]: With dead ends: 235 [2020-11-30 01:48:52,619 INFO L226 Difference]: Without dead ends: 235 [2020-11-30 01:48:52,619 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2020-11-30 01:48:52,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2020-11-30 01:48:52,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 100. [2020-11-30 01:48:52,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2020-11-30 01:48:52,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 110 transitions. [2020-11-30 01:48:52,623 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 110 transitions. Word has length 16 [2020-11-30 01:48:52,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:48:52,623 INFO L481 AbstractCegarLoop]: Abstraction has 100 states and 110 transitions. [2020-11-30 01:48:52,623 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-30 01:48:52,623 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 110 transitions. [2020-11-30 01:48:52,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-11-30 01:48:52,626 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:48:52,626 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:48:52,832 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 mathsat -unsat_core_generation=3 [2020-11-30 01:48:52,832 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39REQUIRES_VIOLATION]=== [2020-11-30 01:48:52,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:48:52,832 INFO L82 PathProgramCache]: Analyzing trace with hash 50233868, now seen corresponding path program 1 times [2020-11-30 01:48:52,833 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-11-30 01:48:52,833 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1634873550] [2020-11-30 01:48:52,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7a200a14-127d-42c4-bf4c-6614499ca232/bin/utaipan/mathsat Starting monitored process 13 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with mathsat -unsat_core_generation=3 [2020-11-30 01:48:52,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:48:52,986 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 9 conjunts are in the unsatisfiable core [2020-11-30 01:48:52,987 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:48:53,000 INFO L384 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 [2020-11-30 01:48:53,000 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:48:53,006 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:48:53,006 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:48:53,006 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-11-30 01:48:53,030 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:48:53,030 INFO L384 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 19 treesize of output 41 [2020-11-30 01:48:53,031 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 01:48:53,031 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 01:48:53,036 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:48:53,053 INFO L625 ElimStorePlain]: treesize reduction 14, result has 54.8 percent of original size [2020-11-30 01:48:53,053 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:48:53,053 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:17 [2020-11-30 01:48:53,070 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2020-11-30 01:48:53,070 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:48:53,085 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:48:53,086 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:48:53,086 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:29 [2020-11-30 01:49:09,754 WARN L193 SmtUtils]: Spent 16.60 s on a formula simplification. DAG size of input: 83 DAG size of output: 47 [2020-11-30 01:49:09,755 INFO L350 Elim1Store]: treesize reduction 521, result has 23.6 percent of original size [2020-11-30 01:49:09,755 INFO L384 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 2 new quantified variables, introduced 4 case distinctions, treesize of input 132 treesize of output 194 [2020-11-30 01:49:09,760 INFO L603 QuantifierPusher]: Distributing 5 conjuncts over 4 disjuncts [2020-11-30 01:49:09,761 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:49:09,787 INFO L625 ElimStorePlain]: treesize reduction 46, result has 38.7 percent of original size [2020-11-30 01:49:09,788 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:49:09,788 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:139, output treesize:29 [2020-11-30 01:49:09,815 INFO L384 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 31 treesize of output 13 [2020-11-30 01:49:09,815 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:49:09,825 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:49:09,830 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 01:49:09,830 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:17 [2020-11-30 01:49:09,858 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-11-30 01:49:09,858 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 01:49:09,910 INFO L545 ElimStorePlain]: Start of recursive call 2: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-11-30 01:49:09,973 INFO L625 ElimStorePlain]: treesize reduction 132, result has 27.1 percent of original size [2020-11-30 01:49:09,974 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2020-11-30 01:49:09,974 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:89, output treesize:49 [2020-11-30 01:49:14,421 WARN L193 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 34 [2020-11-30 01:49:14,447 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:49:15,288 WARN L193 SmtUtils]: Spent 840.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 58 [2020-11-30 01:49:15,289 INFO L625 ElimStorePlain]: treesize reduction 2177, result has 6.5 percent of original size [2020-11-30 01:49:15,295 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 01:49:15,297 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 01:49:15,299 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 01:49:15,300 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 01:49:15,306 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:49:15,324 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:49:15,326 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-11-30 01:49:15,328 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:49:15,340 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 01:49:15,353 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:49:15,356 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-11-30 01:49:15,358 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:49:15,374 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-11-30 01:49:15,376 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:49:15,385 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 01:49:15,394 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 01:49:15,397 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-11-30 01:49:15,402 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-30 01:49:15,409 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 01:49:15,425 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:49:15,431 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-11-30 01:49:15,437 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 01:49:15,442 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-11-30 01:49:15,457 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 01:49:15,460 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-11-30 01:49:15,465 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 01:49:15,472 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-30 01:49:15,482 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-30 01:49:15,486 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-11-30 01:49:15,490 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-30 01:49:15,499 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-11-30 01:49:15,506 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:49:15,511 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-11-30 01:49:15,514 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 01:49:15,517 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-11-30 01:49:15,520 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-30 01:49:15,525 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 01:49:15,531 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:49:15,536 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-11-30 01:49:15,538 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:49:15,544 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 01:49:15,551 INFO L545 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: 40 dim-0 vars, and 9 xjuncts. [2020-11-30 01:49:15,553 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:67, output treesize:1206 [2020-11-30 01:49:19,827 WARN L193 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 13 [2020-11-30 01:49:19,844 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:49:19,844 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1634873550] [2020-11-30 01:49:19,845 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1386783513] [2020-11-30 01:49:19,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7a200a14-127d-42c4-bf4c-6614499ca232/bin/utaipan/cvc4 Starting monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2020-11-30 01:49:20,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:49:20,047 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 10 conjunts are in the unsatisfiable core [2020-11-30 01:49:20,049 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:49:20,092 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:49:20,092 INFO L384 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 14 treesize of output 30 [2020-11-30 01:49:20,093 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:49:20,114 INFO L625 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2020-11-30 01:49:20,114 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 01:49:20,114 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:11 [2020-11-30 01:49:20,141 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:49:20,141 INFO L384 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 19 treesize of output 41 [2020-11-30 01:49:20,142 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 01:49:20,143 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 01:49:20,160 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:49:20,178 INFO L625 ElimStorePlain]: treesize reduction 16, result has 51.5 percent of original size [2020-11-30 01:49:20,178 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:49:20,178 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:17 [2020-11-30 01:49:20,206 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2020-11-30 01:49:20,206 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:49:20,224 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:49:20,224 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:49:20,225 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:29 [2020-11-30 01:49:59,024 WARN L193 SmtUtils]: Spent 38.78 s on a formula simplification. DAG size of input: 83 DAG size of output: 53 [2020-11-30 01:49:59,024 INFO L350 Elim1Store]: treesize reduction 453, result has 33.6 percent of original size [2020-11-30 01:49:59,025 INFO L384 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 2 new quantified variables, introduced 4 case distinctions, treesize of input 132 treesize of output 262 [2020-11-30 01:49:59,026 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-11-30 01:49:59,027 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-11-30 01:49:59,028 INFO L603 QuantifierPusher]: Distributing 5 conjuncts over 4 disjuncts [2020-11-30 01:49:59,029 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-11-30 01:49:59,030 INFO L603 QuantifierPusher]: Distributing 5 conjuncts over 3 disjuncts [2020-11-30 01:49:59,031 INFO L603 QuantifierPusher]: Distributing 5 conjuncts over 4 disjuncts [2020-11-30 01:49:59,032 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-11-30 01:49:59,033 INFO L603 QuantifierPusher]: Distributing 5 conjuncts over 4 disjuncts [2020-11-30 01:49:59,034 INFO L603 QuantifierPusher]: Distributing 5 conjuncts over 5 disjuncts [2020-11-30 01:49:59,035 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-11-30 01:49:59,036 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-11-30 01:49:59,037 INFO L603 QuantifierPusher]: Distributing 5 conjuncts over 4 disjuncts [2020-11-30 01:49:59,038 INFO L603 QuantifierPusher]: Distributing 5 conjuncts over 4 disjuncts [2020-11-30 01:49:59,039 INFO L603 QuantifierPusher]: Distributing 5 conjuncts over 5 disjuncts [2020-11-30 01:49:59,040 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-11-30 01:49:59,041 INFO L603 QuantifierPusher]: Distributing 5 conjuncts over 3 disjuncts [2020-11-30 01:49:59,042 INFO L603 QuantifierPusher]: Distributing 5 conjuncts over 4 disjuncts [2020-11-30 01:49:59,043 INFO L603 QuantifierPusher]: Distributing 5 conjuncts over 4 disjuncts [2020-11-30 01:49:59,044 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-11-30 01:49:59,059 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-11-30 01:49:59,060 INFO L603 QuantifierPusher]: Distributing 5 conjuncts over 5 disjuncts [2020-11-30 01:49:59,062 INFO L603 QuantifierPusher]: Distributing 5 conjuncts over 5 disjuncts [2020-11-30 01:49:59,063 INFO L603 QuantifierPusher]: Distributing 5 conjuncts over 6 disjuncts [2020-11-30 01:49:59,067 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-11-30 01:49:59,068 INFO L603 QuantifierPusher]: Distributing 5 conjuncts over 5 disjuncts [2020-11-30 01:49:59,070 INFO L603 QuantifierPusher]: Distributing 5 conjuncts over 4 disjuncts [2020-11-30 01:49:59,073 INFO L603 QuantifierPusher]: Distributing 5 conjuncts over 4 disjuncts [2020-11-30 01:49:59,074 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-11-30 01:49:59,075 INFO L603 QuantifierPusher]: Distributing 5 conjuncts over 4 disjuncts [2020-11-30 01:49:59,077 INFO L603 QuantifierPusher]: Distributing 5 conjuncts over 5 disjuncts [2020-11-30 01:49:59,081 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 15 xjuncts. [2020-11-30 01:49:59,450 WARN L193 SmtUtils]: Spent 368.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 19 [2020-11-30 01:49:59,450 INFO L625 ElimStorePlain]: treesize reduction 1303, result has 2.2 percent of original size [2020-11-30 01:49:59,450 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:49:59,450 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:139, output treesize:29 [2020-11-30 01:49:59,488 INFO L384 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 31 treesize of output 13 [2020-11-30 01:49:59,489 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:49:59,496 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:49:59,497 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 01:49:59,497 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:17 [2020-11-30 01:49:59,500 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-11-30 01:49:59,500 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 01:49:59,507 INFO L545 ElimStorePlain]: Start of recursive call 2: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-11-30 01:49:59,599 INFO L625 ElimStorePlain]: treesize reduction 132, result has 27.1 percent of original size [2020-11-30 01:49:59,600 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2020-11-30 01:49:59,600 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:89, output treesize:49 [2020-11-30 01:50:04,328 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:50:05,178 WARN L193 SmtUtils]: Spent 849.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 58 [2020-11-30 01:50:05,179 INFO L625 ElimStorePlain]: treesize reduction 2177, result has 6.5 percent of original size [2020-11-30 01:50:05,182 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 01:50:05,202 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 01:50:05,203 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 01:50:05,204 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 01:50:05,206 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:50:05,210 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:50:05,212 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-11-30 01:50:05,214 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:50:05,220 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 01:50:05,224 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:50:05,226 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-11-30 01:50:05,227 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:50:05,233 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-11-30 01:50:05,235 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:50:05,246 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 01:50:05,251 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 01:50:05,252 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-11-30 01:50:05,255 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-30 01:50:05,260 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 01:50:05,267 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:50:05,269 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-11-30 01:50:05,271 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 01:50:05,274 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-11-30 01:50:05,276 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 01:50:05,278 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-11-30 01:50:05,280 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 01:50:05,285 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-30 01:50:05,292 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-30 01:50:05,294 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-11-30 01:50:05,296 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-30 01:50:05,305 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-11-30 01:50:05,310 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:50:05,313 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-11-30 01:50:05,315 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 01:50:05,317 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-11-30 01:50:05,319 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-30 01:50:05,322 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 01:50:05,327 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:50:05,330 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-11-30 01:50:05,332 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:50:05,336 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 01:50:05,341 INFO L545 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: 40 dim-0 vars, and 9 xjuncts. [2020-11-30 01:50:05,341 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:67, output treesize:1206 [2020-11-30 01:50:05,455 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:50:05,455 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1080193649] [2020-11-30 01:50:05,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7a200a14-127d-42c4-bf4c-6614499ca232/bin/utaipan/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 01:50:05,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:50:05,551 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 9 conjunts are in the unsatisfiable core [2020-11-30 01:50:05,553 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:50:05,566 INFO L384 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 [2020-11-30 01:50:05,566 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:50:05,569 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:50:05,569 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:50:05,569 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-11-30 01:50:05,597 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:50:05,597 INFO L384 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 19 treesize of output 41 [2020-11-30 01:50:05,598 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:50:05,624 INFO L625 ElimStorePlain]: treesize reduction 14, result has 51.7 percent of original size [2020-11-30 01:50:05,625 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:50:05,625 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2020-11-30 01:50:05,633 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2020-11-30 01:50:05,633 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:50:05,656 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:50:05,656 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:50:05,656 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:29 [2020-11-30 01:50:18,346 WARN L193 SmtUtils]: Spent 12.68 s on a formula simplification. DAG size of input: 83 DAG size of output: 47 [2020-11-30 01:50:18,347 INFO L350 Elim1Store]: treesize reduction 521, result has 23.6 percent of original size [2020-11-30 01:50:18,347 INFO L384 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 2 new quantified variables, introduced 4 case distinctions, treesize of input 132 treesize of output 194 [2020-11-30 01:50:18,349 INFO L603 QuantifierPusher]: Distributing 5 conjuncts over 4 disjuncts [2020-11-30 01:50:18,350 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:50:18,386 INFO L625 ElimStorePlain]: treesize reduction 46, result has 38.7 percent of original size [2020-11-30 01:50:18,386 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:50:18,387 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:139, output treesize:29 [2020-11-30 01:50:18,406 INFO L384 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 31 treesize of output 13 [2020-11-30 01:50:18,407 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:50:18,414 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:50:18,415 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 01:50:18,415 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:17 [2020-11-30 01:50:18,417 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-11-30 01:50:18,417 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 01:50:18,424 INFO L545 ElimStorePlain]: Start of recursive call 2: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-11-30 01:50:18,487 INFO L625 ElimStorePlain]: treesize reduction 132, result has 27.1 percent of original size [2020-11-30 01:50:18,488 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2020-11-30 01:50:18,488 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:89, output treesize:49 [2020-11-30 01:50:28,957 WARN L193 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 34 [2020-11-30 01:50:28,994 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:50:29,874 WARN L193 SmtUtils]: Spent 879.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 58 [2020-11-30 01:50:29,875 INFO L625 ElimStorePlain]: treesize reduction 2177, result has 6.5 percent of original size [2020-11-30 01:50:29,877 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 01:50:29,878 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:50:29,880 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-11-30 01:50:29,880 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:50:29,882 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 01:50:29,882 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 01:50:29,888 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 01:50:29,904 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 01:50:29,905 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-30 01:50:29,906 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 01:50:29,911 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-11-30 01:50:29,913 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-11-30 01:50:29,918 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 01:50:29,924 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:50:29,926 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 01:50:29,929 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-11-30 01:50:29,931 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-30 01:50:29,932 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-11-30 01:50:29,934 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-11-30 01:50:29,944 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-11-30 01:50:29,945 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-11-30 01:50:29,951 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-11-30 01:50:29,961 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 01:50:29,962 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-30 01:50:29,963 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 01:50:29,971 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-11-30 01:50:29,972 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 01:50:29,983 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-11-30 01:50:29,993 INFO L545 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: 25 dim-0 vars, and 8 xjuncts. [2020-11-30 01:50:29,993 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:67, output treesize:396 [2020-11-30 01:50:30,090 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:50:30,090 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2020-11-30 01:50:30,091 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7, 7, 6, 7] total 15 [2020-11-30 01:50:30,091 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536916035] [2020-11-30 01:50:30,092 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-11-30 01:50:30,092 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-11-30 01:50:30,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-11-30 01:50:30,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=169, Unknown=3, NotChecked=0, Total=240 [2020-11-30 01:50:30,093 INFO L87 Difference]: Start difference. First operand 100 states and 110 transitions. Second operand 16 states. [2020-11-30 01:50:34,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:50:34,460 INFO L93 Difference]: Finished difference Result 202 states and 218 transitions. [2020-11-30 01:50:34,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-30 01:50:34,460 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 18 [2020-11-30 01:50:34,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:50:34,462 INFO L225 Difference]: With dead ends: 202 [2020-11-30 01:50:34,462 INFO L226 Difference]: Without dead ends: 202 [2020-11-30 01:50:34,462 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 83 SyntacticMatches, 5 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 24.2s TimeCoverageRelationStatistics Valid=96, Invalid=207, Unknown=3, NotChecked=0, Total=306 [2020-11-30 01:50:34,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2020-11-30 01:50:34,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 99. [2020-11-30 01:50:34,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2020-11-30 01:50:34,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 109 transitions. [2020-11-30 01:50:34,465 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 109 transitions. Word has length 18 [2020-11-30 01:50:34,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:50:34,465 INFO L481 AbstractCegarLoop]: Abstraction has 99 states and 109 transitions. [2020-11-30 01:50:34,465 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-11-30 01:50:34,465 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 109 transitions. [2020-11-30 01:50:34,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-11-30 01:50:34,466 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:50:34,466 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:50:35,077 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 mathsat -unsat_core_generation=3,14 cvc4 --incremental --print-success --lang smt --rewrite-divk,15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 01:50:35,077 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39REQUIRES_VIOLATION]=== [2020-11-30 01:50:35,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:50:35,078 INFO L82 PathProgramCache]: Analyzing trace with hash 50233869, now seen corresponding path program 1 times [2020-11-30 01:50:35,078 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-11-30 01:50:35,078 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [565821326] [2020-11-30 01:50:35,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7a200a14-127d-42c4-bf4c-6614499ca232/bin/utaipan/mathsat Starting monitored process 16 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with mathsat -unsat_core_generation=3 [2020-11-30 01:50:35,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:50:35,224 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 15 conjunts are in the unsatisfiable core [2020-11-30 01:50:35,226 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:50:35,266 INFO L384 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 [2020-11-30 01:50:35,266 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:50:35,269 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:50:35,269 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:50:35,269 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-11-30 01:50:35,277 INFO L441 ElimStorePlain]: Different costs {0=[|v_#length_76|], 1=[|v_#valid_102|]} [2020-11-30 01:50:35,282 INFO L384 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 [2020-11-30 01:50:35,283 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:50:35,309 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:50:35,317 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:50:35,317 INFO L384 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 13 treesize of output 17 [2020-11-30 01:50:35,317 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 01:50:35,325 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:50:35,325 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:50:35,325 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2020-11-30 01:50:35,344 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2020-11-30 01:50:35,344 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:50:35,360 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:50:35,369 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2020-11-30 01:50:35,369 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 01:50:35,381 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:50:35,382 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:50:35,382 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:31 [2020-11-30 01:50:35,505 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 01:50:35,508 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 01:50:35,510 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 01:50:35,513 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 01:50:35,515 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 01:50:35,518 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 01:50:35,520 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 13 [2020-11-30 01:50:35,521 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:50:35,593 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:51:14,848 WARN L193 SmtUtils]: Spent 39.25 s on a formula simplification. DAG size of input: 83 DAG size of output: 53 [2020-11-30 01:51:14,849 INFO L350 Elim1Store]: treesize reduction 453, result has 33.6 percent of original size [2020-11-30 01:51:14,849 INFO L384 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 2 new quantified variables, introduced 4 case distinctions, treesize of input 132 treesize of output 262 [2020-11-30 01:51:14,850 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-11-30 01:51:14,851 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-11-30 01:51:14,851 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-11-30 01:51:14,852 INFO L603 QuantifierPusher]: Distributing 5 conjuncts over 5 disjuncts [2020-11-30 01:51:14,853 INFO L603 QuantifierPusher]: Distributing 5 conjuncts over 6 disjuncts [2020-11-30 01:51:14,854 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-11-30 01:51:14,854 INFO L603 QuantifierPusher]: Distributing 5 conjuncts over 5 disjuncts [2020-11-30 01:51:14,855 INFO L603 QuantifierPusher]: Distributing 5 conjuncts over 4 disjuncts [2020-11-30 01:51:14,856 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-11-30 01:51:14,857 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-11-30 01:51:14,857 INFO L603 QuantifierPusher]: Distributing 5 conjuncts over 4 disjuncts [2020-11-30 01:51:14,858 INFO L603 QuantifierPusher]: Distributing 5 conjuncts over 3 disjuncts [2020-11-30 01:51:14,863 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-11-30 01:51:14,864 INFO L603 QuantifierPusher]: Distributing 5 conjuncts over 4 disjuncts [2020-11-30 01:51:14,865 INFO L603 QuantifierPusher]: Distributing 5 conjuncts over 5 disjuncts [2020-11-30 01:51:14,867 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 15 xjuncts. [2020-11-30 01:51:15,244 WARN L193 SmtUtils]: Spent 376.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 22 [2020-11-30 01:51:15,244 INFO L625 ElimStorePlain]: treesize reduction 1373, result has 2.4 percent of original size [2020-11-30 01:51:15,244 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:51:15,244 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:254, output treesize:34 [2020-11-30 01:51:15,359 INFO L384 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 19 treesize of output 7 [2020-11-30 01:51:15,359 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:51:15,382 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:51:15,389 INFO L384 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 31 treesize of output 13 [2020-11-30 01:51:15,390 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 01:51:15,403 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:51:15,404 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:51:15,404 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:54, output treesize:14 [2020-11-30 01:51:15,439 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:51:15,440 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 01:51:15,888 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:51:15,905 INFO L545 ElimStorePlain]: Start of recursive call 2: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-11-30 01:51:15,922 INFO L545 ElimStorePlain]: Start of recursive call 3: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-11-30 01:51:16,832 WARN L193 SmtUtils]: Spent 909.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 67 [2020-11-30 01:51:16,833 INFO L625 ElimStorePlain]: treesize reduction 262, result has 54.0 percent of original size [2020-11-30 01:51:16,878 INFO L545 ElimStorePlain]: Start of recursive call 4: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-11-30 01:51:16,905 INFO L545 ElimStorePlain]: Start of recursive call 5: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-11-30 01:51:17,516 WARN L193 SmtUtils]: Spent 610.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 61 [2020-11-30 01:51:17,516 INFO L625 ElimStorePlain]: treesize reduction 264, result has 42.1 percent of original size [2020-11-30 01:51:17,517 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 14 dim-0 vars, and 2 xjuncts. [2020-11-30 01:51:17,518 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:350, output treesize:192 [2020-11-30 01:51:19,530 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_DerPreprocessor_19 (_ BitVec 32)) (v_DerPreprocessor_20 (_ BitVec 32)) (v_DerPreprocessor_25 (_ BitVec 32)) (v_DerPreprocessor_28 (_ BitVec 32)) (v_DerPreprocessor_17 (_ BitVec 32)) (|ULTIMATE.start_create_data_#t~mem10.offset| (_ BitVec 32)) (v_DerPreprocessor_18 (_ BitVec 32)) (v_DerPreprocessor_26 (_ BitVec 32)) (v_DerPreprocessor_27 (_ BitVec 32))) (let ((.cse0 (bvmul c_ULTIMATE.start_create_data_~counter~0 (_ bv4 32)))) (let ((.cse1 (bvadd .cse0 |ULTIMATE.start_create_data_#t~mem10.offset|)) (.cse2 (bvadd .cse0 |ULTIMATE.start_create_data_#t~mem10.offset| (_ bv1 32))) (.cse3 (bvadd .cse0 |ULTIMATE.start_create_data_#t~mem10.offset| (_ bv2 32))) (.cse4 (bvadd .cse0 |ULTIMATE.start_create_data_#t~mem10.offset| (_ bv3 32))) (.cse5 (bvadd c_ULTIMATE.start_create_data_~data~0.offset (_ bv4 32)))) (bvule (bvadd .cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem10.base| (store (store (store (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem10.base|) .cse1 v_DerPreprocessor_17) .cse2 v_DerPreprocessor_18) .cse3 v_DerPreprocessor_19) .cse4 v_DerPreprocessor_20)) c_ULTIMATE.start_create_data_~data~0.base) .cse5) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_#t~mem10.base| (store (store (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_#t~mem10.base|) .cse1 v_DerPreprocessor_25) .cse2 v_DerPreprocessor_26) .cse3 v_DerPreprocessor_27) .cse4 v_DerPreprocessor_28)) c_ULTIMATE.start_create_data_~data~0.base) .cse5)))))) (forall ((v_prenex_95 (_ BitVec 32)) (v_DerPreprocessor_13 (_ BitVec 32)) (v_DerPreprocessor_14 (_ BitVec 32)) (v_DerPreprocessor_15 (_ BitVec 32)) (v_DerPreprocessor_16 (_ BitVec 32))) (let ((.cse7 (bvmul c_ULTIMATE.start_create_data_~counter~0 (_ bv4 32)))) (let ((.cse6 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem10.base| (store (store (store (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem10.base|) (bvadd .cse7 v_prenex_95) v_DerPreprocessor_13) (bvadd .cse7 v_prenex_95 (_ bv1 32)) v_DerPreprocessor_14) (bvadd .cse7 v_prenex_95 (_ bv2 32)) v_DerPreprocessor_15) (bvadd .cse7 v_prenex_95 (_ bv3 32)) v_DerPreprocessor_16)) c_ULTIMATE.start_create_data_~data~0.base) (bvadd c_ULTIMATE.start_create_data_~data~0.offset (_ bv4 32))))) (bvule (bvadd .cse6 .cse7 (_ bv4 32)) (bvadd .cse6 .cse7 (_ bv8 32))))))) is different from false [2020-11-30 01:51:29,942 WARN L193 SmtUtils]: Spent 3.59 s on a formula simplification that was a NOOP. DAG size: 69 [2020-11-30 01:51:31,978 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_DerPreprocessor_19 (_ BitVec 32)) (v_DerPreprocessor_20 (_ BitVec 32)) (v_DerPreprocessor_25 (_ BitVec 32)) (v_DerPreprocessor_17 (_ BitVec 32)) (v_DerPreprocessor_28 (_ BitVec 32)) (|ULTIMATE.start_create_data_#t~mem10.offset| (_ BitVec 32)) (v_DerPreprocessor_18 (_ BitVec 32)) (v_DerPreprocessor_26 (_ BitVec 32)) (v_DerPreprocessor_27 (_ BitVec 32))) (let ((.cse4 (bvadd c_ULTIMATE.start_create_data_~data~0.offset (_ bv4 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_create_data_~data~0.base) .cse4)) (.cse1 (bvadd |ULTIMATE.start_create_data_#t~mem10.offset| (_ bv1 32))) (.cse2 (bvadd |ULTIMATE.start_create_data_#t~mem10.offset| (_ bv2 32))) (.cse3 (bvadd |ULTIMATE.start_create_data_#t~mem10.offset| (_ bv3 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 (store (store (store (store (select |c_#memory_$Pointer$.offset| .cse0) |ULTIMATE.start_create_data_#t~mem10.offset| v_DerPreprocessor_17) .cse1 v_DerPreprocessor_18) .cse2 v_DerPreprocessor_19) .cse3 v_DerPreprocessor_20)) c_ULTIMATE.start_create_data_~data~0.base) .cse4) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 (store (store (store (store (select |c_#memory_$Pointer$.base| .cse0) |ULTIMATE.start_create_data_#t~mem10.offset| v_DerPreprocessor_25) .cse1 v_DerPreprocessor_26) .cse2 v_DerPreprocessor_27) .cse3 v_DerPreprocessor_28)) c_ULTIMATE.start_create_data_~data~0.base) .cse4)))))) (forall ((v_prenex_95 (_ BitVec 32)) (v_DerPreprocessor_13 (_ BitVec 32)) (v_DerPreprocessor_14 (_ BitVec 32)) (v_DerPreprocessor_15 (_ BitVec 32)) (v_DerPreprocessor_16 (_ BitVec 32))) (let ((.cse5 (let ((.cse7 (bvadd c_ULTIMATE.start_create_data_~data~0.offset (_ bv4 32)))) (select (select (let ((.cse6 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_create_data_~data~0.base) .cse7))) (store |c_#memory_$Pointer$.offset| .cse6 (store (store (store (store (select |c_#memory_$Pointer$.offset| .cse6) v_prenex_95 v_DerPreprocessor_13) (bvadd v_prenex_95 (_ bv1 32)) v_DerPreprocessor_14) (bvadd v_prenex_95 (_ bv2 32)) v_DerPreprocessor_15) (bvadd v_prenex_95 (_ bv3 32)) v_DerPreprocessor_16))) c_ULTIMATE.start_create_data_~data~0.base) .cse7)))) (bvule (bvadd .cse5 (_ bv4 32)) (bvadd .cse5 (_ bv8 32)))))) is different from false [2020-11-30 01:51:32,097 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:51:42,890 WARN L193 SmtUtils]: Spent 10.79 s on a formula simplification. DAG size of input: 146 DAG size of output: 103 [2020-11-30 01:51:42,891 INFO L625 ElimStorePlain]: treesize reduction 1887, result has 11.3 percent of original size [2020-11-30 01:51:42,915 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 01:51:47,770 WARN L193 SmtUtils]: Spent 4.85 s on a formula simplification. DAG size of input: 133 DAG size of output: 121 [2020-11-30 01:51:47,771 INFO L625 ElimStorePlain]: treesize reduction 902, result has 36.4 percent of original size [2020-11-30 01:51:47,978 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-11-30 01:52:19,519 WARN L193 SmtUtils]: Spent 31.54 s on a formula simplification. DAG size of input: 1848 DAG size of output: 115 [2020-11-30 01:52:19,519 INFO L625 ElimStorePlain]: treesize reduction 158555, result has 0.2 percent of original size [2020-11-30 01:52:19,538 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:52:19,539 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 01:52:19,540 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-30 01:52:19,541 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 01:52:19,548 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 01:52:19,550 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-11-30 01:52:19,551 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-11-30 01:52:19,552 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-11-30 01:52:19,552 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 01:52:19,554 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:52:19,569 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-11-30 01:52:19,570 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 01:52:19,574 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:52:19,578 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-11-30 01:52:19,579 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-11-30 01:52:19,581 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-30 01:52:19,589 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 01:52:19,597 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-11-30 01:52:19,597 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:52:19,601 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 01:52:19,614 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-11-30 01:52:19,615 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-11-30 01:52:19,616 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-11-30 01:52:19,618 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-11-30 01:52:19,634 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-30 01:52:19,641 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-11-30 01:52:19,642 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 01:52:19,652 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-30 01:52:19,659 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-11-30 01:52:19,660 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-11-30 01:52:19,660 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:52:19,662 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 01:52:19,664 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-11-30 01:52:19,665 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 01:52:19,671 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-30 01:52:19,677 INFO L545 ElimStorePlain]: Start of recursive call 1: 16 dim-0 vars, 3 dim-2 vars, End of recursive call: 86 dim-0 vars, and 14 xjuncts. [2020-11-30 01:52:19,677 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 19 variables, input treesize:211, output treesize:1385 [2020-11-30 01:52:21,802 WARN L193 SmtUtils]: Spent 1.10 s on a formula simplification. DAG size of input: 360 DAG size of output: 14 [2020-11-30 01:52:21,808 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2020-11-30 01:52:21,809 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [565821326] [2020-11-30 01:52:21,809 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1846046712] [2020-11-30 01:52:21,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7a200a14-127d-42c4-bf4c-6614499ca232/bin/utaipan/cvc4 Starting monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2020-11-30 01:52:22,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:52:22,079 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 15 conjunts are in the unsatisfiable core [2020-11-30 01:52:22,080 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:52:22,084 INFO L384 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 [2020-11-30 01:52:22,084 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:52:22,086 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:52:22,086 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:52:22,086 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-11-30 01:52:22,116 INFO L441 ElimStorePlain]: Different costs {0=[|v_#length_79|], 1=[|v_#valid_106|]} [2020-11-30 01:52:22,121 INFO L384 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 [2020-11-30 01:52:22,121 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:52:22,146 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:52:22,157 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:52:22,157 INFO L384 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 13 treesize of output 17 [2020-11-30 01:52:22,158 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 01:52:22,160 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 01:52:22,171 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:52:22,172 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:52:22,172 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2020-11-30 01:52:22,182 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2020-11-30 01:52:22,182 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:52:22,208 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:52:22,215 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2020-11-30 01:52:22,215 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 01:52:22,237 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:52:22,237 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:52:22,238 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:31 [2020-11-30 01:52:22,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 01:52:22,276 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 01:52:22,280 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 01:52:22,284 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 01:52:22,288 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 01:52:22,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 01:52:22,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 01:52:22,298 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 13 [2020-11-30 01:52:22,299 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:52:22,376 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:53:01,352 WARN L193 SmtUtils]: Spent 38.96 s on a formula simplification. DAG size of input: 83 DAG size of output: 53 [2020-11-30 01:53:01,353 INFO L350 Elim1Store]: treesize reduction 453, result has 33.6 percent of original size [2020-11-30 01:53:01,353 INFO L384 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 2 new quantified variables, introduced 4 case distinctions, treesize of input 132 treesize of output 262 [2020-11-30 01:53:01,355 INFO L603 QuantifierPusher]: Distributing 5 conjuncts over 6 disjuncts [2020-11-30 01:53:01,364 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 01:53:01,461 INFO L625 ElimStorePlain]: treesize reduction 138, result has 19.8 percent of original size [2020-11-30 01:53:01,461 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:53:01,462 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:254, output treesize:34 [2020-11-30 01:53:01,512 INFO L384 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 19 treesize of output 7 [2020-11-30 01:53:01,512 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:53:01,540 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:53:01,544 INFO L384 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 31 treesize of output 13 [2020-11-30 01:53:01,545 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 01:53:01,562 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:53:01,563 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:53:01,563 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:54, output treesize:14 [2020-11-30 01:53:01,566 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:53:01,566 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 01:53:01,570 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:53:01,603 INFO L545 ElimStorePlain]: Start of recursive call 2: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-11-30 01:53:01,631 INFO L545 ElimStorePlain]: Start of recursive call 3: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-11-30 01:53:02,728 WARN L193 SmtUtils]: Spent 1.10 s on a formula simplification. DAG size of input: 85 DAG size of output: 67 [2020-11-30 01:53:02,729 INFO L625 ElimStorePlain]: treesize reduction 262, result has 54.0 percent of original size [2020-11-30 01:53:02,756 INFO L545 ElimStorePlain]: Start of recursive call 4: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-11-30 01:53:02,885 INFO L545 ElimStorePlain]: Start of recursive call 5: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-11-30 01:53:03,947 WARN L193 SmtUtils]: Spent 1.06 s on a formula simplification. DAG size of input: 89 DAG size of output: 61 [2020-11-30 01:53:03,947 INFO L625 ElimStorePlain]: treesize reduction 264, result has 42.1 percent of original size [2020-11-30 01:53:03,949 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 14 dim-0 vars, and 2 xjuncts. [2020-11-30 01:53:03,949 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:350, output treesize:192 [2020-11-30 01:53:20,331 WARN L193 SmtUtils]: Spent 2.33 s on a formula simplification that was a NOOP. DAG size: 68 [2020-11-30 01:53:39,831 WARN L193 SmtUtils]: Spent 2.32 s on a formula simplification that was a NOOP. DAG size: 69 [2020-11-30 01:53:41,854 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_DerPreprocessor_40 (_ BitVec 32)) (v_DerPreprocessor_35 (_ BitVec 32)) (v_DerPreprocessor_36 (_ BitVec 32)) (v_DerPreprocessor_33 (_ BitVec 32)) (v_DerPreprocessor_34 (_ BitVec 32)) (v_DerPreprocessor_39 (_ BitVec 32)) (v_prenex_176 (_ BitVec 32)) (v_DerPreprocessor_37 (_ BitVec 32)) (v_DerPreprocessor_38 (_ BitVec 32))) (let ((.cse4 (bvadd c_ULTIMATE.start_create_data_~data~0.offset (_ bv4 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_create_data_~data~0.base) .cse4)) (.cse1 (bvadd v_prenex_176 (_ bv1 32))) (.cse2 (bvadd v_prenex_176 (_ bv2 32))) (.cse3 (bvadd v_prenex_176 (_ bv3 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 (store (store (store (store (select |c_#memory_$Pointer$.offset| .cse0) v_prenex_176 v_DerPreprocessor_33) .cse1 v_DerPreprocessor_34) .cse2 v_DerPreprocessor_35) .cse3 v_DerPreprocessor_36)) c_ULTIMATE.start_create_data_~data~0.base) .cse4) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 (store (store (store (store (select |c_#memory_$Pointer$.base| .cse0) v_prenex_176 v_DerPreprocessor_37) .cse1 v_DerPreprocessor_38) .cse2 v_DerPreprocessor_39) .cse3 v_DerPreprocessor_40)) c_ULTIMATE.start_create_data_~data~0.base) .cse4)))))) (forall ((v_DerPreprocessor_31 (_ BitVec 32)) (v_DerPreprocessor_32 (_ BitVec 32)) (v_DerPreprocessor_30 (_ BitVec 32)) (|ULTIMATE.start_create_data_#t~mem10.offset| (_ BitVec 32)) (v_DerPreprocessor_29 (_ BitVec 32))) (let ((.cse5 (let ((.cse7 (bvadd c_ULTIMATE.start_create_data_~data~0.offset (_ bv4 32)))) (select (select (let ((.cse6 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_create_data_~data~0.base) .cse7))) (store |c_#memory_$Pointer$.offset| .cse6 (store (store (store (store (select |c_#memory_$Pointer$.offset| .cse6) |ULTIMATE.start_create_data_#t~mem10.offset| v_DerPreprocessor_29) (bvadd |ULTIMATE.start_create_data_#t~mem10.offset| (_ bv1 32)) v_DerPreprocessor_30) (bvadd |ULTIMATE.start_create_data_#t~mem10.offset| (_ bv2 32)) v_DerPreprocessor_31) (bvadd |ULTIMATE.start_create_data_#t~mem10.offset| (_ bv3 32)) v_DerPreprocessor_32))) c_ULTIMATE.start_create_data_~data~0.base) .cse7)))) (bvule (bvadd .cse5 (_ bv4 32)) (bvadd .cse5 (_ bv8 32)))))) is different from false [2020-11-30 01:53:41,992 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:54:01,972 WARN L193 SmtUtils]: Spent 19.98 s on a formula simplification. DAG size of input: 200 DAG size of output: 99 [2020-11-30 01:54:01,973 INFO L625 ElimStorePlain]: treesize reduction 10082, result has 4.6 percent of original size [2020-11-30 01:54:02,074 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 01:54:26,041 WARN L193 SmtUtils]: Spent 23.96 s on a formula simplification. DAG size of input: 963 DAG size of output: 92 [2020-11-30 01:54:26,041 INFO L625 ElimStorePlain]: treesize reduction 79197, result has 0.3 percent of original size [2020-11-30 01:54:26,058 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-11-30 01:54:31,236 WARN L193 SmtUtils]: Spent 5.18 s on a formula simplification. DAG size of input: 146 DAG size of output: 112 [2020-11-30 01:54:31,236 INFO L625 ElimStorePlain]: treesize reduction 887, result has 23.3 percent of original size [2020-11-30 01:54:31,239 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 01:54:31,240 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:54:31,241 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-11-30 01:54:31,241 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 01:54:31,242 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 01:54:31,249 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 01:54:31,250 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 01:54:31,255 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-11-30 01:54:31,255 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 01:54:31,267 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 01:54:31,269 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-11-30 01:54:31,270 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-11-30 01:54:31,281 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 01:54:31,286 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:54:31,286 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 01:54:31,289 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-11-30 01:54:31,290 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-11-30 01:54:31,291 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-11-30 01:54:31,291 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 01:54:31,295 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-11-30 01:54:31,298 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-11-30 01:54:31,299 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-11-30 01:54:31,303 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-11-30 01:54:31,306 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-11-30 01:54:31,307 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 01:54:31,311 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-11-30 01:54:31,318 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-11-30 01:54:31,318 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-11-30 01:54:31,322 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 01:54:31,347 INFO L545 ElimStorePlain]: Start of recursive call 1: 16 dim-0 vars, 3 dim-2 vars, End of recursive call: 20 dim-0 vars, and 8 xjuncts. [2020-11-30 01:54:31,347 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 19 variables, input treesize:211, output treesize:199 [2020-11-30 01:54:31,632 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:54:31,633 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2016187953] [2020-11-30 01:54:31,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7a200a14-127d-42c4-bf4c-6614499ca232/bin/utaipan/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 01:54:31,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:54:31,700 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 15 conjunts are in the unsatisfiable core [2020-11-30 01:54:31,701 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:54:31,706 INFO L384 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 [2020-11-30 01:54:31,706 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:54:31,708 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:54:31,708 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:54:31,708 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-11-30 01:54:31,713 INFO L441 ElimStorePlain]: Different costs {0=[|v_#length_82|], 1=[|v_#valid_110|]} [2020-11-30 01:54:31,724 INFO L384 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 [2020-11-30 01:54:31,725 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:54:31,742 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:54:31,755 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:54:31,755 INFO L384 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 13 treesize of output 17 [2020-11-30 01:54:31,756 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 01:54:31,759 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 01:54:31,771 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:54:31,772 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:54:31,772 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2020-11-30 01:54:31,784 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2020-11-30 01:54:31,784 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:54:31,812 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:54:31,820 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2020-11-30 01:54:31,820 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 01:54:31,842 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:54:31,842 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:54:31,842 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:31 [2020-11-30 01:54:42,491 WARN L193 SmtUtils]: Spent 10.63 s on a formula simplification. DAG size of input: 83 DAG size of output: 47 [2020-11-30 01:54:42,492 INFO L350 Elim1Store]: treesize reduction 521, result has 23.6 percent of original size [2020-11-30 01:54:42,492 INFO L384 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 2 new quantified variables, introduced 4 case distinctions, treesize of input 242 treesize of output 268 [2020-11-30 01:54:42,493 INFO L603 QuantifierPusher]: Distributing 5 conjuncts over 5 disjuncts [2020-11-30 01:54:42,493 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:54:42,610 WARN L193 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2020-11-30 01:54:42,610 INFO L625 ElimStorePlain]: treesize reduction 46, result has 75.8 percent of original size [2020-11-30 01:54:42,640 INFO L350 Elim1Store]: treesize reduction 331, result has 0.3 percent of original size [2020-11-30 01:54:42,640 INFO L384 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 3 case distinctions, treesize of input 120 treesize of output 13 [2020-11-30 01:54:42,641 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 01:54:42,654 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:54:42,654 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:54:42,655 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:254, output treesize:34 [2020-11-30 01:54:42,688 INFO L384 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 19 treesize of output 7 [2020-11-30 01:54:42,689 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:54:42,707 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:54:42,711 INFO L384 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 31 treesize of output 13 [2020-11-30 01:54:42,712 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 01:54:42,723 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:54:42,724 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:54:42,724 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:54, output treesize:14 [2020-11-30 01:54:42,726 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:54:42,726 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 01:54:42,729 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:54:42,784 INFO L545 ElimStorePlain]: Start of recursive call 2: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-11-30 01:54:42,830 INFO L545 ElimStorePlain]: Start of recursive call 3: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-11-30 01:54:43,523 WARN L193 SmtUtils]: Spent 692.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 55 [2020-11-30 01:54:43,524 INFO L625 ElimStorePlain]: treesize reduction 262, result has 47.4 percent of original size [2020-11-30 01:54:43,545 INFO L545 ElimStorePlain]: Start of recursive call 4: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-11-30 01:54:43,570 INFO L545 ElimStorePlain]: Start of recursive call 5: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-11-30 01:54:44,343 WARN L193 SmtUtils]: Spent 773.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 61 [2020-11-30 01:54:44,344 INFO L625 ElimStorePlain]: treesize reduction 264, result has 42.1 percent of original size [2020-11-30 01:54:44,346 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 14 dim-0 vars, and 2 xjuncts. [2020-11-30 01:54:44,346 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:350, output treesize:192 [2020-11-30 01:54:46,361 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_DerPreprocessor_53 (_ BitVec 32)) (v_DerPreprocessor_54 (_ BitVec 32)) (v_DerPreprocessor_46 (_ BitVec 32)) (v_DerPreprocessor_47 (_ BitVec 32)) (v_DerPreprocessor_55 (_ BitVec 32)) (v_DerPreprocessor_45 (_ BitVec 32)) (v_DerPreprocessor_56 (_ BitVec 32)) (|ULTIMATE.start_create_data_#t~mem10.offset| (_ BitVec 32)) (v_DerPreprocessor_48 (_ BitVec 32))) (let ((.cse0 (bvmul c_ULTIMATE.start_create_data_~counter~0 (_ bv4 32)))) (let ((.cse1 (bvadd .cse0 |ULTIMATE.start_create_data_#t~mem10.offset|)) (.cse2 (bvadd .cse0 |ULTIMATE.start_create_data_#t~mem10.offset| (_ bv1 32))) (.cse3 (bvadd .cse0 |ULTIMATE.start_create_data_#t~mem10.offset| (_ bv2 32))) (.cse4 (bvadd .cse0 |ULTIMATE.start_create_data_#t~mem10.offset| (_ bv3 32))) (.cse5 (bvadd c_ULTIMATE.start_create_data_~data~0.offset (_ bv4 32)))) (bvule (bvadd .cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem10.base| (store (store (store (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem10.base|) .cse1 v_DerPreprocessor_53) .cse2 v_DerPreprocessor_54) .cse3 v_DerPreprocessor_55) .cse4 v_DerPreprocessor_56)) c_ULTIMATE.start_create_data_~data~0.base) .cse5) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_#t~mem10.base| (store (store (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_#t~mem10.base|) .cse1 v_DerPreprocessor_45) .cse2 v_DerPreprocessor_46) .cse3 v_DerPreprocessor_47) .cse4 v_DerPreprocessor_48)) c_ULTIMATE.start_create_data_~data~0.base) .cse5)))))) (forall ((v_DerPreprocessor_60 (_ BitVec 32)) (v_prenex_191 (_ BitVec 32)) (v_DerPreprocessor_57 (_ BitVec 32)) (v_DerPreprocessor_58 (_ BitVec 32)) (v_DerPreprocessor_59 (_ BitVec 32))) (let ((.cse6 (bvmul c_ULTIMATE.start_create_data_~counter~0 (_ bv4 32)))) (let ((.cse7 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem10.base| (store (store (store (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem10.base|) (bvadd .cse6 v_prenex_191) v_DerPreprocessor_57) (bvadd .cse6 v_prenex_191 (_ bv1 32)) v_DerPreprocessor_58) (bvadd .cse6 v_prenex_191 (_ bv2 32)) v_DerPreprocessor_59) (bvadd .cse6 v_prenex_191 (_ bv3 32)) v_DerPreprocessor_60)) c_ULTIMATE.start_create_data_~data~0.base) (bvadd c_ULTIMATE.start_create_data_~data~0.offset (_ bv4 32))))) (bvule (bvadd .cse6 .cse7 (_ bv4 32)) (bvadd .cse6 .cse7 (_ bv8 32))))))) is different from false [2020-11-30 01:55:14,886 WARN L193 SmtUtils]: Spent 7.13 s on a formula simplification that was a NOOP. DAG size: 69 [2020-11-30 01:55:38,283 WARN L193 SmtUtils]: Spent 4.22 s on a formula simplification that was a NOOP. DAG size: 65 [2020-11-30 01:55:38,477 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:55:55,809 WARN L193 SmtUtils]: Spent 17.33 s on a formula simplification. DAG size of input: 557 DAG size of output: 103 [2020-11-30 01:55:55,810 INFO L625 ElimStorePlain]: treesize reduction 63327, result has 0.4 percent of original size [2020-11-30 01:55:55,838 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 01:56:07,748 WARN L193 SmtUtils]: Spent 11.91 s on a formula simplification. DAG size of input: 164 DAG size of output: 122 [2020-11-30 01:56:07,749 INFO L625 ElimStorePlain]: treesize reduction 4838, result has 9.6 percent of original size [2020-11-30 01:56:07,791 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-11-30 01:56:16,636 WARN L193 SmtUtils]: Spent 8.84 s on a formula simplification. DAG size of input: 458 DAG size of output: 113 [2020-11-30 01:56:16,637 INFO L625 ElimStorePlain]: treesize reduction 10237, result has 2.6 percent of original size [2020-11-30 01:56:16,651 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 01:56:16,669 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-11-30 01:56:16,670 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-11-30 01:56:16,671 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-30 01:56:16,672 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-11-30 01:56:16,674 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-11-30 01:56:16,674 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-11-30 01:56:16,686 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-11-30 01:56:16,706 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-11-30 01:56:16,714 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 01:56:16,716 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-11-30 01:56:16,717 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-11-30 01:56:16,719 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-11-30 01:56:16,731 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 01:56:16,735 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 01:56:16,740 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-11-30 01:56:16,741 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:56:16,742 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-11-30 01:56:16,743 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 01:56:16,744 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 01:56:16,752 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 01:56:16,754 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 01:56:16,763 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 01:56:16,764 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-11-30 01:56:16,765 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-11-30 01:56:16,766 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 01:56:16,769 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-11-30 01:56:16,785 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-11-30 01:56:16,786 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 01:56:16,790 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-11-30 01:56:16,795 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 01:56:16,805 INFO L545 ElimStorePlain]: Start of recursive call 1: 16 dim-0 vars, 3 dim-2 vars, End of recursive call: 46 dim-0 vars, and 10 xjuncts. [2020-11-30 01:56:16,805 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 19 variables, input treesize:211, output treesize:459 [2020-11-30 01:56:17,441 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2020-11-30 01:56:17,441 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2020-11-30 01:56:17,441 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 8, 9, 8, 9] total 21 [2020-11-30 01:56:17,441 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302396243] [2020-11-30 01:56:17,442 INFO L461 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-11-30 01:56:17,442 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-11-30 01:56:17,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-11-30 01:56:17,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=223, Unknown=30, NotChecked=140, Total=462 [2020-11-30 01:56:17,443 INFO L87 Difference]: Start difference. First operand 99 states and 109 transitions. Second operand 22 states. [2020-11-30 01:56:28,897 WARN L193 SmtUtils]: Spent 2.20 s on a formula simplification. DAG size of input: 132 DAG size of output: 32 [2020-11-30 01:56:38,366 WARN L193 SmtUtils]: Spent 3.40 s on a formula simplification. DAG size of input: 144 DAG size of output: 43 [2020-11-30 01:56:45,609 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse14 (bvadd c_ULTIMATE.start_create_data_~data~0.offset (_ bv4 32)))) (let ((.cse19 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_create_data_~data~0.base) .cse14))) (and (forall ((v_DerPreprocessor_53 (_ BitVec 32)) (v_DerPreprocessor_54 (_ BitVec 32)) (v_DerPreprocessor_46 (_ BitVec 32)) (v_DerPreprocessor_47 (_ BitVec 32)) (v_DerPreprocessor_55 (_ BitVec 32)) (v_DerPreprocessor_45 (_ BitVec 32)) (v_DerPreprocessor_56 (_ BitVec 32)) (|ULTIMATE.start_create_data_#t~mem10.offset| (_ BitVec 32)) (v_DerPreprocessor_48 (_ BitVec 32))) (let ((.cse0 (bvmul c_ULTIMATE.start_create_data_~counter~0 (_ bv4 32)))) (let ((.cse1 (bvadd .cse0 |ULTIMATE.start_create_data_#t~mem10.offset|)) (.cse2 (bvadd .cse0 |ULTIMATE.start_create_data_#t~mem10.offset| (_ bv1 32))) (.cse3 (bvadd .cse0 |ULTIMATE.start_create_data_#t~mem10.offset| (_ bv2 32))) (.cse4 (bvadd .cse0 |ULTIMATE.start_create_data_#t~mem10.offset| (_ bv3 32))) (.cse5 (bvadd c_ULTIMATE.start_create_data_~data~0.offset (_ bv4 32)))) (bvule (bvadd .cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem10.base| (store (store (store (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem10.base|) .cse1 v_DerPreprocessor_53) .cse2 v_DerPreprocessor_54) .cse3 v_DerPreprocessor_55) .cse4 v_DerPreprocessor_56)) c_ULTIMATE.start_create_data_~data~0.base) .cse5) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_#t~mem10.base| (store (store (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_#t~mem10.base|) .cse1 v_DerPreprocessor_45) .cse2 v_DerPreprocessor_46) .cse3 v_DerPreprocessor_47) .cse4 v_DerPreprocessor_48)) c_ULTIMATE.start_create_data_~data~0.base) .cse5)))))) (= (bvadd (select |c_#valid| c_ULTIMATE.start_create_data_~data~0.base) (_ bv1 1)) (_ bv0 1)) (forall ((v_DerPreprocessor_40 (_ BitVec 32)) (v_DerPreprocessor_35 (_ BitVec 32)) (v_DerPreprocessor_36 (_ BitVec 32)) (v_DerPreprocessor_33 (_ BitVec 32)) (v_DerPreprocessor_34 (_ BitVec 32)) (v_DerPreprocessor_39 (_ BitVec 32)) (v_prenex_176 (_ BitVec 32)) (v_DerPreprocessor_37 (_ BitVec 32)) (v_DerPreprocessor_38 (_ BitVec 32))) (let ((.cse6 (bvmul c_ULTIMATE.start_create_data_~counter~0 (_ bv4 32)))) (let ((.cse7 (bvadd .cse6 v_prenex_176)) (.cse8 (bvadd .cse6 v_prenex_176 (_ bv1 32))) (.cse9 (bvadd .cse6 v_prenex_176 (_ bv2 32))) (.cse10 (bvadd .cse6 v_prenex_176 (_ bv3 32))) (.cse11 (bvadd c_ULTIMATE.start_create_data_~data~0.offset (_ bv4 32)))) (bvule (bvadd .cse6 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem10.base| (store (store (store (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem10.base|) .cse7 v_DerPreprocessor_33) .cse8 v_DerPreprocessor_34) .cse9 v_DerPreprocessor_35) .cse10 v_DerPreprocessor_36)) c_ULTIMATE.start_create_data_~data~0.base) .cse11) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_#t~mem10.base| (store (store (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_#t~mem10.base|) .cse7 v_DerPreprocessor_37) .cse8 v_DerPreprocessor_38) .cse9 v_DerPreprocessor_39) .cse10 v_DerPreprocessor_40)) c_ULTIMATE.start_create_data_~data~0.base) .cse11)))))) (forall ((v_DerPreprocessor_31 (_ BitVec 32)) (v_DerPreprocessor_32 (_ BitVec 32)) (v_DerPreprocessor_30 (_ BitVec 32)) (|ULTIMATE.start_create_data_#t~mem10.offset| (_ BitVec 32)) (v_DerPreprocessor_29 (_ BitVec 32))) (let ((.cse12 (bvmul c_ULTIMATE.start_create_data_~counter~0 (_ bv4 32)))) (let ((.cse13 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem10.base| (store (store (store (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem10.base|) (bvadd .cse12 |ULTIMATE.start_create_data_#t~mem10.offset|) v_DerPreprocessor_29) (bvadd .cse12 |ULTIMATE.start_create_data_#t~mem10.offset| (_ bv1 32)) v_DerPreprocessor_30) (bvadd .cse12 |ULTIMATE.start_create_data_#t~mem10.offset| (_ bv2 32)) v_DerPreprocessor_31) (bvadd .cse12 |ULTIMATE.start_create_data_#t~mem10.offset| (_ bv3 32)) v_DerPreprocessor_32)) c_ULTIMATE.start_create_data_~data~0.base) (bvadd c_ULTIMATE.start_create_data_~data~0.offset (_ bv4 32))))) (bvule (bvadd .cse12 .cse13 (_ bv4 32)) (bvadd .cse12 .cse13 (_ bv8 32)))))) (= (_ bv0 32) (select (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_create_data_~data~0.base) .cse14)) (= (bvadd c_ULTIMATE.start_create_data_~counter~0 (_ bv4294967295 32)) (_ bv0 32)) (forall ((v_DerPreprocessor_60 (_ BitVec 32)) (v_prenex_191 (_ BitVec 32)) (v_DerPreprocessor_57 (_ BitVec 32)) (v_DerPreprocessor_58 (_ BitVec 32)) (v_DerPreprocessor_59 (_ BitVec 32))) (let ((.cse15 (bvmul c_ULTIMATE.start_create_data_~counter~0 (_ bv4 32)))) (let ((.cse16 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem10.base| (store (store (store (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem10.base|) (bvadd .cse15 v_prenex_191) v_DerPreprocessor_57) (bvadd .cse15 v_prenex_191 (_ bv1 32)) v_DerPreprocessor_58) (bvadd .cse15 v_prenex_191 (_ bv2 32)) v_DerPreprocessor_59) (bvadd .cse15 v_prenex_191 (_ bv3 32)) v_DerPreprocessor_60)) c_ULTIMATE.start_create_data_~data~0.base) (bvadd c_ULTIMATE.start_create_data_~data~0.offset (_ bv4 32))))) (bvule (bvadd .cse15 .cse16 (_ bv4 32)) (bvadd .cse15 .cse16 (_ bv8 32)))))) (= (_ bv80 32) (select |c_#length| |c_ULTIMATE.start_create_data_#t~mem10.base|)) (forall ((v_prenex_95 (_ BitVec 32)) (v_DerPreprocessor_13 (_ BitVec 32)) (v_DerPreprocessor_14 (_ BitVec 32)) (v_DerPreprocessor_15 (_ BitVec 32)) (v_DerPreprocessor_16 (_ BitVec 32))) (let ((.cse18 (bvmul c_ULTIMATE.start_create_data_~counter~0 (_ bv4 32)))) (let ((.cse17 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem10.base| (store (store (store (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem10.base|) (bvadd .cse18 v_prenex_95) v_DerPreprocessor_13) (bvadd .cse18 v_prenex_95 (_ bv1 32)) v_DerPreprocessor_14) (bvadd .cse18 v_prenex_95 (_ bv2 32)) v_DerPreprocessor_15) (bvadd .cse18 v_prenex_95 (_ bv3 32)) v_DerPreprocessor_16)) c_ULTIMATE.start_create_data_~data~0.base) (bvadd c_ULTIMATE.start_create_data_~data~0.offset (_ bv4 32))))) (bvule (bvadd .cse17 .cse18 (_ bv4 32)) (bvadd .cse17 .cse18 (_ bv8 32)))))) (not (= .cse19 c_ULTIMATE.start_create_data_~data~0.base)) (forall ((v_DerPreprocessor_19 (_ BitVec 32)) (v_DerPreprocessor_20 (_ BitVec 32)) (v_DerPreprocessor_25 (_ BitVec 32)) (v_DerPreprocessor_28 (_ BitVec 32)) (v_DerPreprocessor_17 (_ BitVec 32)) (|ULTIMATE.start_create_data_#t~mem10.offset| (_ BitVec 32)) (v_DerPreprocessor_18 (_ BitVec 32)) (v_DerPreprocessor_26 (_ BitVec 32)) (v_DerPreprocessor_27 (_ BitVec 32))) (let ((.cse20 (bvmul c_ULTIMATE.start_create_data_~counter~0 (_ bv4 32)))) (let ((.cse21 (bvadd .cse20 |ULTIMATE.start_create_data_#t~mem10.offset|)) (.cse22 (bvadd .cse20 |ULTIMATE.start_create_data_#t~mem10.offset| (_ bv1 32))) (.cse23 (bvadd .cse20 |ULTIMATE.start_create_data_#t~mem10.offset| (_ bv2 32))) (.cse24 (bvadd .cse20 |ULTIMATE.start_create_data_#t~mem10.offset| (_ bv3 32))) (.cse25 (bvadd c_ULTIMATE.start_create_data_~data~0.offset (_ bv4 32)))) (bvule (bvadd .cse20 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem10.base| (store (store (store (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem10.base|) .cse21 v_DerPreprocessor_17) .cse22 v_DerPreprocessor_18) .cse23 v_DerPreprocessor_19) .cse24 v_DerPreprocessor_20)) c_ULTIMATE.start_create_data_~data~0.base) .cse25) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_#t~mem10.base| (store (store (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_#t~mem10.base|) .cse21 v_DerPreprocessor_25) .cse22 v_DerPreprocessor_26) .cse23 v_DerPreprocessor_27) .cse24 v_DerPreprocessor_28)) c_ULTIMATE.start_create_data_~data~0.base) .cse25)))))) (not (= c_ULTIMATE.start_create_data_~data~0.base |c_ULTIMATE.start_create_data_#t~malloc8.base|)) (= (_ bv80 32) (select |c_#length| .cse19)) (= |c_ULTIMATE.start_create_data_#t~malloc8.offset| (_ bv0 32)) (= (_ bv80 32) (select |c_#length| |c_ULTIMATE.start_create_data_#t~malloc8.base|)) (= (_ bv0 32) |c_ULTIMATE.start_create_data_#t~mem10.offset|)))) is different from true [2020-11-30 01:56:58,146 WARN L193 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2020-11-30 01:57:28,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:57:28,903 INFO L93 Difference]: Finished difference Result 161 states and 175 transitions. [2020-11-30 01:57:28,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-11-30 01:57:28,907 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 18 [2020-11-30 01:57:28,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:57:28,908 INFO L225 Difference]: With dead ends: 161 [2020-11-30 01:57:28,908 INFO L226 Difference]: Without dead ends: 161 [2020-11-30 01:57:28,909 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 76 SyntacticMatches, 7 SemanticMatches, 29 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 127.0s TimeCoverageRelationStatistics Valid=153, Invalid=484, Unknown=33, NotChecked=260, Total=930 [2020-11-30 01:57:28,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2020-11-30 01:57:28,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 109. [2020-11-30 01:57:28,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2020-11-30 01:57:28,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 120 transitions. [2020-11-30 01:57:28,922 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 120 transitions. Word has length 18 [2020-11-30 01:57:28,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:57:28,922 INFO L481 AbstractCegarLoop]: Abstraction has 109 states and 120 transitions. [2020-11-30 01:57:28,922 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-11-30 01:57:28,922 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 120 transitions. [2020-11-30 01:57:28,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-11-30 01:57:28,923 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:57:28,923 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:57:29,524 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 mathsat -unsat_core_generation=3,18 z3 -smt2 -in SMTLIB2_COMPLIANT=true,17 cvc4 --incremental --print-success --lang smt --rewrite-divk [2020-11-30 01:57:29,524 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39REQUIRES_VIOLATION]=== [2020-11-30 01:57:29,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:57:29,524 INFO L82 PathProgramCache]: Analyzing trace with hash -1493326340, now seen corresponding path program 1 times [2020-11-30 01:57:29,525 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-11-30 01:57:29,525 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1879524312] [2020-11-30 01:57:29,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7a200a14-127d-42c4-bf4c-6614499ca232/bin/utaipan/mathsat Starting monitored process 19 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with mathsat -unsat_core_generation=3 [2020-11-30 01:57:29,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:57:29,625 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 9 conjunts are in the unsatisfiable core [2020-11-30 01:57:29,626 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:57:29,641 INFO L384 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 [2020-11-30 01:57:29,641 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:57:29,652 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:57:29,652 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:57:29,652 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2020-11-30 01:57:29,677 INFO L384 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 11 treesize of output 7 [2020-11-30 01:57:29,677 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:57:29,693 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:57:29,694 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:57:29,694 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:11 [2020-11-30 01:57:29,712 INFO L384 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 19 treesize of output 11 [2020-11-30 01:57:29,712 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:57:29,715 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:57:29,715 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:57:29,715 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:7 [2020-11-30 01:57:29,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:57:29,727 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 01:57:29,732 INFO L384 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 36 treesize of output 32 [2020-11-30 01:57:29,733 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 01:57:29,767 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:57:29,767 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 01:57:29,767 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:32 [2020-11-30 01:57:29,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:57:29,921 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1879524312] [2020-11-30 01:57:29,921 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:57:29,921 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 5 [2020-11-30 01:57:29,922 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567779604] [2020-11-30 01:57:29,922 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-30 01:57:29,922 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-11-30 01:57:29,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-30 01:57:29,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-11-30 01:57:29,923 INFO L87 Difference]: Start difference. First operand 109 states and 120 transitions. Second operand 6 states. [2020-11-30 01:57:30,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:57:30,433 INFO L93 Difference]: Finished difference Result 144 states and 154 transitions. [2020-11-30 01:57:30,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-30 01:57:30,434 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2020-11-30 01:57:30,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:57:30,435 INFO L225 Difference]: With dead ends: 144 [2020-11-30 01:57:30,435 INFO L226 Difference]: Without dead ends: 144 [2020-11-30 01:57:30,436 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 25 SyntacticMatches, 7 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-11-30 01:57:30,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2020-11-30 01:57:30,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 109. [2020-11-30 01:57:30,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2020-11-30 01:57:30,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 119 transitions. [2020-11-30 01:57:30,439 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 119 transitions. Word has length 19 [2020-11-30 01:57:30,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:57:30,439 INFO L481 AbstractCegarLoop]: Abstraction has 109 states and 119 transitions. [2020-11-30 01:57:30,439 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-30 01:57:30,439 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 119 transitions. [2020-11-30 01:57:30,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-11-30 01:57:30,440 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:57:30,440 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:57:30,641 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 mathsat -unsat_core_generation=3 [2020-11-30 01:57:30,641 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39REQUIRES_VIOLATION]=== [2020-11-30 01:57:30,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:57:30,641 INFO L82 PathProgramCache]: Analyzing trace with hash -1493326339, now seen corresponding path program 1 times [2020-11-30 01:57:30,642 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-11-30 01:57:30,642 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [82926567] [2020-11-30 01:57:30,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7a200a14-127d-42c4-bf4c-6614499ca232/bin/utaipan/mathsat Starting monitored process 20 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with mathsat -unsat_core_generation=3 [2020-11-30 01:57:30,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:57:30,766 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 13 conjunts are in the unsatisfiable core [2020-11-30 01:57:30,768 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:57:30,777 INFO L384 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 [2020-11-30 01:57:30,777 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:57:30,790 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:57:30,790 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:57:30,790 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2020-11-30 01:57:30,817 INFO L384 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 11 treesize of output 7 [2020-11-30 01:57:30,817 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:57:30,831 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:57:30,835 INFO L384 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 11 treesize of output 7 [2020-11-30 01:57:30,835 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 01:57:30,845 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:57:30,846 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:57:30,846 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:19 [2020-11-30 01:57:30,865 INFO L384 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 [2020-11-30 01:57:30,866 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:57:30,875 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:57:30,877 INFO L384 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 17 treesize of output 9 [2020-11-30 01:57:30,877 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 01:57:30,882 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:57:30,882 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:57:30,882 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:31, output treesize:9 [2020-11-30 01:57:30,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:57:30,902 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 01:57:31,014 INFO L384 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 36 treesize of output 28 [2020-11-30 01:57:31,018 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2020-11-30 01:57:31,053 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:57:31,056 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 01:57:31,057 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 01:57:31,058 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 01:57:31,088 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:57:31,092 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 01:57:31,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 01:57:31,094 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-11-30 01:57:31,120 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:57:31,120 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 4 xjuncts. [2020-11-30 01:57:31,121 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:61, output treesize:19 [2020-11-30 01:57:31,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:57:31,184 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [82926567] [2020-11-30 01:57:31,184 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:57:31,184 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2020-11-30 01:57:31,184 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368117811] [2020-11-30 01:57:31,184 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-30 01:57:31,184 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-11-30 01:57:31,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-30 01:57:31,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-11-30 01:57:31,185 INFO L87 Difference]: Start difference. First operand 109 states and 119 transitions. Second operand 8 states. [2020-11-30 01:57:32,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:57:32,790 INFO L93 Difference]: Finished difference Result 239 states and 256 transitions. [2020-11-30 01:57:32,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-30 01:57:32,792 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-11-30 01:57:32,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:57:32,793 INFO L225 Difference]: With dead ends: 239 [2020-11-30 01:57:32,794 INFO L226 Difference]: Without dead ends: 239 [2020-11-30 01:57:32,794 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2020-11-30 01:57:32,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2020-11-30 01:57:32,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 108. [2020-11-30 01:57:32,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2020-11-30 01:57:32,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 117 transitions. [2020-11-30 01:57:32,799 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 117 transitions. Word has length 19 [2020-11-30 01:57:32,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:57:32,799 INFO L481 AbstractCegarLoop]: Abstraction has 108 states and 117 transitions. [2020-11-30 01:57:32,799 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-30 01:57:32,799 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 117 transitions. [2020-11-30 01:57:32,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-30 01:57:32,800 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:57:32,800 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:57:33,008 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 mathsat -unsat_core_generation=3 [2020-11-30 01:57:33,008 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39REQUIRES_VIOLATION]=== [2020-11-30 01:57:33,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:57:33,009 INFO L82 PathProgramCache]: Analyzing trace with hash -413674294, now seen corresponding path program 1 times [2020-11-30 01:57:33,009 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-11-30 01:57:33,009 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2068513023] [2020-11-30 01:57:33,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7a200a14-127d-42c4-bf4c-6614499ca232/bin/utaipan/mathsat Starting monitored process 21 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with mathsat -unsat_core_generation=3 [2020-11-30 01:57:33,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:57:33,115 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 25 conjunts are in the unsatisfiable core [2020-11-30 01:57:33,116 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:57:33,121 INFO L384 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 [2020-11-30 01:57:33,121 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:57:33,125 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:57:33,125 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:57:33,125 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-11-30 01:57:33,140 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:57:33,140 INFO L384 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 11 treesize of output 15 [2020-11-30 01:57:33,140 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:57:33,149 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:57:33,150 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:57:33,150 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2020-11-30 01:57:33,222 INFO L384 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 11 treesize of output 7 [2020-11-30 01:57:33,222 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:57:33,242 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:57:33,248 INFO L384 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 11 treesize of output 7 [2020-11-30 01:57:33,248 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 01:57:33,264 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:57:33,265 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:57:33,265 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:25 [2020-11-30 01:57:33,313 INFO L384 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 19 treesize of output 18 [2020-11-30 01:57:33,313 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:57:33,333 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:57:33,338 INFO L384 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 19 treesize of output 18 [2020-11-30 01:57:33,338 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 01:57:33,354 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:57:33,355 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:57:33,355 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:41, output treesize:39 [2020-11-30 01:57:33,448 INFO L384 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 32 [2020-11-30 01:57:33,449 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 01:57:33,463 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:57:33,484 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:57:33,484 INFO L384 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 26 [2020-11-30 01:57:33,485 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-11-30 01:57:33,486 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 01:57:33,491 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:57:33,492 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:57:33,492 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:69, output treesize:7 [2020-11-30 01:57:33,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:57:33,548 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 01:57:33,729 INFO L441 ElimStorePlain]: Different costs {2=[|#memory_$Pointer$.base|, v_prenex_234], 6=[|#memory_$Pointer$.offset|, v_prenex_235]} [2020-11-30 01:57:33,821 INFO L384 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 294 treesize of output 290 [2020-11-30 01:57:33,822 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 01:57:34,712 WARN L193 SmtUtils]: Spent 888.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2020-11-30 01:57:34,712 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:57:34,753 INFO L384 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 606 treesize of output 598 [2020-11-30 01:57:34,753 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 01:57:34,754 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:57:34,754 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:57:34,754 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:57:34,755 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:57:34,755 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:57:34,758 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 01:57:34,759 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:57:34,760 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:57:34,760 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:57:34,761 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:57:34,761 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:57:34,763 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 01:57:37,753 WARN L193 SmtUtils]: Spent 2.99 s on a formula simplification. DAG size of input: 85 DAG size of output: 74 [2020-11-30 01:57:37,754 INFO L625 ElimStorePlain]: treesize reduction 385, result has 56.7 percent of original size [2020-11-30 01:57:38,972 WARN L193 SmtUtils]: Spent 1.09 s on a formula simplification. DAG size of input: 138 DAG size of output: 96 [2020-11-30 01:57:38,972 INFO L350 Elim1Store]: treesize reduction 154, result has 56.6 percent of original size [2020-11-30 01:57:38,973 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 10 new quantified variables, introduced 36 case distinctions, treesize of input 4463 treesize of output 4235 [2020-11-30 01:57:38,977 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2068513023] [2020-11-30 01:57:38,978 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger out of long range [2020-11-30 01:57:38,978 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1901713805] [2020-11-30 01:57:38,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7a200a14-127d-42c4-bf4c-6614499ca232/bin/utaipan/cvc4 Starting monitored process 22 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2020-11-30 01:57:39,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:57:39,197 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 27 conjunts are in the unsatisfiable core [2020-11-30 01:57:39,199 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:57:39,509 INFO L384 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 11 treesize of output 7 [2020-11-30 01:57:39,509 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:57:39,541 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:57:39,549 INFO L384 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 11 treesize of output 7 [2020-11-30 01:57:39,549 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 01:57:39,576 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:57:39,576 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 01:57:39,577 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:30 [2020-11-30 01:57:39,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 01:57:39,694 INFO L384 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 19 treesize of output 18 [2020-11-30 01:57:39,694 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:57:39,736 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:57:39,748 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 01:57:39,750 INFO L384 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 19 treesize of output 18 [2020-11-30 01:57:39,751 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 01:57:39,780 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:57:39,780 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 01:57:39,781 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:46, output treesize:44 [2020-11-30 01:57:40,056 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 01:57:40,058 INFO L384 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 32 [2020-11-30 01:57:40,058 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 01:57:40,077 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:57:40,089 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:57:40,089 INFO L384 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 25 [2020-11-30 01:57:40,090 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-11-30 01:57:40,091 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-11-30 01:57:40,091 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 01:57:40,123 INFO L625 ElimStorePlain]: treesize reduction 12, result has 52.0 percent of original size [2020-11-30 01:57:40,125 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:57:40,125 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:71, output treesize:7 [2020-11-30 01:57:40,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:57:40,129 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 01:57:40,140 INFO L441 ElimStorePlain]: Different costs {2=[|#memory_$Pointer$.base|, v_prenex_237], 6=[|#memory_$Pointer$.offset|, v_prenex_238]} [2020-11-30 01:57:40,198 INFO L384 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 294 treesize of output 290 [2020-11-30 01:57:40,199 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 01:57:41,352 WARN L193 SmtUtils]: Spent 1.15 s on a formula simplification that was a NOOP. DAG size: 69 [2020-11-30 01:57:41,353 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:57:41,401 INFO L384 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 294 treesize of output 290 [2020-11-30 01:57:41,402 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 01:57:42,263 WARN L193 SmtUtils]: Spent 860.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2020-11-30 01:57:42,263 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:57:43,661 WARN L193 SmtUtils]: Spent 1.25 s on a formula simplification. DAG size of input: 166 DAG size of output: 112 [2020-11-30 01:57:43,674 INFO L350 Elim1Store]: treesize reduction 198, result has 55.2 percent of original size [2020-11-30 01:57:43,674 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 11 new quantified variables, introduced 45 case distinctions, treesize of input 8353 treesize of output 7856 [2020-11-30 01:57:43,677 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger out of long range [2020-11-30 01:57:43,677 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1063251468] [2020-11-30 01:57:43,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7a200a14-127d-42c4-bf4c-6614499ca232/bin/utaipan/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 01:57:43,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:57:43,746 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 25 conjunts are in the unsatisfiable core [2020-11-30 01:57:43,747 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:57:43,751 INFO L384 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 [2020-11-30 01:57:43,751 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:57:43,753 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:57:43,753 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:57:43,753 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-11-30 01:57:43,762 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:57:43,763 INFO L384 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 11 treesize of output 15 [2020-11-30 01:57:43,763 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:57:43,771 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:57:43,771 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:57:43,772 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2020-11-30 01:57:43,779 INFO L384 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 11 treesize of output 7 [2020-11-30 01:57:43,779 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:57:43,798 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:57:43,803 INFO L384 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 11 treesize of output 7 [2020-11-30 01:57:43,803 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 01:57:43,818 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:57:43,819 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:57:43,819 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:25 [2020-11-30 01:57:43,842 INFO L384 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 19 treesize of output 18 [2020-11-30 01:57:43,842 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 01:57:43,865 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:57:43,870 INFO L384 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 19 treesize of output 18 [2020-11-30 01:57:43,870 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 01:57:43,907 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:57:43,907 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:57:43,908 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:41, output treesize:39 [2020-11-30 01:57:43,933 INFO L384 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 32 [2020-11-30 01:57:43,934 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 01:57:43,951 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:57:43,967 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:57:43,968 INFO L384 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 26 [2020-11-30 01:57:43,968 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-11-30 01:57:43,970 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 01:57:43,978 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:57:43,979 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 01:57:43,979 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:69, output treesize:7 [2020-11-30 01:57:43,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:57:43,982 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 01:57:43,993 INFO L441 ElimStorePlain]: Different costs {2=[v_prenex_240, |#memory_$Pointer$.base|], 6=[|#memory_$Pointer$.offset|, v_prenex_241]} [2020-11-30 01:57:44,117 INFO L384 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 294 treesize of output 290 [2020-11-30 01:57:44,118 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 01:57:44,918 WARN L193 SmtUtils]: Spent 798.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2020-11-30 01:57:44,923 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:57:44,969 INFO L384 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 294 treesize of output 290 [2020-11-30 01:57:44,970 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 01:57:46,014 WARN L193 SmtUtils]: Spent 1.04 s on a formula simplification that was a NOOP. DAG size: 76 [2020-11-30 01:57:46,015 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 01:57:47,271 WARN L193 SmtUtils]: Spent 1.11 s on a formula simplification. DAG size of input: 138 DAG size of output: 96 [2020-11-30 01:57:47,271 INFO L350 Elim1Store]: treesize reduction 154, result has 56.6 percent of original size [2020-11-30 01:57:47,272 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 10 new quantified variables, introduced 36 case distinctions, treesize of input 4535 treesize of output 4235 [2020-11-30 01:57:47,274 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger out of long range [2020-11-30 01:57:47,274 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:57:47,274 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [] total 0 [2020-11-30 01:57:47,274 ERROR L205 FreeRefinementEngine]: Strategy WALRUS failed to provide any proof altough trace is infeasible [2020-11-30 01:57:47,274 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-30 01:57:47,879 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 mathsat -unsat_core_generation=3,22 cvc4 --incremental --print-success --lang smt --rewrite-divk,23 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 01:57:47,892 WARN L238 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2020-11-30 01:57:47,893 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.11 01:57:47 BoogieIcfgContainer [2020-11-30 01:57:47,893 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-30 01:57:47,894 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-30 01:57:47,894 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-30 01:57:47,894 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-30 01:57:47,894 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 01:47:52" (3/4) ... [2020-11-30 01:57:47,897 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-11-30 01:57:47,897 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-30 01:57:47,898 INFO L168 Benchmark]: Toolchain (without parser) took 596933.61 ms. Allocated memory was 67.1 MB in the beginning and 83.9 MB in the end (delta: 16.8 MB). Free memory was 46.6 MB in the beginning and 34.8 MB in the end (delta: 11.9 MB). Peak memory consumption was 28.5 MB. Max. memory is 16.1 GB. [2020-11-30 01:57:47,898 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 67.1 MB. Free memory is still 49.2 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-11-30 01:57:47,899 INFO L168 Benchmark]: CACSL2BoogieTranslator took 667.45 ms. Allocated memory is still 67.1 MB. Free memory was 46.5 MB in the beginning and 33.6 MB in the end (delta: 12.9 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2020-11-30 01:57:47,899 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.32 ms. Allocated memory is still 67.1 MB. Free memory was 33.6 MB in the beginning and 31.4 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-30 01:57:47,899 INFO L168 Benchmark]: Boogie Preprocessor took 49.04 ms. Allocated memory is still 67.1 MB. Free memory was 31.4 MB in the beginning and 29.5 MB in the end (delta: 1.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-30 01:57:47,900 INFO L168 Benchmark]: RCFGBuilder took 990.91 ms. Allocated memory was 67.1 MB in the beginning and 83.9 MB in the end (delta: 16.8 MB). Free memory was 29.5 MB in the beginning and 55.6 MB in the end (delta: -26.0 MB). Peak memory consumption was 7.9 MB. Max. memory is 16.1 GB. [2020-11-30 01:57:47,900 INFO L168 Benchmark]: TraceAbstraction took 595145.49 ms. Allocated memory is still 83.9 MB. Free memory was 55.1 MB in the beginning and 35.5 MB in the end (delta: 19.6 MB). Peak memory consumption was 39.6 MB. Max. memory is 16.1 GB. [2020-11-30 01:57:47,901 INFO L168 Benchmark]: Witness Printer took 3.67 ms. Allocated memory is still 83.9 MB. Free memory was 35.5 MB in the beginning and 34.8 MB in the end (delta: 741.8 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-30 01:57:47,903 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.27 ms. Allocated memory is still 67.1 MB. Free memory is still 49.2 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 667.45 ms. Allocated memory is still 67.1 MB. Free memory was 46.5 MB in the beginning and 33.6 MB in the end (delta: 12.9 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 68.32 ms. Allocated memory is still 67.1 MB. Free memory was 33.6 MB in the beginning and 31.4 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 49.04 ms. Allocated memory is still 67.1 MB. Free memory was 31.4 MB in the beginning and 29.5 MB in the end (delta: 1.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 990.91 ms. Allocated memory was 67.1 MB in the beginning and 83.9 MB in the end (delta: 16.8 MB). Free memory was 29.5 MB in the beginning and 55.6 MB in the end (delta: -26.0 MB). Peak memory consumption was 7.9 MB. Max. memory is 16.1 GB. * TraceAbstraction took 595145.49 ms. Allocated memory is still 83.9 MB. Free memory was 55.1 MB in the beginning and 35.5 MB in the end (delta: 19.6 MB). Peak memory consumption was 39.6 MB. Max. memory is 16.1 GB. * Witness Printer took 3.67 ms. Allocated memory is still 83.9 MB. Free memory was 35.5 MB in the beginning and 34.8 MB in the end (delta: 741.8 kB). There was no memory consumed. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 570]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: unable to decide satisfiability of path constraint. Possible FailurePath: [L582] struct node_t *list = ((void *)0); [L583] int dataNotFinished = 0; [L576] struct node_t *node = malloc(sizeof *node); [L577] EXPR \read(**pointerToList) [L577] node->next = *pointerToList [L550] COND TRUE __VERIFIER_nondet_int() [L551] return ((void *)0); [L578] node->data = create_data() [L579] *pointerToList = node [L586] COND FALSE !(__VERIFIER_nondet_int()) [L587] \read(*list) [L587] COND TRUE \read(*list) [L588] EXPR \read(*list) [L588] EXPR list->next [L588] struct node_t *next = list->next; [L589] EXPR \read(*list) [L589] list->data [L567] COND FALSE !(data == ((void *)0)) [L570] data->array - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 97 locations, 46 error locations. Started 1 CEGAR loops. VerificationResult: UNKNOWN, OverallTime: 595.0s, OverallIterations: 16, TraceHistogramMax: 2, AutomataDifference: 121.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1134 SDtfs, 3414 SDslu, 3805 SDs, 0 SdLazy, 4111 SolverSat, 189 SolverUnsat, 11 SolverUnknown, 0 SolverNotchecked, 88.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 519 GetRequests, 362 SyntacticMatches, 29 SemanticMatches, 128 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 338 ImplicationChecksByTransitivity, 173.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=109occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 1258 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 452.9s InterpolantComputationTime, 256 NumberOfCodeBlocks, 256 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 474 ConstructedInterpolants, 58 QuantifiedInterpolants, 147736 SizeOfPredicates, 195 NumberOfNonLiveVariables, 1572 ConjunctsInSsa, 174 ConjunctsInUnsatCore, 38 InterpolantComputations, 26 PerfectInterpolantSequences, 6/36 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [MP z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process Received shutdown request...