./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/ldv-memsafety/memleaks_test11_1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_c2ea65b5-aaea-47da-a0c6-b0febddd04df/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_c2ea65b5-aaea-47da-a0c6-b0febddd04df/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_c2ea65b5-aaea-47da-a0c6-b0febddd04df/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_c2ea65b5-aaea-47da-a0c6-b0febddd04df/bin/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/ldv-memsafety/memleaks_test11_1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_c2ea65b5-aaea-47da-a0c6-b0febddd04df/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_c2ea65b5-aaea-47da-a0c6-b0febddd04df/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 d58cec473cb766e48ec31cf93ef2517d91aaecb5 ........................................................................................................................................ Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_c2ea65b5-aaea-47da-a0c6-b0febddd04df/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_c2ea65b5-aaea-47da-a0c6-b0febddd04df/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_c2ea65b5-aaea-47da-a0c6-b0febddd04df/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_c2ea65b5-aaea-47da-a0c6-b0febddd04df/bin/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/ldv-memsafety/memleaks_test11_1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_c2ea65b5-aaea-47da-a0c6-b0febddd04df/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_c2ea65b5-aaea-47da-a0c6-b0febddd04df/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 d58cec473cb766e48ec31cf93ef2517d91aaecb5 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-free) --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 16:48:35,986 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 16:48:35,987 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 16:48:35,994 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 16:48:35,995 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 16:48:35,995 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 16:48:35,996 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 16:48:35,997 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 16:48:35,999 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 16:48:35,999 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 16:48:36,000 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 16:48:36,001 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 16:48:36,001 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 16:48:36,001 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 16:48:36,002 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 16:48:36,003 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 16:48:36,003 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 16:48:36,004 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 16:48:36,005 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 16:48:36,007 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 16:48:36,008 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 16:48:36,008 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 16:48:36,009 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 16:48:36,009 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 16:48:36,011 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 16:48:36,011 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 16:48:36,011 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 16:48:36,012 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 16:48:36,012 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 16:48:36,013 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 16:48:36,013 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 16:48:36,013 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 16:48:36,014 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 16:48:36,014 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 16:48:36,015 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 16:48:36,015 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 16:48:36,015 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 16:48:36,015 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 16:48:36,015 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 16:48:36,016 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 16:48:36,016 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 16:48:36,017 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_c2ea65b5-aaea-47da-a0c6-b0febddd04df/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2019-12-07 16:48:36,027 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 16:48:36,027 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 16:48:36,028 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 16:48:36,028 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 16:48:36,028 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 16:48:36,028 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 16:48:36,028 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 16:48:36,029 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 16:48:36,029 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 16:48:36,029 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 16:48:36,029 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 16:48:36,029 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 16:48:36,029 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 16:48:36,029 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 16:48:36,029 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 16:48:36,030 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 16:48:36,030 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 16:48:36,030 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 16:48:36,030 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 16:48:36,030 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 16:48:36,031 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 16:48:36,031 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 16:48:36,031 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 16:48:36,031 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-12-07 16:48:36,031 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-12-07 16:48:36,031 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-12-07 16:48:36,031 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 16:48:36,031 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 16:48:36,031 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 16:48:36,032 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 16:48:36,032 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 16:48:36,032 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 16:48:36,032 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 16:48:36,032 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 16:48:36,032 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 16:48:36,032 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 16:48:36,032 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 16:48:36,032 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 16:48:36,033 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 16:48:36,033 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 16:48:36,033 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_c2ea65b5-aaea-47da-a0c6-b0febddd04df/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 -> d58cec473cb766e48ec31cf93ef2517d91aaecb5 [2019-12-07 16:48:36,131 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 16:48:36,141 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 16:48:36,144 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 16:48:36,145 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 16:48:36,145 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 16:48:36,146 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_c2ea65b5-aaea-47da-a0c6-b0febddd04df/bin/utaipan/../../sv-benchmarks/c/ldv-memsafety/memleaks_test11_1.i [2019-12-07 16:48:36,189 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c2ea65b5-aaea-47da-a0c6-b0febddd04df/bin/utaipan/data/7306cbf19/188a191ae46849c1a94ab9d764985980/FLAGc30389e1d [2019-12-07 16:48:36,619 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 16:48:36,620 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_c2ea65b5-aaea-47da-a0c6-b0febddd04df/sv-benchmarks/c/ldv-memsafety/memleaks_test11_1.i [2019-12-07 16:48:36,630 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c2ea65b5-aaea-47da-a0c6-b0febddd04df/bin/utaipan/data/7306cbf19/188a191ae46849c1a94ab9d764985980/FLAGc30389e1d [2019-12-07 16:48:36,964 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_c2ea65b5-aaea-47da-a0c6-b0febddd04df/bin/utaipan/data/7306cbf19/188a191ae46849c1a94ab9d764985980 [2019-12-07 16:48:36,968 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 16:48:36,970 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 16:48:36,972 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 16:48:36,972 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 16:48:36,977 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 16:48:36,978 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 04:48:36" (1/1) ... [2019-12-07 16:48:36,981 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@411ad413 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:48:36, skipping insertion in model container [2019-12-07 16:48:36,981 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 04:48:36" (1/1) ... [2019-12-07 16:48:36,989 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 16:48:37,024 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 16:48:37,274 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 16:48:37,288 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) [2019-12-07 16:48:37,288 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@122d31fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:48:37, skipping insertion in model container [2019-12-07 16:48:37,288 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 16:48:37,288 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2019-12-07 16:48:37,290 INFO L168 Benchmark]: Toolchain (without parser) took 320.46 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 99.1 MB). Free memory was 935.5 MB in the beginning and 1.1 GB in the end (delta: -149.1 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. [2019-12-07 16:48:37,291 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 955.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 16:48:37,291 INFO L168 Benchmark]: CACSL2BoogieTranslator took 316.79 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 99.1 MB). Free memory was 935.5 MB in the beginning and 1.1 GB in the end (delta: -149.1 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. [2019-12-07 16:48:37,292 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 955.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 316.79 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 99.1 MB). Free memory was 935.5 MB in the beginning and 1.1 GB in the end (delta: -149.1 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 576]: Unsupported Syntax Found a cast between two array/pointer types where the value type is smaller than the cast-to type while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.25-f470102 [2019-12-07 16:48:38,421 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 16:48:38,422 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 16:48:38,430 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 16:48:38,430 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 16:48:38,431 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 16:48:38,433 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 16:48:38,434 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 16:48:38,436 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 16:48:38,437 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 16:48:38,438 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 16:48:38,439 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 16:48:38,439 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 16:48:38,439 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 16:48:38,440 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 16:48:38,441 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 16:48:38,442 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 16:48:38,442 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 16:48:38,444 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 16:48:38,445 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 16:48:38,447 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 16:48:38,448 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 16:48:38,449 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 16:48:38,449 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 16:48:38,451 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 16:48:38,452 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 16:48:38,452 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 16:48:38,452 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 16:48:38,453 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 16:48:38,453 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 16:48:38,454 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 16:48:38,454 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 16:48:38,455 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 16:48:38,455 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 16:48:38,456 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 16:48:38,457 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 16:48:38,457 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 16:48:38,457 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 16:48:38,458 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 16:48:38,458 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 16:48:38,459 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 16:48:38,460 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_c2ea65b5-aaea-47da-a0c6-b0febddd04df/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2019-12-07 16:48:38,473 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 16:48:38,473 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 16:48:38,474 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 16:48:38,474 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 16:48:38,474 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 16:48:38,474 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 16:48:38,475 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 16:48:38,475 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 16:48:38,475 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 16:48:38,475 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 16:48:38,476 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 16:48:38,476 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 16:48:38,476 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 16:48:38,476 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 16:48:38,477 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 16:48:38,477 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 16:48:38,477 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 16:48:38,477 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-12-07 16:48:38,477 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-12-07 16:48:38,477 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-12-07 16:48:38,478 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 16:48:38,478 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 16:48:38,478 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-12-07 16:48:38,478 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-12-07 16:48:38,478 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 16:48:38,479 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 16:48:38,479 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 16:48:38,479 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 16:48:38,479 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 16:48:38,479 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 16:48:38,479 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 16:48:38,480 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 16:48:38,480 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 16:48:38,480 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2019-12-07 16:48:38,480 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-12-07 16:48:38,480 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 16:48:38,481 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 16:48:38,481 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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_c2ea65b5-aaea-47da-a0c6-b0febddd04df/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 -> d58cec473cb766e48ec31cf93ef2517d91aaecb5 [2019-12-07 16:48:38,640 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 16:48:38,648 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 16:48:38,650 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 16:48:38,651 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 16:48:38,651 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 16:48:38,651 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_c2ea65b5-aaea-47da-a0c6-b0febddd04df/bin/utaipan/../../sv-benchmarks/c/ldv-memsafety/memleaks_test11_1.i [2019-12-07 16:48:38,688 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c2ea65b5-aaea-47da-a0c6-b0febddd04df/bin/utaipan/data/72088349d/65833bf0bcc94688b7e501f5a2cdb18e/FLAG3fd0192c3 [2019-12-07 16:48:39,177 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 16:48:39,178 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_c2ea65b5-aaea-47da-a0c6-b0febddd04df/sv-benchmarks/c/ldv-memsafety/memleaks_test11_1.i [2019-12-07 16:48:39,188 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c2ea65b5-aaea-47da-a0c6-b0febddd04df/bin/utaipan/data/72088349d/65833bf0bcc94688b7e501f5a2cdb18e/FLAG3fd0192c3 [2019-12-07 16:48:39,197 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_c2ea65b5-aaea-47da-a0c6-b0febddd04df/bin/utaipan/data/72088349d/65833bf0bcc94688b7e501f5a2cdb18e [2019-12-07 16:48:39,199 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 16:48:39,200 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 16:48:39,200 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 16:48:39,200 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 16:48:39,202 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 16:48:39,203 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 04:48:39" (1/1) ... [2019-12-07 16:48:39,204 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b5dd555 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:48:39, skipping insertion in model container [2019-12-07 16:48:39,205 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 04:48:39" (1/1) ... [2019-12-07 16:48:39,209 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 16:48:39,237 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 16:48:39,494 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 16:48:39,508 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2019-12-07 16:48:39,518 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 16:48:39,554 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 16:48:39,561 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 16:48:39,596 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 16:48:39,656 INFO L208 MainTranslator]: Completed translation [2019-12-07 16:48:39,657 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:48:39 WrapperNode [2019-12-07 16:48:39,657 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 16:48:39,657 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 16:48:39,657 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 16:48:39,658 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 16:48:39,663 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:48:39" (1/1) ... [2019-12-07 16:48:39,679 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:48:39" (1/1) ... [2019-12-07 16:48:39,698 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 16:48:39,698 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 16:48:39,698 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 16:48:39,698 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 16:48:39,705 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:48:39" (1/1) ... [2019-12-07 16:48:39,705 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:48:39" (1/1) ... [2019-12-07 16:48:39,708 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:48:39" (1/1) ... [2019-12-07 16:48:39,708 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:48:39" (1/1) ... [2019-12-07 16:48:39,715 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:48:39" (1/1) ... [2019-12-07 16:48:39,717 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:48:39" (1/1) ... [2019-12-07 16:48:39,718 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:48:39" (1/1) ... [2019-12-07 16:48:39,721 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 16:48:39,722 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 16:48:39,722 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 16:48:39,722 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 16:48:39,722 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:48:39" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c2ea65b5-aaea-47da-a0c6-b0febddd04df/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 [2019-12-07 16:48:39,761 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-07 16:48:39,761 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-07 16:48:39,761 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 16:48:39,762 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-12-07 16:48:39,762 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 16:48:39,762 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-12-07 16:48:39,762 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 16:48:39,762 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 16:48:40,107 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 16:48:40,107 INFO L287 CfgBuilder]: Removed 30 assume(true) statements. [2019-12-07 16:48:40,108 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 04:48:40 BoogieIcfgContainer [2019-12-07 16:48:40,108 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 16:48:40,109 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 16:48:40,109 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 16:48:40,111 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 16:48:40,111 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 04:48:39" (1/3) ... [2019-12-07 16:48:40,112 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19dd5182 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 04:48:40, skipping insertion in model container [2019-12-07 16:48:40,112 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:48:39" (2/3) ... [2019-12-07 16:48:40,112 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19dd5182 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 04:48:40, skipping insertion in model container [2019-12-07 16:48:40,112 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 04:48:40" (3/3) ... [2019-12-07 16:48:40,114 INFO L109 eAbstractionObserver]: Analyzing ICFG memleaks_test11_1.i [2019-12-07 16:48:40,121 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 16:48:40,126 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 32 error locations. [2019-12-07 16:48:40,133 INFO L249 AbstractCegarLoop]: Starting to check reachability of 32 error locations. [2019-12-07 16:48:40,146 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 16:48:40,147 INFO L374 AbstractCegarLoop]: Hoare is false [2019-12-07 16:48:40,147 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 16:48:40,147 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 16:48:40,147 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 16:48:40,147 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 16:48:40,147 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 16:48:40,147 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 16:48:40,159 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states. [2019-12-07 16:48:40,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-12-07 16:48:40,164 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:48:40,165 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-12-07 16:48:40,165 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 16:48:40,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:48:40,169 INFO L82 PathProgramCache]: Analyzing trace with hash 889508834, now seen corresponding path program 1 times [2019-12-07 16:48:40,177 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 16:48:40,177 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1167150126] [2019-12-07 16:48:40,178 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c2ea65b5-aaea-47da-a0c6-b0febddd04df/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 [2019-12-07 16:48:40,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:48:40,228 INFO L264 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 16:48:40,231 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:48:40,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:48:40,255 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:48:40,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:48:40,258 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1167150126] [2019-12-07 16:48:40,258 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:48:40,258 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-12-07 16:48:40,259 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968705226] [2019-12-07 16:48:40,262 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:48:40,262 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 16:48:40,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:48:40,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:48:40,273 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 4 states. [2019-12-07 16:48:40,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:48:40,411 INFO L93 Difference]: Finished difference Result 315 states and 337 transitions. [2019-12-07 16:48:40,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 16:48:40,412 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-12-07 16:48:40,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:48:40,421 INFO L225 Difference]: With dead ends: 315 [2019-12-07 16:48:40,421 INFO L226 Difference]: Without dead ends: 307 [2019-12-07 16:48:40,422 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 16:48:40,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2019-12-07 16:48:40,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 84. [2019-12-07 16:48:40,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-12-07 16:48:40,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 92 transitions. [2019-12-07 16:48:40,453 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 92 transitions. Word has length 6 [2019-12-07 16:48:40,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:48:40,454 INFO L462 AbstractCegarLoop]: Abstraction has 84 states and 92 transitions. [2019-12-07 16:48:40,454 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:48:40,454 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 92 transitions. [2019-12-07 16:48:40,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-12-07 16:48:40,454 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:48:40,454 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-12-07 16:48:40,655 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-12-07 16:48:40,656 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 16:48:40,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:48:40,656 INFO L82 PathProgramCache]: Analyzing trace with hash 889568416, now seen corresponding path program 1 times [2019-12-07 16:48:40,657 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 16:48:40,657 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [787256513] [2019-12-07 16:48:40,658 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c2ea65b5-aaea-47da-a0c6-b0febddd04df/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 [2019-12-07 16:48:40,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:48:40,725 INFO L264 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 16:48:40,726 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:48:40,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:48:40,735 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:48:40,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:48:40,738 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [787256513] [2019-12-07 16:48:40,738 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:48:40,738 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-12-07 16:48:40,739 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955330837] [2019-12-07 16:48:40,741 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:48:40,741 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 16:48:40,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:48:40,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:48:40,742 INFO L87 Difference]: Start difference. First operand 84 states and 92 transitions. Second operand 3 states. [2019-12-07 16:48:40,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:48:40,901 INFO L93 Difference]: Finished difference Result 160 states and 174 transitions. [2019-12-07 16:48:40,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:48:40,902 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2019-12-07 16:48:40,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:48:40,904 INFO L225 Difference]: With dead ends: 160 [2019-12-07 16:48:40,904 INFO L226 Difference]: Without dead ends: 159 [2019-12-07 16:48:40,905 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:48:40,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-12-07 16:48:40,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 82. [2019-12-07 16:48:40,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-12-07 16:48:40,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 89 transitions. [2019-12-07 16:48:40,914 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 89 transitions. Word has length 6 [2019-12-07 16:48:40,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:48:40,914 INFO L462 AbstractCegarLoop]: Abstraction has 82 states and 89 transitions. [2019-12-07 16:48:40,914 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:48:40,914 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 89 transitions. [2019-12-07 16:48:40,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 16:48:40,915 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:48:40,915 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:48:41,115 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-12-07 16:48:41,116 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 16:48:41,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:48:41,117 INFO L82 PathProgramCache]: Analyzing trace with hash -592189871, now seen corresponding path program 1 times [2019-12-07 16:48:41,118 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 16:48:41,118 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1986949065] [2019-12-07 16:48:41,118 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c2ea65b5-aaea-47da-a0c6-b0febddd04df/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 [2019-12-07 16:48:41,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:48:41,190 INFO L264 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 16:48:41,192 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:48:41,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:48:41,202 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:48:41,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:48:41,204 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1986949065] [2019-12-07 16:48:41,204 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:48:41,204 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-12-07 16:48:41,204 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526890670] [2019-12-07 16:48:41,205 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:48:41,205 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 16:48:41,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:48:41,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:48:41,205 INFO L87 Difference]: Start difference. First operand 82 states and 89 transitions. Second operand 4 states. [2019-12-07 16:48:41,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:48:41,290 INFO L93 Difference]: Finished difference Result 294 states and 311 transitions. [2019-12-07 16:48:41,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 16:48:41,290 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-12-07 16:48:41,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:48:41,292 INFO L225 Difference]: With dead ends: 294 [2019-12-07 16:48:41,292 INFO L226 Difference]: Without dead ends: 294 [2019-12-07 16:48:41,292 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 16:48:41,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2019-12-07 16:48:41,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 84. [2019-12-07 16:48:41,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-12-07 16:48:41,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 91 transitions. [2019-12-07 16:48:41,300 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 91 transitions. Word has length 9 [2019-12-07 16:48:41,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:48:41,300 INFO L462 AbstractCegarLoop]: Abstraction has 84 states and 91 transitions. [2019-12-07 16:48:41,300 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:48:41,300 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 91 transitions. [2019-12-07 16:48:41,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 16:48:41,301 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:48:41,301 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:48:41,501 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-12-07 16:48:41,502 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 16:48:41,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:48:41,503 INFO L82 PathProgramCache]: Analyzing trace with hash -592189907, now seen corresponding path program 1 times [2019-12-07 16:48:41,503 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 16:48:41,504 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1430472412] [2019-12-07 16:48:41,504 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c2ea65b5-aaea-47da-a0c6-b0febddd04df/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 [2019-12-07 16:48:41,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:48:41,574 INFO L264 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 16:48:41,575 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:48:41,610 INFO L377 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 [2019-12-07 16:48:41,611 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:48:41,614 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:48:41,614 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:48:41,614 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 16:48:41,643 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:48:41,643 INFO L377 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 [2019-12-07 16:48:41,645 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:48:41,658 INFO L614 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2019-12-07 16:48:41,659 INFO L534 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. [2019-12-07 16:48:41,659 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:11 [2019-12-07 16:48:41,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:48:41,667 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:48:41,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:48:41,681 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1430472412] [2019-12-07 16:48:41,681 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:48:41,681 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-12-07 16:48:41,681 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599467545] [2019-12-07 16:48:41,681 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:48:41,682 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 16:48:41,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:48:41,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:48:41,682 INFO L87 Difference]: Start difference. First operand 84 states and 91 transitions. Second operand 4 states. [2019-12-07 16:48:41,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:48:41,888 INFO L93 Difference]: Finished difference Result 190 states and 203 transitions. [2019-12-07 16:48:41,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 16:48:41,889 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-12-07 16:48:41,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:48:41,892 INFO L225 Difference]: With dead ends: 190 [2019-12-07 16:48:41,892 INFO L226 Difference]: Without dead ends: 190 [2019-12-07 16:48:41,893 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 16:48:41,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-12-07 16:48:41,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 95. [2019-12-07 16:48:41,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-12-07 16:48:41,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 107 transitions. [2019-12-07 16:48:41,901 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 107 transitions. Word has length 9 [2019-12-07 16:48:41,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:48:41,901 INFO L462 AbstractCegarLoop]: Abstraction has 95 states and 107 transitions. [2019-12-07 16:48:41,902 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:48:41,902 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 107 transitions. [2019-12-07 16:48:41,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 16:48:41,902 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:48:41,902 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:48:42,103 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-12-07 16:48:42,104 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 16:48:42,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:48:42,104 INFO L82 PathProgramCache]: Analyzing trace with hash -592189906, now seen corresponding path program 1 times [2019-12-07 16:48:42,104 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 16:48:42,105 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [58573856] [2019-12-07 16:48:42,105 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c2ea65b5-aaea-47da-a0c6-b0febddd04df/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 [2019-12-07 16:48:42,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:48:42,160 INFO L264 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-07 16:48:42,161 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:48:42,169 INFO L377 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 [2019-12-07 16:48:42,169 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:48:42,175 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:48:42,178 INFO L377 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 [2019-12-07 16:48:42,178 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 16:48:42,183 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:48:42,183 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:48:42,183 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-12-07 16:48:42,213 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:48:42,214 INFO L377 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 [2019-12-07 16:48:42,215 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:48:42,227 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:48:42,235 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:48:42,235 INFO L377 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 [2019-12-07 16:48:42,236 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 16:48:42,246 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:48:42,247 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:48:42,247 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:27, output treesize:11 [2019-12-07 16:48:42,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:48:42,260 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:48:42,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:48:42,485 INFO L430 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2019-12-07 16:48:42,492 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-12-07 16:48:42,492 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:48:42,499 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:48:42,501 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 16:48:42,501 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 16:48:42,509 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:48:42,509 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:48:42,510 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:21, output treesize:3 [2019-12-07 16:48:42,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:48:42,535 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [58573856] [2019-12-07 16:48:42,535 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:48:42,536 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2019-12-07 16:48:42,536 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353947823] [2019-12-07 16:48:42,536 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 16:48:42,536 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 16:48:42,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 16:48:42,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-12-07 16:48:42,537 INFO L87 Difference]: Start difference. First operand 95 states and 107 transitions. Second operand 10 states. [2019-12-07 16:48:43,458 WARN L192 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 36 [2019-12-07 16:49:04,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:49:04,824 INFO L93 Difference]: Finished difference Result 315 states and 334 transitions. [2019-12-07 16:49:04,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 16:49:04,825 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2019-12-07 16:49:04,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:49:04,826 INFO L225 Difference]: With dead ends: 315 [2019-12-07 16:49:04,827 INFO L226 Difference]: Without dead ends: 315 [2019-12-07 16:49:04,827 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2019-12-07 16:49:04,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2019-12-07 16:49:04,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 95. [2019-12-07 16:49:04,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-12-07 16:49:04,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 105 transitions. [2019-12-07 16:49:04,833 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 105 transitions. Word has length 9 [2019-12-07 16:49:04,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:49:04,834 INFO L462 AbstractCegarLoop]: Abstraction has 95 states and 105 transitions. [2019-12-07 16:49:04,834 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 16:49:04,834 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 105 transitions. [2019-12-07 16:49:04,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 16:49:04,834 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:49:04,835 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:49:05,035 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-12-07 16:49:05,036 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 16:49:05,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:49:05,036 INFO L82 PathProgramCache]: Analyzing trace with hash 1182817455, now seen corresponding path program 1 times [2019-12-07 16:49:05,036 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 16:49:05,037 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1210124471] [2019-12-07 16:49:05,037 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c2ea65b5-aaea-47da-a0c6-b0febddd04df/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 [2019-12-07 16:49:05,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:49:05,090 INFO L264 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 16:49:05,092 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:49:05,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:49:05,110 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:49:05,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:49:05,112 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1210124471] [2019-12-07 16:49:05,112 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:49:05,112 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-12-07 16:49:05,112 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693016560] [2019-12-07 16:49:05,113 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:49:05,113 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 16:49:05,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:49:05,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:49:05,113 INFO L87 Difference]: Start difference. First operand 95 states and 105 transitions. Second operand 4 states. [2019-12-07 16:49:05,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:49:05,169 INFO L93 Difference]: Finished difference Result 157 states and 166 transitions. [2019-12-07 16:49:05,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:49:05,170 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-12-07 16:49:05,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:49:05,171 INFO L225 Difference]: With dead ends: 157 [2019-12-07 16:49:05,171 INFO L226 Difference]: Without dead ends: 155 [2019-12-07 16:49:05,171 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 16:49:05,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-12-07 16:49:05,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 85. [2019-12-07 16:49:05,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-12-07 16:49:05,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 92 transitions. [2019-12-07 16:49:05,174 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 92 transitions. Word has length 9 [2019-12-07 16:49:05,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:49:05,174 INFO L462 AbstractCegarLoop]: Abstraction has 85 states and 92 transitions. [2019-12-07 16:49:05,174 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:49:05,175 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 92 transitions. [2019-12-07 16:49:05,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-07 16:49:05,175 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:49:05,175 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:49:05,375 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-12-07 16:49:05,376 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 16:49:05,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:49:05,376 INFO L82 PathProgramCache]: Analyzing trace with hash -1176169616, now seen corresponding path program 1 times [2019-12-07 16:49:05,377 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 16:49:05,377 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2125018979] [2019-12-07 16:49:05,377 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c2ea65b5-aaea-47da-a0c6-b0febddd04df/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 [2019-12-07 16:49:05,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:49:05,436 INFO L264 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 16:49:05,437 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:49:05,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:49:05,470 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:49:05,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:49:05,485 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2125018979] [2019-12-07 16:49:05,485 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:49:05,485 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 6 [2019-12-07 16:49:05,486 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10949469] [2019-12-07 16:49:05,486 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 16:49:05,486 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 16:49:05,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 16:49:05,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-07 16:49:05,486 INFO L87 Difference]: Start difference. First operand 85 states and 92 transitions. Second operand 7 states. [2019-12-07 16:49:05,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:49:05,606 INFO L93 Difference]: Finished difference Result 153 states and 161 transitions. [2019-12-07 16:49:05,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 16:49:05,607 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 10 [2019-12-07 16:49:05,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:49:05,607 INFO L225 Difference]: With dead ends: 153 [2019-12-07 16:49:05,607 INFO L226 Difference]: Without dead ends: 153 [2019-12-07 16:49:05,608 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-12-07 16:49:05,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-12-07 16:49:05,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 84. [2019-12-07 16:49:05,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-12-07 16:49:05,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 90 transitions. [2019-12-07 16:49:05,610 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 90 transitions. Word has length 10 [2019-12-07 16:49:05,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:49:05,610 INFO L462 AbstractCegarLoop]: Abstraction has 84 states and 90 transitions. [2019-12-07 16:49:05,610 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 16:49:05,610 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 90 transitions. [2019-12-07 16:49:05,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-12-07 16:49:05,611 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:49:05,611 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:49:05,811 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2019-12-07 16:49:05,812 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 16:49:05,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:49:05,812 INFO L82 PathProgramCache]: Analyzing trace with hash -722596971, now seen corresponding path program 1 times [2019-12-07 16:49:05,813 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 16:49:05,813 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1553238257] [2019-12-07 16:49:05,813 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c2ea65b5-aaea-47da-a0c6-b0febddd04df/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 [2019-12-07 16:49:05,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:49:05,870 INFO L264 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-07 16:49:05,871 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:49:05,883 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:49:05,883 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 25 [2019-12-07 16:49:05,883 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:49:05,894 INFO L614 ElimStorePlain]: treesize reduction 10, result has 60.0 percent of original size [2019-12-07 16:49:05,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:49:05,895 INFO L534 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. [2019-12-07 16:49:05,896 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:9, output treesize:15 [2019-12-07 16:49:05,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:49:05,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:49:05,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:49:05,983 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:49:08,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:49:08,034 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1553238257] [2019-12-07 16:49:08,034 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:49:08,034 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 10 [2019-12-07 16:49:08,034 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658597009] [2019-12-07 16:49:08,034 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 16:49:08,034 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 16:49:08,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 16:49:08,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=78, Unknown=1, NotChecked=0, Total=110 [2019-12-07 16:49:08,035 INFO L87 Difference]: Start difference. First operand 84 states and 90 transitions. Second operand 11 states. [2019-12-07 16:49:10,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:49:10,834 INFO L93 Difference]: Finished difference Result 170 states and 180 transitions. [2019-12-07 16:49:10,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 16:49:10,834 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 12 [2019-12-07 16:49:10,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:49:10,835 INFO L225 Difference]: With dead ends: 170 [2019-12-07 16:49:10,835 INFO L226 Difference]: Without dead ends: 166 [2019-12-07 16:49:10,836 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=46, Invalid=109, Unknown=1, NotChecked=0, Total=156 [2019-12-07 16:49:10,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-12-07 16:49:10,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 79. [2019-12-07 16:49:10,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-12-07 16:49:10,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 84 transitions. [2019-12-07 16:49:10,838 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 84 transitions. Word has length 12 [2019-12-07 16:49:10,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:49:10,838 INFO L462 AbstractCegarLoop]: Abstraction has 79 states and 84 transitions. [2019-12-07 16:49:10,838 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 16:49:10,838 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 84 transitions. [2019-12-07 16:49:10,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 16:49:10,838 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:49:10,838 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:49:11,039 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2019-12-07 16:49:11,039 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 16:49:11,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:49:11,040 INFO L82 PathProgramCache]: Analyzing trace with hash -493394203, now seen corresponding path program 1 times [2019-12-07 16:49:11,040 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 16:49:11,040 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1269688633] [2019-12-07 16:49:11,041 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c2ea65b5-aaea-47da-a0c6-b0febddd04df/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 [2019-12-07 16:49:11,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:49:11,109 INFO L264 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 16:49:11,110 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:49:11,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:49:11,116 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:49:11,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:49:11,118 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1269688633] [2019-12-07 16:49:11,118 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:49:11,118 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-12-07 16:49:11,118 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087465034] [2019-12-07 16:49:11,118 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:49:11,118 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 16:49:11,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:49:11,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:49:11,118 INFO L87 Difference]: Start difference. First operand 79 states and 84 transitions. Second operand 4 states. [2019-12-07 16:49:11,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:49:11,167 INFO L93 Difference]: Finished difference Result 255 states and 266 transitions. [2019-12-07 16:49:11,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 16:49:11,167 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-07 16:49:11,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:49:11,168 INFO L225 Difference]: With dead ends: 255 [2019-12-07 16:49:11,168 INFO L226 Difference]: Without dead ends: 255 [2019-12-07 16:49:11,168 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 16:49:11,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2019-12-07 16:49:11,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 81. [2019-12-07 16:49:11,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-12-07 16:49:11,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 86 transitions. [2019-12-07 16:49:11,171 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 86 transitions. Word has length 14 [2019-12-07 16:49:11,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:49:11,171 INFO L462 AbstractCegarLoop]: Abstraction has 81 states and 86 transitions. [2019-12-07 16:49:11,171 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:49:11,171 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 86 transitions. [2019-12-07 16:49:11,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 16:49:11,171 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:49:11,171 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:49:11,372 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 mathsat -unsat_core_generation=3 [2019-12-07 16:49:11,372 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 16:49:11,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:49:11,372 INFO L82 PathProgramCache]: Analyzing trace with hash -493394216, now seen corresponding path program 1 times [2019-12-07 16:49:11,373 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 16:49:11,373 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1158442852] [2019-12-07 16:49:11,373 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c2ea65b5-aaea-47da-a0c6-b0febddd04df/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 [2019-12-07 16:49:11,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:49:11,416 INFO L264 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 16:49:11,417 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:49:11,420 INFO L377 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 [2019-12-07 16:49:11,421 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:49:11,422 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:49:11,423 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:49:11,423 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 16:49:11,445 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:49:11,445 INFO L377 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 [2019-12-07 16:49:11,446 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:49:11,460 INFO L614 ElimStorePlain]: treesize reduction 14, result has 51.7 percent of original size [2019-12-07 16:49:11,461 INFO L534 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. [2019-12-07 16:49:11,461 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:15 [2019-12-07 16:49:11,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:49:11,474 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:49:11,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:49:11,503 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1158442852] [2019-12-07 16:49:11,503 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:49:11,503 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 16:49:11,503 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778524736] [2019-12-07 16:49:11,504 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 16:49:11,504 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 16:49:11,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 16:49:11,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 16:49:11,504 INFO L87 Difference]: Start difference. First operand 81 states and 86 transitions. Second operand 7 states. [2019-12-07 16:49:11,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:49:11,851 INFO L93 Difference]: Finished difference Result 221 states and 234 transitions. [2019-12-07 16:49:11,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 16:49:11,852 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2019-12-07 16:49:11,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:49:11,853 INFO L225 Difference]: With dead ends: 221 [2019-12-07 16:49:11,853 INFO L226 Difference]: Without dead ends: 221 [2019-12-07 16:49:11,853 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2019-12-07 16:49:11,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2019-12-07 16:49:11,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 94. [2019-12-07 16:49:11,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-12-07 16:49:11,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 104 transitions. [2019-12-07 16:49:11,855 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 104 transitions. Word has length 14 [2019-12-07 16:49:11,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:49:11,856 INFO L462 AbstractCegarLoop]: Abstraction has 94 states and 104 transitions. [2019-12-07 16:49:11,856 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 16:49:11,856 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 104 transitions. [2019-12-07 16:49:11,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 16:49:11,856 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:49:11,856 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:49:12,056 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 mathsat -unsat_core_generation=3 [2019-12-07 16:49:12,057 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 16:49:12,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:49:12,058 INFO L82 PathProgramCache]: Analyzing trace with hash -493394215, now seen corresponding path program 1 times [2019-12-07 16:49:12,058 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 16:49:12,058 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2092215131] [2019-12-07 16:49:12,058 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c2ea65b5-aaea-47da-a0c6-b0febddd04df/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 [2019-12-07 16:49:12,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:49:12,113 INFO L264 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-07 16:49:12,114 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:49:12,121 INFO L377 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 [2019-12-07 16:49:12,122 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:49:12,127 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:49:12,129 INFO L377 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 [2019-12-07 16:49:12,129 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 16:49:12,134 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:49:12,134 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:49:12,135 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-12-07 16:49:12,160 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:49:12,161 INFO L377 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 14 treesize of output 16 [2019-12-07 16:49:12,161 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:49:12,171 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:49:12,178 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:49:12,178 INFO L377 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 [2019-12-07 16:49:12,179 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 16:49:12,188 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:49:12,188 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:49:12,188 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:9 [2019-12-07 16:49:12,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:49:12,199 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:49:12,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:49:12,527 INFO L430 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2019-12-07 16:49:12,532 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-12-07 16:49:12,533 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:49:12,540 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:49:12,542 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 16:49:12,543 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 16:49:12,550 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:49:12,551 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:49:12,551 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:21, output treesize:3 [2019-12-07 16:49:12,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:49:12,582 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2092215131] [2019-12-07 16:49:12,582 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:49:12,583 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2019-12-07 16:49:12,583 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992575427] [2019-12-07 16:49:12,583 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 16:49:12,583 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 16:49:12,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 16:49:12,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-12-07 16:49:12,584 INFO L87 Difference]: Start difference. First operand 94 states and 104 transitions. Second operand 10 states. [2019-12-07 16:49:13,105 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 34 [2019-12-07 16:49:14,103 WARN L192 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 36 [2019-12-07 16:49:33,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:49:33,817 INFO L93 Difference]: Finished difference Result 306 states and 317 transitions. [2019-12-07 16:49:33,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-07 16:49:33,818 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 14 [2019-12-07 16:49:33,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:49:33,819 INFO L225 Difference]: With dead ends: 306 [2019-12-07 16:49:33,819 INFO L226 Difference]: Without dead ends: 306 [2019-12-07 16:49:33,820 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 15 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=149, Invalid=357, Unknown=0, NotChecked=0, Total=506 [2019-12-07 16:49:33,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2019-12-07 16:49:33,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 118. [2019-12-07 16:49:33,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-12-07 16:49:33,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 143 transitions. [2019-12-07 16:49:33,824 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 143 transitions. Word has length 14 [2019-12-07 16:49:33,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:49:33,824 INFO L462 AbstractCegarLoop]: Abstraction has 118 states and 143 transitions. [2019-12-07 16:49:33,824 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 16:49:33,824 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 143 transitions. [2019-12-07 16:49:33,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 16:49:33,825 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:49:33,825 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:49:34,025 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 mathsat -unsat_core_generation=3 [2019-12-07 16:49:34,026 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 16:49:34,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:49:34,026 INFO L82 PathProgramCache]: Analyzing trace with hash 186664154, now seen corresponding path program 1 times [2019-12-07 16:49:34,027 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 16:49:34,027 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1329984084] [2019-12-07 16:49:34,027 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c2ea65b5-aaea-47da-a0c6-b0febddd04df/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 [2019-12-07 16:49:34,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:49:34,095 INFO L264 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 16:49:34,096 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:49:34,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:49:34,125 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:49:34,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:49:34,128 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1329984084] [2019-12-07 16:49:34,128 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:49:34,128 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-12-07 16:49:34,128 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676050820] [2019-12-07 16:49:34,129 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:49:34,129 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 16:49:34,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:49:34,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:49:34,129 INFO L87 Difference]: Start difference. First operand 118 states and 143 transitions. Second operand 4 states. [2019-12-07 16:49:34,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:49:34,200 INFO L93 Difference]: Finished difference Result 173 states and 197 transitions. [2019-12-07 16:49:34,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:49:34,200 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-07 16:49:34,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:49:34,201 INFO L225 Difference]: With dead ends: 173 [2019-12-07 16:49:34,201 INFO L226 Difference]: Without dead ends: 171 [2019-12-07 16:49:34,201 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 16:49:34,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-12-07 16:49:34,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 95. [2019-12-07 16:49:34,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-12-07 16:49:34,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 109 transitions. [2019-12-07 16:49:34,204 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 109 transitions. Word has length 14 [2019-12-07 16:49:34,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:49:34,204 INFO L462 AbstractCegarLoop]: Abstraction has 95 states and 109 transitions. [2019-12-07 16:49:34,204 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:49:34,204 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 109 transitions. [2019-12-07 16:49:34,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 16:49:34,204 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:49:34,205 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:49:34,405 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 mathsat -unsat_core_generation=3 [2019-12-07 16:49:34,405 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 16:49:34,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:49:34,406 INFO L82 PathProgramCache]: Analyzing trace with hash 1886496085, now seen corresponding path program 1 times [2019-12-07 16:49:34,406 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 16:49:34,406 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [107906016] [2019-12-07 16:49:34,407 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c2ea65b5-aaea-47da-a0c6-b0febddd04df/bin/utaipan/mathsat Starting monitored process 14 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with mathsat -unsat_core_generation=3 [2019-12-07 16:49:34,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:49:34,478 INFO L264 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 16:49:34,479 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:49:34,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:49:34,532 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:49:34,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:49:34,554 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [107906016] [2019-12-07 16:49:34,554 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:49:34,554 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 3] imperfect sequences [] total 7 [2019-12-07 16:49:34,555 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243090762] [2019-12-07 16:49:34,555 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 16:49:34,555 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 16:49:34,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 16:49:34,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 16:49:34,555 INFO L87 Difference]: Start difference. First operand 95 states and 109 transitions. Second operand 8 states. [2019-12-07 16:49:34,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:49:34,675 INFO L93 Difference]: Finished difference Result 94 states and 107 transitions. [2019-12-07 16:49:34,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 16:49:34,675 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2019-12-07 16:49:34,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:49:34,676 INFO L225 Difference]: With dead ends: 94 [2019-12-07 16:49:34,676 INFO L226 Difference]: Without dead ends: 94 [2019-12-07 16:49:34,676 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-07 16:49:34,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-12-07 16:49:34,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2019-12-07 16:49:34,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-12-07 16:49:34,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 107 transitions. [2019-12-07 16:49:34,678 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 107 transitions. Word has length 15 [2019-12-07 16:49:34,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:49:34,679 INFO L462 AbstractCegarLoop]: Abstraction has 94 states and 107 transitions. [2019-12-07 16:49:34,679 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 16:49:34,679 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 107 transitions. [2019-12-07 16:49:34,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 16:49:34,679 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:49:34,679 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:49:34,880 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 mathsat -unsat_core_generation=3 [2019-12-07 16:49:34,880 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 16:49:34,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:49:34,881 INFO L82 PathProgramCache]: Analyzing trace with hash -1705438503, now seen corresponding path program 1 times [2019-12-07 16:49:34,881 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 16:49:34,881 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [251995714] [2019-12-07 16:49:34,881 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c2ea65b5-aaea-47da-a0c6-b0febddd04df/bin/utaipan/mathsat Starting monitored process 15 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with mathsat -unsat_core_generation=3 [2019-12-07 16:49:34,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:49:34,973 INFO L264 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-07 16:49:34,974 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:49:34,993 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:49:34,994 INFO L377 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 [2019-12-07 16:49:34,994 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:49:35,008 INFO L614 ElimStorePlain]: treesize reduction 14, result has 51.7 percent of original size [2019-12-07 16:49:35,008 INFO L534 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. [2019-12-07 16:49:35,008 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:15 [2019-12-07 16:49:35,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:49:35,030 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:49:35,054 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:49:35,054 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2019-12-07 16:49:35,054 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:49:35,055 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:49:35,055 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:49:35,055 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:1 [2019-12-07 16:49:35,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:49:35,056 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [251995714] [2019-12-07 16:49:35,056 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:49:35,056 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 16:49:35,056 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717152051] [2019-12-07 16:49:35,056 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 16:49:35,056 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 16:49:35,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 16:49:35,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 16:49:35,057 INFO L87 Difference]: Start difference. First operand 94 states and 107 transitions. Second operand 7 states. [2019-12-07 16:49:35,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:49:35,352 INFO L93 Difference]: Finished difference Result 154 states and 165 transitions. [2019-12-07 16:49:35,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 16:49:35,353 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2019-12-07 16:49:35,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:49:35,354 INFO L225 Difference]: With dead ends: 154 [2019-12-07 16:49:35,354 INFO L226 Difference]: Without dead ends: 154 [2019-12-07 16:49:35,354 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-12-07 16:49:35,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-12-07 16:49:35,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 93. [2019-12-07 16:49:35,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-12-07 16:49:35,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 106 transitions. [2019-12-07 16:49:35,356 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 106 transitions. Word has length 16 [2019-12-07 16:49:35,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:49:35,356 INFO L462 AbstractCegarLoop]: Abstraction has 93 states and 106 transitions. [2019-12-07 16:49:35,356 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 16:49:35,356 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 106 transitions. [2019-12-07 16:49:35,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 16:49:35,357 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:49:35,357 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:49:35,557 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 mathsat -unsat_core_generation=3 [2019-12-07 16:49:35,557 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 16:49:35,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:49:35,558 INFO L82 PathProgramCache]: Analyzing trace with hash -1705438502, now seen corresponding path program 1 times [2019-12-07 16:49:35,558 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 16:49:35,558 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1554816100] [2019-12-07 16:49:35,559 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c2ea65b5-aaea-47da-a0c6-b0febddd04df/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 [2019-12-07 16:49:35,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:49:35,652 INFO L264 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 19 conjunts are in the unsatisfiable core [2019-12-07 16:49:35,653 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:49:35,660 INFO L377 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 [2019-12-07 16:49:35,660 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:49:35,665 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:49:35,667 INFO L377 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 [2019-12-07 16:49:35,667 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 16:49:35,672 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:49:35,672 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:49:35,672 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-12-07 16:49:35,698 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:49:35,698 INFO L377 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 [2019-12-07 16:49:35,698 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:49:35,706 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:49:35,709 INFO L377 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 [2019-12-07 16:49:35,709 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 16:49:35,717 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:49:35,717 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:49:35,717 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:27, output treesize:11 [2019-12-07 16:49:35,735 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:49:35,736 INFO L377 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 [2019-12-07 16:49:35,736 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:49:35,746 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:49:35,753 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:49:35,753 INFO L377 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 [2019-12-07 16:49:35,753 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 16:49:35,762 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:49:35,762 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:49:35,762 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:27, output treesize:11 [2019-12-07 16:49:35,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:49:35,774 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:49:35,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:49:36,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:49:36,029 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:49:36,030 INFO L377 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 [2019-12-07 16:49:36,030 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:49:36,049 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:49:36,050 INFO L377 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 [2019-12-07 16:49:36,050 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 16:49:36,075 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:49:36,075 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-12-07 16:49:36,075 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:42, output treesize:20 [2019-12-07 16:49:36,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:49:36,385 INFO L430 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2019-12-07 16:49:36,391 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-12-07 16:49:36,391 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:49:36,400 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:49:36,402 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 16:49:36,402 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 16:49:36,408 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:49:36,409 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:49:36,409 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:21, output treesize:3 [2019-12-07 16:49:36,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:49:36,443 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1554816100] [2019-12-07 16:49:36,443 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:49:36,443 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 11 [2019-12-07 16:49:36,443 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2701284] [2019-12-07 16:49:36,444 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 16:49:36,444 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 16:49:36,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 16:49:36,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-12-07 16:49:36,444 INFO L87 Difference]: Start difference. First operand 93 states and 106 transitions. Second operand 12 states. [2019-12-07 16:49:53,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:49:53,739 INFO L93 Difference]: Finished difference Result 191 states and 203 transitions. [2019-12-07 16:49:53,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 16:49:53,740 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 16 [2019-12-07 16:49:53,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:49:53,741 INFO L225 Difference]: With dead ends: 191 [2019-12-07 16:49:53,741 INFO L226 Difference]: Without dead ends: 191 [2019-12-07 16:49:53,741 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 15 SyntacticMatches, 5 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=130, Invalid=332, Unknown=0, NotChecked=0, Total=462 [2019-12-07 16:49:53,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2019-12-07 16:49:53,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 91. [2019-12-07 16:49:53,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-12-07 16:49:53,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 104 transitions. [2019-12-07 16:49:53,743 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 104 transitions. Word has length 16 [2019-12-07 16:49:53,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:49:53,743 INFO L462 AbstractCegarLoop]: Abstraction has 91 states and 104 transitions. [2019-12-07 16:49:53,743 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 16:49:53,743 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 104 transitions. [2019-12-07 16:49:53,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 16:49:53,744 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:49:53,744 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:49:53,944 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 mathsat -unsat_core_generation=3 [2019-12-07 16:49:53,945 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 16:49:53,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:49:53,945 INFO L82 PathProgramCache]: Analyzing trace with hash 1751106330, now seen corresponding path program 1 times [2019-12-07 16:49:53,945 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 16:49:53,945 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [590953850] [2019-12-07 16:49:53,946 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c2ea65b5-aaea-47da-a0c6-b0febddd04df/bin/utaipan/mathsat Starting monitored process 17 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with mathsat -unsat_core_generation=3 [2019-12-07 16:49:54,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:49:54,034 INFO L264 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 23 conjunts are in the unsatisfiable core [2019-12-07 16:49:54,035 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:49:54,054 INFO L377 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 [2019-12-07 16:49:54,055 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:49:54,060 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:49:54,060 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:49:54,060 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:14 [2019-12-07 16:49:54,074 INFO L377 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 [2019-12-07 16:49:54,074 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:49:54,082 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:49:54,082 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:49:54,082 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:19 [2019-12-07 16:49:54,131 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:49:54,132 INFO L377 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 1 case distinctions, treesize of input 29 treesize of output 39 [2019-12-07 16:49:54,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:49:54,133 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-07 16:49:54,167 INFO L614 ElimStorePlain]: treesize reduction 23, result has 68.5 percent of original size [2019-12-07 16:49:54,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:49:54,168 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:49:54,168 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:49 [2019-12-07 16:49:54,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:49:54,226 INFO L377 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 [2019-12-07 16:49:54,227 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:49:54,233 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:49:54,233 INFO L377 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 [2019-12-07 16:49:54,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:49:54,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:49:54,235 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 16:49:54,257 INFO L614 ElimStorePlain]: treesize reduction 8, result has 74.2 percent of original size [2019-12-07 16:49:54,258 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-12-07 16:49:54,258 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:53, output treesize:23 [2019-12-07 16:49:54,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:49:54,292 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:49:54,404 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:49:54,404 INFO L377 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 67 treesize of output 71 [2019-12-07 16:49:54,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:49:54,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:49:54,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:49:54,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:49:54,406 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:49:54,447 INFO L614 ElimStorePlain]: treesize reduction 26, result has 54.4 percent of original size [2019-12-07 16:49:54,447 INFO L534 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. [2019-12-07 16:49:54,447 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:31 [2019-12-07 16:49:54,490 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:49:54,491 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:49:54,491 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:49:54,491 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:63, output treesize:1 [2019-12-07 16:49:54,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:49:54,493 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [590953850] [2019-12-07 16:49:54,493 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:49:54,493 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12, 8] imperfect sequences [] total 17 [2019-12-07 16:49:54,493 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896668576] [2019-12-07 16:49:54,493 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-07 16:49:54,493 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 16:49:54,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-07 16:49:54,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2019-12-07 16:49:54,494 INFO L87 Difference]: Start difference. First operand 91 states and 104 transitions. Second operand 18 states. [2019-12-07 16:49:54,881 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2019-12-07 16:49:55,155 WARN L192 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2019-12-07 16:49:55,400 WARN L192 SmtUtils]: Spent 176.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-12-07 16:49:55,691 WARN L192 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2019-12-07 16:49:56,011 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2019-12-07 16:49:56,264 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2019-12-07 16:49:56,453 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2019-12-07 16:49:57,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:49:57,221 INFO L93 Difference]: Finished difference Result 142 states and 153 transitions. [2019-12-07 16:49:57,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-07 16:49:57,221 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2019-12-07 16:49:57,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:49:57,222 INFO L225 Difference]: With dead ends: 142 [2019-12-07 16:49:57,222 INFO L226 Difference]: Without dead ends: 142 [2019-12-07 16:49:57,223 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=296, Invalid=964, Unknown=0, NotChecked=0, Total=1260 [2019-12-07 16:49:57,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-12-07 16:49:57,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 82. [2019-12-07 16:49:57,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-12-07 16:49:57,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 87 transitions. [2019-12-07 16:49:57,225 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 87 transitions. Word has length 18 [2019-12-07 16:49:57,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:49:57,225 INFO L462 AbstractCegarLoop]: Abstraction has 82 states and 87 transitions. [2019-12-07 16:49:57,225 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-07 16:49:57,225 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 87 transitions. [2019-12-07 16:49:57,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 16:49:57,226 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:49:57,226 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:49:57,426 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 mathsat -unsat_core_generation=3 [2019-12-07 16:49:57,426 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 16:49:57,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:49:57,427 INFO L82 PathProgramCache]: Analyzing trace with hash 1751106331, now seen corresponding path program 1 times [2019-12-07 16:49:57,427 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 16:49:57,427 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1035270142] [2019-12-07 16:49:57,428 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c2ea65b5-aaea-47da-a0c6-b0febddd04df/bin/utaipan/mathsat Starting monitored process 18 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with mathsat -unsat_core_generation=3 [2019-12-07 16:49:57,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:49:57,512 INFO L264 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 28 conjunts are in the unsatisfiable core [2019-12-07 16:49:57,514 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:49:57,517 INFO L377 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 [2019-12-07 16:49:57,517 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:49:57,518 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:49:57,518 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:49:57,518 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 16:49:57,532 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_55|], 3=[|v_#valid_85|]} [2019-12-07 16:49:57,534 INFO L377 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 [2019-12-07 16:49:57,534 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:49:57,543 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:49:57,557 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:49:57,557 INFO L377 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 [2019-12-07 16:49:57,557 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 16:49:57,578 INFO L614 ElimStorePlain]: treesize reduction 14, result has 62.2 percent of original size [2019-12-07 16:49:57,578 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:49:57,578 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:23 [2019-12-07 16:49:57,614 INFO L377 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 11 treesize of output 7 [2019-12-07 16:49:57,614 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:49:57,638 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:49:57,642 INFO L377 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 11 treesize of output 7 [2019-12-07 16:49:57,642 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 16:49:57,657 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:49:57,657 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:49:57,658 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:43 [2019-12-07 16:49:57,684 INFO L430 ElimStorePlain]: Different costs {1=[|v_#length_56|], 3=[|v_#valid_86|]} [2019-12-07 16:49:57,689 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:49:57,689 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2019-12-07 16:49:57,690 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:49:57,712 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:49:57,726 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:49:57,727 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 30 [2019-12-07 16:49:57,727 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 16:49:57,746 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:49:57,747 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:49:57,747 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:54, output treesize:29 [2019-12-07 16:49:57,795 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:49:57,795 INFO L377 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 1 case distinctions, treesize of input 56 treesize of output 62 [2019-12-07 16:49:57,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:49:57,796 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:49:57,829 INFO L614 ElimStorePlain]: treesize reduction 20, result has 73.3 percent of original size [2019-12-07 16:49:57,832 INFO L377 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 27 treesize of output 22 [2019-12-07 16:49:57,832 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 16:49:57,844 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:49:57,844 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:49:57,845 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:63, output treesize:25 [2019-12-07 16:49:57,888 INFO L377 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 27 treesize of output 15 [2019-12-07 16:49:57,888 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:49:57,896 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:49:57,898 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 15 treesize of output 7 [2019-12-07 16:49:57,898 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 16:49:57,904 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:49:57,904 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:49:57,904 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:41, output treesize:9 [2019-12-07 16:49:57,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:49:57,940 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:49:58,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:50:08,779 WARN L192 SmtUtils]: Spent 4.09 s on a formula simplification that was a NOOP. DAG size: 44 [2019-12-07 16:50:19,473 WARN L192 SmtUtils]: Spent 2.09 s on a formula simplification that was a NOOP. DAG size: 48 [2019-12-07 16:50:19,483 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:50:19,629 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2019-12-07 16:50:19,629 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:50:19,638 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 16:50:19,938 WARN L192 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 49 [2019-12-07 16:50:19,938 INFO L614 ElimStorePlain]: treesize reduction 56, result has 66.9 percent of original size [2019-12-07 16:50:19,945 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 16:50:20,108 WARN L192 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2019-12-07 16:50:20,108 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:50:20,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:50:20,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:50:20,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:50:20,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:50:20,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:50:20,114 INFO L534 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 3 dim-2 vars, End of recursive call: 14 dim-0 vars, and 5 xjuncts. [2019-12-07 16:50:20,114 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 11 variables, input treesize:142, output treesize:116 [2019-12-07 16:50:20,535 WARN L192 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 34 [2019-12-07 16:50:21,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:50:21,016 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 16:50:21,019 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 53 [2019-12-07 16:50:21,019 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 16:50:21,165 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2019-12-07 16:50:21,165 INFO L614 ElimStorePlain]: treesize reduction 15, result has 82.4 percent of original size [2019-12-07 16:50:21,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:50:21,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:50:21,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:50:21,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:50:21,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:50:21,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:50:21,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:50:21,176 INFO L534 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-12-07 16:50:21,176 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:57, output treesize:70 [2019-12-07 16:50:21,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:50:21,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:50:21,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:50:21,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:50:21,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:50:21,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:50:21,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:50:21,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:50:21,531 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1035270142] [2019-12-07 16:50:21,531 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:50:21,531 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12, 13] imperfect sequences [] total 24 [2019-12-07 16:50:21,531 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871325682] [2019-12-07 16:50:21,531 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-12-07 16:50:21,531 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 16:50:21,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-12-07 16:50:21,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=513, Unknown=5, NotChecked=0, Total=600 [2019-12-07 16:50:21,532 INFO L87 Difference]: Start difference. First operand 82 states and 87 transitions. Second operand 25 states. [2019-12-07 16:50:22,988 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 81 [2019-12-07 16:50:37,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:50:37,104 INFO L93 Difference]: Finished difference Result 177 states and 183 transitions. [2019-12-07 16:50:37,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-07 16:50:37,105 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 18 [2019-12-07 16:50:37,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:50:37,106 INFO L225 Difference]: With dead ends: 177 [2019-12-07 16:50:37,106 INFO L226 Difference]: Without dead ends: 177 [2019-12-07 16:50:37,106 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 304 ImplicationChecksByTransitivity, 24.0s TimeCoverageRelationStatistics Valid=385, Invalid=1250, Unknown=5, NotChecked=0, Total=1640 [2019-12-07 16:50:37,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-12-07 16:50:37,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 84. [2019-12-07 16:50:37,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-12-07 16:50:37,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 88 transitions. [2019-12-07 16:50:37,108 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 88 transitions. Word has length 18 [2019-12-07 16:50:37,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:50:37,108 INFO L462 AbstractCegarLoop]: Abstraction has 84 states and 88 transitions. [2019-12-07 16:50:37,108 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-12-07 16:50:37,108 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 88 transitions. [2019-12-07 16:50:37,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 16:50:37,109 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:50:37,109 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:50:37,309 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 mathsat -unsat_core_generation=3 [2019-12-07 16:50:37,309 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 16:50:37,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:50:37,309 INFO L82 PathProgramCache]: Analyzing trace with hash 941759704, now seen corresponding path program 1 times [2019-12-07 16:50:37,310 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 16:50:37,310 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1800479163] [2019-12-07 16:50:37,310 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c2ea65b5-aaea-47da-a0c6-b0febddd04df/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 [2019-12-07 16:50:37,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:50:37,352 INFO L264 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 16:50:37,353 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:50:37,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:50:37,364 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:50:37,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:50:37,365 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1800479163] [2019-12-07 16:50:37,366 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:50:37,366 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-12-07 16:50:37,366 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958674798] [2019-12-07 16:50:37,366 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:50:37,366 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 16:50:37,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:50:37,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:50:37,366 INFO L87 Difference]: Start difference. First operand 84 states and 88 transitions. Second operand 4 states. [2019-12-07 16:50:37,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:50:37,408 INFO L93 Difference]: Finished difference Result 130 states and 133 transitions. [2019-12-07 16:50:37,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:50:37,408 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-12-07 16:50:37,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:50:37,409 INFO L225 Difference]: With dead ends: 130 [2019-12-07 16:50:37,409 INFO L226 Difference]: Without dead ends: 130 [2019-12-07 16:50:37,409 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 16:50:37,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-12-07 16:50:37,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 78. [2019-12-07 16:50:37,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-12-07 16:50:37,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 81 transitions. [2019-12-07 16:50:37,410 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 81 transitions. Word has length 18 [2019-12-07 16:50:37,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:50:37,411 INFO L462 AbstractCegarLoop]: Abstraction has 78 states and 81 transitions. [2019-12-07 16:50:37,411 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:50:37,411 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2019-12-07 16:50:37,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 16:50:37,411 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:50:37,411 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:50:37,611 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 mathsat -unsat_core_generation=3 [2019-12-07 16:50:37,612 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 16:50:37,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:50:37,612 INFO L82 PathProgramCache]: Analyzing trace with hash 1469928108, now seen corresponding path program 1 times [2019-12-07 16:50:37,612 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 16:50:37,612 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1388358387] [2019-12-07 16:50:37,612 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c2ea65b5-aaea-47da-a0c6-b0febddd04df/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 [2019-12-07 16:50:37,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:50:37,657 INFO L264 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 15 conjunts are in the unsatisfiable core [2019-12-07 16:50:37,658 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:50:37,668 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:50:37,668 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 25 [2019-12-07 16:50:37,668 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:50:37,680 INFO L614 ElimStorePlain]: treesize reduction 10, result has 60.0 percent of original size [2019-12-07 16:50:37,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:50:37,680 INFO L534 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. [2019-12-07 16:50:37,680 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:9, output treesize:15 [2019-12-07 16:50:37,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:50:37,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:50:39,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:50:39,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:50:39,892 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:50:39,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:50:44,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:50:52,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:50:52,352 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1388358387] [2019-12-07 16:50:52,352 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:50:52,352 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 16 [2019-12-07 16:50:52,352 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447884931] [2019-12-07 16:50:52,353 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-07 16:50:52,353 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 16:50:52,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-07 16:50:52,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=214, Unknown=5, NotChecked=0, Total=272 [2019-12-07 16:50:52,353 INFO L87 Difference]: Start difference. First operand 78 states and 81 transitions. Second operand 17 states. [2019-12-07 16:50:59,382 WARN L192 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 38 [2019-12-07 16:50:59,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:50:59,807 INFO L93 Difference]: Finished difference Result 89 states and 91 transitions. [2019-12-07 16:50:59,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 16:50:59,808 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 20 [2019-12-07 16:50:59,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:50:59,808 INFO L225 Difference]: With dead ends: 89 [2019-12-07 16:50:59,808 INFO L226 Difference]: Without dead ends: 80 [2019-12-07 16:50:59,809 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 17.2s TimeCoverageRelationStatistics Valid=95, Invalid=361, Unknown=6, NotChecked=0, Total=462 [2019-12-07 16:50:59,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-12-07 16:50:59,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 70. [2019-12-07 16:50:59,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-12-07 16:50:59,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 72 transitions. [2019-12-07 16:50:59,810 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 72 transitions. Word has length 20 [2019-12-07 16:50:59,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:50:59,810 INFO L462 AbstractCegarLoop]: Abstraction has 70 states and 72 transitions. [2019-12-07 16:50:59,810 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-07 16:50:59,810 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 72 transitions. [2019-12-07 16:50:59,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-07 16:50:59,810 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:50:59,810 INFO L410 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, 1] [2019-12-07 16:51:00,011 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 mathsat -unsat_core_generation=3 [2019-12-07 16:51:00,011 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 16:51:00,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:51:00,012 INFO L82 PathProgramCache]: Analyzing trace with hash -373354461, now seen corresponding path program 1 times [2019-12-07 16:51:00,012 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 16:51:00,012 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1157973652] [2019-12-07 16:51:00,012 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c2ea65b5-aaea-47da-a0c6-b0febddd04df/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 [2019-12-07 16:51:00,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:51:00,109 INFO L264 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 26 conjunts are in the unsatisfiable core [2019-12-07 16:51:00,110 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:51:00,113 INFO L377 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 [2019-12-07 16:51:00,113 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:51:00,114 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:51:00,114 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:51:00,114 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 16:51:00,125 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:51:00,125 INFO L377 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 [2019-12-07 16:51:00,126 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:51:00,127 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:51:00,127 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:51:00,127 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:4 [2019-12-07 16:51:00,141 INFO L377 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 11 treesize of output 7 [2019-12-07 16:51:00,141 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:51:00,151 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:51:00,153 INFO L377 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 11 treesize of output 7 [2019-12-07 16:51:00,153 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 16:51:00,161 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:51:00,162 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:51:00,162 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:19 [2019-12-07 16:51:00,181 INFO L377 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 [2019-12-07 16:51:00,181 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:51:00,190 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:51:00,190 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:51:00,190 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:24 [2019-12-07 16:51:00,235 INFO L377 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 41 [2019-12-07 16:51:00,236 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:51:00,248 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:51:00,270 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:51:00,270 INFO L377 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 1 case distinctions, treesize of input 47 treesize of output 69 [2019-12-07 16:51:00,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:51:00,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:51:00,271 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2019-12-07 16:51:00,309 INFO L614 ElimStorePlain]: treesize reduction 95, result has 32.6 percent of original size [2019-12-07 16:51:00,310 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:51:00,310 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:62, output treesize:28 [2019-12-07 16:51:00,354 INFO L377 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 25 treesize of output 17 [2019-12-07 16:51:00,354 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:51:00,362 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:51:00,362 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 16:51:00,362 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:31 [2019-12-07 16:51:00,432 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:51:00,432 INFO L377 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 35 treesize of output 30 [2019-12-07 16:51:00,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:51:00,433 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:51:00,434 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:51:00,434 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:51:00,434 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:5 [2019-12-07 16:51:00,489 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:51:00,489 INFO L377 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 [2019-12-07 16:51:00,490 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:51:00,503 INFO L614 ElimStorePlain]: treesize reduction 14, result has 51.7 percent of original size [2019-12-07 16:51:00,503 INFO L534 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. [2019-12-07 16:51:00,503 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:15 [2019-12-07 16:51:00,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:51:00,541 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:51:05,970 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:51:05,970 INFO L377 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 212 treesize of output 216 [2019-12-07 16:51:05,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:51:05,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:51:05,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:51:05,972 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:51:06,017 INFO L614 ElimStorePlain]: treesize reduction 41, result has 66.7 percent of original size [2019-12-07 16:51:06,017 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 16:51:06,017 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:57, output treesize:39 [2019-12-07 16:51:21,519 WARN L192 SmtUtils]: Spent 576.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2019-12-07 16:51:21,527 INFO L430 ElimStorePlain]: Different costs {2=[|#memory_$Pointer$.offset|], 6=[|#memory_$Pointer$.base|]} [2019-12-07 16:51:21,529 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:51:21,579 INFO L614 ElimStorePlain]: treesize reduction 68, result has 50.0 percent of original size [2019-12-07 16:51:21,582 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:51:21,583 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:51:21,584 INFO L377 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 64 treesize of output 60 [2019-12-07 16:51:21,584 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 16:51:21,609 INFO L614 ElimStorePlain]: treesize reduction 37, result has 30.2 percent of original size [2019-12-07 16:51:21,609 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:51:21,609 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:87, output treesize:4 [2019-12-07 16:51:21,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:51:21,615 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1157973652] [2019-12-07 16:51:21,615 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:51:21,615 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15, 15] imperfect sequences [] total 24 [2019-12-07 16:51:21,615 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306122019] [2019-12-07 16:51:21,615 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-12-07 16:51:21,615 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 16:51:21,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-12-07 16:51:21,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=527, Unknown=7, NotChecked=0, Total=600 [2019-12-07 16:51:21,616 INFO L87 Difference]: Start difference. First operand 70 states and 72 transitions. Second operand 25 states. [2019-12-07 16:51:22,569 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2019-12-07 16:51:22,727 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2019-12-07 16:51:22,888 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 60 [2019-12-07 16:51:23,054 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 63 [2019-12-07 16:51:23,224 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 61 [2019-12-07 16:51:26,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:51:26,281 INFO L93 Difference]: Finished difference Result 158 states and 163 transitions. [2019-12-07 16:51:26,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-07 16:51:26,282 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 23 [2019-12-07 16:51:26,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:51:26,282 INFO L225 Difference]: With dead ends: 158 [2019-12-07 16:51:26,282 INFO L226 Difference]: Without dead ends: 158 [2019-12-07 16:51:26,283 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 22.4s TimeCoverageRelationStatistics Valid=331, Invalid=1302, Unknown=7, NotChecked=0, Total=1640 [2019-12-07 16:51:26,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-12-07 16:51:26,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 69. [2019-12-07 16:51:26,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-12-07 16:51:26,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 71 transitions. [2019-12-07 16:51:26,284 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 71 transitions. Word has length 23 [2019-12-07 16:51:26,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:51:26,285 INFO L462 AbstractCegarLoop]: Abstraction has 69 states and 71 transitions. [2019-12-07 16:51:26,285 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-12-07 16:51:26,285 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 71 transitions. [2019-12-07 16:51:26,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-07 16:51:26,285 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:51:26,285 INFO L410 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, 1] [2019-12-07 16:51:26,486 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 mathsat -unsat_core_generation=3 [2019-12-07 16:51:26,486 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 16:51:26,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:51:26,487 INFO L82 PathProgramCache]: Analyzing trace with hash -373354460, now seen corresponding path program 1 times [2019-12-07 16:51:26,487 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 16:51:26,487 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [144345026] [2019-12-07 16:51:26,488 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c2ea65b5-aaea-47da-a0c6-b0febddd04df/bin/utaipan/mathsat Starting monitored process 22 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with mathsat -unsat_core_generation=3 [2019-12-07 16:51:26,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:51:26,585 INFO L264 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 34 conjunts are in the unsatisfiable core [2019-12-07 16:51:26,586 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:51:26,588 INFO L377 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 [2019-12-07 16:51:26,588 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:51:26,590 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:51:26,590 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:51:26,590 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 16:51:26,601 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:51:26,602 INFO L377 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 [2019-12-07 16:51:26,602 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:51:26,603 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:51:26,603 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:51:26,603 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:4 [2019-12-07 16:51:26,616 INFO L377 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 11 treesize of output 7 [2019-12-07 16:51:26,617 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:51:26,625 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:51:26,628 INFO L377 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 11 treesize of output 7 [2019-12-07 16:51:26,628 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 16:51:26,635 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:51:26,635 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:51:26,635 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:19 [2019-12-07 16:51:26,674 INFO L377 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 [2019-12-07 16:51:26,674 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:51:26,689 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:51:26,692 INFO L377 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 [2019-12-07 16:51:26,693 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 16:51:26,707 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:51:26,707 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:51:26,708 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:32 [2019-12-07 16:51:26,794 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:51:26,794 INFO L377 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 1 case distinctions, treesize of input 55 treesize of output 73 [2019-12-07 16:51:26,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:51:26,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:51:26,796 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-12-07 16:51:26,844 INFO L614 ElimStorePlain]: treesize reduction 111, result has 35.5 percent of original size [2019-12-07 16:51:26,848 INFO L377 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 33 [2019-12-07 16:51:26,848 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 16:51:26,860 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:51:26,860 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:51:26,861 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:69, output treesize:60 [2019-12-07 16:51:27,017 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:51:27,017 INFO L377 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 88 treesize of output 59 [2019-12-07 16:51:27,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:51:27,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:51:27,019 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 16:51:27,048 INFO L614 ElimStorePlain]: treesize reduction 16, result has 69.8 percent of original size [2019-12-07 16:51:27,051 INFO L377 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 23 treesize of output 10 [2019-12-07 16:51:27,051 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 16:51:27,060 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:51:27,060 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:51:27,060 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:88, output treesize:14 [2019-12-07 16:51:27,128 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:51:27,128 INFO L377 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 [2019-12-07 16:51:27,128 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:51:27,137 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:51:27,139 INFO L377 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 14 treesize of output 16 [2019-12-07 16:51:27,139 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 16:51:27,147 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:51:27,147 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:51:27,148 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:11 [2019-12-07 16:51:27,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:51:27,183 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:51:27,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:51:35,418 WARN L192 SmtUtils]: Spent 4.29 s on a formula simplification that was a NOOP. DAG size: 45 [2019-12-07 16:51:41,349 WARN L192 SmtUtils]: Spent 4.39 s on a formula simplification that was a NOOP. DAG size: 45 [2019-12-07 16:51:41,352 INFO L430 ElimStorePlain]: Different costs {1=[v_prenex_27, |#valid|], 2=[|#length|]} [2019-12-07 16:51:41,378 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-12-07 16:51:41,378 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:51:41,493 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2019-12-07 16:51:41,494 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:51:41,516 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-12-07 16:51:41,517 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 16:51:41,622 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2019-12-07 16:51:41,622 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:51:41,642 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 448 treesize of output 410 [2019-12-07 16:51:41,643 INFO L534 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 16:51:42,175 WARN L192 SmtUtils]: Spent 531.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 55 [2019-12-07 16:51:42,175 INFO L614 ElimStorePlain]: treesize reduction 123, result has 75.2 percent of original size [2019-12-07 16:51:42,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:51:42,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:51:42,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:51:42,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:51:42,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:51:42,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:51:42,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:51:42,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:51:42,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:51:42,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:51:42,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:51:42,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:51:42,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:51:42,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:51:42,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:51:42,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:51:42,181 INFO L534 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 3 dim-1 vars, End of recursive call: 9 dim-0 vars, and 5 xjuncts. [2019-12-07 16:51:42,181 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 8 variables, input treesize:183, output treesize:649 [2019-12-07 16:51:42,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:51:42,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:51:42,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:51:42,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:52:12,213 WARN L192 SmtUtils]: Spent 13.54 s on a formula simplification. DAG size of input: 95 DAG size of output: 59 [2019-12-07 16:52:12,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:52:12,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:52:33,931 WARN L192 SmtUtils]: Spent 5.89 s on a formula simplification that was a NOOP. DAG size: 55 [2019-12-07 16:52:33,937 INFO L430 ElimStorePlain]: Different costs {2=[|#memory_$Pointer$.base|], 6=[v_prenex_39, v_prenex_37, v_prenex_35, |#memory_$Pointer$.offset|, v_prenex_40]} [2019-12-07 16:52:33,968 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:52:34,789 WARN L192 SmtUtils]: Spent 820.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 87 [2019-12-07 16:52:34,790 INFO L614 ElimStorePlain]: treesize reduction 100, result has 82.8 percent of original size [2019-12-07 16:52:34,884 INFO L343 Elim1Store]: treesize reduction 71, result has 53.9 percent of original size [2019-12-07 16:52:34,884 INFO L377 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 2 case distinctions, treesize of input 454 treesize of output 496 [2019-12-07 16:52:34,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:52:34,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:52:34,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:52:34,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:52:34,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:52:34,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:52:34,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:52:34,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:52:34,908 INFO L430 ElimStorePlain]: Different costs {0=[v_prenex_43], 1=[v_prenex_42], 3=[v_arrayElimArr_1]} [2019-12-07 16:52:34,913 WARN L227 Elim1Store]: Array PQE input equivalent to true [2019-12-07 16:52:34,914 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 16:52:34,931 INFO L614 ElimStorePlain]: treesize reduction 39, result has 29.1 percent of original size [2019-12-07 16:52:35,105 WARN L192 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 36 [2019-12-07 16:52:35,106 INFO L614 ElimStorePlain]: treesize reduction 394, result has 22.4 percent of original size [2019-12-07 16:52:35,106 INFO L502 ElimStorePlain]: Eliminatee v_prenex_42 vanished before elimination [2019-12-07 16:52:35,175 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:52:35,175 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 48 [2019-12-07 16:52:35,176 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 3 xjuncts. [2019-12-07 16:52:35,206 INFO L614 ElimStorePlain]: treesize reduction 39, result has 64.2 percent of original size [2019-12-07 16:52:35,206 INFO L534 ElimStorePlain]: Start of recursive call 3: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:52:35,473 WARN L192 SmtUtils]: Spent 266.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2019-12-07 16:52:35,473 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:52:35,500 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:52:35,500 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1127 treesize of output 1007 [2019-12-07 16:52:35,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:52:35,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:52:35,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:52:35,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:52:35,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:52:35,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:52:35,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:52:35,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:52:35,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:52:35,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:52:35,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:52:35,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:52:35,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:52:35,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:52:35,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:52:35,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:52:35,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:52:35,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:52:35,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:52:35,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:52:35,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:52:35,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:52:35,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:52:35,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:52:35,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:52:35,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:52:35,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:52:35,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:52:35,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:52:35,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:52:35,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:52:35,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:52:35,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:52:35,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:52:35,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:52:35,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:52:35,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:52:35,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:52:35,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:52:35,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:52:35,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:52:35,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:52:35,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:52:35,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:52:35,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:52:35,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:52:35,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:52:35,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:52:35,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:52:35,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:52:35,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:52:35,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:52:35,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:52:35,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:52:35,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:52:35,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:52:35,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:52:35,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:52:35,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:52:35,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:52:35,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:52:35,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:52:35,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:52:35,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:52:35,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:52:35,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:52:35,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:52:35,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:52:35,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:52:35,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:52:35,524 INFO L534 ElimStorePlain]: Start of recursive call 6: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 16:52:36,130 WARN L192 SmtUtils]: Spent 606.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 73 [2019-12-07 16:52:36,131 INFO L614 ElimStorePlain]: treesize reduction 926, result has 23.1 percent of original size [2019-12-07 16:52:36,148 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:52:36,150 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:52:36,158 INFO L377 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 126 treesize of output 118 [2019-12-07 16:52:36,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:52:36,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:52:36,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:52:36,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:52:36,160 INFO L534 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2019-12-07 16:52:36,532 WARN L192 SmtUtils]: Spent 371.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 62 [2019-12-07 16:52:36,532 INFO L614 ElimStorePlain]: treesize reduction 144, result has 61.1 percent of original size [2019-12-07 16:52:36,537 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:52:36,539 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:52:36,543 INFO L377 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 72 treesize of output 64 [2019-12-07 16:52:36,546 INFO L534 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-12-07 16:52:36,792 WARN L192 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 52 [2019-12-07 16:52:36,792 INFO L614 ElimStorePlain]: treesize reduction 39, result has 74.8 percent of original size [2019-12-07 16:52:36,798 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:52:36,800 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:52:36,805 INFO L377 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 68 treesize of output 64 [2019-12-07 16:52:36,806 INFO L534 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-12-07 16:52:36,989 WARN L192 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 42 [2019-12-07 16:52:36,990 INFO L614 ElimStorePlain]: treesize reduction 39, result has 61.4 percent of original size [2019-12-07 16:52:36,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:52:36,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:52:36,995 INFO L534 ElimStorePlain]: Start of recursive call 1: 10 dim-0 vars, 6 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:52:36,995 INFO L239 ElimStorePlain]: Needed 9 recursive calls to eliminate 16 variables, input treesize:529, output treesize:4 [2019-12-07 16:52:37,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:52:37,003 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [144345026] [2019-12-07 16:52:37,003 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:52:37,003 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16, 16] imperfect sequences [] total 27 [2019-12-07 16:52:37,003 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227554163] [2019-12-07 16:52:37,003 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-12-07 16:52:37,003 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 16:52:37,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-12-07 16:52:37,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=671, Unknown=8, NotChecked=0, Total=756 [2019-12-07 16:52:37,004 INFO L87 Difference]: Start difference. First operand 69 states and 71 transitions. Second operand 28 states. [2019-12-07 16:52:39,160 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 74 [2019-12-07 16:52:39,524 WARN L192 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 80 [2019-12-07 16:52:39,902 WARN L192 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 80 [2019-12-07 16:52:40,278 WARN L192 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-07 16:52:45,252 WARN L192 SmtUtils]: Spent 4.79 s on a formula simplification. DAG size of input: 128 DAG size of output: 114 [2019-12-07 16:53:37,494 WARN L192 SmtUtils]: Spent 51.31 s on a formula simplification. DAG size of input: 164 DAG size of output: 147 [2019-12-07 16:53:44,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:53:44,382 INFO L93 Difference]: Finished difference Result 156 states and 161 transitions. [2019-12-07 16:53:44,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-07 16:53:44,383 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 23 [2019-12-07 16:53:44,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:53:44,384 INFO L225 Difference]: With dead ends: 156 [2019-12-07 16:53:44,384 INFO L226 Difference]: Without dead ends: 156 [2019-12-07 16:53:44,385 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 125.4s TimeCoverageRelationStatistics Valid=379, Invalid=1683, Unknown=8, NotChecked=0, Total=2070 [2019-12-07 16:53:44,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2019-12-07 16:53:44,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 68. [2019-12-07 16:53:44,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-12-07 16:53:44,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 70 transitions. [2019-12-07 16:53:44,386 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 70 transitions. Word has length 23 [2019-12-07 16:53:44,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:53:44,386 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 70 transitions. [2019-12-07 16:53:44,386 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-12-07 16:53:44,386 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 70 transitions. [2019-12-07 16:53:44,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-07 16:53:44,387 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:53:44,387 INFO L410 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, 1, 1] [2019-12-07 16:53:44,587 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 mathsat -unsat_core_generation=3 [2019-12-07 16:53:44,587 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 16:53:44,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:53:44,588 INFO L82 PathProgramCache]: Analyzing trace with hash 1310912225, now seen corresponding path program 1 times [2019-12-07 16:53:44,588 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 16:53:44,588 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1237732656] [2019-12-07 16:53:44,588 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c2ea65b5-aaea-47da-a0c6-b0febddd04df/bin/utaipan/mathsat Starting monitored process 23 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with mathsat -unsat_core_generation=3 [2019-12-07 16:53:44,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:53:44,683 INFO L264 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 16:53:44,684 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:53:44,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:53:44,691 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:53:44,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:53:44,692 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1237732656] [2019-12-07 16:53:44,692 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:53:44,692 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-12-07 16:53:44,692 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390824095] [2019-12-07 16:53:44,692 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:53:44,693 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 16:53:44,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:53:44,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:53:44,693 INFO L87 Difference]: Start difference. First operand 68 states and 70 transitions. Second operand 4 states. [2019-12-07 16:53:44,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:53:44,738 INFO L93 Difference]: Finished difference Result 111 states and 113 transitions. [2019-12-07 16:53:44,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 16:53:44,738 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2019-12-07 16:53:44,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:53:44,739 INFO L225 Difference]: With dead ends: 111 [2019-12-07 16:53:44,739 INFO L226 Difference]: Without dead ends: 111 [2019-12-07 16:53:44,739 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 16:53:44,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-12-07 16:53:44,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 70. [2019-12-07 16:53:44,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-12-07 16:53:44,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 72 transitions. [2019-12-07 16:53:44,741 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 72 transitions. Word has length 24 [2019-12-07 16:53:44,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:53:44,741 INFO L462 AbstractCegarLoop]: Abstraction has 70 states and 72 transitions. [2019-12-07 16:53:44,741 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:53:44,741 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 72 transitions. [2019-12-07 16:53:44,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-07 16:53:44,741 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:53:44,741 INFO L410 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, 1, 1] [2019-12-07 16:53:44,941 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 mathsat -unsat_core_generation=3 [2019-12-07 16:53:44,942 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 16:53:44,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:53:44,942 INFO L82 PathProgramCache]: Analyzing trace with hash 1312759267, now seen corresponding path program 1 times [2019-12-07 16:53:44,942 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 16:53:44,943 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1009818029] [2019-12-07 16:53:44,943 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c2ea65b5-aaea-47da-a0c6-b0febddd04df/bin/utaipan/mathsat Starting monitored process 24 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with mathsat -unsat_core_generation=3 [2019-12-07 16:53:44,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:53:45,002 INFO L264 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 16:53:45,003 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:53:45,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:53:45,010 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:53:45,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:53:45,012 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1009818029] [2019-12-07 16:53:45,012 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:53:45,012 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-12-07 16:53:45,012 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931837570] [2019-12-07 16:53:45,012 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:53:45,013 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 16:53:45,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:53:45,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:53:45,013 INFO L87 Difference]: Start difference. First operand 70 states and 72 transitions. Second operand 4 states. [2019-12-07 16:53:45,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:53:45,114 INFO L93 Difference]: Finished difference Result 88 states and 91 transitions. [2019-12-07 16:53:45,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:53:45,115 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2019-12-07 16:53:45,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:53:45,115 INFO L225 Difference]: With dead ends: 88 [2019-12-07 16:53:45,115 INFO L226 Difference]: Without dead ends: 88 [2019-12-07 16:53:45,116 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 16:53:45,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-12-07 16:53:45,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 68. [2019-12-07 16:53:45,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-12-07 16:53:45,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 70 transitions. [2019-12-07 16:53:45,117 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 70 transitions. Word has length 24 [2019-12-07 16:53:45,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:53:45,117 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 70 transitions. [2019-12-07 16:53:45,117 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:53:45,117 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 70 transitions. [2019-12-07 16:53:45,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-07 16:53:45,117 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:53:45,117 INFO L410 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, 1, 1] [2019-12-07 16:53:45,318 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 mathsat -unsat_core_generation=3 [2019-12-07 16:53:45,318 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 16:53:45,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:53:45,319 INFO L82 PathProgramCache]: Analyzing trace with hash 1312759268, now seen corresponding path program 1 times [2019-12-07 16:53:45,320 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 16:53:45,320 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1923680425] [2019-12-07 16:53:45,320 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c2ea65b5-aaea-47da-a0c6-b0febddd04df/bin/utaipan/mathsat Starting monitored process 25 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with mathsat -unsat_core_generation=3 [2019-12-07 16:53:45,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:53:45,436 INFO L264 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 27 conjunts are in the unsatisfiable core [2019-12-07 16:53:45,437 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:53:45,442 INFO L377 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 [2019-12-07 16:53:45,443 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:53:45,449 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:53:45,451 INFO L377 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 [2019-12-07 16:53:45,451 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 16:53:45,456 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:53:45,456 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:53:45,456 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-12-07 16:53:45,477 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:53:45,478 INFO L377 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 [2019-12-07 16:53:45,478 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:53:45,487 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:53:45,494 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:53:45,494 INFO L377 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 [2019-12-07 16:53:45,495 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 16:53:45,505 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:53:45,505 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:53:45,505 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:27, output treesize:11 [2019-12-07 16:53:45,533 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:53:45,533 INFO L377 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 [2019-12-07 16:53:45,533 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:53:45,545 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:53:45,548 INFO L377 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 [2019-12-07 16:53:45,548 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 16:53:45,557 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:53:45,558 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:53:45,558 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:27, output treesize:11 [2019-12-07 16:53:45,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:53:45,582 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:53:45,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:53:45,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:53:45,974 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:53:45,974 INFO L377 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 [2019-12-07 16:53:45,975 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:53:45,987 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:53:45,988 INFO L377 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 [2019-12-07 16:53:45,988 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 16:53:46,017 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:53:46,017 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-12-07 16:53:46,017 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:44, output treesize:22 [2019-12-07 16:53:46,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:53:46,431 INFO L430 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2019-12-07 16:53:46,436 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-12-07 16:53:46,436 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:53:46,444 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:53:46,445 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 16:53:46,445 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 16:53:46,451 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:53:46,451 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:53:46,451 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:21, output treesize:3 [2019-12-07 16:53:46,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:53:46,489 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1923680425] [2019-12-07 16:53:46,489 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:53:46,489 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 13 [2019-12-07 16:53:46,489 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183743928] [2019-12-07 16:53:46,489 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-07 16:53:46,490 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 16:53:46,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-07 16:53:46,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2019-12-07 16:53:46,490 INFO L87 Difference]: Start difference. First operand 68 states and 70 transitions. Second operand 14 states. [2019-12-07 16:53:47,030 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2019-12-07 16:53:47,444 WARN L192 SmtUtils]: Spent 187.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2019-12-07 16:53:52,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:53:52,394 INFO L93 Difference]: Finished difference Result 125 states and 128 transitions. [2019-12-07 16:53:52,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 16:53:52,395 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 24 [2019-12-07 16:53:52,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:53:52,396 INFO L225 Difference]: With dead ends: 125 [2019-12-07 16:53:52,396 INFO L226 Difference]: Without dead ends: 125 [2019-12-07 16:53:52,396 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 29 SyntacticMatches, 5 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=121, Invalid=385, Unknown=0, NotChecked=0, Total=506 [2019-12-07 16:53:52,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-12-07 16:53:52,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 66. [2019-12-07 16:53:52,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-12-07 16:53:52,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 68 transitions. [2019-12-07 16:53:52,397 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 68 transitions. Word has length 24 [2019-12-07 16:53:52,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:53:52,398 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 68 transitions. [2019-12-07 16:53:52,398 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-07 16:53:52,398 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 68 transitions. [2019-12-07 16:53:52,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 16:53:52,398 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:53:52,398 INFO L410 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, 1, 1, 1, 1] [2019-12-07 16:53:52,598 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 mathsat -unsat_core_generation=3 [2019-12-07 16:53:52,599 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 16:53:52,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:53:52,599 INFO L82 PathProgramCache]: Analyzing trace with hash 1362588745, now seen corresponding path program 1 times [2019-12-07 16:53:52,599 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 16:53:52,600 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1951975951] [2019-12-07 16:53:52,600 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c2ea65b5-aaea-47da-a0c6-b0febddd04df/bin/utaipan/mathsat Starting monitored process 26 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with mathsat -unsat_core_generation=3 [2019-12-07 16:53:52,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:53:52,681 INFO L264 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 16:53:52,681 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:53:52,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:53:52,687 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:53:52,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:53:52,689 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1951975951] [2019-12-07 16:53:52,689 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:53:52,689 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-12-07 16:53:52,689 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066444538] [2019-12-07 16:53:52,689 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:53:52,689 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 16:53:52,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:53:52,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:53:52,689 INFO L87 Difference]: Start difference. First operand 66 states and 68 transitions. Second operand 4 states. [2019-12-07 16:53:52,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:53:52,716 INFO L93 Difference]: Finished difference Result 65 states and 67 transitions. [2019-12-07 16:53:52,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:53:52,716 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2019-12-07 16:53:52,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:53:52,716 INFO L225 Difference]: With dead ends: 65 [2019-12-07 16:53:52,716 INFO L226 Difference]: Without dead ends: 65 [2019-12-07 16:53:52,717 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 16:53:52,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-12-07 16:53:52,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-12-07 16:53:52,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-12-07 16:53:52,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 67 transitions. [2019-12-07 16:53:52,718 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 67 transitions. Word has length 26 [2019-12-07 16:53:52,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:53:52,718 INFO L462 AbstractCegarLoop]: Abstraction has 65 states and 67 transitions. [2019-12-07 16:53:52,718 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:53:52,718 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 67 transitions. [2019-12-07 16:53:52,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 16:53:52,718 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:53:52,718 INFO L410 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, 1, 1, 1, 1, 1] [2019-12-07 16:53:52,919 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 mathsat -unsat_core_generation=3 [2019-12-07 16:53:52,919 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 16:53:52,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:53:52,920 INFO L82 PathProgramCache]: Analyzing trace with hash -709421756, now seen corresponding path program 1 times [2019-12-07 16:53:52,920 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 16:53:52,921 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1913703657] [2019-12-07 16:53:52,921 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c2ea65b5-aaea-47da-a0c6-b0febddd04df/bin/utaipan/mathsat Starting monitored process 27 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with mathsat -unsat_core_generation=3 [2019-12-07 16:53:52,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:53:53,001 INFO L264 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 16:53:53,002 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:53:53,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:53:53,054 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:53:53,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:53:53,076 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1913703657] [2019-12-07 16:53:53,076 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:53:53,076 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 3] imperfect sequences [] total 7 [2019-12-07 16:53:53,076 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386291530] [2019-12-07 16:53:53,077 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 16:53:53,077 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 16:53:53,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 16:53:53,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 16:53:53,077 INFO L87 Difference]: Start difference. First operand 65 states and 67 transitions. Second operand 8 states. [2019-12-07 16:53:53,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:53:53,206 INFO L93 Difference]: Finished difference Result 64 states and 66 transitions. [2019-12-07 16:53:53,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 16:53:53,206 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2019-12-07 16:53:53,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:53:53,207 INFO L225 Difference]: With dead ends: 64 [2019-12-07 16:53:53,207 INFO L226 Difference]: Without dead ends: 64 [2019-12-07 16:53:53,207 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-07 16:53:53,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-12-07 16:53:53,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-12-07 16:53:53,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-12-07 16:53:53,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 66 transitions. [2019-12-07 16:53:53,208 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 66 transitions. Word has length 27 [2019-12-07 16:53:53,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:53:53,208 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 66 transitions. [2019-12-07 16:53:53,208 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 16:53:53,209 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 66 transitions. [2019-12-07 16:53:53,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 16:53:53,209 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:53:53,209 INFO L410 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, 1, 1, 1, 1, 1] [2019-12-07 16:53:53,409 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 mathsat -unsat_core_generation=3 [2019-12-07 16:53:53,410 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 16:53:53,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:53:53,410 INFO L82 PathProgramCache]: Analyzing trace with hash -1560815527, now seen corresponding path program 1 times [2019-12-07 16:53:53,411 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 16:53:53,411 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [56073630] [2019-12-07 16:53:53,411 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c2ea65b5-aaea-47da-a0c6-b0febddd04df/bin/utaipan/mathsat Starting monitored process 28 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with mathsat -unsat_core_generation=3 [2019-12-07 16:53:53,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:53:53,513 INFO L264 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 16:53:53,514 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:53:53,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:53:53,525 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:53:53,531 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:53:53,531 INFO L377 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 14 treesize of output 18 [2019-12-07 16:53:53,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:53:53,532 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:53:53,533 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:53:53,533 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:53:53,534 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:3 [2019-12-07 16:53:53,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:53:53,535 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [56073630] [2019-12-07 16:53:53,535 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:53:53,535 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-12-07 16:53:53,535 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288558162] [2019-12-07 16:53:53,535 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 16:53:53,535 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 16:53:53,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 16:53:53,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 16:53:53,536 INFO L87 Difference]: Start difference. First operand 64 states and 66 transitions. Second operand 5 states. [2019-12-07 16:53:53,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:53:53,676 INFO L93 Difference]: Finished difference Result 89 states and 92 transitions. [2019-12-07 16:53:53,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 16:53:53,677 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-07 16:53:53,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:53:53,677 INFO L225 Difference]: With dead ends: 89 [2019-12-07 16:53:53,677 INFO L226 Difference]: Without dead ends: 89 [2019-12-07 16:53:53,677 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 16:53:53,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-12-07 16:53:53,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 66. [2019-12-07 16:53:53,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-12-07 16:53:53,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 69 transitions. [2019-12-07 16:53:53,678 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 69 transitions. Word has length 27 [2019-12-07 16:53:53,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:53:53,679 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 69 transitions. [2019-12-07 16:53:53,679 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 16:53:53,679 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 69 transitions. [2019-12-07 16:53:53,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 16:53:53,679 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:53:53,679 INFO L410 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, 1, 1, 1, 1, 1] [2019-12-07 16:53:53,879 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 mathsat -unsat_core_generation=3 [2019-12-07 16:53:53,880 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 16:53:53,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:53:53,880 INFO L82 PathProgramCache]: Analyzing trace with hash -1560815526, now seen corresponding path program 1 times [2019-12-07 16:53:53,880 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 16:53:53,881 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1570098740] [2019-12-07 16:53:53,881 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c2ea65b5-aaea-47da-a0c6-b0febddd04df/bin/utaipan/mathsat Starting monitored process 29 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with mathsat -unsat_core_generation=3 [2019-12-07 16:53:53,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:53:53,986 INFO L264 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 29 conjunts are in the unsatisfiable core [2019-12-07 16:53:53,987 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:53:54,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:53:54,049 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:53:54,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:53:54,142 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:53:54,143 INFO L377 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 16 treesize of output 20 [2019-12-07 16:53:54,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:53:54,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:53:54,144 INFO L534 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 16:53:54,156 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2019-12-07 16:53:54,157 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 16:53:54,204 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:53:54,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:53:54,205 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-12-07 16:53:54,205 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:35 [2019-12-07 16:53:54,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:53:54,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:53:54,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:53:54,541 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1570098740] [2019-12-07 16:53:54,541 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:53:54,541 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 13 [2019-12-07 16:53:54,541 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292672643] [2019-12-07 16:53:54,542 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-07 16:53:54,542 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 16:53:54,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-07 16:53:54,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2019-12-07 16:53:54,542 INFO L87 Difference]: Start difference. First operand 66 states and 69 transitions. Second operand 14 states. [2019-12-07 16:53:54,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:53:54,929 INFO L93 Difference]: Finished difference Result 65 states and 67 transitions. [2019-12-07 16:53:54,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 16:53:54,929 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 27 [2019-12-07 16:53:54,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:53:54,930 INFO L225 Difference]: With dead ends: 65 [2019-12-07 16:53:54,930 INFO L226 Difference]: Without dead ends: 65 [2019-12-07 16:53:54,930 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=100, Invalid=242, Unknown=0, NotChecked=0, Total=342 [2019-12-07 16:53:54,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-12-07 16:53:54,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-12-07 16:53:54,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-12-07 16:53:54,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 67 transitions. [2019-12-07 16:53:54,931 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 67 transitions. Word has length 27 [2019-12-07 16:53:54,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:53:54,932 INFO L462 AbstractCegarLoop]: Abstraction has 65 states and 67 transitions. [2019-12-07 16:53:54,932 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-07 16:53:54,932 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 67 transitions. [2019-12-07 16:53:54,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-07 16:53:54,932 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:53:54,932 INFO L410 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, 1, 1, 1, 1, 1, 1] [2019-12-07 16:53:55,132 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 mathsat -unsat_core_generation=3 [2019-12-07 16:53:55,133 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 16:53:55,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:53:55,134 INFO L82 PathProgramCache]: Analyzing trace with hash -517237845, now seen corresponding path program 1 times [2019-12-07 16:53:55,134 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 16:53:55,134 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [154224291] [2019-12-07 16:53:55,135 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c2ea65b5-aaea-47da-a0c6-b0febddd04df/bin/utaipan/mathsat Starting monitored process 30 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with mathsat -unsat_core_generation=3 [2019-12-07 16:53:55,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:53:55,206 INFO L264 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 16:53:55,207 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:53:55,210 INFO L377 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 [2019-12-07 16:53:55,210 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:53:55,211 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:53:55,212 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:53:55,212 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 16:53:55,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:53:55,218 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:53:55,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:53:55,220 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [154224291] [2019-12-07 16:53:55,220 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:53:55,220 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-12-07 16:53:55,220 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450583830] [2019-12-07 16:53:55,221 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:53:55,221 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 16:53:55,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:53:55,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:53:55,221 INFO L87 Difference]: Start difference. First operand 65 states and 67 transitions. Second operand 4 states. [2019-12-07 16:53:55,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:53:55,332 INFO L93 Difference]: Finished difference Result 71 states and 73 transitions. [2019-12-07 16:53:55,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:53:55,332 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2019-12-07 16:53:55,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:53:55,332 INFO L225 Difference]: With dead ends: 71 [2019-12-07 16:53:55,332 INFO L226 Difference]: Without dead ends: 71 [2019-12-07 16:53:55,333 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 16:53:55,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-12-07 16:53:55,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-12-07 16:53:55,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-12-07 16:53:55,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 73 transitions. [2019-12-07 16:53:55,339 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 73 transitions. Word has length 28 [2019-12-07 16:53:55,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:53:55,339 INFO L462 AbstractCegarLoop]: Abstraction has 71 states and 73 transitions. [2019-12-07 16:53:55,339 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:53:55,339 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 73 transitions. [2019-12-07 16:53:55,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-07 16:53:55,339 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:53:55,339 INFO L410 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, 1, 1, 1, 1, 1, 1] [2019-12-07 16:53:55,539 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 mathsat -unsat_core_generation=3 [2019-12-07 16:53:55,540 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 16:53:55,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:53:55,540 INFO L82 PathProgramCache]: Analyzing trace with hash 162820525, now seen corresponding path program 1 times [2019-12-07 16:53:55,541 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 16:53:55,541 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [5816575] [2019-12-07 16:53:55,541 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c2ea65b5-aaea-47da-a0c6-b0febddd04df/bin/utaipan/mathsat Starting monitored process 31 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with mathsat -unsat_core_generation=3 [2019-12-07 16:53:55,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:53:55,604 INFO L264 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 16:53:55,604 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:53:55,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:53:55,615 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:53:55,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:53:55,616 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [5816575] [2019-12-07 16:53:55,617 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:53:55,617 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-12-07 16:53:55,617 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47162374] [2019-12-07 16:53:55,617 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:53:55,617 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 16:53:55,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:53:55,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:53:55,617 INFO L87 Difference]: Start difference. First operand 71 states and 73 transitions. Second operand 4 states. [2019-12-07 16:53:55,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:53:55,651 INFO L93 Difference]: Finished difference Result 90 states and 91 transitions. [2019-12-07 16:53:55,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:53:55,651 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2019-12-07 16:53:55,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:53:55,652 INFO L225 Difference]: With dead ends: 90 [2019-12-07 16:53:55,652 INFO L226 Difference]: Without dead ends: 90 [2019-12-07 16:53:55,652 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 16:53:55,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-12-07 16:53:55,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 64. [2019-12-07 16:53:55,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-12-07 16:53:55,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 65 transitions. [2019-12-07 16:53:55,653 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 65 transitions. Word has length 28 [2019-12-07 16:53:55,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:53:55,653 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 65 transitions. [2019-12-07 16:53:55,653 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:53:55,653 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 65 transitions. [2019-12-07 16:53:55,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-07 16:53:55,654 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:53:55,654 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:53:55,854 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 mathsat -unsat_core_generation=3 [2019-12-07 16:53:55,855 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 16:53:55,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:53:55,856 INFO L82 PathProgramCache]: Analyzing trace with hash 1150641166, now seen corresponding path program 1 times [2019-12-07 16:53:55,856 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 16:53:55,857 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [164481814] [2019-12-07 16:53:55,857 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c2ea65b5-aaea-47da-a0c6-b0febddd04df/bin/utaipan/mathsat Starting monitored process 32 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with mathsat -unsat_core_generation=3 [2019-12-07 16:53:55,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:53:55,993 INFO L264 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 22 conjunts are in the unsatisfiable core [2019-12-07 16:53:55,994 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:53:56,020 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:53:56,021 INFO L377 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 [2019-12-07 16:53:56,021 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:53:56,040 INFO L614 ElimStorePlain]: treesize reduction 14, result has 56.3 percent of original size [2019-12-07 16:53:56,040 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:53:56,040 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2019-12-07 16:53:56,098 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-12-07 16:53:56,098 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:53:56,109 INFO L614 ElimStorePlain]: treesize reduction 4, result has 76.5 percent of original size [2019-12-07 16:53:56,109 INFO L534 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. [2019-12-07 16:53:56,109 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:13 [2019-12-07 16:53:56,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:53:56,140 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:53:56,248 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:53:56,248 INFO L377 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 14 treesize of output 18 [2019-12-07 16:53:56,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:53:56,249 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:53:56,250 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:53:56,250 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:53:56,250 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:3 [2019-12-07 16:53:56,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:53:56,252 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [164481814] [2019-12-07 16:53:56,252 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:53:56,252 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 8] imperfect sequences [] total 15 [2019-12-07 16:53:56,252 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940764901] [2019-12-07 16:53:56,252 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-07 16:53:56,253 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 16:53:56,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-07 16:53:56,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2019-12-07 16:53:56,253 INFO L87 Difference]: Start difference. First operand 64 states and 65 transitions. Second operand 16 states. [2019-12-07 16:54:10,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:54:10,934 INFO L93 Difference]: Finished difference Result 98 states and 101 transitions. [2019-12-07 16:54:10,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-07 16:54:10,935 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 30 [2019-12-07 16:54:10,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:54:10,935 INFO L225 Difference]: With dead ends: 98 [2019-12-07 16:54:10,935 INFO L226 Difference]: Without dead ends: 98 [2019-12-07 16:54:10,936 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=140, Invalid=412, Unknown=0, NotChecked=0, Total=552 [2019-12-07 16:54:10,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-12-07 16:54:10,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 61. [2019-12-07 16:54:10,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-12-07 16:54:10,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 62 transitions. [2019-12-07 16:54:10,937 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 62 transitions. Word has length 30 [2019-12-07 16:54:10,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:54:10,937 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 62 transitions. [2019-12-07 16:54:10,937 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-07 16:54:10,937 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2019-12-07 16:54:10,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-07 16:54:10,937 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:54:10,937 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:54:11,138 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 mathsat -unsat_core_generation=3 [2019-12-07 16:54:11,138 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 16:54:11,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:54:11,139 INFO L82 PathProgramCache]: Analyzing trace with hash -775819286, now seen corresponding path program 1 times [2019-12-07 16:54:11,139 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 16:54:11,140 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1565243300] [2019-12-07 16:54:11,140 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c2ea65b5-aaea-47da-a0c6-b0febddd04df/bin/utaipan/mathsat Starting monitored process 33 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with mathsat -unsat_core_generation=3 [2019-12-07 16:54:11,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:54:11,234 INFO L264 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 47 conjunts are in the unsatisfiable core [2019-12-07 16:54:11,235 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:54:11,276 INFO L377 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 [2019-12-07 16:54:11,276 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:54:11,285 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:54:11,287 INFO L377 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 [2019-12-07 16:54:11,287 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 16:54:11,293 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:54:11,293 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:54:11,293 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:22 [2019-12-07 16:54:11,324 INFO L377 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 [2019-12-07 16:54:11,324 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:54:11,329 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:54:11,330 INFO L377 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 [2019-12-07 16:54:11,330 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 16:54:11,333 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:54:11,334 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:54:11,334 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2019-12-07 16:54:11,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:54:11,383 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:54:11,458 INFO L377 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 38 treesize of output 32 [2019-12-07 16:54:11,459 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-12-07 16:54:11,473 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:54:11,475 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:54:11,476 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:54:11,477 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 16:54:11,484 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:54:11,484 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 4 xjuncts. [2019-12-07 16:54:11,484 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:17 [2019-12-07 16:54:11,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:54:11,534 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1565243300] [2019-12-07 16:54:11,534 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:54:11,534 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12, 10] imperfect sequences [] total 16 [2019-12-07 16:54:11,534 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319096700] [2019-12-07 16:54:11,535 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-07 16:54:11,535 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 16:54:11,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-07 16:54:11,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2019-12-07 16:54:11,535 INFO L87 Difference]: Start difference. First operand 61 states and 62 transitions. Second operand 16 states. [2019-12-07 16:54:12,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:54:12,149 INFO L93 Difference]: Finished difference Result 99 states and 98 transitions. [2019-12-07 16:54:12,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-07 16:54:12,150 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 32 [2019-12-07 16:54:12,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:54:12,150 INFO L225 Difference]: With dead ends: 99 [2019-12-07 16:54:12,150 INFO L226 Difference]: Without dead ends: 99 [2019-12-07 16:54:12,151 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=174, Invalid=476, Unknown=0, NotChecked=0, Total=650 [2019-12-07 16:54:12,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-12-07 16:54:12,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 67. [2019-12-07 16:54:12,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-12-07 16:54:12,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2019-12-07 16:54:12,152 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 32 [2019-12-07 16:54:12,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:54:12,152 INFO L462 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2019-12-07 16:54:12,152 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-07 16:54:12,152 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2019-12-07 16:54:12,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-07 16:54:12,153 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:54:12,153 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:54:12,353 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 mathsat -unsat_core_generation=3 [2019-12-07 16:54:12,354 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 16:54:12,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:54:12,354 INFO L82 PathProgramCache]: Analyzing trace with hash -775819029, now seen corresponding path program 1 times [2019-12-07 16:54:12,354 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 16:54:12,355 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1444859613] [2019-12-07 16:54:12,355 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c2ea65b5-aaea-47da-a0c6-b0febddd04df/bin/utaipan/mathsat Starting monitored process 34 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with mathsat -unsat_core_generation=3 [2019-12-07 16:54:12,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:54:12,470 INFO L264 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 16:54:12,471 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:54:12,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:54:12,478 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:54:12,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:54:12,480 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1444859613] [2019-12-07 16:54:12,480 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:54:12,480 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-12-07 16:54:12,481 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543087062] [2019-12-07 16:54:12,481 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:54:12,481 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 16:54:12,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:54:12,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:54:12,481 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand 4 states. [2019-12-07 16:54:12,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:54:12,503 INFO L93 Difference]: Finished difference Result 66 states and 67 transitions. [2019-12-07 16:54:12,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 16:54:12,504 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2019-12-07 16:54:12,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:54:12,504 INFO L225 Difference]: With dead ends: 66 [2019-12-07 16:54:12,504 INFO L226 Difference]: Without dead ends: 66 [2019-12-07 16:54:12,504 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 16:54:12,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-12-07 16:54:12,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-12-07 16:54:12,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-12-07 16:54:12,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 67 transitions. [2019-12-07 16:54:12,505 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 67 transitions. Word has length 32 [2019-12-07 16:54:12,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:54:12,506 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 67 transitions. [2019-12-07 16:54:12,506 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:54:12,506 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 67 transitions. [2019-12-07 16:54:12,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 16:54:12,506 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:54:12,506 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:54:12,706 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 mathsat -unsat_core_generation=3 [2019-12-07 16:54:12,707 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 16:54:12,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:54:12,707 INFO L82 PathProgramCache]: Analyzing trace with hash 1719414022, now seen corresponding path program 1 times [2019-12-07 16:54:12,708 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 16:54:12,708 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1411360872] [2019-12-07 16:54:12,708 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c2ea65b5-aaea-47da-a0c6-b0febddd04df/bin/utaipan/mathsat Starting monitored process 35 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with mathsat -unsat_core_generation=3 [2019-12-07 16:54:12,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:54:12,790 INFO L264 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 16:54:12,791 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:54:12,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:54:12,846 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:54:12,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:54:12,875 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1411360872] [2019-12-07 16:54:12,875 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:54:12,875 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 3] imperfect sequences [] total 7 [2019-12-07 16:54:12,875 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893219719] [2019-12-07 16:54:12,876 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 16:54:12,876 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 16:54:12,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 16:54:12,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 16:54:12,876 INFO L87 Difference]: Start difference. First operand 66 states and 67 transitions. Second operand 8 states. [2019-12-07 16:54:12,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:54:12,991 INFO L93 Difference]: Finished difference Result 65 states and 66 transitions. [2019-12-07 16:54:12,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 16:54:12,992 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2019-12-07 16:54:12,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:54:12,992 INFO L225 Difference]: With dead ends: 65 [2019-12-07 16:54:12,992 INFO L226 Difference]: Without dead ends: 65 [2019-12-07 16:54:12,992 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-07 16:54:12,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-12-07 16:54:12,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-12-07 16:54:12,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-12-07 16:54:12,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 66 transitions. [2019-12-07 16:54:12,993 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 66 transitions. Word has length 33 [2019-12-07 16:54:12,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:54:12,993 INFO L462 AbstractCegarLoop]: Abstraction has 65 states and 66 transitions. [2019-12-07 16:54:12,993 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 16:54:12,994 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 66 transitions. [2019-12-07 16:54:12,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-07 16:54:12,994 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:54:12,994 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:54:13,194 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 mathsat -unsat_core_generation=3 [2019-12-07 16:54:13,195 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 16:54:13,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:54:13,195 INFO L82 PathProgramCache]: Analyzing trace with hash 1762227277, now seen corresponding path program 1 times [2019-12-07 16:54:13,195 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 16:54:13,196 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [953546985] [2019-12-07 16:54:13,196 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c2ea65b5-aaea-47da-a0c6-b0febddd04df/bin/utaipan/mathsat Starting monitored process 36 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with mathsat -unsat_core_generation=3 [2019-12-07 16:54:13,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:54:13,291 INFO L264 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 16:54:13,292 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:54:13,295 INFO L377 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 [2019-12-07 16:54:13,295 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:54:13,296 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:54:13,297 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:54:13,297 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 16:54:13,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:54:13,304 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:54:13,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:54:13,307 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [953546985] [2019-12-07 16:54:13,307 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:54:13,307 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-12-07 16:54:13,307 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128996955] [2019-12-07 16:54:13,307 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:54:13,307 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 16:54:13,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:54:13,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:54:13,308 INFO L87 Difference]: Start difference. First operand 65 states and 66 transitions. Second operand 4 states. [2019-12-07 16:54:13,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:54:13,415 INFO L93 Difference]: Finished difference Result 68 states and 69 transitions. [2019-12-07 16:54:13,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 16:54:13,415 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2019-12-07 16:54:13,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:54:13,416 INFO L225 Difference]: With dead ends: 68 [2019-12-07 16:54:13,416 INFO L226 Difference]: Without dead ends: 68 [2019-12-07 16:54:13,416 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 16:54:13,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-12-07 16:54:13,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-12-07 16:54:13,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-12-07 16:54:13,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 69 transitions. [2019-12-07 16:54:13,417 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 69 transitions. Word has length 34 [2019-12-07 16:54:13,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:54:13,418 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 69 transitions. [2019-12-07 16:54:13,418 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:54:13,418 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 69 transitions. [2019-12-07 16:54:13,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-07 16:54:13,418 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:54:13,418 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:54:13,618 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 mathsat -unsat_core_generation=3 [2019-12-07 16:54:13,619 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 16:54:13,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:54:13,619 INFO L82 PathProgramCache]: Analyzing trace with hash 281046357, now seen corresponding path program 1 times [2019-12-07 16:54:13,620 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 16:54:13,620 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1798226938] [2019-12-07 16:54:13,620 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c2ea65b5-aaea-47da-a0c6-b0febddd04df/bin/utaipan/mathsat Starting monitored process 37 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with mathsat -unsat_core_generation=3 [2019-12-07 16:54:13,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:54:13,735 INFO L264 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 41 conjunts are in the unsatisfiable core [2019-12-07 16:54:13,736 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:54:13,789 INFO L377 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 [2019-12-07 16:54:13,789 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:54:13,794 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:54:13,794 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:54:13,794 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2019-12-07 16:54:13,820 INFO L377 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 [2019-12-07 16:54:13,820 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:54:13,821 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:54:13,822 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:54:13,822 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-12-07 16:54:13,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:54:13,861 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:54:13,910 INFO L377 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 38 treesize of output 32 [2019-12-07 16:54:13,910 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-12-07 16:54:13,915 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:54:13,916 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-12-07 16:54:13,916 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:14 [2019-12-07 16:54:14,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:54:14,008 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1798226938] [2019-12-07 16:54:14,008 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:54:14,008 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13, 11] imperfect sequences [] total 19 [2019-12-07 16:54:14,008 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157145215] [2019-12-07 16:54:14,008 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-07 16:54:14,008 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 16:54:14,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-07 16:54:14,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=324, Unknown=0, NotChecked=0, Total=380 [2019-12-07 16:54:14,009 INFO L87 Difference]: Start difference. First operand 68 states and 69 transitions. Second operand 20 states. [2019-12-07 16:54:14,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:54:14,591 INFO L93 Difference]: Finished difference Result 67 states and 68 transitions. [2019-12-07 16:54:14,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-07 16:54:14,592 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 35 [2019-12-07 16:54:14,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:54:14,592 INFO L225 Difference]: With dead ends: 67 [2019-12-07 16:54:14,592 INFO L226 Difference]: Without dead ends: 67 [2019-12-07 16:54:14,593 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=217, Invalid=595, Unknown=0, NotChecked=0, Total=812 [2019-12-07 16:54:14,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-12-07 16:54:14,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-12-07 16:54:14,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-12-07 16:54:14,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2019-12-07 16:54:14,594 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 35 [2019-12-07 16:54:14,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:54:14,594 INFO L462 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2019-12-07 16:54:14,594 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-07 16:54:14,594 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2019-12-07 16:54:14,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-07 16:54:14,594 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:54:14,594 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:54:14,795 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 mathsat -unsat_core_generation=3 [2019-12-07 16:54:14,795 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 16:54:14,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:54:14,795 INFO L82 PathProgramCache]: Analyzing trace with hash 122502611, now seen corresponding path program 1 times [2019-12-07 16:54:14,795 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 16:54:14,795 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1921744695] [2019-12-07 16:54:14,795 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c2ea65b5-aaea-47da-a0c6-b0febddd04df/bin/utaipan/mathsat Starting monitored process 38 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with mathsat -unsat_core_generation=3 [2019-12-07 16:54:14,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:54:14,870 INFO L264 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 45 conjunts are in the unsatisfiable core [2019-12-07 16:54:14,871 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:54:15,033 INFO L377 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 [2019-12-07 16:54:15,033 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:54:15,051 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:54:15,051 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 16:54:15,051 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:23 [2019-12-07 16:54:15,173 INFO L377 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 [2019-12-07 16:54:15,173 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:54:15,182 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:54:15,182 INFO L534 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. [2019-12-07 16:54:15,182 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:11 [2019-12-07 16:54:15,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:54:15,325 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:54:15,638 INFO L377 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 38 treesize of output 32 [2019-12-07 16:54:15,638 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 16:54:15,669 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:54:15,670 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 16:54:15,670 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:36 [2019-12-07 16:54:16,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:54:16,081 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1921744695] [2019-12-07 16:54:16,081 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:54:16,081 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14, 12] imperfect sequences [] total 26 [2019-12-07 16:54:16,081 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644217951] [2019-12-07 16:54:16,081 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-12-07 16:54:16,082 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 16:54:16,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-12-07 16:54:16,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=601, Unknown=0, NotChecked=0, Total=702 [2019-12-07 16:54:16,082 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand 27 states. [2019-12-07 16:54:17,326 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 35 [2019-12-07 16:54:17,682 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 41 [2019-12-07 16:54:17,971 WARN L192 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 43 [2019-12-07 16:54:18,206 WARN L192 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 43 [2019-12-07 16:54:18,567 WARN L192 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 45 [2019-12-07 16:54:18,961 WARN L192 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 47 [2019-12-07 16:54:19,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:54:19,581 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2019-12-07 16:54:19,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-07 16:54:19,582 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 36 [2019-12-07 16:54:19,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:54:19,583 INFO L225 Difference]: With dead ends: 76 [2019-12-07 16:54:19,583 INFO L226 Difference]: Without dead ends: 76 [2019-12-07 16:54:19,583 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 41 SyntacticMatches, 4 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 391 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=524, Invalid=1456, Unknown=0, NotChecked=0, Total=1980 [2019-12-07 16:54:19,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-12-07 16:54:19,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 66. [2019-12-07 16:54:19,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-12-07 16:54:19,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 67 transitions. [2019-12-07 16:54:19,585 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 67 transitions. Word has length 36 [2019-12-07 16:54:19,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:54:19,585 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 67 transitions. [2019-12-07 16:54:19,585 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-12-07 16:54:19,585 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 67 transitions. [2019-12-07 16:54:19,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-07 16:54:19,585 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:54:19,585 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:54:19,785 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 mathsat -unsat_core_generation=3 [2019-12-07 16:54:19,786 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 16:54:19,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:54:19,786 INFO L82 PathProgramCache]: Analyzing trace with hash -497386217, now seen corresponding path program 1 times [2019-12-07 16:54:19,787 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 16:54:19,787 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1888021334] [2019-12-07 16:54:19,787 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c2ea65b5-aaea-47da-a0c6-b0febddd04df/bin/utaipan/mathsat Starting monitored process 39 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with mathsat -unsat_core_generation=3 [2019-12-07 16:54:19,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 16:54:20,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 16:54:20,134 INFO L174 FreeRefinementEngine]: Strategy WALRUS found a feasible trace [2019-12-07 16:54:20,134 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 16:54:20,335 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 mathsat -unsat_core_generation=3 [2019-12-07 16:54:20,371 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 04:54:20 BoogieIcfgContainer [2019-12-07 16:54:20,371 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 16:54:20,371 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 16:54:20,371 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 16:54:20,371 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 16:54:20,372 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 04:48:40" (3/4) ... [2019-12-07 16:54:20,373 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 16:54:20,409 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_c2ea65b5-aaea-47da-a0c6-b0febddd04df/bin/utaipan/witness.graphml [2019-12-07 16:54:20,409 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 16:54:20,410 INFO L168 Benchmark]: Toolchain (without parser) took 341210.55 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 203.4 MB). Free memory was 948.4 MB in the beginning and 1.1 GB in the end (delta: -146.5 MB). Peak memory consumption was 57.0 MB. Max. memory is 11.5 GB. [2019-12-07 16:54:20,410 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 16:54:20,410 INFO L168 Benchmark]: CACSL2BoogieTranslator took 456.94 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.4 MB). Free memory was 948.4 MB in the beginning and 1.1 GB in the end (delta: -124.8 MB). Peak memory consumption was 26.6 MB. Max. memory is 11.5 GB. [2019-12-07 16:54:20,410 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.74 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 16:54:20,411 INFO L168 Benchmark]: Boogie Preprocessor took 23.29 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2019-12-07 16:54:20,411 INFO L168 Benchmark]: RCFGBuilder took 386.73 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 41.0 MB). Peak memory consumption was 41.0 MB. Max. memory is 11.5 GB. [2019-12-07 16:54:20,411 INFO L168 Benchmark]: TraceAbstraction took 340261.74 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 77.1 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -69.5 MB). Peak memory consumption was 7.5 MB. Max. memory is 11.5 GB. [2019-12-07 16:54:20,411 INFO L168 Benchmark]: Witness Printer took 38.09 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 16:54:20,412 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 456.94 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.4 MB). Free memory was 948.4 MB in the beginning and 1.1 GB in the end (delta: -124.8 MB). Peak memory consumption was 26.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 40.74 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 23.29 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 386.73 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 41.0 MB). Peak memory consumption was 41.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 340261.74 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 77.1 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -69.5 MB). Peak memory consumption was 7.5 MB. Max. memory is 11.5 GB. * Witness Printer took 38.09 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 799]: free of unallocated memory possible free of unallocated memory possible We found a FailurePath: [L569] struct ldv_list_head ldv_global_msg_list = { &(ldv_global_msg_list), &(ldv_global_msg_list) }; VAL [ldv_global_msg_list={15:0}] [L526] COND TRUE __VERIFIER_nondet_int() [L527] return malloc(size); VAL [ldv_global_msg_list={15:0}] [L803] struct ldv_i2c_client *c11 = (struct ldv_i2c_client *)ldv_malloc(sizeof(struct ldv_i2c_client)); [L804] COND FALSE !(!c11) [L526] COND TRUE __VERIFIER_nondet_int() [L527] return malloc(size); VAL [ldv_global_msg_list={15:0}] [L805-L806] struct ldv_m88ts2022_config *cfg = (struct ldv_m88ts2022_config *) ldv_malloc(sizeof(struct ldv_m88ts2022_config)); [L807] COND FALSE !(!cfg) VAL [ldv_global_msg_list={15:0}] [L808] c11->dev.platform_data = cfg VAL [ldv_global_msg_list={15:0}] [L526] COND TRUE __VERIFIER_nondet_int() [L527] return malloc(size); VAL [ldv_global_msg_list={15:0}] [L809-L810] struct ldv_dvb_frontend *fe = (struct ldv_dvb_frontend *) ldv_malloc(sizeof(struct ldv_dvb_frontend)); [L811] COND FALSE !(!fe) VAL [ldv_global_msg_list={15:0}] [L812] cfg->fe = fe VAL [ldv_global_msg_list={15:0}] [L784] EXPR client->dev.platform_data VAL [ldv_global_msg_list={15:0}] [L784] struct ldv_m88ts2022_config *cfg = client->dev.platform_data; [L785] EXPR cfg->fe VAL [ldv_global_msg_list={15:0}] [L785] struct ldv_dvb_frontend *fe = cfg->fe; [L526] COND TRUE __VERIFIER_nondet_int() [L527] return malloc(size); VAL [ldv_global_msg_list={15:0}] [L786] struct Data11 *priv = (struct Data11*)ldv_malloc(sizeof(struct Data11)); [L787] COND FALSE !(!priv) VAL [ldv_global_msg_list={15:0}] [L788] fe->tuner_priv = priv VAL [ldv_global_msg_list={15:0}] [L623] dev->driver_data = data VAL [ldv_global_msg_list={15:0}] [L790] free(priv) VAL [ldv_global_msg_list={15:0}] [L790] free(priv) VAL [ldv_global_msg_list={15:0}] [L790] free(priv) [L791] return 0; VAL [ldv_global_msg_list={15:0}] [L619] EXPR dev->driver_data VAL [ldv_global_msg_list={15:0}] [L619] return dev->driver_data; [L774] return ldv_dev_get_drvdata(&dev->dev); [L797] void *priv = (struct Data11*)ldv_i2c_get_clientdata(client); [L798] COND TRUE \read(*priv) VAL [ldv_global_msg_list={15:0}] [L799] free(priv) VAL [ldv_global_msg_list={15:0}] [L799] free(priv) VAL [ldv_global_msg_list={15:0}] [L799] free(priv) VAL [ldv_global_msg_list={15:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 84 locations, 32 error locations. Result: UNSAFE, OverallTime: 340.1s, OverallIterations: 38, TraceHistogramMax: 1, AutomataDifference: 189.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2303 SDtfs, 10840 SDslu, 6154 SDs, 0 SdLazy, 6771 SolverSat, 808 SolverUnsat, 40 SolverUnknown, 0 SolverNotchecked, 113.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1639 GetRequests, 1122 SyntacticMatches, 27 SemanticMatches, 490 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2031 ImplicationChecksByTransitivity, 204.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=118occurred in iteration=11, 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, 37 MinimizatonAttempts, 2417 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 139.4s InterpolantComputationTime, 797 NumberOfCodeBlocks, 797 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 1446 ConstructedInterpolants, 225 QuantifiedInterpolants, 285262 SizeOfPredicates, 445 NumberOfNonLiveVariables, 3647 ConjunctsInSsa, 504 ConjunctsInUnsatCore, 74 InterpolantComputations, 74 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...