./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/ldv-memsafety/memleaks_test6_2.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_a7feec43-860d-451d-abdd-2c76607f9065/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_a7feec43-860d-451d-abdd-2c76607f9065/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_a7feec43-860d-451d-abdd-2c76607f9065/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_a7feec43-860d-451d-abdd-2c76607f9065/bin/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/ldv-memsafety/memleaks_test6_2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_a7feec43-860d-451d-abdd-2c76607f9065/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_a7feec43-860d-451d-abdd-2c76607f9065/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 098cac8041f427989b0fcb649de06793770da06a ........................................................................................................................................ 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_a7feec43-860d-451d-abdd-2c76607f9065/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_a7feec43-860d-451d-abdd-2c76607f9065/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_a7feec43-860d-451d-abdd-2c76607f9065/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_a7feec43-860d-451d-abdd-2c76607f9065/bin/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/ldv-memsafety/memleaks_test6_2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_a7feec43-860d-451d-abdd-2c76607f9065/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_a7feec43-860d-451d-abdd-2c76607f9065/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 098cac8041f427989b0fcb649de06793770da06a ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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 22:07:38,963 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 22:07:38,964 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 22:07:38,972 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 22:07:38,972 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 22:07:38,973 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 22:07:38,974 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 22:07:38,976 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 22:07:38,978 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 22:07:38,978 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 22:07:38,979 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 22:07:38,980 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 22:07:38,981 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 22:07:38,982 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 22:07:38,982 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 22:07:38,983 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 22:07:38,984 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 22:07:38,985 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 22:07:38,987 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 22:07:38,989 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 22:07:38,990 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 22:07:38,991 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 22:07:38,992 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 22:07:38,992 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 22:07:38,995 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 22:07:38,995 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 22:07:38,995 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 22:07:38,996 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 22:07:38,996 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 22:07:38,997 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 22:07:38,997 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 22:07:38,998 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 22:07:38,998 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 22:07:38,998 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 22:07:38,999 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 22:07:39,000 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 22:07:39,000 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 22:07:39,000 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 22:07:39,000 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 22:07:39,001 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 22:07:39,002 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 22:07:39,002 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_a7feec43-860d-451d-abdd-2c76607f9065/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2019-12-07 22:07:39,015 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 22:07:39,015 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 22:07:39,016 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 22:07:39,016 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 22:07:39,016 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 22:07:39,017 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 22:07:39,017 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 22:07:39,017 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 22:07:39,017 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 22:07:39,017 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 22:07:39,017 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 22:07:39,018 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 22:07:39,018 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 22:07:39,018 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 22:07:39,018 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 22:07:39,019 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 22:07:39,019 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 22:07:39,019 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 22:07:39,019 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 22:07:39,020 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 22:07:39,020 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 22:07:39,020 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 22:07:39,020 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 22:07:39,020 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-12-07 22:07:39,020 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-12-07 22:07:39,021 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-12-07 22:07:39,021 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 22:07:39,021 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 22:07:39,021 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 22:07:39,021 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 22:07:39,022 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 22:07:39,022 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 22:07:39,022 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 22:07:39,022 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 22:07:39,022 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 22:07:39,023 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 22:07:39,023 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 22:07:39,023 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 22:07:39,023 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 22:07:39,023 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 22:07:39,023 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_a7feec43-860d-451d-abdd-2c76607f9065/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 -> 098cac8041f427989b0fcb649de06793770da06a [2019-12-07 22:07:39,128 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 22:07:39,135 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 22:07:39,137 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 22:07:39,138 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 22:07:39,139 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 22:07:39,139 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_a7feec43-860d-451d-abdd-2c76607f9065/bin/utaipan/../../sv-benchmarks/c/ldv-memsafety/memleaks_test6_2.i [2019-12-07 22:07:39,177 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a7feec43-860d-451d-abdd-2c76607f9065/bin/utaipan/data/78630f800/c766b4e49e25412daeec161e69ae8ea1/FLAG37a3d1c59 [2019-12-07 22:07:39,588 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 22:07:39,589 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_a7feec43-860d-451d-abdd-2c76607f9065/sv-benchmarks/c/ldv-memsafety/memleaks_test6_2.i [2019-12-07 22:07:39,600 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a7feec43-860d-451d-abdd-2c76607f9065/bin/utaipan/data/78630f800/c766b4e49e25412daeec161e69ae8ea1/FLAG37a3d1c59 [2019-12-07 22:07:39,609 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_a7feec43-860d-451d-abdd-2c76607f9065/bin/utaipan/data/78630f800/c766b4e49e25412daeec161e69ae8ea1 [2019-12-07 22:07:39,611 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 22:07:39,612 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 22:07:39,612 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 22:07:39,612 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 22:07:39,615 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 22:07:39,615 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 10:07:39" (1/1) ... [2019-12-07 22:07:39,617 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74e739d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:39, skipping insertion in model container [2019-12-07 22:07:39,617 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 10:07:39" (1/1) ... [2019-12-07 22:07:39,623 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 22:07:39,652 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 22:07:39,906 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 22:07:39,920 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 22:07:39,921 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@4d3d41e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:39, skipping insertion in model container [2019-12-07 22:07:39,921 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 22:07:39,921 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2019-12-07 22:07:39,923 INFO L168 Benchmark]: Toolchain (without parser) took 310.81 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 95.9 MB). Free memory was 935.6 MB in the beginning and 1.1 GB in the end (delta: -144.1 MB). Peak memory consumption was 19.6 MB. Max. memory is 11.5 GB. [2019-12-07 22:07:39,924 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 955.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 22:07:39,924 INFO L168 Benchmark]: CACSL2BoogieTranslator took 308.94 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 95.9 MB). Free memory was 935.6 MB in the beginning and 1.1 GB in the end (delta: -144.1 MB). Peak memory consumption was 19.6 MB. Max. memory is 11.5 GB. [2019-12-07 22:07:39,926 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.13 ms. Allocated memory is still 1.0 GB. Free memory is still 955.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 308.94 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 95.9 MB). Free memory was 935.6 MB in the beginning and 1.1 GB in the end (delta: -144.1 MB). Peak memory consumption was 19.6 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 22:07:41,036 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 22:07:41,037 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 22:07:41,045 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 22:07:41,045 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 22:07:41,046 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 22:07:41,047 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 22:07:41,048 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 22:07:41,049 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 22:07:41,050 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 22:07:41,050 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 22:07:41,051 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 22:07:41,051 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 22:07:41,052 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 22:07:41,053 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 22:07:41,054 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 22:07:41,054 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 22:07:41,055 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 22:07:41,056 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 22:07:41,058 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 22:07:41,059 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 22:07:41,060 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 22:07:41,061 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 22:07:41,061 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 22:07:41,063 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 22:07:41,063 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 22:07:41,063 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 22:07:41,064 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 22:07:41,064 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 22:07:41,065 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 22:07:41,065 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 22:07:41,066 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 22:07:41,066 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 22:07:41,066 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 22:07:41,067 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 22:07:41,067 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 22:07:41,068 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 22:07:41,068 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 22:07:41,068 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 22:07:41,069 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 22:07:41,069 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 22:07:41,070 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_a7feec43-860d-451d-abdd-2c76607f9065/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2019-12-07 22:07:41,080 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 22:07:41,080 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 22:07:41,081 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 22:07:41,081 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 22:07:41,081 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 22:07:41,081 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 22:07:41,081 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 22:07:41,081 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 22:07:41,082 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 22:07:41,082 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 22:07:41,082 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 22:07:41,082 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 22:07:41,082 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 22:07:41,083 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 22:07:41,083 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 22:07:41,083 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 22:07:41,083 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 22:07:41,083 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-12-07 22:07:41,083 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-12-07 22:07:41,083 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-12-07 22:07:41,083 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 22:07:41,084 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 22:07:41,084 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-12-07 22:07:41,084 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-12-07 22:07:41,084 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 22:07:41,084 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 22:07:41,084 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 22:07:41,084 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 22:07:41,085 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 22:07:41,085 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 22:07:41,085 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 22:07:41,085 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 22:07:41,085 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 22:07:41,085 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2019-12-07 22:07:41,085 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-12-07 22:07:41,085 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 22:07:41,086 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 22:07:41,086 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_a7feec43-860d-451d-abdd-2c76607f9065/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 -> 098cac8041f427989b0fcb649de06793770da06a [2019-12-07 22:07:41,264 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 22:07:41,272 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 22:07:41,274 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 22:07:41,275 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 22:07:41,275 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 22:07:41,276 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_a7feec43-860d-451d-abdd-2c76607f9065/bin/utaipan/../../sv-benchmarks/c/ldv-memsafety/memleaks_test6_2.i [2019-12-07 22:07:41,313 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a7feec43-860d-451d-abdd-2c76607f9065/bin/utaipan/data/e0f0390dd/b1e08e880cdc432094e5ffab588f3c3d/FLAGe8c2d8061 [2019-12-07 22:07:41,805 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 22:07:41,805 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_a7feec43-860d-451d-abdd-2c76607f9065/sv-benchmarks/c/ldv-memsafety/memleaks_test6_2.i [2019-12-07 22:07:41,817 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a7feec43-860d-451d-abdd-2c76607f9065/bin/utaipan/data/e0f0390dd/b1e08e880cdc432094e5ffab588f3c3d/FLAGe8c2d8061 [2019-12-07 22:07:41,829 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_a7feec43-860d-451d-abdd-2c76607f9065/bin/utaipan/data/e0f0390dd/b1e08e880cdc432094e5ffab588f3c3d [2019-12-07 22:07:41,831 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 22:07:41,833 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 22:07:41,833 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 22:07:41,834 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 22:07:41,837 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 22:07:41,837 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 10:07:41" (1/1) ... [2019-12-07 22:07:41,840 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 10:07:41, skipping insertion in model container [2019-12-07 22:07:41,840 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 10:07:41" (1/1) ... [2019-12-07 22:07:41,845 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 22:07:41,878 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 22:07:42,150 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 22:07:42,164 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2019-12-07 22:07:42,170 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 22:07:42,203 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 22:07:42,209 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 22:07:42,245 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 22:07:42,299 INFO L208 MainTranslator]: Completed translation [2019-12-07 22:07:42,299 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:42 WrapperNode [2019-12-07 22:07:42,300 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 22:07:42,300 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 22:07:42,300 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 22:07:42,300 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 22:07:42,305 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:42" (1/1) ... [2019-12-07 22:07:42,322 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:42" (1/1) ... [2019-12-07 22:07:42,337 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 22:07:42,338 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 22:07:42,338 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 22:07:42,338 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 22:07:42,344 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:42" (1/1) ... [2019-12-07 22:07:42,345 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:42" (1/1) ... [2019-12-07 22:07:42,347 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:42" (1/1) ... [2019-12-07 22:07:42,347 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:42" (1/1) ... [2019-12-07 22:07:42,353 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:42" (1/1) ... [2019-12-07 22:07:42,355 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:42" (1/1) ... [2019-12-07 22:07:42,356 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:42" (1/1) ... [2019-12-07 22:07:42,358 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 22:07:42,358 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 22:07:42,359 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 22:07:42,359 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 22:07:42,359 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:42" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a7feec43-860d-451d-abdd-2c76607f9065/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 22:07:42,398 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-07 22:07:42,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-07 22:07:42,398 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 22:07:42,398 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-12-07 22:07:42,398 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 22:07:42,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-12-07 22:07:42,399 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 22:07:42,399 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 22:07:42,625 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 22:07:42,625 INFO L287 CfgBuilder]: Removed 16 assume(true) statements. [2019-12-07 22:07:42,626 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:07:42 BoogieIcfgContainer [2019-12-07 22:07:42,626 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 22:07:42,627 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 22:07:42,627 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 22:07:42,629 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 22:07:42,629 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 10:07:41" (1/3) ... [2019-12-07 22:07:42,630 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@defafc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 10:07:42, skipping insertion in model container [2019-12-07 22:07:42,630 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:42" (2/3) ... [2019-12-07 22:07:42,630 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@defafc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 10:07:42, skipping insertion in model container [2019-12-07 22:07:42,630 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:07:42" (3/3) ... [2019-12-07 22:07:42,631 INFO L109 eAbstractionObserver]: Analyzing ICFG memleaks_test6_2.i [2019-12-07 22:07:42,638 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 22:07:42,642 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 16 error locations. [2019-12-07 22:07:42,649 INFO L249 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2019-12-07 22:07:42,661 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 22:07:42,662 INFO L374 AbstractCegarLoop]: Hoare is false [2019-12-07 22:07:42,662 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 22:07:42,662 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 22:07:42,662 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 22:07:42,662 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 22:07:42,662 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 22:07:42,662 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 22:07:42,672 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states. [2019-12-07 22:07:42,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-12-07 22:07:42,676 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 22:07:42,677 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 22:07:42,677 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 22:07:42,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 22:07:42,681 INFO L82 PathProgramCache]: Analyzing trace with hash 119413611, now seen corresponding path program 1 times [2019-12-07 22:07:42,688 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 22:07:42,689 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2104444673] [2019-12-07 22:07:42,689 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a7feec43-860d-451d-abdd-2c76607f9065/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 22:07:42,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 22:07:42,744 INFO L264 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 22:07:42,748 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 22:07:42,772 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 22:07:42,772 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 22:07:42,775 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 22:07:42,776 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2104444673] [2019-12-07 22:07:42,776 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 22:07:42,776 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-12-07 22:07:42,777 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685211695] [2019-12-07 22:07:42,780 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 22:07:42,780 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 22:07:42,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 22:07:42,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 22:07:42,791 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 4 states. [2019-12-07 22:07:42,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 22:07:42,857 INFO L93 Difference]: Finished difference Result 81 states and 87 transitions. [2019-12-07 22:07:42,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 22:07:42,858 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-12-07 22:07:42,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 22:07:42,865 INFO L225 Difference]: With dead ends: 81 [2019-12-07 22:07:42,865 INFO L226 Difference]: Without dead ends: 77 [2019-12-07 22:07:42,866 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 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 22:07:42,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-12-07 22:07:42,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 42. [2019-12-07 22:07:42,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-12-07 22:07:42,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2019-12-07 22:07:42,891 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 8 [2019-12-07 22:07:42,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 22:07:42,891 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2019-12-07 22:07:42,891 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 22:07:42,891 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2019-12-07 22:07:42,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-12-07 22:07:42,892 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 22:07:42,892 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 22:07:43,092 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-12-07 22:07:43,094 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 22:07:43,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 22:07:43,095 INFO L82 PathProgramCache]: Analyzing trace with hash 119443421, now seen corresponding path program 1 times [2019-12-07 22:07:43,096 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 22:07:43,097 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [789323051] [2019-12-07 22:07:43,097 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a7feec43-860d-451d-abdd-2c76607f9065/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 22:07:43,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 22:07:43,171 INFO L264 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 22:07:43,172 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 22:07:43,181 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 22:07:43,182 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 22:07:43,186 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 22:07:43,186 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [789323051] [2019-12-07 22:07:43,187 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 22:07:43,187 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-12-07 22:07:43,187 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954162994] [2019-12-07 22:07:43,188 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 22:07:43,188 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 22:07:43,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 22:07:43,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 22:07:43,189 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand 4 states. [2019-12-07 22:07:43,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 22:07:43,211 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2019-12-07 22:07:43,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 22:07:43,211 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-12-07 22:07:43,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 22:07:43,212 INFO L225 Difference]: With dead ends: 40 [2019-12-07 22:07:43,212 INFO L226 Difference]: Without dead ends: 40 [2019-12-07 22:07:43,213 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 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 22:07:43,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-12-07 22:07:43,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-12-07 22:07:43,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-12-07 22:07:43,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2019-12-07 22:07:43,217 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 8 [2019-12-07 22:07:43,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 22:07:43,217 INFO L462 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2019-12-07 22:07:43,217 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 22:07:43,217 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2019-12-07 22:07:43,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-12-07 22:07:43,218 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 22:07:43,218 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 22:07:43,418 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-12-07 22:07:43,420 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 22:07:43,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 22:07:43,421 INFO L82 PathProgramCache]: Analyzing trace with hash 176671913, now seen corresponding path program 1 times [2019-12-07 22:07:43,422 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 22:07:43,423 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1215713505] [2019-12-07 22:07:43,423 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a7feec43-860d-451d-abdd-2c76607f9065/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 22:07:43,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 22:07:43,496 INFO L264 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 22:07:43,497 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 22:07:43,513 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 22:07:43,513 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 22:07:43,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 22:07:43,534 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1215713505] [2019-12-07 22:07:43,534 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 22:07:43,534 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2019-12-07 22:07:43,535 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023313148] [2019-12-07 22:07:43,535 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 22:07:43,535 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 22:07:43,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 22:07:43,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-07 22:07:43,535 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand 8 states. [2019-12-07 22:07:43,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 22:07:43,616 INFO L93 Difference]: Finished difference Result 59 states and 60 transitions. [2019-12-07 22:07:43,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 22:07:43,616 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-12-07 22:07:43,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 22:07:43,617 INFO L225 Difference]: With dead ends: 59 [2019-12-07 22:07:43,617 INFO L226 Difference]: Without dead ends: 59 [2019-12-07 22:07:43,617 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2019-12-07 22:07:43,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-12-07 22:07:43,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 42. [2019-12-07 22:07:43,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-12-07 22:07:43,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2019-12-07 22:07:43,621 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 8 [2019-12-07 22:07:43,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 22:07:43,621 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2019-12-07 22:07:43,621 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 22:07:43,622 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2019-12-07 22:07:43,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-12-07 22:07:43,622 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 22:07:43,622 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 22:07:43,822 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-12-07 22:07:43,823 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 22:07:43,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 22:07:43,823 INFO L82 PathProgramCache]: Analyzing trace with hash 176672298, now seen corresponding path program 1 times [2019-12-07 22:07:43,823 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 22:07:43,824 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1526582574] [2019-12-07 22:07:43,824 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a7feec43-860d-451d-abdd-2c76607f9065/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 22:07:43,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 22:07:43,860 INFO L264 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 22:07:43,861 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 22:07:43,922 INFO L343 Elim1Store]: treesize reduction 27, result has 50.9 percent of original size [2019-12-07 22:07:43,923 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 2 case distinctions, treesize of input 12 treesize of output 33 [2019-12-07 22:07:43,924 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 22:07:43,945 INFO L614 ElimStorePlain]: treesize reduction 10, result has 69.7 percent of original size [2019-12-07 22:07:43,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 22:07:43,949 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 22:07:43,949 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:23 [2019-12-07 22:07:43,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 22:07:43,962 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 22:07:43,962 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 22:07:43,964 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 22:07:43,964 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1526582574] [2019-12-07 22:07:43,964 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 22:07:43,965 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1, 1] imperfect sequences [] total 1 [2019-12-07 22:07:43,965 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810673443] [2019-12-07 22:07:43,965 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 22:07:43,965 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 22:07:43,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 22:07:43,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 22:07:43,966 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand 3 states. [2019-12-07 22:07:44,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 22:07:44,011 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2019-12-07 22:07:44,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 22:07:44,012 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-12-07 22:07:44,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 22:07:44,012 INFO L225 Difference]: With dead ends: 46 [2019-12-07 22:07:44,013 INFO L226 Difference]: Without dead ends: 46 [2019-12-07 22:07:44,013 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 13 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 22:07:44,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-12-07 22:07:44,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2019-12-07 22:07:44,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-12-07 22:07:44,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2019-12-07 22:07:44,018 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 8 [2019-12-07 22:07:44,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 22:07:44,018 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 50 transitions. [2019-12-07 22:07:44,018 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 22:07:44,019 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2019-12-07 22:07:44,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-12-07 22:07:44,019 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 22:07:44,019 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 22:07:44,220 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-12-07 22:07:44,221 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 22:07:44,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 22:07:44,222 INFO L82 PathProgramCache]: Analyzing trace with hash 176672299, now seen corresponding path program 1 times [2019-12-07 22:07:44,223 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 22:07:44,224 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1743674433] [2019-12-07 22:07:44,225 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a7feec43-860d-451d-abdd-2c76607f9065/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 22:07:44,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 22:07:44,319 INFO L264 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 22:07:44,320 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 22:07:44,340 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 22:07:44,340 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 22:07:44,341 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 22:07:44,360 INFO L614 ElimStorePlain]: treesize reduction 10, result has 64.3 percent of original size [2019-12-07 22:07:44,361 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 22:07:44,361 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-12-07 22:07:44,370 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 22:07:44,370 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 22:07:44,399 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 22:07:44,400 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1743674433] [2019-12-07 22:07:44,400 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 22:07:44,400 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1, 1] imperfect sequences [] total 2 [2019-12-07 22:07:44,401 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758045267] [2019-12-07 22:07:44,401 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 22:07:44,401 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 22:07:44,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 22:07:44,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 22:07:44,402 INFO L87 Difference]: Start difference. First operand 45 states and 50 transitions. Second operand 4 states. [2019-12-07 22:07:44,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 22:07:44,486 INFO L93 Difference]: Finished difference Result 79 states and 85 transitions. [2019-12-07 22:07:44,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 22:07:44,487 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-12-07 22:07:44,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 22:07:44,488 INFO L225 Difference]: With dead ends: 79 [2019-12-07 22:07:44,488 INFO L226 Difference]: Without dead ends: 79 [2019-12-07 22:07:44,488 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 22:07:44,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-12-07 22:07:44,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 65. [2019-12-07 22:07:44,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-12-07 22:07:44,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 84 transitions. [2019-12-07 22:07:44,494 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 84 transitions. Word has length 8 [2019-12-07 22:07:44,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 22:07:44,494 INFO L462 AbstractCegarLoop]: Abstraction has 65 states and 84 transitions. [2019-12-07 22:07:44,494 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 22:07:44,494 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 84 transitions. [2019-12-07 22:07:44,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 22:07:44,494 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 22:07:44,494 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 22:07:44,695 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-12-07 22:07:44,696 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 22:07:44,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 22:07:44,697 INFO L82 PathProgramCache]: Analyzing trace with hash -592221173, now seen corresponding path program 1 times [2019-12-07 22:07:44,698 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 22:07:44,699 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1781489316] [2019-12-07 22:07:44,699 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a7feec43-860d-451d-abdd-2c76607f9065/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 22:07:44,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 22:07:44,780 INFO L264 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 22:07:44,781 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 22:07:44,806 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 22:07:44,806 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 22:07:44,822 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 22:07:44,822 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1781489316] [2019-12-07 22:07:44,822 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 22:07:44,822 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 6 [2019-12-07 22:07:44,822 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078882447] [2019-12-07 22:07:44,822 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 22:07:44,823 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 22:07:44,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 22:07:44,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-07 22:07:44,823 INFO L87 Difference]: Start difference. First operand 65 states and 84 transitions. Second operand 7 states. [2019-12-07 22:07:44,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 22:07:44,938 INFO L93 Difference]: Finished difference Result 75 states and 81 transitions. [2019-12-07 22:07:44,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 22:07:44,939 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 9 [2019-12-07 22:07:44,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 22:07:44,939 INFO L225 Difference]: With dead ends: 75 [2019-12-07 22:07:44,939 INFO L226 Difference]: Without dead ends: 75 [2019-12-07 22:07:44,940 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-12-07 22:07:44,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-12-07 22:07:44,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 63. [2019-12-07 22:07:44,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-12-07 22:07:44,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 80 transitions. [2019-12-07 22:07:44,944 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 80 transitions. Word has length 9 [2019-12-07 22:07:44,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 22:07:44,944 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 80 transitions. [2019-12-07 22:07:44,944 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 22:07:44,945 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 80 transitions. [2019-12-07 22:07:44,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 22:07:44,945 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 22:07:44,945 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 22:07:45,146 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-12-07 22:07:45,147 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 22:07:45,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 22:07:45,148 INFO L82 PathProgramCache]: Analyzing trace with hash 1181873979, now seen corresponding path program 1 times [2019-12-07 22:07:45,149 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 22:07:45,149 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [639393506] [2019-12-07 22:07:45,149 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a7feec43-860d-451d-abdd-2c76607f9065/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 22:07:45,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 22:07:45,230 INFO L264 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 22:07:45,231 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 22:07:45,235 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 22:07:45,235 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 22:07:45,236 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 22:07:45,236 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [639393506] [2019-12-07 22:07:45,237 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 22:07:45,237 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-12-07 22:07:45,237 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834815581] [2019-12-07 22:07:45,237 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 22:07:45,237 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 22:07:45,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 22:07:45,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 22:07:45,238 INFO L87 Difference]: Start difference. First operand 63 states and 80 transitions. Second operand 3 states. [2019-12-07 22:07:45,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 22:07:45,285 INFO L93 Difference]: Finished difference Result 68 states and 80 transitions. [2019-12-07 22:07:45,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 22:07:45,285 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-07 22:07:45,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 22:07:45,286 INFO L225 Difference]: With dead ends: 68 [2019-12-07 22:07:45,286 INFO L226 Difference]: Without dead ends: 64 [2019-12-07 22:07:45,286 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 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 22:07:45,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-12-07 22:07:45,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 60. [2019-12-07 22:07:45,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-12-07 22:07:45,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 76 transitions. [2019-12-07 22:07:45,289 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 76 transitions. Word has length 9 [2019-12-07 22:07:45,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 22:07:45,290 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 76 transitions. [2019-12-07 22:07:45,290 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 22:07:45,290 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 76 transitions. [2019-12-07 22:07:45,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-07 22:07:45,290 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 22:07:45,290 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 22:07:45,491 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2019-12-07 22:07:45,492 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 22:07:45,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 22:07:45,493 INFO L82 PathProgramCache]: Analyzing trace with hash -1178987105, now seen corresponding path program 1 times [2019-12-07 22:07:45,494 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 22:07:45,494 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [238457118] [2019-12-07 22:07:45,495 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a7feec43-860d-451d-abdd-2c76607f9065/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 22:07:45,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 22:07:45,562 INFO L264 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 22:07:45,562 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 22:07:45,566 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 22:07:45,566 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 22:07:45,567 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 22:07:45,567 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 22:07:45,568 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 22:07:45,575 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 22:07:45,575 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 22:07:45,577 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 22:07:45,577 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [238457118] [2019-12-07 22:07:45,577 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 22:07:45,577 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-12-07 22:07:45,578 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980320454] [2019-12-07 22:07:45,578 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 22:07:45,578 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 22:07:45,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 22:07:45,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 22:07:45,578 INFO L87 Difference]: Start difference. First operand 60 states and 76 transitions. Second operand 4 states. [2019-12-07 22:07:45,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 22:07:45,652 INFO L93 Difference]: Finished difference Result 62 states and 74 transitions. [2019-12-07 22:07:45,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 22:07:45,652 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-12-07 22:07:45,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 22:07:45,652 INFO L225 Difference]: With dead ends: 62 [2019-12-07 22:07:45,653 INFO L226 Difference]: Without dead ends: 62 [2019-12-07 22:07:45,653 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 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 22:07:45,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-12-07 22:07:45,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 60. [2019-12-07 22:07:45,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-12-07 22:07:45,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 74 transitions. [2019-12-07 22:07:45,657 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 74 transitions. Word has length 10 [2019-12-07 22:07:45,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 22:07:45,658 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 74 transitions. [2019-12-07 22:07:45,658 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 22:07:45,658 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 74 transitions. [2019-12-07 22:07:45,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-07 22:07:45,658 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 22:07:45,659 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 22:07:45,859 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2019-12-07 22:07:45,861 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 22:07:45,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 22:07:45,861 INFO L82 PathProgramCache]: Analyzing trace with hash -1178944307, now seen corresponding path program 1 times [2019-12-07 22:07:45,862 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 22:07:45,863 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [244983991] [2019-12-07 22:07:45,863 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a7feec43-860d-451d-abdd-2c76607f9065/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 22:07:45,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 22:07:45,955 INFO L264 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 22:07:45,956 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 22:07:45,991 INFO L343 Elim1Store]: treesize reduction 27, result has 50.9 percent of original size [2019-12-07 22:07:45,991 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 2 case distinctions, treesize of input 12 treesize of output 33 [2019-12-07 22:07:45,991 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 22:07:46,009 INFO L614 ElimStorePlain]: treesize reduction 10, result has 69.7 percent of original size [2019-12-07 22:07:46,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 22:07:46,011 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 22:07:46,011 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:23 [2019-12-07 22:07:46,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 22:07:46,042 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 22:07:46,042 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 22:07:46,043 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 22:07:46,053 INFO L614 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2019-12-07 22:07:46,054 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 22:07:46,054 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:11 [2019-12-07 22:07:46,060 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 22:07:46,060 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 22:07:46,072 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 22:07:46,072 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [244983991] [2019-12-07 22:07:46,072 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 22:07:46,073 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-12-07 22:07:46,073 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634128206] [2019-12-07 22:07:46,073 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 22:07:46,073 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 22:07:46,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 22:07:46,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 22:07:46,073 INFO L87 Difference]: Start difference. First operand 60 states and 74 transitions. Second operand 4 states. [2019-12-07 22:07:46,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 22:07:46,117 INFO L93 Difference]: Finished difference Result 59 states and 72 transitions. [2019-12-07 22:07:46,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 22:07:46,117 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-12-07 22:07:46,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 22:07:46,117 INFO L225 Difference]: With dead ends: 59 [2019-12-07 22:07:46,117 INFO L226 Difference]: Without dead ends: 59 [2019-12-07 22:07:46,118 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 3 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 22:07:46,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-12-07 22:07:46,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-12-07 22:07:46,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-12-07 22:07:46,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 72 transitions. [2019-12-07 22:07:46,120 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 72 transitions. Word has length 10 [2019-12-07 22:07:46,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 22:07:46,120 INFO L462 AbstractCegarLoop]: Abstraction has 59 states and 72 transitions. [2019-12-07 22:07:46,120 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 22:07:46,120 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 72 transitions. [2019-12-07 22:07:46,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-07 22:07:46,121 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 22:07:46,121 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 22:07:46,322 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 mathsat -unsat_core_generation=3 [2019-12-07 22:07:46,323 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 22:07:46,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 22:07:46,324 INFO L82 PathProgramCache]: Analyzing trace with hash -1178944306, now seen corresponding path program 1 times [2019-12-07 22:07:46,324 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 22:07:46,325 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2031924292] [2019-12-07 22:07:46,325 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a7feec43-860d-451d-abdd-2c76607f9065/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 22:07:46,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 22:07:46,435 INFO L264 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 22:07:46,436 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 22:07:46,453 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 22:07:46,453 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 22:07:46,453 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 22:07:46,471 INFO L614 ElimStorePlain]: treesize reduction 10, result has 64.3 percent of original size [2019-12-07 22:07:46,471 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 22:07:46,471 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-12-07 22:07:46,499 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 22:07:46,499 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 22:07:46,500 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 22:07:46,515 INFO L614 ElimStorePlain]: treesize reduction 14, result has 50.0 percent of original size [2019-12-07 22:07:46,515 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 22:07:46,516 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:14 [2019-12-07 22:07:46,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 22:07:46,530 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 22:07:46,701 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 22:07:46,701 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2031924292] [2019-12-07 22:07:46,702 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 22:07:46,702 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 6 [2019-12-07 22:07:46,702 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42622095] [2019-12-07 22:07:46,702 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 22:07:46,702 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 22:07:46,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 22:07:46,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-07 22:07:46,702 INFO L87 Difference]: Start difference. First operand 59 states and 72 transitions. Second operand 8 states. [2019-12-07 22:07:46,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 22:07:46,746 INFO L93 Difference]: Finished difference Result 57 states and 69 transitions. [2019-12-07 22:07:46,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 22:07:46,747 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 10 [2019-12-07 22:07:46,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 22:07:46,747 INFO L225 Difference]: With dead ends: 57 [2019-12-07 22:07:46,747 INFO L226 Difference]: Without dead ends: 57 [2019-12-07 22:07:46,747 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-07 22:07:46,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-12-07 22:07:46,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 48. [2019-12-07 22:07:46,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-12-07 22:07:46,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 53 transitions. [2019-12-07 22:07:46,749 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 53 transitions. Word has length 10 [2019-12-07 22:07:46,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 22:07:46,750 INFO L462 AbstractCegarLoop]: Abstraction has 48 states and 53 transitions. [2019-12-07 22:07:46,750 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 22:07:46,750 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2019-12-07 22:07:46,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-07 22:07:46,750 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 22:07:46,750 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 22:07:46,951 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 mathsat -unsat_core_generation=3 [2019-12-07 22:07:46,952 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 22:07:46,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 22:07:46,952 INFO L82 PathProgramCache]: Analyzing trace with hash -1988333731, now seen corresponding path program 1 times [2019-12-07 22:07:46,953 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 22:07:46,953 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1690729159] [2019-12-07 22:07:46,954 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a7feec43-860d-451d-abdd-2c76607f9065/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 22:07:47,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 22:07:47,013 INFO L264 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 22:07:47,014 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 22:07:47,025 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 22:07:47,025 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 22:07:47,026 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 22:07:47,026 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1690729159] [2019-12-07 22:07:47,026 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 22:07:47,026 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-12-07 22:07:47,026 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117513659] [2019-12-07 22:07:47,026 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 22:07:47,027 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 22:07:47,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 22:07:47,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 22:07:47,027 INFO L87 Difference]: Start difference. First operand 48 states and 53 transitions. Second operand 4 states. [2019-12-07 22:07:47,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 22:07:47,050 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2019-12-07 22:07:47,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 22:07:47,050 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-12-07 22:07:47,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 22:07:47,051 INFO L225 Difference]: With dead ends: 35 [2019-12-07 22:07:47,051 INFO L226 Difference]: Without dead ends: 33 [2019-12-07 22:07:47,051 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 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 22:07:47,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-12-07 22:07:47,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-12-07 22:07:47,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-12-07 22:07:47,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2019-12-07 22:07:47,053 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 10 [2019-12-07 22:07:47,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 22:07:47,053 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2019-12-07 22:07:47,053 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 22:07:47,053 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2019-12-07 22:07:47,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 22:07:47,053 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 22:07:47,053 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 22:07:47,254 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 mathsat -unsat_core_generation=3 [2019-12-07 22:07:47,255 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 22:07:47,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 22:07:47,255 INFO L82 PathProgramCache]: Analyzing trace with hash 1037777585, now seen corresponding path program 1 times [2019-12-07 22:07:47,256 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 22:07:47,256 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [730503491] [2019-12-07 22:07:47,257 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a7feec43-860d-451d-abdd-2c76607f9065/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 22:07:47,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 22:07:47,328 INFO L264 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 22:07:47,329 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 22:07:47,369 INFO L343 Elim1Store]: treesize reduction 27, result has 50.9 percent of original size [2019-12-07 22:07:47,370 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 2 case distinctions, treesize of input 12 treesize of output 33 [2019-12-07 22:07:47,370 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 22:07:47,387 INFO L614 ElimStorePlain]: treesize reduction 10, result has 69.7 percent of original size [2019-12-07 22:07:47,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 22:07:47,389 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 22:07:47,389 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:23 [2019-12-07 22:07:47,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 22:07:47,411 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 22:07:47,412 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 17 treesize of output 39 [2019-12-07 22:07:47,412 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 22:07:47,425 INFO L614 ElimStorePlain]: treesize reduction 14, result has 51.7 percent of original size [2019-12-07 22:07:47,426 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 22:07:47,426 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:15 [2019-12-07 22:07:47,449 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 17 treesize of output 17 [2019-12-07 22:07:47,450 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 22:07:47,459 INFO L614 ElimStorePlain]: treesize reduction 4, result has 73.3 percent of original size [2019-12-07 22:07:47,459 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 22:07:47,460 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:11 [2019-12-07 22:07:47,473 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 22:07:47,474 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 22:07:47,496 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 22:07:47,496 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [730503491] [2019-12-07 22:07:47,496 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 22:07:47,496 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 3] imperfect sequences [] total 6 [2019-12-07 22:07:47,496 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558485825] [2019-12-07 22:07:47,497 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 22:07:47,497 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 22:07:47,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 22:07:47,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-12-07 22:07:47,497 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand 8 states. [2019-12-07 22:07:53,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 22:07:53,628 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2019-12-07 22:07:53,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 22:07:53,629 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2019-12-07 22:07:53,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 22:07:53,629 INFO L225 Difference]: With dead ends: 36 [2019-12-07 22:07:53,629 INFO L226 Difference]: Without dead ends: 36 [2019-12-07 22:07:53,630 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-12-07 22:07:53,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-12-07 22:07:53,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2019-12-07 22:07:53,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-12-07 22:07:53,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2019-12-07 22:07:53,631 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 13 [2019-12-07 22:07:53,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 22:07:53,631 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 36 transitions. [2019-12-07 22:07:53,631 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 22:07:53,631 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2019-12-07 22:07:53,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 22:07:53,632 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 22:07:53,632 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 22:07:53,832 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 mathsat -unsat_core_generation=3 [2019-12-07 22:07:53,833 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 22:07:53,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 22:07:53,834 INFO L82 PathProgramCache]: Analyzing trace with hash 2106334100, now seen corresponding path program 1 times [2019-12-07 22:07:53,835 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 22:07:53,835 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1495352310] [2019-12-07 22:07:53,836 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a7feec43-860d-451d-abdd-2c76607f9065/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 22:07:53,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 22:07:53,897 INFO L264 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 22:07:53,898 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 22:07:55,937 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 22:07:55,937 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 22:08:03,444 WARN L192 SmtUtils]: Spent 1.44 s on a formula simplification that was a NOOP. DAG size: 11 [2019-12-07 22:08:03,446 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 22:08:03,446 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1495352310] [2019-12-07 22:08:03,446 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 22:08:03,446 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2019-12-07 22:08:03,446 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666894149] [2019-12-07 22:08:03,447 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 22:08:03,447 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 22:08:03,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 22:08:03,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=48, Unknown=4, NotChecked=0, Total=72 [2019-12-07 22:08:03,447 INFO L87 Difference]: Start difference. First operand 34 states and 36 transitions. Second operand 9 states. [2019-12-07 22:08:05,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 22:08:05,629 INFO L93 Difference]: Finished difference Result 35 states and 36 transitions. [2019-12-07 22:08:05,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 22:08:05,629 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 14 [2019-12-07 22:08:05,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 22:08:05,630 INFO L225 Difference]: With dead ends: 35 [2019-12-07 22:08:05,630 INFO L226 Difference]: Without dead ends: 28 [2019-12-07 22:08:05,630 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=33, Invalid=73, Unknown=4, NotChecked=0, Total=110 [2019-12-07 22:08:05,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-12-07 22:08:05,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-12-07 22:08:05,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-12-07 22:08:05,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 27 transitions. [2019-12-07 22:08:05,631 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 27 transitions. Word has length 14 [2019-12-07 22:08:05,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 22:08:05,631 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 27 transitions. [2019-12-07 22:08:05,631 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 22:08:05,631 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 27 transitions. [2019-12-07 22:08:05,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 22:08:05,632 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 22:08:05,632 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 22:08:05,832 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 mathsat -unsat_core_generation=3 [2019-12-07 22:08:05,833 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 22:08:05,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 22:08:05,834 INFO L82 PathProgramCache]: Analyzing trace with hash 2072222585, now seen corresponding path program 1 times [2019-12-07 22:08:05,834 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 22:08:05,834 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [982728998] [2019-12-07 22:08:05,835 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a7feec43-860d-451d-abdd-2c76607f9065/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 22:08:05,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 22:08:05,915 INFO L264 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-07 22:08:05,917 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 22:08:05,960 INFO L343 Elim1Store]: treesize reduction 27, result has 50.9 percent of original size [2019-12-07 22:08:05,960 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 2 case distinctions, treesize of input 12 treesize of output 33 [2019-12-07 22:08:05,960 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 22:08:05,983 INFO L614 ElimStorePlain]: treesize reduction 10, result has 69.7 percent of original size [2019-12-07 22:08:05,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 22:08:05,984 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 22:08:05,984 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:23 [2019-12-07 22:08:05,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 22:08:06,015 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 22:08:06,016 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 17 treesize of output 39 [2019-12-07 22:08:06,016 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 22:08:06,033 INFO L614 ElimStorePlain]: treesize reduction 14, result has 56.3 percent of original size [2019-12-07 22:08:06,034 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 22:08:06,034 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:18 [2019-12-07 22:08:06,070 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 17 treesize of output 17 [2019-12-07 22:08:06,071 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 22:08:06,079 INFO L614 ElimStorePlain]: treesize reduction 4, result has 73.3 percent of original size [2019-12-07 22:08:06,079 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 22:08:06,079 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:11 [2019-12-07 22:08:06,107 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 22:08:06,108 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 22:08:06,166 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 22:08:06,166 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [982728998] [2019-12-07 22:08:06,166 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 22:08:06,166 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 5] imperfect sequences [] total 11 [2019-12-07 22:08:06,166 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108230475] [2019-12-07 22:08:06,167 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-07 22:08:06,167 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 22:08:06,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-07 22:08:06,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-12-07 22:08:06,167 INFO L87 Difference]: Start difference. First operand 28 states and 27 transitions. Second operand 13 states. [2019-12-07 22:08:12,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 22:08:12,453 INFO L93 Difference]: Finished difference Result 27 states and 26 transitions. [2019-12-07 22:08:12,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 22:08:12,453 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 16 [2019-12-07 22:08:12,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 22:08:12,454 INFO L225 Difference]: With dead ends: 27 [2019-12-07 22:08:12,454 INFO L226 Difference]: Without dead ends: 27 [2019-12-07 22:08:12,454 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2019-12-07 22:08:12,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-12-07 22:08:12,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-12-07 22:08:12,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-12-07 22:08:12,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 26 transitions. [2019-12-07 22:08:12,455 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 26 transitions. Word has length 16 [2019-12-07 22:08:12,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 22:08:12,455 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 26 transitions. [2019-12-07 22:08:12,455 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-07 22:08:12,455 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 26 transitions. [2019-12-07 22:08:12,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 22:08:12,456 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 22:08:12,456 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 22:08:12,656 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 mathsat -unsat_core_generation=3 [2019-12-07 22:08:12,657 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 22:08:12,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 22:08:12,658 INFO L82 PathProgramCache]: Analyzing trace with hash 2072222586, now seen corresponding path program 1 times [2019-12-07 22:08:12,659 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 22:08:12,659 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1485164166] [2019-12-07 22:08:12,659 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a7feec43-860d-451d-abdd-2c76607f9065/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 22:08:12,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 22:08:12,733 INFO L264 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 11 conjunts are in the unsatisfiable core [2019-12-07 22:08:12,734 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 22:08:12,773 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 22:08:12,773 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 22:08:12,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 22:08:12,861 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 22:08:12,862 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 22:08:12,877 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 22:08:12,877 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 22:08:12,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 22:08:12,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 22:08:12,879 INFO L534 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 22:08:12,917 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 22:08:12,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 22:08:12,919 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 22:08:12,919 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:33 [2019-12-07 22:08:12,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 22:08:13,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 22:08:13,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 22:08:13,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 22:08:13,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 22:08:13,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 22:08:13,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 22:08:13,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 22:08:13,791 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 22:08:13,792 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1485164166] [2019-12-07 22:08:13,792 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 22:08:13,792 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 8 [2019-12-07 22:08:13,792 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384048925] [2019-12-07 22:08:13,792 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 22:08:13,792 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 22:08:13,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 22:08:13,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-12-07 22:08:13,793 INFO L87 Difference]: Start difference. First operand 27 states and 26 transitions. Second operand 10 states. [2019-12-07 22:08:13,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 22:08:13,907 INFO L93 Difference]: Finished difference Result 26 states and 25 transitions. [2019-12-07 22:08:13,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 22:08:13,908 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2019-12-07 22:08:13,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 22:08:13,909 INFO L225 Difference]: With dead ends: 26 [2019-12-07 22:08:13,909 INFO L226 Difference]: Without dead ends: 26 [2019-12-07 22:08:13,909 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 15 SyntacticMatches, 7 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2019-12-07 22:08:13,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-12-07 22:08:13,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-12-07 22:08:13,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-12-07 22:08:13,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 25 transitions. [2019-12-07 22:08:13,911 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 25 transitions. Word has length 16 [2019-12-07 22:08:13,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 22:08:13,911 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 25 transitions. [2019-12-07 22:08:13,911 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 22:08:13,911 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 25 transitions. [2019-12-07 22:08:13,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 22:08:13,912 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 22:08:13,912 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 22:08:14,112 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 mathsat -unsat_core_generation=3 [2019-12-07 22:08:14,114 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 22:08:14,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 22:08:14,115 INFO L82 PathProgramCache]: Analyzing trace with hash -185609283, now seen corresponding path program 1 times [2019-12-07 22:08:14,116 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 22:08:14,117 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1026421977] [2019-12-07 22:08:14,117 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a7feec43-860d-451d-abdd-2c76607f9065/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 22:08:14,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 22:08:14,248 INFO L264 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-07 22:08:14,250 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 22:08:14,283 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 22:08:14,283 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 22:08:14,285 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 22:08:14,285 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 22:08:14,285 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2019-12-07 22:08:14,304 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 22:08:14,305 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 22:08:14,306 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 22:08:14,306 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 22:08:14,306 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2019-12-07 22:08:14,316 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 22:08:14,316 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 22:08:14,322 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 28 treesize of output 24 [2019-12-07 22:08:14,323 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-12-07 22:08:14,329 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 22:08:14,329 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-12-07 22:08:14,330 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:10 [2019-12-07 22:08:14,332 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 22:08:14,332 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1026421977] [2019-12-07 22:08:14,332 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 22:08:14,333 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 7 [2019-12-07 22:08:14,333 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328014104] [2019-12-07 22:08:14,333 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 22:08:14,333 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 22:08:14,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 22:08:14,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-07 22:08:14,333 INFO L87 Difference]: Start difference. First operand 26 states and 25 transitions. Second operand 8 states. [2019-12-07 22:08:14,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 22:08:14,481 INFO L93 Difference]: Finished difference Result 25 states and 24 transitions. [2019-12-07 22:08:14,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 22:08:14,482 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2019-12-07 22:08:14,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 22:08:14,482 INFO L225 Difference]: With dead ends: 25 [2019-12-07 22:08:14,482 INFO L226 Difference]: Without dead ends: 25 [2019-12-07 22:08:14,483 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2019-12-07 22:08:14,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-12-07 22:08:14,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-12-07 22:08:14,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-12-07 22:08:14,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 24 transitions. [2019-12-07 22:08:14,484 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 24 transitions. Word has length 17 [2019-12-07 22:08:14,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 22:08:14,484 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 24 transitions. [2019-12-07 22:08:14,484 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 22:08:14,484 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 24 transitions. [2019-12-07 22:08:14,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 22:08:14,485 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 22:08:14,485 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 22:08:14,686 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 mathsat -unsat_core_generation=3 [2019-12-07 22:08:14,687 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 22:08:14,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 22:08:14,688 INFO L82 PathProgramCache]: Analyzing trace with hash -1458920391, now seen corresponding path program 1 times [2019-12-07 22:08:14,689 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 22:08:14,689 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [791688228] [2019-12-07 22:08:14,690 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a7feec43-860d-451d-abdd-2c76607f9065/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 22:08:14,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 22:08:14,808 INFO L264 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 17 conjunts are in the unsatisfiable core [2019-12-07 22:08:14,809 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 22:08:14,864 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 22:08:14,864 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 22:08:14,874 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 22:08:14,875 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 22:08:14,875 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2019-12-07 22:08:14,935 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 23 treesize of output 11 [2019-12-07 22:08:14,935 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 22:08:14,940 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 22:08:14,940 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 22:08:14,940 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:8 [2019-12-07 22:08:14,960 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 22:08:14,960 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 22:08:15,037 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 28 treesize of output 24 [2019-12-07 22:08:15,038 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 22:08:15,077 INFO L614 ElimStorePlain]: treesize reduction 13, result has 53.6 percent of original size [2019-12-07 22:08:15,078 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 22:08:15,078 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:15 [2019-12-07 22:08:15,186 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 22:08:15,186 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [791688228] [2019-12-07 22:08:15,186 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 22:08:15,186 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 16 [2019-12-07 22:08:15,187 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342678261] [2019-12-07 22:08:15,187 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-07 22:08:15,187 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 22:08:15,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-07 22:08:15,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2019-12-07 22:08:15,187 INFO L87 Difference]: Start difference. First operand 25 states and 24 transitions. Second operand 17 states. [2019-12-07 22:08:15,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 22:08:15,616 INFO L93 Difference]: Finished difference Result 24 states and 23 transitions. [2019-12-07 22:08:15,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 22:08:15,616 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 18 [2019-12-07 22:08:15,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 22:08:15,616 INFO L225 Difference]: With dead ends: 24 [2019-12-07 22:08:15,617 INFO L226 Difference]: Without dead ends: 24 [2019-12-07 22:08:15,617 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=167, Invalid=385, Unknown=0, NotChecked=0, Total=552 [2019-12-07 22:08:15,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-12-07 22:08:15,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-12-07 22:08:15,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-12-07 22:08:15,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 23 transitions. [2019-12-07 22:08:15,618 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 23 transitions. Word has length 18 [2019-12-07 22:08:15,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 22:08:15,618 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 23 transitions. [2019-12-07 22:08:15,618 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-07 22:08:15,618 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 23 transitions. [2019-12-07 22:08:15,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 22:08:15,619 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 22:08:15,619 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 22:08:15,819 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 mathsat -unsat_core_generation=3 [2019-12-07 22:08:15,820 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 22:08:15,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 22:08:15,821 INFO L82 PathProgramCache]: Analyzing trace with hash 2018108223, now seen corresponding path program 1 times [2019-12-07 22:08:15,821 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 22:08:15,822 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [533273096] [2019-12-07 22:08:15,822 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a7feec43-860d-451d-abdd-2c76607f9065/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 22:08:15,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 22:08:15,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 22:08:15,988 INFO L174 FreeRefinementEngine]: Strategy WALRUS found a feasible trace [2019-12-07 22:08:15,988 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 22:08:16,188 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 mathsat -unsat_core_generation=3 [2019-12-07 22:08:16,217 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 10:08:16 BoogieIcfgContainer [2019-12-07 22:08:16,217 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 22:08:16,217 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 22:08:16,217 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 22:08:16,217 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 22:08:16,218 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:07:42" (3/4) ... [2019-12-07 22:08:16,219 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 22:08:16,249 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_a7feec43-860d-451d-abdd-2c76607f9065/bin/utaipan/witness.graphml [2019-12-07 22:08:16,249 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 22:08:16,250 INFO L168 Benchmark]: Toolchain (without parser) took 34418.27 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 314.0 MB). Free memory was 947.0 MB in the beginning and 1.2 GB in the end (delta: -256.4 MB). Peak memory consumption was 57.7 MB. Max. memory is 11.5 GB. [2019-12-07 22:08:16,250 INFO L168 Benchmark]: CDTParser took 0.13 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 22:08:16,251 INFO L168 Benchmark]: CACSL2BoogieTranslator took 466.36 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.3 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -126.0 MB). Peak memory consumption was 26.3 MB. Max. memory is 11.5 GB. [2019-12-07 22:08:16,251 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.67 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.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-12-07 22:08:16,251 INFO L168 Benchmark]: Boogie Preprocessor took 20.45 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 22:08:16,251 INFO L168 Benchmark]: RCFGBuilder took 267.74 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: 33.2 MB). Peak memory consumption was 33.2 MB. Max. memory is 11.5 GB. [2019-12-07 22:08:16,252 INFO L168 Benchmark]: TraceAbstraction took 33590.21 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 189.8 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -170.2 MB). Peak memory consumption was 19.5 MB. Max. memory is 11.5 GB. [2019-12-07 22:08:16,252 INFO L168 Benchmark]: Witness Printer took 32.27 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 22:08:16,253 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.13 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 466.36 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.3 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -126.0 MB). Peak memory consumption was 26.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 37.67 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.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.45 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. * RCFGBuilder took 267.74 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: 33.2 MB). Peak memory consumption was 33.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 33590.21 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 189.8 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -170.2 MB). Peak memory consumption was 19.5 MB. Max. memory is 11.5 GB. * Witness Printer took 32.27 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 782]: 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) }; [L784] struct A a6; VAL [a6={3:0}, ldv_global_msg_list={7:0}] [L764] int ret = - -3; [L526] COND TRUE __VERIFIER_nondet_int() [L527] return malloc(size); VAL [a6={3:0}, ldv_global_msg_list={7:0}] [L765] int *p = (int *)ldv_malloc(sizeof(int)); [L766] COND FALSE !(p==0) [L758] return __VERIFIER_nondet_int(); [L768] ret = f6() [L769] COND FALSE !(ret<0) [L761] return __VERIFIER_nondet_int(); [L771] ret = g6() [L772] COND FALSE !(ret<0) VAL [a6={3:0}, ldv_global_msg_list={7:0}] [L774] a->p = p VAL [a6={3:0}, ldv_global_msg_list={7:0}] [L775] free(p) VAL [a6={3:0}, ldv_global_msg_list={7:0}] [L775] free(p) VAL [a6={3:0}, ldv_global_msg_list={7:0}] [L775] free(p) [L776] return 0; VAL [a6={3:0}, ldv_global_msg_list={7:0}] [L786] int ret = probe3_6(&a6); [L787] COND TRUE ret==0 [L782] EXPR a->p VAL [a6={3:0}, ldv_global_msg_list={7:0}] [L782] free(a->p) VAL [a6={3:0}, ldv_global_msg_list={7:0}] [L782] free(a->p) VAL [a6={3:0}, ldv_global_msg_list={7:0}] [L782] free(a->p) VAL [a6={3:0}, ldv_global_msg_list={7:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 42 locations, 16 error locations. Result: UNSAFE, OverallTime: 33.5s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 15.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 516 SDtfs, 1089 SDslu, 644 SDs, 0 SdLazy, 573 SolverSat, 80 SolverUnsat, 7 SolverUnknown, 0 SolverNotchecked, 14.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 387 GetRequests, 254 SyntacticMatches, 12 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 12.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=65occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 17 MinimizatonAttempts, 96 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 12.2s InterpolantComputationTime, 211 NumberOfCodeBlocks, 211 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 350 ConstructedInterpolants, 22 QuantifiedInterpolants, 36211 SizeOfPredicates, 89 NumberOfNonLiveVariables, 885 ConjunctsInSsa, 117 ConjunctsInUnsatCore, 34 InterpolantComputations, 34 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...