./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-ext-properties/test-0232_1-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_031189cb-02dd-46a2-b9ab-4c48dc668343/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_031189cb-02dd-46a2-b9ab-4c48dc668343/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_031189cb-02dd-46a2-b9ab-4c48dc668343/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_031189cb-02dd-46a2-b9ab-4c48dc668343/bin/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-ext-properties/test-0232_1-1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_031189cb-02dd-46a2-b9ab-4c48dc668343/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_031189cb-02dd-46a2-b9ab-4c48dc668343/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 0db1674e58e1126b93b48759a00b2e69f0d5f058 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_031189cb-02dd-46a2-b9ab-4c48dc668343/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_031189cb-02dd-46a2-b9ab-4c48dc668343/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_031189cb-02dd-46a2-b9ab-4c48dc668343/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_031189cb-02dd-46a2-b9ab-4c48dc668343/bin/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-ext-properties/test-0232_1-1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_031189cb-02dd-46a2-b9ab-4c48dc668343/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_031189cb-02dd-46a2-b9ab-4c48dc668343/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 0db1674e58e1126b93b48759a00b2e69f0d5f058 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 16:59:55,865 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 16:59:55,867 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 16:59:55,876 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 16:59:55,876 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 16:59:55,876 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 16:59:55,877 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 16:59:55,879 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 16:59:55,880 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 16:59:55,881 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 16:59:55,881 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 16:59:55,882 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 16:59:55,882 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 16:59:55,883 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 16:59:55,883 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 16:59:55,884 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 16:59:55,885 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 16:59:55,885 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 16:59:55,887 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 16:59:55,889 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 16:59:55,890 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 16:59:55,891 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 16:59:55,892 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 16:59:55,892 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 16:59:55,894 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 16:59:55,894 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 16:59:55,895 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 16:59:55,895 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 16:59:55,895 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 16:59:55,896 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 16:59:55,896 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 16:59:55,897 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 16:59:55,897 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 16:59:55,898 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 16:59:55,899 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 16:59:55,899 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 16:59:55,899 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 16:59:55,900 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 16:59:55,900 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 16:59:55,900 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 16:59:55,901 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 16:59:55,902 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_031189cb-02dd-46a2-b9ab-4c48dc668343/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2019-12-07 16:59:55,915 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 16:59:55,915 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 16:59:55,916 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 16:59:55,916 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 16:59:55,916 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 16:59:55,916 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 16:59:55,916 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 16:59:55,917 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 16:59:55,917 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 16:59:55,917 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 16:59:55,917 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 16:59:55,917 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 16:59:55,917 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 16:59:55,918 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 16:59:55,918 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 16:59:55,918 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 16:59:55,919 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 16:59:55,919 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 16:59:55,919 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 16:59:55,919 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 16:59:55,919 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 16:59:55,919 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 16:59:55,920 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 16:59:55,920 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-12-07 16:59:55,920 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-12-07 16:59:55,920 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-12-07 16:59:55,920 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 16:59:55,921 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 16:59:55,921 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 16:59:55,921 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 16:59:55,921 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 16:59:55,921 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 16:59:55,921 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 16:59:55,922 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 16:59:55,922 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 16:59:55,922 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 16:59:55,922 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 16:59:55,922 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 16:59:55,923 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 16:59:55,923 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 16:59:55,923 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_031189cb-02dd-46a2-b9ab-4c48dc668343/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 -> 0db1674e58e1126b93b48759a00b2e69f0d5f058 [2019-12-07 16:59:56,025 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 16:59:56,034 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 16:59:56,036 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 16:59:56,037 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 16:59:56,037 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 16:59:56,038 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_031189cb-02dd-46a2-b9ab-4c48dc668343/bin/utaipan/../../sv-benchmarks/c/list-ext-properties/test-0232_1-1.i [2019-12-07 16:59:56,074 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_031189cb-02dd-46a2-b9ab-4c48dc668343/bin/utaipan/data/1ba898bc9/053da7c4058543de9cffda5353ba6ba2/FLAG9119c07e8 [2019-12-07 16:59:56,519 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 16:59:56,519 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_031189cb-02dd-46a2-b9ab-4c48dc668343/sv-benchmarks/c/list-ext-properties/test-0232_1-1.i [2019-12-07 16:59:56,529 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_031189cb-02dd-46a2-b9ab-4c48dc668343/bin/utaipan/data/1ba898bc9/053da7c4058543de9cffda5353ba6ba2/FLAG9119c07e8 [2019-12-07 16:59:56,539 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_031189cb-02dd-46a2-b9ab-4c48dc668343/bin/utaipan/data/1ba898bc9/053da7c4058543de9cffda5353ba6ba2 [2019-12-07 16:59:56,541 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 16:59:56,542 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 16:59:56,542 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 16:59:56,542 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 16:59:56,545 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 16:59:56,545 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 04:59:56" (1/1) ... [2019-12-07 16:59:56,547 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@731888a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:59:56, skipping insertion in model container [2019-12-07 16:59:56,547 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 04:59:56" (1/1) ... [2019-12-07 16:59:56,552 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 16:59:56,576 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 16:59:56,787 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 16:59:56,792 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 16:59:56,820 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 16:59:56,851 INFO L208 MainTranslator]: Completed translation [2019-12-07 16:59:56,851 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:59:56 WrapperNode [2019-12-07 16:59:56,851 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 16:59:56,852 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 16:59:56,852 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 16:59:56,852 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 16:59:56,857 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:59:56" (1/1) ... [2019-12-07 16:59:56,867 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:59:56" (1/1) ... [2019-12-07 16:59:56,882 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 16:59:56,882 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 16:59:56,882 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 16:59:56,882 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 16:59:56,888 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:59:56" (1/1) ... [2019-12-07 16:59:56,888 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:59:56" (1/1) ... [2019-12-07 16:59:56,891 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:59:56" (1/1) ... [2019-12-07 16:59:56,891 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:59:56" (1/1) ... [2019-12-07 16:59:56,896 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:59:56" (1/1) ... [2019-12-07 16:59:56,899 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:59:56" (1/1) ... [2019-12-07 16:59:56,900 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:59:56" (1/1) ... [2019-12-07 16:59:56,902 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 16:59:56,902 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 16:59:56,902 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 16:59:56,902 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 16:59:56,903 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:59:56" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_031189cb-02dd-46a2-b9ab-4c48dc668343/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 16:59:56,941 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-07 16:59:56,942 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 16:59:56,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-07 16:59:56,942 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-12-07 16:59:56,942 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 16:59:56,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-12-07 16:59:56,942 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 16:59:56,942 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 16:59:57,243 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 16:59:57,244 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 16:59:57,244 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 04:59:57 BoogieIcfgContainer [2019-12-07 16:59:57,244 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 16:59:57,245 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 16:59:57,245 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 16:59:57,248 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 16:59:57,248 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 04:59:56" (1/3) ... [2019-12-07 16:59:57,248 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@511be2dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 04:59:57, skipping insertion in model container [2019-12-07 16:59:57,249 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:59:56" (2/3) ... [2019-12-07 16:59:57,249 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@511be2dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 04:59:57, skipping insertion in model container [2019-12-07 16:59:57,249 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 04:59:57" (3/3) ... [2019-12-07 16:59:57,250 INFO L109 eAbstractionObserver]: Analyzing ICFG test-0232_1-1.i [2019-12-07 16:59:57,257 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 16:59:57,262 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 44 error locations. [2019-12-07 16:59:57,269 INFO L249 AbstractCegarLoop]: Starting to check reachability of 44 error locations. [2019-12-07 16:59:57,281 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 16:59:57,281 INFO L374 AbstractCegarLoop]: Hoare is false [2019-12-07 16:59:57,281 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 16:59:57,282 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 16:59:57,282 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 16:59:57,282 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 16:59:57,282 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 16:59:57,282 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 16:59:57,295 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states. [2019-12-07 16:59:57,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-07 16:59:57,300 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:59:57,301 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-07 16:59:57,301 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr37REQUIRES_VIOLATION]=== [2019-12-07 16:59:57,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:59:57,304 INFO L82 PathProgramCache]: Analyzing trace with hash 153954, now seen corresponding path program 1 times [2019-12-07 16:59:57,310 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:59:57,310 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870975647] [2019-12-07 16:59:57,311 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:59:57,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:59:57,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:59:57,430 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870975647] [2019-12-07 16:59:57,431 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:59:57,431 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 16:59:57,432 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056488709] [2019-12-07 16:59:57,435 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:59:57,435 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:59:57,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:59:57,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:59:57,445 INFO L87 Difference]: Start difference. First operand 79 states. Second operand 4 states. [2019-12-07 16:59:57,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:59:57,569 INFO L93 Difference]: Finished difference Result 101 states and 106 transitions. [2019-12-07 16:59:57,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:59:57,571 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-12-07 16:59:57,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:59:57,578 INFO L225 Difference]: With dead ends: 101 [2019-12-07 16:59:57,578 INFO L226 Difference]: Without dead ends: 100 [2019-12-07 16:59:57,579 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 16:59:57,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-12-07 16:59:57,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 73. [2019-12-07 16:59:57,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-12-07 16:59:57,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 78 transitions. [2019-12-07 16:59:57,605 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 78 transitions. Word has length 3 [2019-12-07 16:59:57,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:59:57,605 INFO L462 AbstractCegarLoop]: Abstraction has 73 states and 78 transitions. [2019-12-07 16:59:57,605 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:59:57,605 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 78 transitions. [2019-12-07 16:59:57,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-07 16:59:57,605 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:59:57,605 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-07 16:59:57,606 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr37REQUIRES_VIOLATION]=== [2019-12-07 16:59:57,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:59:57,606 INFO L82 PathProgramCache]: Analyzing trace with hash 153955, now seen corresponding path program 1 times [2019-12-07 16:59:57,606 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:59:57,607 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781499115] [2019-12-07 16:59:57,607 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:59:57,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:59:57,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:59:57,645 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781499115] [2019-12-07 16:59:57,645 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:59:57,645 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 16:59:57,645 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043890131] [2019-12-07 16:59:57,646 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:59:57,646 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:59:57,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:59:57,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:59:57,646 INFO L87 Difference]: Start difference. First operand 73 states and 78 transitions. Second operand 4 states. [2019-12-07 16:59:57,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:59:57,824 INFO L93 Difference]: Finished difference Result 170 states and 179 transitions. [2019-12-07 16:59:57,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 16:59:57,824 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-12-07 16:59:57,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:59:57,826 INFO L225 Difference]: With dead ends: 170 [2019-12-07 16:59:57,826 INFO L226 Difference]: Without dead ends: 170 [2019-12-07 16:59:57,826 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 16:59:57,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-12-07 16:59:57,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 79. [2019-12-07 16:59:57,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-12-07 16:59:57,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 90 transitions. [2019-12-07 16:59:57,833 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 90 transitions. Word has length 3 [2019-12-07 16:59:57,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:59:57,834 INFO L462 AbstractCegarLoop]: Abstraction has 79 states and 90 transitions. [2019-12-07 16:59:57,834 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:59:57,834 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 90 transitions. [2019-12-07 16:59:57,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-12-07 16:59:57,834 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:59:57,834 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-12-07 16:59:57,834 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr37REQUIRES_VIOLATION]=== [2019-12-07 16:59:57,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:59:57,835 INFO L82 PathProgramCache]: Analyzing trace with hash 4772554, now seen corresponding path program 1 times [2019-12-07 16:59:57,835 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:59:57,835 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271322300] [2019-12-07 16:59:57,835 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:59:57,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:59:57,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:59:57,855 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271322300] [2019-12-07 16:59:57,855 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:59:57,855 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 16:59:57,855 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461077506] [2019-12-07 16:59:57,856 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:59:57,856 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:59:57,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:59:57,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:59:57,856 INFO L87 Difference]: Start difference. First operand 79 states and 90 transitions. Second operand 3 states. [2019-12-07 16:59:57,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:59:57,912 INFO L93 Difference]: Finished difference Result 92 states and 98 transitions. [2019-12-07 16:59:57,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:59:57,912 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-12-07 16:59:57,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:59:57,913 INFO L225 Difference]: With dead ends: 92 [2019-12-07 16:59:57,913 INFO L226 Difference]: Without dead ends: 92 [2019-12-07 16:59:57,913 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:59:57,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-12-07 16:59:57,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 75. [2019-12-07 16:59:57,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-12-07 16:59:57,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 85 transitions. [2019-12-07 16:59:57,920 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 85 transitions. Word has length 4 [2019-12-07 16:59:57,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:59:57,920 INFO L462 AbstractCegarLoop]: Abstraction has 75 states and 85 transitions. [2019-12-07 16:59:57,920 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:59:57,920 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 85 transitions. [2019-12-07 16:59:57,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-12-07 16:59:57,920 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:59:57,920 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-12-07 16:59:57,921 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr37REQUIRES_VIOLATION]=== [2019-12-07 16:59:57,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:59:57,921 INFO L82 PathProgramCache]: Analyzing trace with hash 4772555, now seen corresponding path program 1 times [2019-12-07 16:59:57,921 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:59:57,921 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286384572] [2019-12-07 16:59:57,922 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:59:57,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:59:57,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:59:57,948 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286384572] [2019-12-07 16:59:57,948 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:59:57,948 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 16:59:57,948 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773819795] [2019-12-07 16:59:57,949 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:59:57,949 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:59:57,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:59:57,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:59:57,949 INFO L87 Difference]: Start difference. First operand 75 states and 85 transitions. Second operand 3 states. [2019-12-07 16:59:57,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:59:57,982 INFO L93 Difference]: Finished difference Result 72 states and 81 transitions. [2019-12-07 16:59:57,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:59:57,982 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-12-07 16:59:57,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:59:57,983 INFO L225 Difference]: With dead ends: 72 [2019-12-07 16:59:57,983 INFO L226 Difference]: Without dead ends: 72 [2019-12-07 16:59:57,983 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:59:57,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-12-07 16:59:57,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2019-12-07 16:59:57,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-12-07 16:59:57,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 80 transitions. [2019-12-07 16:59:57,987 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 80 transitions. Word has length 4 [2019-12-07 16:59:57,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:59:57,987 INFO L462 AbstractCegarLoop]: Abstraction has 71 states and 80 transitions. [2019-12-07 16:59:57,987 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:59:57,987 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 80 transitions. [2019-12-07 16:59:57,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-12-07 16:59:57,988 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:59:57,988 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:59:57,988 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr37REQUIRES_VIOLATION]=== [2019-12-07 16:59:57,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:59:57,988 INFO L82 PathProgramCache]: Analyzing trace with hash 1029578956, now seen corresponding path program 1 times [2019-12-07 16:59:57,988 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:59:57,988 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950921692] [2019-12-07 16:59:57,988 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:59:57,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:59:58,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:59:58,044 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950921692] [2019-12-07 16:59:58,045 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:59:58,045 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 16:59:58,045 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395174085] [2019-12-07 16:59:58,045 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 16:59:58,045 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:59:58,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 16:59:58,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 16:59:58,046 INFO L87 Difference]: Start difference. First operand 71 states and 80 transitions. Second operand 7 states. [2019-12-07 16:59:58,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:59:58,168 INFO L93 Difference]: Finished difference Result 79 states and 88 transitions. [2019-12-07 16:59:58,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 16:59:58,168 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2019-12-07 16:59:58,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:59:58,169 INFO L225 Difference]: With dead ends: 79 [2019-12-07 16:59:58,169 INFO L226 Difference]: Without dead ends: 79 [2019-12-07 16:59:58,169 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-12-07 16:59:58,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-12-07 16:59:58,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 76. [2019-12-07 16:59:58,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-12-07 16:59:58,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 85 transitions. [2019-12-07 16:59:58,173 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 85 transitions. Word has length 8 [2019-12-07 16:59:58,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:59:58,173 INFO L462 AbstractCegarLoop]: Abstraction has 76 states and 85 transitions. [2019-12-07 16:59:58,174 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 16:59:58,174 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 85 transitions. [2019-12-07 16:59:58,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-12-07 16:59:58,174 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:59:58,174 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:59:58,174 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr37REQUIRES_VIOLATION]=== [2019-12-07 16:59:58,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:59:58,175 INFO L82 PathProgramCache]: Analyzing trace with hash 1029591182, now seen corresponding path program 1 times [2019-12-07 16:59:58,175 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:59:58,175 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923455178] [2019-12-07 16:59:58,175 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:59:58,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:59:58,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:59:58,238 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923455178] [2019-12-07 16:59:58,238 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:59:58,238 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:59:58,239 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179204826] [2019-12-07 16:59:58,239 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 16:59:58,239 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:59:58,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 16:59:58,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 16:59:58,239 INFO L87 Difference]: Start difference. First operand 76 states and 85 transitions. Second operand 6 states. [2019-12-07 16:59:58,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:59:58,352 INFO L93 Difference]: Finished difference Result 91 states and 96 transitions. [2019-12-07 16:59:58,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 16:59:58,352 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 8 [2019-12-07 16:59:58,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:59:58,353 INFO L225 Difference]: With dead ends: 91 [2019-12-07 16:59:58,353 INFO L226 Difference]: Without dead ends: 91 [2019-12-07 16:59:58,354 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-12-07 16:59:58,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-12-07 16:59:58,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 73. [2019-12-07 16:59:58,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-12-07 16:59:58,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 82 transitions. [2019-12-07 16:59:58,359 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 82 transitions. Word has length 8 [2019-12-07 16:59:58,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:59:58,359 INFO L462 AbstractCegarLoop]: Abstraction has 73 states and 82 transitions. [2019-12-07 16:59:58,359 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 16:59:58,359 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 82 transitions. [2019-12-07 16:59:58,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-12-07 16:59:58,360 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:59:58,360 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:59:58,361 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr37REQUIRES_VIOLATION]=== [2019-12-07 16:59:58,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:59:58,361 INFO L82 PathProgramCache]: Analyzing trace with hash -754889711, now seen corresponding path program 1 times [2019-12-07 16:59:58,361 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:59:58,362 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110411349] [2019-12-07 16:59:58,362 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:59:58,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:59:58,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:59:58,397 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110411349] [2019-12-07 16:59:58,397 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:59:58,398 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:59:58,398 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572131535] [2019-12-07 16:59:58,398 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:59:58,398 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:59:58,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:59:58,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:59:58,399 INFO L87 Difference]: Start difference. First operand 73 states and 82 transitions. Second operand 4 states. [2019-12-07 16:59:58,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:59:58,412 INFO L93 Difference]: Finished difference Result 55 states and 57 transitions. [2019-12-07 16:59:58,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:59:58,413 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-12-07 16:59:58,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:59:58,413 INFO L225 Difference]: With dead ends: 55 [2019-12-07 16:59:58,413 INFO L226 Difference]: Without dead ends: 55 [2019-12-07 16:59:58,413 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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 16:59:58,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-12-07 16:59:58,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 53. [2019-12-07 16:59:58,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-12-07 16:59:58,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 55 transitions. [2019-12-07 16:59:58,416 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 55 transitions. Word has length 12 [2019-12-07 16:59:58,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:59:58,416 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 55 transitions. [2019-12-07 16:59:58,416 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:59:58,416 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions. [2019-12-07 16:59:58,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 16:59:58,417 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:59:58,417 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:59:58,417 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr37REQUIRES_VIOLATION]=== [2019-12-07 16:59:58,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:59:58,418 INFO L82 PathProgramCache]: Analyzing trace with hash -1928008016, now seen corresponding path program 1 times [2019-12-07 16:59:58,418 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:59:58,418 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862011847] [2019-12-07 16:59:58,418 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:59:58,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:59:58,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:59:58,468 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862011847] [2019-12-07 16:59:58,468 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:59:58,468 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 16:59:58,468 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354187106] [2019-12-07 16:59:58,468 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 16:59:58,468 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:59:58,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 16:59:58,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 16:59:58,469 INFO L87 Difference]: Start difference. First operand 53 states and 55 transitions. Second operand 6 states. [2019-12-07 16:59:58,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:59:58,557 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2019-12-07 16:59:58,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 16:59:58,558 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2019-12-07 16:59:58,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:59:58,558 INFO L225 Difference]: With dead ends: 52 [2019-12-07 16:59:58,558 INFO L226 Difference]: Without dead ends: 52 [2019-12-07 16:59:58,559 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 16:59:58,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-12-07 16:59:58,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-12-07 16:59:58,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-12-07 16:59:58,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 54 transitions. [2019-12-07 16:59:58,561 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 54 transitions. Word has length 13 [2019-12-07 16:59:58,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:59:58,561 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 54 transitions. [2019-12-07 16:59:58,561 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 16:59:58,562 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2019-12-07 16:59:58,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 16:59:58,562 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:59:58,562 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:59:58,562 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr37REQUIRES_VIOLATION]=== [2019-12-07 16:59:58,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:59:58,562 INFO L82 PathProgramCache]: Analyzing trace with hash -1928008015, now seen corresponding path program 1 times [2019-12-07 16:59:58,563 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:59:58,563 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404005456] [2019-12-07 16:59:58,563 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:59:58,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:59:58,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:59:58,625 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404005456] [2019-12-07 16:59:58,625 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:59:58,625 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 16:59:58,625 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483904044] [2019-12-07 16:59:58,626 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 16:59:58,626 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:59:58,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 16:59:58,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 16:59:58,626 INFO L87 Difference]: Start difference. First operand 52 states and 54 transitions. Second operand 6 states. [2019-12-07 16:59:58,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:59:58,704 INFO L93 Difference]: Finished difference Result 51 states and 53 transitions. [2019-12-07 16:59:58,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 16:59:58,705 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2019-12-07 16:59:58,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:59:58,705 INFO L225 Difference]: With dead ends: 51 [2019-12-07 16:59:58,705 INFO L226 Difference]: Without dead ends: 51 [2019-12-07 16:59:58,705 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 16:59:58,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-12-07 16:59:58,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-12-07 16:59:58,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-12-07 16:59:58,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 53 transitions. [2019-12-07 16:59:58,708 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 53 transitions. Word has length 13 [2019-12-07 16:59:58,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:59:58,708 INFO L462 AbstractCegarLoop]: Abstraction has 51 states and 53 transitions. [2019-12-07 16:59:58,708 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 16:59:58,708 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 53 transitions. [2019-12-07 16:59:58,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 16:59:58,709 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:59:58,709 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:59:58,709 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr37REQUIRES_VIOLATION]=== [2019-12-07 16:59:58,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:59:58,709 INFO L82 PathProgramCache]: Analyzing trace with hash -1684736751, now seen corresponding path program 1 times [2019-12-07 16:59:58,709 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:59:58,710 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411235629] [2019-12-07 16:59:58,710 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:59:58,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:59:58,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:59:58,749 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411235629] [2019-12-07 16:59:58,749 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:59:58,750 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:59:58,750 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195282856] [2019-12-07 16:59:58,750 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 16:59:58,750 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:59:58,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 16:59:58,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 16:59:58,750 INFO L87 Difference]: Start difference. First operand 51 states and 53 transitions. Second operand 5 states. [2019-12-07 16:59:58,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:59:58,803 INFO L93 Difference]: Finished difference Result 50 states and 52 transitions. [2019-12-07 16:59:58,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 16:59:58,804 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-12-07 16:59:58,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:59:58,804 INFO L225 Difference]: With dead ends: 50 [2019-12-07 16:59:58,804 INFO L226 Difference]: Without dead ends: 50 [2019-12-07 16:59:58,804 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-07 16:59:58,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-12-07 16:59:58,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-12-07 16:59:58,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-12-07 16:59:58,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 52 transitions. [2019-12-07 16:59:58,807 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 52 transitions. Word has length 15 [2019-12-07 16:59:58,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:59:58,807 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 52 transitions. [2019-12-07 16:59:58,807 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 16:59:58,807 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 52 transitions. [2019-12-07 16:59:58,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 16:59:58,808 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:59:58,808 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:59:58,808 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr37REQUIRES_VIOLATION]=== [2019-12-07 16:59:58,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:59:58,808 INFO L82 PathProgramCache]: Analyzing trace with hash -687231616, now seen corresponding path program 1 times [2019-12-07 16:59:58,809 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:59:58,809 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567384275] [2019-12-07 16:59:58,809 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:59:58,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:59:58,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:59:58,848 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567384275] [2019-12-07 16:59:58,848 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:59:58,848 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:59:58,848 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925968688] [2019-12-07 16:59:58,848 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 16:59:58,848 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:59:58,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 16:59:58,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 16:59:58,849 INFO L87 Difference]: Start difference. First operand 50 states and 52 transitions. Second operand 5 states. [2019-12-07 16:59:58,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:59:58,917 INFO L93 Difference]: Finished difference Result 49 states and 51 transitions. [2019-12-07 16:59:58,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 16:59:58,917 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-07 16:59:58,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:59:58,917 INFO L225 Difference]: With dead ends: 49 [2019-12-07 16:59:58,917 INFO L226 Difference]: Without dead ends: 49 [2019-12-07 16:59:58,918 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-07 16:59:58,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-12-07 16:59:58,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-12-07 16:59:58,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-12-07 16:59:58,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 51 transitions. [2019-12-07 16:59:58,919 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 51 transitions. Word has length 16 [2019-12-07 16:59:58,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:59:58,920 INFO L462 AbstractCegarLoop]: Abstraction has 49 states and 51 transitions. [2019-12-07 16:59:58,920 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 16:59:58,920 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 51 transitions. [2019-12-07 16:59:58,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 16:59:58,920 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:59:58,920 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:59:58,920 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr37REQUIRES_VIOLATION]=== [2019-12-07 16:59:58,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:59:58,920 INFO L82 PathProgramCache]: Analyzing trace with hash -177383025, now seen corresponding path program 1 times [2019-12-07 16:59:58,921 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:59:58,921 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278064697] [2019-12-07 16:59:58,921 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:59:58,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:59:58,997 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:59:58,997 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278064697] [2019-12-07 16:59:58,997 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2107419754] [2019-12-07 16:59:58,998 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_031189cb-02dd-46a2-b9ab-4c48dc668343/bin/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:59:59,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:59:59,046 INFO L264 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 30 conjunts are in the unsatisfiable core [2019-12-07 16:59:59,050 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:59:59,125 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 16:59:59,125 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:59:59,130 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:59:59,130 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:59:59,130 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2019-12-07 16:59:59,161 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:59:59,162 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 21 treesize of output 59 [2019-12-07 16:59:59,163 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:59:59,177 INFO L614 ElimStorePlain]: treesize reduction 26, result has 50.0 percent of original size [2019-12-07 16:59:59,178 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 16:59:59,178 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:26 [2019-12-07 16:59:59,231 INFO L343 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2019-12-07 16:59:59,231 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24 [2019-12-07 16:59:59,232 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:59:59,237 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:59:59,237 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 16:59:59,238 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:34 [2019-12-07 16:59:59,271 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:59:59,272 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 28 [2019-12-07 16:59:59,272 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:59:59,276 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:59:59,277 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 16:59:59,277 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:41, output treesize:15 [2019-12-07 16:59:59,295 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:59:59,295 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:59:59,357 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2019-12-07 16:59:59,358 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 16:59:59,369 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:59:59,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:59:59,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:59:59,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:59:59,373 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 16:59:59,373 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:40 [2019-12-07 16:59:59,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:59:59,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:59:59,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:59:59,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:59:59,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:59:59,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:59:59,405 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:59:59,406 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1924142016] [2019-12-07 16:59:59,421 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2019-12-07 16:59:59,422 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 16:59:59,425 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 16:59:59,430 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 16:59:59,430 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 17:00:02,369 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 17:00:02,743 WARN L192 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 108 [2019-12-07 17:00:03,002 WARN L192 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 131 [2019-12-07 17:00:03,325 WARN L192 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 144 [2019-12-07 17:00:03,825 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 79 [2019-12-07 17:00:04,050 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 17:00:04,050 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 17:00:04,051 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 20 [2019-12-07 17:00:04,051 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655859703] [2019-12-07 17:00:04,051 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-12-07 17:00:04,051 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 17:00:04,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-12-07 17:00:04,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=815, Unknown=0, NotChecked=0, Total=930 [2019-12-07 17:00:04,052 INFO L87 Difference]: Start difference. First operand 49 states and 51 transitions. Second operand 21 states. [2019-12-07 17:00:04,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:00:04,467 INFO L93 Difference]: Finished difference Result 62 states and 65 transitions. [2019-12-07 17:00:04,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 17:00:04,468 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 16 [2019-12-07 17:00:04,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:00:04,468 INFO L225 Difference]: With dead ends: 62 [2019-12-07 17:00:04,468 INFO L226 Difference]: Without dead ends: 62 [2019-12-07 17:00:04,469 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 307 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=230, Invalid=1176, Unknown=0, NotChecked=0, Total=1406 [2019-12-07 17:00:04,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-12-07 17:00:04,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 48. [2019-12-07 17:00:04,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-12-07 17:00:04,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 50 transitions. [2019-12-07 17:00:04,471 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 50 transitions. Word has length 16 [2019-12-07 17:00:04,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:00:04,471 INFO L462 AbstractCegarLoop]: Abstraction has 48 states and 50 transitions. [2019-12-07 17:00:04,471 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-12-07 17:00:04,471 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2019-12-07 17:00:04,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 17:00:04,471 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:00:04,472 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:00:04,672 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:00:04,673 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr37REQUIRES_VIOLATION]=== [2019-12-07 17:00:04,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:00:04,674 INFO L82 PathProgramCache]: Analyzing trace with hash -177383024, now seen corresponding path program 1 times [2019-12-07 17:00:04,674 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 17:00:04,675 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429741855] [2019-12-07 17:00:04,675 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:00:04,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:00:04,759 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:00:04,759 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429741855] [2019-12-07 17:00:04,759 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1209477717] [2019-12-07 17:00:04,760 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_031189cb-02dd-46a2-b9ab-4c48dc668343/bin/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:00:04,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:00:04,797 INFO L264 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 44 conjunts are in the unsatisfiable core [2019-12-07 17:00:04,799 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:00:05,056 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:00:05,056 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:00:05,439 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:00:05,439 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [905881823] [2019-12-07 17:00:05,440 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2019-12-07 17:00:05,440 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 17:00:05,440 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 17:00:05,440 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 17:00:05,441 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 17:00:07,993 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 17:00:08,418 WARN L192 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 108 [2019-12-07 17:00:08,684 WARN L192 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 131 [2019-12-07 17:00:09,017 WARN L192 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 144 [2019-12-07 17:00:09,568 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 79 [2019-12-07 17:00:09,838 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 17:00:09,838 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 17:00:09,838 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 9] total 24 [2019-12-07 17:00:09,838 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136328406] [2019-12-07 17:00:09,839 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-12-07 17:00:09,839 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 17:00:09,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-12-07 17:00:09,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=1050, Unknown=0, NotChecked=0, Total=1190 [2019-12-07 17:00:09,839 INFO L87 Difference]: Start difference. First operand 48 states and 50 transitions. Second operand 25 states. [2019-12-07 17:00:10,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:00:10,966 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions. [2019-12-07 17:00:10,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-07 17:00:10,966 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 16 [2019-12-07 17:00:10,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:00:10,967 INFO L225 Difference]: With dead ends: 78 [2019-12-07 17:00:10,967 INFO L226 Difference]: Without dead ends: 78 [2019-12-07 17:00:10,968 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 455 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=302, Invalid=1590, Unknown=0, NotChecked=0, Total=1892 [2019-12-07 17:00:10,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-12-07 17:00:10,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 47. [2019-12-07 17:00:10,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-12-07 17:00:10,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 49 transitions. [2019-12-07 17:00:10,970 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 49 transitions. Word has length 16 [2019-12-07 17:00:10,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:00:10,971 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 49 transitions. [2019-12-07 17:00:10,971 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-12-07 17:00:10,971 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2019-12-07 17:00:10,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 17:00:10,971 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:00:10,971 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 17:00:11,172 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:00:11,172 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr37REQUIRES_VIOLATION]=== [2019-12-07 17:00:11,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:00:11,172 INFO L82 PathProgramCache]: Analyzing trace with hash 170656499, now seen corresponding path program 1 times [2019-12-07 17:00:11,173 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 17:00:11,173 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641331816] [2019-12-07 17:00:11,173 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:00:11,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:00:11,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:00:11,204 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641331816] [2019-12-07 17:00:11,204 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:00:11,204 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 17:00:11,204 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127838157] [2019-12-07 17:00:11,204 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 17:00:11,204 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 17:00:11,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 17:00:11,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:00:11,205 INFO L87 Difference]: Start difference. First operand 47 states and 49 transitions. Second operand 6 states. [2019-12-07 17:00:11,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:00:11,284 INFO L93 Difference]: Finished difference Result 46 states and 48 transitions. [2019-12-07 17:00:11,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 17:00:11,284 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2019-12-07 17:00:11,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:00:11,284 INFO L225 Difference]: With dead ends: 46 [2019-12-07 17:00:11,285 INFO L226 Difference]: Without dead ends: 46 [2019-12-07 17:00:11,285 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 17:00:11,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-12-07 17:00:11,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-12-07 17:00:11,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-12-07 17:00:11,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 48 transitions. [2019-12-07 17:00:11,286 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 48 transitions. Word has length 17 [2019-12-07 17:00:11,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:00:11,287 INFO L462 AbstractCegarLoop]: Abstraction has 46 states and 48 transitions. [2019-12-07 17:00:11,287 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 17:00:11,287 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 48 transitions. [2019-12-07 17:00:11,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 17:00:11,287 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:00:11,287 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 17:00:11,287 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr37REQUIRES_VIOLATION]=== [2019-12-07 17:00:11,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:00:11,288 INFO L82 PathProgramCache]: Analyzing trace with hash 995384291, now seen corresponding path program 1 times [2019-12-07 17:00:11,288 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 17:00:11,288 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913850465] [2019-12-07 17:00:11,288 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:00:11,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:00:11,323 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 17:00:11,324 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913850465] [2019-12-07 17:00:11,324 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:00:11,324 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:00:11,324 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53212719] [2019-12-07 17:00:11,324 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 17:00:11,324 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 17:00:11,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 17:00:11,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:00:11,325 INFO L87 Difference]: Start difference. First operand 46 states and 48 transitions. Second operand 6 states. [2019-12-07 17:00:11,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:00:11,400 INFO L93 Difference]: Finished difference Result 45 states and 47 transitions. [2019-12-07 17:00:11,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 17:00:11,400 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2019-12-07 17:00:11,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:00:11,401 INFO L225 Difference]: With dead ends: 45 [2019-12-07 17:00:11,401 INFO L226 Difference]: Without dead ends: 45 [2019-12-07 17:00:11,401 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2019-12-07 17:00:11,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-12-07 17:00:11,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-12-07 17:00:11,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-12-07 17:00:11,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 47 transitions. [2019-12-07 17:00:11,402 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 47 transitions. Word has length 18 [2019-12-07 17:00:11,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:00:11,403 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 47 transitions. [2019-12-07 17:00:11,403 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 17:00:11,403 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2019-12-07 17:00:11,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 17:00:11,403 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:00:11,403 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 17:00:11,403 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr37REQUIRES_VIOLATION]=== [2019-12-07 17:00:11,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:00:11,404 INFO L82 PathProgramCache]: Analyzing trace with hash 995384292, now seen corresponding path program 1 times [2019-12-07 17:00:11,404 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 17:00:11,404 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378918515] [2019-12-07 17:00:11,404 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:00:11,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:00:11,418 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 17:00:11,418 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378918515] [2019-12-07 17:00:11,418 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:00:11,418 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:00:11,418 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066904304] [2019-12-07 17:00:11,418 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:00:11,418 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 17:00:11,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:00:11,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:00:11,419 INFO L87 Difference]: Start difference. First operand 45 states and 47 transitions. Second operand 3 states. [2019-12-07 17:00:11,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:00:11,440 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2019-12-07 17:00:11,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:00:11,440 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-07 17:00:11,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:00:11,440 INFO L225 Difference]: With dead ends: 41 [2019-12-07 17:00:11,440 INFO L226 Difference]: Without dead ends: 41 [2019-12-07 17:00:11,440 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 17:00:11,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-12-07 17:00:11,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-12-07 17:00:11,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-12-07 17:00:11,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 43 transitions. [2019-12-07 17:00:11,442 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 43 transitions. Word has length 18 [2019-12-07 17:00:11,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:00:11,442 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 43 transitions. [2019-12-07 17:00:11,442 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:00:11,442 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2019-12-07 17:00:11,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 17:00:11,442 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:00:11,442 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:00:11,442 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr37REQUIRES_VIOLATION]=== [2019-12-07 17:00:11,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:00:11,443 INFO L82 PathProgramCache]: Analyzing trace with hash -1213354654, now seen corresponding path program 1 times [2019-12-07 17:00:11,443 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 17:00:11,443 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829399862] [2019-12-07 17:00:11,443 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:00:11,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:00:11,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:00:11,489 INFO L174 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2019-12-07 17:00:11,489 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 17:00:11,514 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 05:00:11 BoogieIcfgContainer [2019-12-07 17:00:11,514 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 17:00:11,514 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 17:00:11,514 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 17:00:11,514 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 17:00:11,514 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 04:59:57" (3/4) ... [2019-12-07 17:00:11,517 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-12-07 17:00:11,517 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 17:00:11,518 INFO L168 Benchmark]: Toolchain (without parser) took 14976.37 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 300.9 MB). Free memory was 941.0 MB in the beginning and 997.8 MB in the end (delta: -56.8 MB). Peak memory consumption was 244.1 MB. Max. memory is 11.5 GB. [2019-12-07 17:00:11,518 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 960.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 17:00:11,518 INFO L168 Benchmark]: CACSL2BoogieTranslator took 309.27 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 104.3 MB). Free memory was 941.0 MB in the beginning and 1.1 GB in the end (delta: -147.3 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. [2019-12-07 17:00:11,518 INFO L168 Benchmark]: Boogie Procedure Inliner took 30.29 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 17:00:11,518 INFO L168 Benchmark]: Boogie Preprocessor took 19.79 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 17:00:11,518 INFO L168 Benchmark]: RCFGBuilder took 342.44 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 45.0 MB). Peak memory consumption was 45.0 MB. Max. memory is 11.5 GB. [2019-12-07 17:00:11,519 INFO L168 Benchmark]: TraceAbstraction took 14268.54 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 196.6 MB). Free memory was 1.0 GB in the beginning and 997.8 MB in the end (delta: 40.2 MB). Peak memory consumption was 236.8 MB. Max. memory is 11.5 GB. [2019-12-07 17:00:11,519 INFO L168 Benchmark]: Witness Printer took 2.94 ms. Allocated memory is still 1.3 GB. Free memory is still 997.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 17:00:11,520 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 960.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 309.27 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 104.3 MB). Free memory was 941.0 MB in the beginning and 1.1 GB in the end (delta: -147.3 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 30.29 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.79 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 342.44 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 45.0 MB). Peak memory consumption was 45.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 14268.54 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 196.6 MB). Free memory was 1.0 GB in the beginning and 997.8 MB in the end (delta: 40.2 MB). Peak memory consumption was 236.8 MB. Max. memory is 11.5 GB. * Witness Printer took 2.94 ms. Allocated memory is still 1.3 GB. Free memory is still 997.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 528]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 528. Possible FailurePath: [L513] int c = 0; [L530] struct item *list = ((void *)0); [L531] int length = 0; VAL [c=0] [L520] c++ [L521] struct item *item = malloc(sizeof *item); VAL [c=1] [L522] EXPR \read(**plist) VAL [c=1] [L522] item->next = *plist [L523] EXPR item->next VAL [c=1] [L523-L525] EXPR (item->next) ? item->next->data : malloc(sizeof *item) [L523-L525] EXPR (item->next) ? item->next->data : malloc(sizeof *item) VAL [c=1] [L523-L525] item->data = (item->next) ? item->next->data : malloc(sizeof *item) [L526] *plist = item [L534] length++ [L535] COND FALSE !(__VERIFIER_nondet_int() && c < 20) [L536] COND TRUE length > 0 VAL [c=1] [L537] COND FALSE !(length < 0) VAL [c=1] [L540] EXPR \read(*list) VAL [c=1] [L540] EXPR list->next [L540] struct item *next = list->next; [L541] EXPR \read(*list) VAL [c=1] [L541] free(list) VAL [c=1] [L541] free(list) VAL [c=1] [L541] free(list) [L542] list = next [L543] length-- VAL [c=1] [L545] COND FALSE !(length > 0) [L551] return 0; [L530] struct item *list = ((void *)0); [L551] return 0; VAL [c=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 79 locations, 44 error locations. Result: UNSAFE, OverallTime: 14.2s, OverallIterations: 17, TraceHistogramMax: 2, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 498 SDtfs, 1568 SDslu, 773 SDs, 0 SdLazy, 1790 SolverSat, 168 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 198 GetRequests, 55 SyntacticMatches, 2 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 776 ImplicationChecksByTransitivity, 5.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=79occurred in iteration=0, 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, 16 MinimizatonAttempts, 204 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 236 NumberOfCodeBlocks, 236 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 228 ConstructedInterpolants, 18 QuantifiedInterpolants, 36744 SizeOfPredicates, 46 NumberOfNonLiveVariables, 312 ConjunctsInSsa, 74 ConjunctsInUnsatCore, 20 InterpolantComputations, 14 PerfectInterpolantSequences, 6/30 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 could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.25-f470102 [2019-12-07 17:00:12,862 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 17:00:12,863 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 17:00:12,871 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 17:00:12,871 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 17:00:12,872 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 17:00:12,873 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 17:00:12,874 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 17:00:12,875 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 17:00:12,876 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 17:00:12,876 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 17:00:12,877 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 17:00:12,877 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 17:00:12,878 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 17:00:12,879 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 17:00:12,880 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 17:00:12,880 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 17:00:12,881 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 17:00:12,882 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 17:00:12,884 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 17:00:12,885 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 17:00:12,885 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 17:00:12,886 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 17:00:12,887 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 17:00:12,889 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 17:00:12,889 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 17:00:12,889 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 17:00:12,890 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 17:00:12,890 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 17:00:12,891 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 17:00:12,891 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 17:00:12,891 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 17:00:12,892 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 17:00:12,892 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 17:00:12,893 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 17:00:12,893 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 17:00:12,893 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 17:00:12,894 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 17:00:12,894 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 17:00:12,894 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 17:00:12,895 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 17:00:12,895 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_031189cb-02dd-46a2-b9ab-4c48dc668343/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2019-12-07 17:00:12,905 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 17:00:12,905 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 17:00:12,906 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 17:00:12,906 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 17:00:12,906 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 17:00:12,906 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 17:00:12,907 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 17:00:12,907 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 17:00:12,907 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 17:00:12,907 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 17:00:12,907 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 17:00:12,908 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 17:00:12,908 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 17:00:12,908 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 17:00:12,908 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 17:00:12,908 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 17:00:12,908 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 17:00:12,908 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-12-07 17:00:12,908 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-12-07 17:00:12,909 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-12-07 17:00:12,909 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 17:00:12,909 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 17:00:12,909 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-12-07 17:00:12,909 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-12-07 17:00:12,909 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 17:00:12,909 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 17:00:12,910 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 17:00:12,910 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 17:00:12,910 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 17:00:12,910 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 17:00:12,910 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 17:00:12,910 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 17:00:12,910 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 17:00:12,910 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2019-12-07 17:00:12,911 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-12-07 17:00:12,911 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 17:00:12,911 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 17:00:12,911 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_031189cb-02dd-46a2-b9ab-4c48dc668343/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 -> 0db1674e58e1126b93b48759a00b2e69f0d5f058 [2019-12-07 17:00:13,084 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 17:00:13,092 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 17:00:13,094 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 17:00:13,095 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 17:00:13,095 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 17:00:13,095 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_031189cb-02dd-46a2-b9ab-4c48dc668343/bin/utaipan/../../sv-benchmarks/c/list-ext-properties/test-0232_1-1.i [2019-12-07 17:00:13,132 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_031189cb-02dd-46a2-b9ab-4c48dc668343/bin/utaipan/data/a9ed3f280/4e32d7bc2b2441d388c2ca5f7f88afb6/FLAG2500140c5 [2019-12-07 17:00:13,492 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 17:00:13,492 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_031189cb-02dd-46a2-b9ab-4c48dc668343/sv-benchmarks/c/list-ext-properties/test-0232_1-1.i [2019-12-07 17:00:13,500 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_031189cb-02dd-46a2-b9ab-4c48dc668343/bin/utaipan/data/a9ed3f280/4e32d7bc2b2441d388c2ca5f7f88afb6/FLAG2500140c5 [2019-12-07 17:00:13,509 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_031189cb-02dd-46a2-b9ab-4c48dc668343/bin/utaipan/data/a9ed3f280/4e32d7bc2b2441d388c2ca5f7f88afb6 [2019-12-07 17:00:13,511 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 17:00:13,512 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 17:00:13,512 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 17:00:13,512 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 17:00:13,514 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 17:00:13,515 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 05:00:13" (1/1) ... [2019-12-07 17:00:13,517 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ee44331 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:00:13, skipping insertion in model container [2019-12-07 17:00:13,517 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 05:00:13" (1/1) ... [2019-12-07 17:00:13,522 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 17:00:13,544 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 17:00:13,755 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 17:00:13,763 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 17:00:13,795 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 17:00:13,829 INFO L208 MainTranslator]: Completed translation [2019-12-07 17:00:13,829 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:00:13 WrapperNode [2019-12-07 17:00:13,829 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 17:00:13,830 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 17:00:13,830 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 17:00:13,830 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 17:00:13,835 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:00:13" (1/1) ... [2019-12-07 17:00:13,848 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:00:13" (1/1) ... [2019-12-07 17:00:13,863 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 17:00:13,863 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 17:00:13,863 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 17:00:13,863 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 17:00:13,869 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:00:13" (1/1) ... [2019-12-07 17:00:13,869 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:00:13" (1/1) ... [2019-12-07 17:00:13,871 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:00:13" (1/1) ... [2019-12-07 17:00:13,872 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:00:13" (1/1) ... [2019-12-07 17:00:13,878 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:00:13" (1/1) ... [2019-12-07 17:00:13,881 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:00:13" (1/1) ... [2019-12-07 17:00:13,883 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:00:13" (1/1) ... [2019-12-07 17:00:13,885 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 17:00:13,886 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 17:00:13,886 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 17:00:13,886 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 17:00:13,886 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:00:13" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_031189cb-02dd-46a2-b9ab-4c48dc668343/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 17:00:13,925 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-07 17:00:13,925 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 17:00:13,926 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-07 17:00:13,926 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-12-07 17:00:13,926 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 17:00:13,926 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-12-07 17:00:13,926 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 17:00:13,926 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 17:00:14,286 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 17:00:14,287 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 17:00:14,287 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:00:14 BoogieIcfgContainer [2019-12-07 17:00:14,287 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 17:00:14,288 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 17:00:14,288 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 17:00:14,290 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 17:00:14,290 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 05:00:13" (1/3) ... [2019-12-07 17:00:14,291 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4de7a46e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 05:00:14, skipping insertion in model container [2019-12-07 17:00:14,291 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:00:13" (2/3) ... [2019-12-07 17:00:14,291 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4de7a46e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 05:00:14, skipping insertion in model container [2019-12-07 17:00:14,291 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:00:14" (3/3) ... [2019-12-07 17:00:14,292 INFO L109 eAbstractionObserver]: Analyzing ICFG test-0232_1-1.i [2019-12-07 17:00:14,298 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 17:00:14,303 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 44 error locations. [2019-12-07 17:00:14,310 INFO L249 AbstractCegarLoop]: Starting to check reachability of 44 error locations. [2019-12-07 17:00:14,322 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 17:00:14,323 INFO L374 AbstractCegarLoop]: Hoare is false [2019-12-07 17:00:14,323 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 17:00:14,323 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 17:00:14,323 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 17:00:14,323 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 17:00:14,323 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 17:00:14,323 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 17:00:14,336 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states. [2019-12-07 17:00:14,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-12-07 17:00:14,340 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:00:14,341 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-12-07 17:00:14,341 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr37REQUIRES_VIOLATION]=== [2019-12-07 17:00:14,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:00:14,345 INFO L82 PathProgramCache]: Analyzing trace with hash 925637, now seen corresponding path program 1 times [2019-12-07 17:00:14,352 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 17:00:14,352 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [879014826] [2019-12-07 17:00:14,353 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_031189cb-02dd-46a2-b9ab-4c48dc668343/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 17:00:14,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:00:14,400 INFO L264 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 17:00:14,404 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:00:14,438 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 17:00:14,438 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:00:14,444 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:00:14,444 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:00:14,444 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 17:00:14,469 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:00:14,469 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 12 treesize of output 28 [2019-12-07 17:00:14,470 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:00:14,487 INFO L614 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2019-12-07 17:00:14,488 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 17:00:14,488 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2019-12-07 17:00:14,499 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 17:00:14,499 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:00:14,512 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 17:00:14,513 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [879014826] [2019-12-07 17:00:14,513 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:00:14,514 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-12-07 17:00:14,515 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67394552] [2019-12-07 17:00:14,518 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:00:14,518 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 17:00:14,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:00:14,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:00:14,529 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 4 states. [2019-12-07 17:00:14,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:00:14,741 INFO L93 Difference]: Finished difference Result 115 states and 120 transitions. [2019-12-07 17:00:14,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:00:14,742 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-12-07 17:00:14,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:00:14,749 INFO L225 Difference]: With dead ends: 115 [2019-12-07 17:00:14,750 INFO L226 Difference]: Without dead ends: 113 [2019-12-07 17:00:14,751 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:00:14,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-12-07 17:00:14,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 83. [2019-12-07 17:00:14,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-12-07 17:00:14,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 88 transitions. [2019-12-07 17:00:14,779 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 88 transitions. Word has length 4 [2019-12-07 17:00:14,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:00:14,779 INFO L462 AbstractCegarLoop]: Abstraction has 83 states and 88 transitions. [2019-12-07 17:00:14,779 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:00:14,779 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 88 transitions. [2019-12-07 17:00:14,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-12-07 17:00:14,780 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:00:14,780 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-12-07 17:00:14,980 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-12-07 17:00:14,981 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr37REQUIRES_VIOLATION]=== [2019-12-07 17:00:14,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:00:14,981 INFO L82 PathProgramCache]: Analyzing trace with hash 925638, now seen corresponding path program 1 times [2019-12-07 17:00:14,982 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 17:00:14,982 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1642703753] [2019-12-07 17:00:14,982 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_031189cb-02dd-46a2-b9ab-4c48dc668343/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 17:00:15,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:00:15,024 INFO L264 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 17:00:15,025 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:00:15,032 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 17:00:15,032 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:00:15,042 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:00:15,045 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 17:00:15,046 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:00:15,053 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:00:15,053 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:00:15,054 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-12-07 17:00:15,073 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:00:15,074 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-12-07 17:00:15,075 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:00:15,087 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:00:15,092 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:00:15,093 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 17:00:15,093 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:00:15,100 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:00:15,101 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:00:15,101 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:16 [2019-12-07 17:00:15,114 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 17:00:15,114 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:00:15,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:00:15,223 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 17:00:15,223 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1642703753] [2019-12-07 17:00:15,223 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:00:15,223 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2019-12-07 17:00:15,223 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968914024] [2019-12-07 17:00:15,224 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 17:00:15,225 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 17:00:15,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 17:00:15,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:00:15,225 INFO L87 Difference]: Start difference. First operand 83 states and 88 transitions. Second operand 6 states. [2019-12-07 17:00:24,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:00:24,402 INFO L93 Difference]: Finished difference Result 205 states and 214 transitions. [2019-12-07 17:00:24,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 17:00:24,403 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-12-07 17:00:24,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:00:24,405 INFO L225 Difference]: With dead ends: 205 [2019-12-07 17:00:24,405 INFO L226 Difference]: Without dead ends: 205 [2019-12-07 17:00:24,406 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-12-07 17:00:24,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2019-12-07 17:00:24,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 88. [2019-12-07 17:00:24,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-12-07 17:00:24,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 97 transitions. [2019-12-07 17:00:24,414 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 97 transitions. Word has length 4 [2019-12-07 17:00:24,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:00:24,414 INFO L462 AbstractCegarLoop]: Abstraction has 88 states and 97 transitions. [2019-12-07 17:00:24,414 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 17:00:24,414 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 97 transitions. [2019-12-07 17:00:24,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-07 17:00:24,414 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:00:24,415 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-07 17:00:24,615 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-12-07 17:00:24,617 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr37REQUIRES_VIOLATION]=== [2019-12-07 17:00:24,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:00:24,618 INFO L82 PathProgramCache]: Analyzing trace with hash 28694727, now seen corresponding path program 1 times [2019-12-07 17:00:24,619 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 17:00:24,620 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [229709556] [2019-12-07 17:00:24,620 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_031189cb-02dd-46a2-b9ab-4c48dc668343/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 17:00:24,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:00:24,662 INFO L264 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 17:00:24,663 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:00:24,667 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-07 17:00:24,667 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:00:24,669 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:00:24,669 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:00:24,669 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 17:00:24,673 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 17:00:24,673 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:00:24,674 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 17:00:24,674 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [229709556] [2019-12-07 17:00:24,675 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:00:24,675 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-12-07 17:00:24,675 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714904154] [2019-12-07 17:00:24,675 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:00:24,676 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 17:00:24,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:00:24,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:00:24,676 INFO L87 Difference]: Start difference. First operand 88 states and 97 transitions. Second operand 3 states. [2019-12-07 17:00:24,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:00:24,814 INFO L93 Difference]: Finished difference Result 102 states and 107 transitions. [2019-12-07 17:00:24,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:00:24,814 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-07 17:00:24,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:00:24,815 INFO L225 Difference]: With dead ends: 102 [2019-12-07 17:00:24,815 INFO L226 Difference]: Without dead ends: 102 [2019-12-07 17:00:24,815 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:00:24,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-12-07 17:00:24,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 84. [2019-12-07 17:00:24,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-12-07 17:00:24,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 93 transitions. [2019-12-07 17:00:24,820 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 93 transitions. Word has length 5 [2019-12-07 17:00:24,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:00:24,820 INFO L462 AbstractCegarLoop]: Abstraction has 84 states and 93 transitions. [2019-12-07 17:00:24,821 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:00:24,821 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 93 transitions. [2019-12-07 17:00:24,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-07 17:00:24,821 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:00:24,821 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-07 17:00:25,021 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-12-07 17:00:25,023 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr37REQUIRES_VIOLATION]=== [2019-12-07 17:00:25,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:00:25,024 INFO L82 PathProgramCache]: Analyzing trace with hash 28694728, now seen corresponding path program 1 times [2019-12-07 17:00:25,025 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 17:00:25,026 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [600005443] [2019-12-07 17:00:25,026 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_031189cb-02dd-46a2-b9ab-4c48dc668343/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 17:00:25,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:00:25,102 INFO L264 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 17:00:25,103 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:00:25,111 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 17:00:25,111 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:00:25,118 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:00:25,118 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:00:25,118 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-12-07 17:00:25,133 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 17:00:25,133 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:00:25,184 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 17:00:25,184 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [600005443] [2019-12-07 17:00:25,184 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:00:25,184 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-12-07 17:00:25,184 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147292431] [2019-12-07 17:00:25,184 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:00:25,184 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 17:00:25,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:00:25,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:00:25,185 INFO L87 Difference]: Start difference. First operand 84 states and 93 transitions. Second operand 4 states. [2019-12-07 17:00:25,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:00:25,287 INFO L93 Difference]: Finished difference Result 81 states and 90 transitions. [2019-12-07 17:00:25,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:00:25,287 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-12-07 17:00:25,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:00:25,288 INFO L225 Difference]: With dead ends: 81 [2019-12-07 17:00:25,288 INFO L226 Difference]: Without dead ends: 81 [2019-12-07 17:00:25,288 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:00:25,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-12-07 17:00:25,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 80. [2019-12-07 17:00:25,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-12-07 17:00:25,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 89 transitions. [2019-12-07 17:00:25,292 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 89 transitions. Word has length 5 [2019-12-07 17:00:25,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:00:25,292 INFO L462 AbstractCegarLoop]: Abstraction has 80 states and 89 transitions. [2019-12-07 17:00:25,292 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:00:25,292 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 89 transitions. [2019-12-07 17:00:25,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-07 17:00:25,293 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:00:25,293 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:00:25,493 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-12-07 17:00:25,495 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr37REQUIRES_VIOLATION]=== [2019-12-07 17:00:25,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:00:25,496 INFO L82 PathProgramCache]: Analyzing trace with hash -1328641136, now seen corresponding path program 1 times [2019-12-07 17:00:25,496 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 17:00:25,497 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2100006693] [2019-12-07 17:00:25,497 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_031189cb-02dd-46a2-b9ab-4c48dc668343/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 17:00:25,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:00:25,547 INFO L264 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-07 17:00:25,549 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:00:25,608 INFO L343 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2019-12-07 17:00:25,608 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 18 [2019-12-07 17:00:25,609 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:00:25,621 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:00:25,640 INFO L343 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2019-12-07 17:00:25,640 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 18 [2019-12-07 17:00:25,641 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:00:25,651 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:00:25,652 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 17:00:25,652 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:45, output treesize:33 [2019-12-07 17:00:25,696 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:00:25,696 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 22 [2019-12-07 17:00:25,697 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:00:25,717 INFO L614 ElimStorePlain]: treesize reduction 12, result has 70.7 percent of original size [2019-12-07 17:00:25,726 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:00:25,726 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 22 [2019-12-07 17:00:25,727 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:00:25,731 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:00:25,731 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:00:25,731 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:47, output treesize:7 [2019-12-07 17:00:25,745 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 17:00:25,745 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:00:25,779 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 17:00:25,779 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2100006693] [2019-12-07 17:00:25,779 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:00:25,780 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 9 [2019-12-07 17:00:25,780 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257337247] [2019-12-07 17:00:25,780 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 17:00:25,780 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 17:00:25,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 17:00:25,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-12-07 17:00:25,781 INFO L87 Difference]: Start difference. First operand 80 states and 89 transitions. Second operand 9 states. [2019-12-07 17:00:26,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:00:26,342 INFO L93 Difference]: Finished difference Result 91 states and 100 transitions. [2019-12-07 17:00:26,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 17:00:26,343 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 10 [2019-12-07 17:00:26,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:00:26,344 INFO L225 Difference]: With dead ends: 91 [2019-12-07 17:00:26,344 INFO L226 Difference]: Without dead ends: 91 [2019-12-07 17:00:26,344 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2019-12-07 17:00:26,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-12-07 17:00:26,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 86. [2019-12-07 17:00:26,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-12-07 17:00:26,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 95 transitions. [2019-12-07 17:00:26,348 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 95 transitions. Word has length 10 [2019-12-07 17:00:26,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:00:26,348 INFO L462 AbstractCegarLoop]: Abstraction has 86 states and 95 transitions. [2019-12-07 17:00:26,348 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 17:00:26,348 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 95 transitions. [2019-12-07 17:00:26,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 17:00:26,349 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:00:26,349 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 17:00:26,550 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-12-07 17:00:26,551 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr37REQUIRES_VIOLATION]=== [2019-12-07 17:00:26,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:00:26,552 INFO L82 PathProgramCache]: Analyzing trace with hash 1870124675, now seen corresponding path program 1 times [2019-12-07 17:00:26,553 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 17:00:26,553 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [804831370] [2019-12-07 17:00:26,554 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_031189cb-02dd-46a2-b9ab-4c48dc668343/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 17:00:26,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:00:26,643 INFO L264 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-07 17:00:26,645 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:00:26,667 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 17:00:26,667 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:00:26,672 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:00:26,672 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:00:26,673 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:9 [2019-12-07 17:00:26,683 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2019-12-07 17:00:26,683 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:00:26,685 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:00:26,685 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 17:00:26,685 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:17, output treesize:7 [2019-12-07 17:00:26,694 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 17:00:26,694 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:00:26,702 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 36 treesize of output 32 [2019-12-07 17:00:26,703 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 17:00:26,723 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:00:26,723 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 17:00:26,723 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:32 [2019-12-07 17:00:26,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:00:26,781 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 17:00:26,782 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [804831370] [2019-12-07 17:00:26,782 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:00:26,782 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 6 [2019-12-07 17:00:26,782 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918691988] [2019-12-07 17:00:26,782 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 17:00:26,783 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 17:00:26,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 17:00:26,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-07 17:00:26,783 INFO L87 Difference]: Start difference. First operand 86 states and 95 transitions. Second operand 7 states. [2019-12-07 17:00:27,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:00:27,092 INFO L93 Difference]: Finished difference Result 102 states and 107 transitions. [2019-12-07 17:00:27,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 17:00:27,092 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2019-12-07 17:00:27,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:00:27,093 INFO L225 Difference]: With dead ends: 102 [2019-12-07 17:00:27,093 INFO L226 Difference]: Without dead ends: 102 [2019-12-07 17:00:27,093 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-12-07 17:00:27,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-12-07 17:00:27,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 86. [2019-12-07 17:00:27,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-12-07 17:00:27,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 94 transitions. [2019-12-07 17:00:27,097 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 94 transitions. Word has length 17 [2019-12-07 17:00:27,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:00:27,097 INFO L462 AbstractCegarLoop]: Abstraction has 86 states and 94 transitions. [2019-12-07 17:00:27,097 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 17:00:27,097 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 94 transitions. [2019-12-07 17:00:27,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 17:00:27,098 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:00:27,098 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 17:00:27,298 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-12-07 17:00:27,299 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr37REQUIRES_VIOLATION]=== [2019-12-07 17:00:27,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:00:27,300 INFO L82 PathProgramCache]: Analyzing trace with hash 1870124676, now seen corresponding path program 1 times [2019-12-07 17:00:27,301 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 17:00:27,301 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [33044064] [2019-12-07 17:00:27,302 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_031189cb-02dd-46a2-b9ab-4c48dc668343/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 17:00:27,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:00:27,391 INFO L264 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-07 17:00:27,392 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:00:27,427 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 17:00:27,428 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:00:27,440 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:00:27,444 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 17:00:27,444 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:00:27,454 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:00:27,454 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:00:27,454 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:17 [2019-12-07 17:00:27,473 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2019-12-07 17:00:27,473 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:00:27,483 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:00:27,487 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 17:00:27,487 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:00:27,493 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:00:27,493 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:00:27,493 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:31, output treesize:9 [2019-12-07 17:00:27,508 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 17:00:27,509 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:00:27,603 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 60 treesize of output 56 [2019-12-07 17:00:27,604 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 17:00:27,675 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:00:27,688 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 90 treesize of output 82 [2019-12-07 17:00:27,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:00:27,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:00:27,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:00:27,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:00:27,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:00:27,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:00:27,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:00:27,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:00:27,692 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:00:27,852 WARN L192 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 33 [2019-12-07 17:00:27,852 INFO L614 ElimStorePlain]: treesize reduction 50, result has 55.4 percent of original size [2019-12-07 17:00:27,866 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 36 treesize of output 28 [2019-12-07 17:00:27,869 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2019-12-07 17:00:27,931 INFO L614 ElimStorePlain]: treesize reduction 25, result has 43.2 percent of original size [2019-12-07 17:00:27,931 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 4 xjuncts. [2019-12-07 17:00:27,932 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:61, output treesize:19 [2019-12-07 17:00:27,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:00:28,003 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 17:00:28,003 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 17:00:28,012 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 16 treesize of output 12 [2019-12-07 17:00:28,012 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:00:28,032 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 17:00:28,032 INFO L534 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:00:28,046 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 17:00:28,046 INFO L534 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:00:28,107 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:00:28,108 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2019-12-07 17:00:28,108 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:55, output treesize:45 [2019-12-07 17:00:28,264 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 17:00:28,264 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [33044064] [2019-12-07 17:00:28,264 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:00:28,264 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2019-12-07 17:00:28,265 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797246936] [2019-12-07 17:00:28,265 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 17:00:28,265 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 17:00:28,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 17:00:28,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-12-07 17:00:28,265 INFO L87 Difference]: Start difference. First operand 86 states and 94 transitions. Second operand 10 states. [2019-12-07 17:00:28,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:00:28,791 INFO L93 Difference]: Finished difference Result 97 states and 102 transitions. [2019-12-07 17:00:28,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:00:28,793 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2019-12-07 17:00:28,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:00:28,793 INFO L225 Difference]: With dead ends: 97 [2019-12-07 17:00:28,793 INFO L226 Difference]: Without dead ends: 97 [2019-12-07 17:00:28,794 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2019-12-07 17:00:28,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-12-07 17:00:28,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 85. [2019-12-07 17:00:28,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-12-07 17:00:28,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 92 transitions. [2019-12-07 17:00:28,798 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 92 transitions. Word has length 17 [2019-12-07 17:00:28,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:00:28,798 INFO L462 AbstractCegarLoop]: Abstraction has 85 states and 92 transitions. [2019-12-07 17:00:28,798 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 17:00:28,798 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 92 transitions. [2019-12-07 17:00:28,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 17:00:28,799 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:00:28,799 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 17:00:29,000 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2019-12-07 17:00:29,001 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr37REQUIRES_VIOLATION]=== [2019-12-07 17:00:29,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:00:29,002 INFO L82 PathProgramCache]: Analyzing trace with hash 1870110741, now seen corresponding path program 1 times [2019-12-07 17:00:29,003 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 17:00:29,003 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1843702816] [2019-12-07 17:00:29,003 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_031189cb-02dd-46a2-b9ab-4c48dc668343/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 17:00:29,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:00:29,059 INFO L264 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 17:00:29,060 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:00:29,068 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 17:00:29,068 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:00:29,080 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 17:00:29,080 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1843702816] [2019-12-07 17:00:29,080 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:00:29,080 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 17:00:29,080 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149844301] [2019-12-07 17:00:29,081 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 17:00:29,081 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 17:00:29,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 17:00:29,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:00:29,081 INFO L87 Difference]: Start difference. First operand 85 states and 92 transitions. Second operand 6 states. [2019-12-07 17:00:29,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:00:29,139 INFO L93 Difference]: Finished difference Result 172 states and 182 transitions. [2019-12-07 17:00:29,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 17:00:29,140 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2019-12-07 17:00:29,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:00:29,142 INFO L225 Difference]: With dead ends: 172 [2019-12-07 17:00:29,142 INFO L226 Difference]: Without dead ends: 172 [2019-12-07 17:00:29,142 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-12-07 17:00:29,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2019-12-07 17:00:29,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 113. [2019-12-07 17:00:29,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-12-07 17:00:29,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 134 transitions. [2019-12-07 17:00:29,148 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 134 transitions. Word has length 17 [2019-12-07 17:00:29,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:00:29,148 INFO L462 AbstractCegarLoop]: Abstraction has 113 states and 134 transitions. [2019-12-07 17:00:29,148 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 17:00:29,148 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 134 transitions. [2019-12-07 17:00:29,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 17:00:29,149 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:00:29,149 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:00:29,349 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2019-12-07 17:00:29,350 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr37REQUIRES_VIOLATION]=== [2019-12-07 17:00:29,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:00:29,350 INFO L82 PathProgramCache]: Analyzing trace with hash -1431526068, now seen corresponding path program 1 times [2019-12-07 17:00:29,350 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 17:00:29,350 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1505297325] [2019-12-07 17:00:29,350 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_031189cb-02dd-46a2-b9ab-4c48dc668343/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 17:00:29,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:00:29,400 INFO L264 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-07 17:00:29,401 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:00:29,412 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 17:00:29,412 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:00:29,414 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:00:29,414 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:00:29,414 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2019-12-07 17:00:29,420 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 17:00:29,421 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:00:29,422 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:00:29,422 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 17:00:29,422 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2019-12-07 17:00:29,428 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 17:00:29,428 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:00:29,431 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 17:00:29,431 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-12-07 17:00:29,438 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:00:29,438 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-12-07 17:00:29,438 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:10 [2019-12-07 17:00:29,440 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 17:00:29,440 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1505297325] [2019-12-07 17:00:29,440 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:00:29,441 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-12-07 17:00:29,441 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301286249] [2019-12-07 17:00:29,441 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:00:29,441 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 17:00:29,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:00:29,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:00:29,441 INFO L87 Difference]: Start difference. First operand 113 states and 134 transitions. Second operand 5 states. [2019-12-07 17:00:29,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:00:29,588 INFO L93 Difference]: Finished difference Result 125 states and 143 transitions. [2019-12-07 17:00:29,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 17:00:29,588 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2019-12-07 17:00:29,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:00:29,589 INFO L225 Difference]: With dead ends: 125 [2019-12-07 17:00:29,589 INFO L226 Difference]: Without dead ends: 125 [2019-12-07 17:00:29,589 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-07 17:00:29,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-12-07 17:00:29,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 112. [2019-12-07 17:00:29,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-12-07 17:00:29,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 132 transitions. [2019-12-07 17:00:29,593 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 132 transitions. Word has length 20 [2019-12-07 17:00:29,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:00:29,593 INFO L462 AbstractCegarLoop]: Abstraction has 112 states and 132 transitions. [2019-12-07 17:00:29,593 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:00:29,594 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 132 transitions. [2019-12-07 17:00:29,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 17:00:29,594 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:00:29,594 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:00:29,795 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 mathsat -unsat_core_generation=3 [2019-12-07 17:00:29,796 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr37REQUIRES_VIOLATION]=== [2019-12-07 17:00:29,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:00:29,796 INFO L82 PathProgramCache]: Analyzing trace with hash -1427635036, now seen corresponding path program 1 times [2019-12-07 17:00:29,797 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 17:00:29,798 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [70056483] [2019-12-07 17:00:29,798 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_031189cb-02dd-46a2-b9ab-4c48dc668343/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 17:00:29,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:00:29,859 INFO L264 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 11 conjunts are in the unsatisfiable core [2019-12-07 17:00:29,860 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:00:29,890 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 17:00:29,891 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:00:29,899 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:00:29,899 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:00:29,899 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:16 [2019-12-07 17:00:29,914 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 17:00:29,914 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:00:29,919 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:00:29,919 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 17:00:29,919 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:8 [2019-12-07 17:00:29,932 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 17:00:29,932 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:00:29,957 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 17:00:29,958 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 17:00:29,981 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:00:29,982 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 17:00:29,982 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:24 [2019-12-07 17:00:30,031 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 17:00:30,031 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [70056483] [2019-12-07 17:00:30,031 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:00:30,031 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 8 [2019-12-07 17:00:30,031 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559301914] [2019-12-07 17:00:30,031 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 17:00:30,032 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 17:00:30,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 17:00:30,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-07 17:00:30,032 INFO L87 Difference]: Start difference. First operand 112 states and 132 transitions. Second operand 9 states. [2019-12-07 17:00:30,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:00:30,416 INFO L93 Difference]: Finished difference Result 124 states and 141 transitions. [2019-12-07 17:00:30,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 17:00:30,417 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-12-07 17:00:30,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:00:30,418 INFO L225 Difference]: With dead ends: 124 [2019-12-07 17:00:30,418 INFO L226 Difference]: Without dead ends: 124 [2019-12-07 17:00:30,418 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2019-12-07 17:00:30,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-12-07 17:00:30,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 111. [2019-12-07 17:00:30,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-12-07 17:00:30,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 130 transitions. [2019-12-07 17:00:30,420 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 130 transitions. Word has length 21 [2019-12-07 17:00:30,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:00:30,421 INFO L462 AbstractCegarLoop]: Abstraction has 111 states and 130 transitions. [2019-12-07 17:00:30,421 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 17:00:30,421 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 130 transitions. [2019-12-07 17:00:30,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 17:00:30,421 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:00:30,421 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:00:30,622 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 mathsat -unsat_core_generation=3 [2019-12-07 17:00:30,623 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr37REQUIRES_VIOLATION]=== [2019-12-07 17:00:30,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:00:30,624 INFO L82 PathProgramCache]: Analyzing trace with hash 717052317, now seen corresponding path program 1 times [2019-12-07 17:00:30,625 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 17:00:30,625 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [919626107] [2019-12-07 17:00:30,626 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_031189cb-02dd-46a2-b9ab-4c48dc668343/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 17:00:30,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:00:30,731 INFO L264 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 17 conjunts are in the unsatisfiable core [2019-12-07 17:00:30,733 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:00:30,743 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 17:00:30,744 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:00:30,750 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:00:30,750 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 17:00:30,750 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:12 [2019-12-07 17:00:30,781 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 17:00:30,781 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:00:30,786 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:00:30,786 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:00:30,787 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:11 [2019-12-07 17:00:30,809 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:00:30,809 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 18 treesize of output 46 [2019-12-07 17:00:30,809 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:00:30,825 INFO L614 ElimStorePlain]: treesize reduction 26, result has 36.6 percent of original size [2019-12-07 17:00:30,825 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:00:30,825 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:15 [2019-12-07 17:00:30,874 INFO L343 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2019-12-07 17:00:30,875 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 20 [2019-12-07 17:00:30,875 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:00:30,883 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:00:30,884 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 17:00:30,884 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:28 [2019-12-07 17:00:30,923 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:00:30,923 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 24 [2019-12-07 17:00:30,923 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:00:30,927 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:00:30,928 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:00:30,928 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:35, output treesize:13 [2019-12-07 17:00:30,948 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:00:30,948 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:00:31,010 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 36 treesize of output 32 [2019-12-07 17:00:31,010 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 17:00:31,029 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:00:31,030 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 17:00:31,030 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:32 [2019-12-07 17:00:31,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:00:31,190 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:00:31,190 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [919626107] [2019-12-07 17:00:31,190 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1842243292] [2019-12-07 17:00:31,190 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_031189cb-02dd-46a2-b9ab-4c48dc668343/bin/utaipan/cvc4 Starting monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 17:00:31,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:00:31,315 INFO L264 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 19 conjunts are in the unsatisfiable core [2019-12-07 17:00:31,316 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:00:31,355 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 5 treesize of output 3 [2019-12-07 17:00:31,356 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:00:31,361 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:00:31,361 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:00:31,361 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:10 [2019-12-07 17:00:31,393 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 17:00:31,393 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:00:31,399 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:00:31,399 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:00:31,400 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2019-12-07 17:00:31,439 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:00:31,440 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 16 treesize of output 44 [2019-12-07 17:00:31,440 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:00:31,461 INFO L614 ElimStorePlain]: treesize reduction 26, result has 40.9 percent of original size [2019-12-07 17:00:31,462 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:00:31,462 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2019-12-07 17:00:31,542 INFO L343 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2019-12-07 17:00:31,543 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 20 [2019-12-07 17:00:31,543 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:00:31,549 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:00:31,550 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:00:31,550 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2019-12-07 17:00:31,603 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:00:31,603 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 24 [2019-12-07 17:00:31,604 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:00:31,607 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:00:31,607 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:00:31,608 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:13 [2019-12-07 17:00:31,609 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:00:31,609 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:00:31,622 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 36 treesize of output 32 [2019-12-07 17:00:31,623 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 17:00:31,640 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:00:31,640 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 17:00:31,641 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:32 [2019-12-07 17:00:31,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:00:31,704 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:00:31,704 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2019-12-07 17:00:31,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:00:31,705 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:00:31,714 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:00:31,714 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2019-12-07 17:00:31,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:00:31,715 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:00:31,722 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:00:31,722 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 21 treesize of output 23 [2019-12-07 17:00:31,722 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 17:00:31,734 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:00:31,734 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-12-07 17:00:31,734 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:56, output treesize:7 [2019-12-07 17:00:31,738 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 6 treesize of output 4 [2019-12-07 17:00:31,738 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:00:31,740 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2019-12-07 17:00:31,740 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:00:31,744 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:00:31,744 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-12-07 17:00:31,744 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:7 [2019-12-07 17:00:31,746 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:00:31,746 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1368859213] [2019-12-07 17:00:31,746 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_031189cb-02dd-46a2-b9ab-4c48dc668343/bin/utaipan/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:00:31,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:00:31,811 INFO L264 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 16 conjunts are in the unsatisfiable core [2019-12-07 17:00:31,812 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:00:31,822 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 17:00:31,822 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:00:31,827 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:00:31,827 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:00:31,827 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:11 [2019-12-07 17:00:31,846 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:00:31,846 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 23 treesize of output 61 [2019-12-07 17:00:31,847 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:00:31,862 INFO L614 ElimStorePlain]: treesize reduction 26, result has 46.9 percent of original size [2019-12-07 17:00:31,863 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 17:00:31,863 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:23 [2019-12-07 17:00:31,979 INFO L343 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2019-12-07 17:00:31,979 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24 [2019-12-07 17:00:31,979 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:00:31,989 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:00:31,990 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-12-07 17:00:31,990 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:38, output treesize:34 [2019-12-07 17:00:32,101 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:00:32,101 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 28 [2019-12-07 17:00:32,102 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:00:32,107 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:00:32,107 INFO L534 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:00:32,107 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:41, output treesize:15 [2019-12-07 17:00:32,146 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:00:32,146 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:00:32,195 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2019-12-07 17:00:32,195 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 17:00:32,216 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:00:32,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:00:32,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:00:32,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:00:32,218 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 17:00:32,218 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:40 [2019-12-07 17:00:32,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:00:32,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:00:32,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:00:32,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:00:32,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:00:32,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:00:32,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:00:32,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:00:32,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:00:32,449 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:00:32,450 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2019-12-07 17:00:32,450 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9, 8, 8, 8] total 27 [2019-12-07 17:00:32,450 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470140794] [2019-12-07 17:00:32,450 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-12-07 17:00:32,450 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 17:00:32,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-12-07 17:00:32,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=665, Unknown=0, NotChecked=0, Total=756 [2019-12-07 17:00:32,451 INFO L87 Difference]: Start difference. First operand 111 states and 130 transitions. Second operand 28 states. [2019-12-07 17:00:33,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:00:33,804 INFO L93 Difference]: Finished difference Result 132 states and 144 transitions. [2019-12-07 17:00:33,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-07 17:00:33,805 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 21 [2019-12-07 17:00:33,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:00:33,805 INFO L225 Difference]: With dead ends: 132 [2019-12-07 17:00:33,806 INFO L226 Difference]: Without dead ends: 132 [2019-12-07 17:00:33,806 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 87 SyntacticMatches, 7 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 336 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=311, Invalid=1095, Unknown=0, NotChecked=0, Total=1406 [2019-12-07 17:00:33,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-12-07 17:00:33,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 110. [2019-12-07 17:00:33,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-12-07 17:00:33,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 127 transitions. [2019-12-07 17:00:33,808 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 127 transitions. Word has length 21 [2019-12-07 17:00:33,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:00:33,809 INFO L462 AbstractCegarLoop]: Abstraction has 110 states and 127 transitions. [2019-12-07 17:00:33,809 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-12-07 17:00:33,809 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 127 transitions. [2019-12-07 17:00:33,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 17:00:33,810 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:00:33,810 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:00:34,411 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true,13 cvc4 --incremental --print-success --lang smt --rewrite-divk,12 mathsat -unsat_core_generation=3 [2019-12-07 17:00:34,412 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr37REQUIRES_VIOLATION]=== [2019-12-07 17:00:34,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:00:34,413 INFO L82 PathProgramCache]: Analyzing trace with hash 717052318, now seen corresponding path program 1 times [2019-12-07 17:00:34,414 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 17:00:34,414 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [847112663] [2019-12-07 17:00:34,414 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_031189cb-02dd-46a2-b9ab-4c48dc668343/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 17:00:34,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:00:34,495 INFO L264 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 28 conjunts are in the unsatisfiable core [2019-12-07 17:00:34,496 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:00:34,501 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 17:00:34,502 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:00:34,512 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:00:34,514 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 17:00:34,515 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:00:34,524 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:00:34,524 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:00:34,524 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:20 [2019-12-07 17:00:34,541 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:00:34,541 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2019-12-07 17:00:34,542 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:00:34,557 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:00:34,565 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:00:34,565 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2019-12-07 17:00:34,565 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:00:34,577 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:00:34,578 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:00:34,578 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:35, output treesize:26 [2019-12-07 17:00:34,624 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 17:00:34,625 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:00:34,640 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:00:34,643 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 17:00:34,643 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:00:34,656 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:00:34,657 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:00:34,657 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:48, output treesize:43 [2019-12-07 17:00:34,684 INFO L430 ElimStorePlain]: Different costs {1=[|v_#valid_95|], 3=[|v_#length_74|]} [2019-12-07 17:00:34,693 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:00:34,693 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 19 [2019-12-07 17:00:34,694 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:00:34,707 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:00:34,722 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:00:34,722 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 44 [2019-12-07 17:00:34,723 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:00:34,757 INFO L614 ElimStorePlain]: treesize reduction 14, result has 75.4 percent of original size [2019-12-07 17:00:34,758 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 17:00:34,758 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:54, output treesize:43 [2019-12-07 17:00:34,834 INFO L343 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2019-12-07 17:00:34,834 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24 [2019-12-07 17:00:34,834 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:00:34,851 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:00:34,868 INFO L343 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2019-12-07 17:00:34,868 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 18 [2019-12-07 17:00:34,868 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:00:34,883 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:00:34,883 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-12-07 17:00:34,883 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:60, output treesize:54 [2019-12-07 17:00:34,932 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:00:34,932 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 30 [2019-12-07 17:00:34,933 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:00:34,947 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:00:34,956 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:00:34,956 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 22 [2019-12-07 17:00:34,957 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:00:34,963 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:00:34,964 INFO L534 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:00:34,964 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:68, output treesize:18 [2019-12-07 17:00:34,998 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:00:34,998 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:00:35,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:00:35,631 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 40 treesize of output 32 [2019-12-07 17:00:35,632 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-12-07 17:00:35,688 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:00:35,699 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 66 treesize of output 62 [2019-12-07 17:00:35,700 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:00:35,794 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:00:35,802 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 102 treesize of output 94 [2019-12-07 17:00:35,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:00:35,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:00:35,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:00:35,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:00:35,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:00:35,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:00:35,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:00:35,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:00:35,806 INFO L534 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:00:36,011 WARN L192 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 41 [2019-12-07 17:00:36,012 INFO L614 ElimStorePlain]: treesize reduction 56, result has 54.1 percent of original size [2019-12-07 17:00:36,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:00:36,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:00:36,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:00:36,014 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2019-12-07 17:00:36,014 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:80, output treesize:66 [2019-12-07 17:00:36,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:00:36,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:00:36,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:00:36,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:00:36,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:00:36,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:00:36,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:00:36,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:00:36,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:00:36,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:00:36,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:00:36,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:00:36,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:00:36,452 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:00:36,453 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2019-12-07 17:00:36,453 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:00:36,478 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:00:36,479 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2019-12-07 17:00:36,479 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:00:36,504 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:00:36,505 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2019-12-07 17:00:36,505 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 17:00:36,529 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:00:36,529 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2019-12-07 17:00:36,530 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-07 17:00:36,549 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:00:36,557 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 17:00:36,558 INFO L534 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-12-07 17:00:36,648 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:00:36,649 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 4 xjuncts. [2019-12-07 17:00:36,649 INFO L239 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:137, output treesize:64 [2019-12-07 17:00:36,977 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 22 [2019-12-07 17:00:36,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:00:37,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:00:37,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:00:37,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:00:37,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:00:37,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:00:37,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:00:37,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:00:37,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:00:37,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:00:37,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:00:37,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:00:37,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:00:38,009 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:00:38,010 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [847112663] [2019-12-07 17:00:38,010 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1973140469] [2019-12-07 17:00:38,010 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_031189cb-02dd-46a2-b9ab-4c48dc668343/bin/utaipan/cvc4 Starting monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 17:00:38,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:00:38,170 INFO L264 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 28 conjunts are in the unsatisfiable core [2019-12-07 17:00:38,171 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:00:38,212 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 17:00:38,213 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:00:38,224 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:00:38,226 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 17:00:38,226 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:00:38,237 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:00:38,237 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:00:38,238 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:23 [2019-12-07 17:00:38,304 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:00:38,304 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2019-12-07 17:00:38,305 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:00:38,321 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:00:38,324 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2019-12-07 17:00:38,324 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:00:38,337 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:00:38,337 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:00:38,338 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:29 [2019-12-07 17:00:38,493 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 17:00:38,493 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:00:38,511 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:00:38,515 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 17:00:38,515 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:00:38,530 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:00:38,530 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:00:38,530 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:51, output treesize:46 [2019-12-07 17:00:38,618 INFO L430 ElimStorePlain]: Different costs {1=[|v_#valid_101|], 3=[|v_#length_80|]} [2019-12-07 17:00:38,633 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:00:38,633 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 19 [2019-12-07 17:00:38,634 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:00:38,651 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:00:38,666 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:00:38,666 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 44 [2019-12-07 17:00:38,667 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:00:38,707 INFO L614 ElimStorePlain]: treesize reduction 14, result has 77.4 percent of original size [2019-12-07 17:00:38,707 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 17:00:38,707 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:57, output treesize:48 [2019-12-07 17:00:38,889 INFO L343 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2019-12-07 17:00:38,889 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 18 [2019-12-07 17:00:38,889 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:00:38,906 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:00:38,921 INFO L343 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2019-12-07 17:00:38,922 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 26 [2019-12-07 17:00:38,922 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:00:38,936 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:00:38,936 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 17:00:38,936 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:62, output treesize:54 [2019-12-07 17:00:39,031 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:00:39,031 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 30 [2019-12-07 17:00:39,032 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:00:39,045 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:00:39,052 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:00:39,053 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 22 [2019-12-07 17:00:39,053 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:00:39,068 INFO L614 ElimStorePlain]: treesize reduction 12, result has 60.0 percent of original size [2019-12-07 17:00:39,068 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:00:39,068 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:68, output treesize:18 [2019-12-07 17:00:39,098 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:00:39,098 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:00:39,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:00:39,426 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 40 treesize of output 32 [2019-12-07 17:00:39,427 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-12-07 17:00:39,484 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:00:39,492 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 66 treesize of output 62 [2019-12-07 17:00:39,493 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:00:39,580 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:00:39,590 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 102 treesize of output 94 [2019-12-07 17:00:39,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:00:39,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:00:39,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:00:39,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:00:39,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:00:39,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:00:39,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:00:39,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:00:39,592 INFO L534 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:00:39,812 WARN L192 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 41 [2019-12-07 17:00:39,813 INFO L614 ElimStorePlain]: treesize reduction 56, result has 54.1 percent of original size [2019-12-07 17:00:39,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:00:39,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:00:39,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:00:39,814 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2019-12-07 17:00:39,814 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:80, output treesize:66 [2019-12-07 17:00:39,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:00:39,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:00:39,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:00:39,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:00:39,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:00:39,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:00:40,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:00:40,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:00:40,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:00:40,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:00:40,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:00:40,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:00:40,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:00:40,173 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:00:40,173 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2019-12-07 17:00:40,174 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:00:40,201 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:00:40,201 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2019-12-07 17:00:40,201 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:00:40,219 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:00:40,220 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2019-12-07 17:00:40,220 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 17:00:40,242 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:00:40,243 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2019-12-07 17:00:40,243 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-07 17:00:40,260 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:00:40,261 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 17:00:40,262 INFO L534 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-12-07 17:00:40,337 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:00:40,338 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 4 xjuncts. [2019-12-07 17:00:40,338 INFO L239 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:137, output treesize:64 [2019-12-07 17:00:40,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:00:40,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:00:40,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:00:40,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:00:40,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:00:40,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:00:40,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:00:41,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:00:41,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:00:41,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:00:41,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:00:41,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:00:41,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:00:41,506 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:00:41,506 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1221543132] [2019-12-07 17:00:41,506 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_031189cb-02dd-46a2-b9ab-4c48dc668343/bin/utaipan/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:00:41,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:00:41,552 INFO L264 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 23 conjunts are in the unsatisfiable core [2019-12-07 17:00:41,554 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:00:41,690 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 17:00:41,690 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:00:41,704 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:00:41,708 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 17:00:41,708 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:00:41,719 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:00:41,719 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:00:41,720 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:35, output treesize:26 [2019-12-07 17:00:41,816 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:00:41,816 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 15 treesize of output 19 [2019-12-07 17:00:41,817 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:00:41,830 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:00:41,833 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2019-12-07 17:00:41,833 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:00:41,846 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:00:41,846 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:00:41,846 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:30 [2019-12-07 17:00:42,062 INFO L343 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2019-12-07 17:00:42,063 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24 [2019-12-07 17:00:42,063 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:00:42,085 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:00:42,104 INFO L343 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2019-12-07 17:00:42,104 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 18 [2019-12-07 17:00:42,104 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:00:42,125 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:00:42,125 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-12-07 17:00:42,125 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:62, output treesize:54 [2019-12-07 17:00:42,246 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:00:42,246 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 28 [2019-12-07 17:00:42,246 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:00:42,265 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:00:42,275 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:00:42,275 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 22 [2019-12-07 17:00:42,276 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:00:42,285 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:00:42,285 INFO L534 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:00:42,285 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:68, output treesize:20 [2019-12-07 17:00:42,390 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:00:42,390 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:00:42,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:00:42,720 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 66 treesize of output 62 [2019-12-07 17:00:42,720 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 17:00:42,809 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:00:42,820 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 32 [2019-12-07 17:00:42,822 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2019-12-07 17:00:42,915 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:00:42,924 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 102 treesize of output 94 [2019-12-07 17:00:42,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:00:42,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:00:42,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:00:42,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:00:42,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:00:42,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:00:42,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:00:42,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:00:42,927 INFO L534 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:00:43,119 WARN L192 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 41 [2019-12-07 17:00:43,120 INFO L614 ElimStorePlain]: treesize reduction 56, result has 54.1 percent of original size [2019-12-07 17:00:43,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:00:43,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:00:43,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:00:43,121 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2019-12-07 17:00:43,121 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:80, output treesize:66 [2019-12-07 17:00:43,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:00:43,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:00:43,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:00:43,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:00:43,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:00:43,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:00:43,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:00:43,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:00:43,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:00:43,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:00:43,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:00:43,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:00:43,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:00:43,449 INFO L430 ElimStorePlain]: Different costs {3=[|#valid|], 5=[|#length|]} [2019-12-07 17:00:43,471 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:00:43,472 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2019-12-07 17:00:43,472 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:00:43,493 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:00:43,501 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:00:43,502 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 17:00:43,502 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:00:43,523 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:00:43,524 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2019-12-07 17:00:43,524 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 17:00:43,546 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:00:43,546 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2019-12-07 17:00:43,546 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-07 17:00:43,568 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:00:43,568 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 17:00:43,569 INFO L534 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-12-07 17:00:43,642 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:00:43,667 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:00:43,668 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 34 [2019-12-07 17:00:43,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:00:43,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:00:43,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:00:43,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:00:43,669 INFO L534 ElimStorePlain]: Start of recursive call 7: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 17:00:43,681 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2019-12-07 17:00:43,681 INFO L534 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:00:43,709 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:00:43,709 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 34 [2019-12-07 17:00:43,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:00:43,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:00:43,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:00:43,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:00:43,711 INFO L534 ElimStorePlain]: Start of recursive call 9: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 17:00:43,842 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-12-07 17:00:43,842 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:00:43,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:00:43,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:00:43,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:00:43,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:00:43,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:00:43,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:00:43,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:00:43,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:00:43,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:00:43,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:00:43,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:00:43,855 INFO L534 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 13 dim-0 vars, and 3 xjuncts. [2019-12-07 17:00:43,855 INFO L239 ElimStorePlain]: Needed 9 recursive calls to eliminate 7 variables, input treesize:177, output treesize:107 [2019-12-07 17:00:44,220 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:00:44,221 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2019-12-07 17:00:44,221 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 10, 8, 8, 8] total 32 [2019-12-07 17:00:44,221 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634476957] [2019-12-07 17:00:44,221 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-12-07 17:00:44,221 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 17:00:44,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-12-07 17:00:44,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=919, Unknown=0, NotChecked=0, Total=1056 [2019-12-07 17:00:44,222 INFO L87 Difference]: Start difference. First operand 110 states and 127 transitions. Second operand 33 states. [2019-12-07 17:00:45,027 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 53 [2019-12-07 17:00:45,222 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 47 [2019-12-07 17:00:45,544 WARN L192 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 52 [2019-12-07 17:00:47,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:00:47,082 INFO L93 Difference]: Finished difference Result 133 states and 142 transitions. [2019-12-07 17:00:47,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-07 17:00:47,083 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 21 [2019-12-07 17:00:47,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:00:47,084 INFO L225 Difference]: With dead ends: 133 [2019-12-07 17:00:47,084 INFO L226 Difference]: Without dead ends: 133 [2019-12-07 17:00:47,084 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 64 SyntacticMatches, 25 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 764 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=350, Invalid=1372, Unknown=0, NotChecked=0, Total=1722 [2019-12-07 17:00:47,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-12-07 17:00:47,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 109. [2019-12-07 17:00:47,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-12-07 17:00:47,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 124 transitions. [2019-12-07 17:00:47,087 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 124 transitions. Word has length 21 [2019-12-07 17:00:47,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:00:47,087 INFO L462 AbstractCegarLoop]: Abstraction has 109 states and 124 transitions. [2019-12-07 17:00:47,087 INFO L463 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-12-07 17:00:47,087 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 124 transitions. [2019-12-07 17:00:47,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 17:00:47,088 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:00:47,088 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:00:47,689 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 mathsat -unsat_core_generation=3,16 cvc4 --incremental --print-success --lang smt --rewrite-divk,17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:00:47,690 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr37REQUIRES_VIOLATION]=== [2019-12-07 17:00:47,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:00:47,691 INFO L82 PathProgramCache]: Analyzing trace with hash -1307013042, now seen corresponding path program 1 times [2019-12-07 17:00:47,692 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 17:00:47,692 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1853733957] [2019-12-07 17:00:47,692 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_031189cb-02dd-46a2-b9ab-4c48dc668343/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 17:00:47,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:00:47,788 INFO L264 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-07 17:00:47,789 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:00:47,807 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 17:00:47,807 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:00:47,811 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:00:47,811 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:00:47,812 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:9 [2019-12-07 17:00:47,819 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2019-12-07 17:00:47,819 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:00:47,820 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:00:47,820 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 17:00:47,821 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:17, output treesize:7 [2019-12-07 17:00:47,827 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 17:00:47,827 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:00:47,830 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 36 treesize of output 32 [2019-12-07 17:00:47,830 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 17:00:47,847 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:00:47,847 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 17:00:47,847 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:32 [2019-12-07 17:00:47,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:00:47,901 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 17:00:47,901 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1853733957] [2019-12-07 17:00:47,901 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:00:47,901 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 6 [2019-12-07 17:00:47,901 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889558670] [2019-12-07 17:00:47,901 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 17:00:47,901 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 17:00:47,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 17:00:47,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-07 17:00:47,902 INFO L87 Difference]: Start difference. First operand 109 states and 124 transitions. Second operand 7 states. [2019-12-07 17:00:48,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:00:48,164 INFO L93 Difference]: Finished difference Result 118 states and 130 transitions. [2019-12-07 17:00:48,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 17:00:48,164 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2019-12-07 17:00:48,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:00:48,165 INFO L225 Difference]: With dead ends: 118 [2019-12-07 17:00:48,165 INFO L226 Difference]: Without dead ends: 118 [2019-12-07 17:00:48,165 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-07 17:00:48,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-12-07 17:00:48,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 108. [2019-12-07 17:00:48,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-12-07 17:00:48,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 122 transitions. [2019-12-07 17:00:48,167 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 122 transitions. Word has length 22 [2019-12-07 17:00:48,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:00:48,167 INFO L462 AbstractCegarLoop]: Abstraction has 108 states and 122 transitions. [2019-12-07 17:00:48,167 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 17:00:48,167 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 122 transitions. [2019-12-07 17:00:48,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-07 17:00:48,168 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:00:48,168 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:00:48,368 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 mathsat -unsat_core_generation=3 [2019-12-07 17:00:48,369 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr37REQUIRES_VIOLATION]=== [2019-12-07 17:00:48,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:00:48,370 INFO L82 PathProgramCache]: Analyzing trace with hash -1862698521, now seen corresponding path program 1 times [2019-12-07 17:00:48,370 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 17:00:48,370 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1005998502] [2019-12-07 17:00:48,371 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_031189cb-02dd-46a2-b9ab-4c48dc668343/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 17:00:48,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:00:48,533 INFO L264 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-07 17:00:48,534 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:00:48,536 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 17:00:48,537 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:00:48,538 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:00:48,538 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:00:48,538 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 17:00:48,546 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:00:48,546 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 11 treesize of output 15 [2019-12-07 17:00:48,547 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:00:48,552 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:00:48,552 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:00:48,552 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2019-12-07 17:00:48,564 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 17:00:48,564 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:00:48,572 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:00:48,572 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 17:00:48,572 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:16 [2019-12-07 17:00:48,591 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 17:00:48,591 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:00:48,599 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:00:48,599 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:00:48,599 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:21 [2019-12-07 17:00:48,616 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 16 treesize of output 8 [2019-12-07 17:00:48,616 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:00:48,620 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:00:48,620 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:00:48,620 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:10 [2019-12-07 17:00:48,632 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-12-07 17:00:48,632 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:00:48,640 INFO L614 ElimStorePlain]: treesize reduction 4, result has 73.3 percent of original size [2019-12-07 17:00:48,640 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 17:00:48,640 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:11 [2019-12-07 17:00:48,654 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 17:00:48,654 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:00:48,665 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 30 treesize of output 26 [2019-12-07 17:00:48,666 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-12-07 17:00:48,689 INFO L614 ElimStorePlain]: treesize reduction 22, result has 45.0 percent of original size [2019-12-07 17:00:48,689 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:00:48,690 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:18 [2019-12-07 17:00:48,711 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2019-12-07 17:00:48,712 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:00:48,716 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 15 treesize of output 13 [2019-12-07 17:00:48,716 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:00:48,718 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 15 treesize of output 13 [2019-12-07 17:00:48,718 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 17:00:48,724 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:00:48,724 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2019-12-07 17:00:48,724 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:41, output treesize:11 [2019-12-07 17:00:48,728 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 17:00:48,728 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1005998502] [2019-12-07 17:00:48,728 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:00:48,728 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 8 [2019-12-07 17:00:48,728 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856835334] [2019-12-07 17:00:48,728 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 17:00:48,729 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 17:00:48,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 17:00:48,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-07 17:00:48,729 INFO L87 Difference]: Start difference. First operand 108 states and 122 transitions. Second operand 9 states. [2019-12-07 17:01:05,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:01:05,146 INFO L93 Difference]: Finished difference Result 131 states and 145 transitions. [2019-12-07 17:01:05,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 17:01:05,146 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2019-12-07 17:01:05,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:01:05,147 INFO L225 Difference]: With dead ends: 131 [2019-12-07 17:01:05,147 INFO L226 Difference]: Without dead ends: 131 [2019-12-07 17:01:05,147 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2019-12-07 17:01:05,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-12-07 17:01:05,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 107. [2019-12-07 17:01:05,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-12-07 17:01:05,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 120 transitions. [2019-12-07 17:01:05,149 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 120 transitions. Word has length 23 [2019-12-07 17:01:05,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:01:05,149 INFO L462 AbstractCegarLoop]: Abstraction has 107 states and 120 transitions. [2019-12-07 17:01:05,149 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 17:01:05,149 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 120 transitions. [2019-12-07 17:01:05,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-07 17:01:05,150 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:01:05,150 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:01:05,350 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 mathsat -unsat_core_generation=3 [2019-12-07 17:01:05,351 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr37REQUIRES_VIOLATION]=== [2019-12-07 17:01:05,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:01:05,352 INFO L82 PathProgramCache]: Analyzing trace with hash -1862698520, now seen corresponding path program 1 times [2019-12-07 17:01:05,353 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 17:01:05,353 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [263521930] [2019-12-07 17:01:05,353 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_031189cb-02dd-46a2-b9ab-4c48dc668343/bin/utaipan/mathsat Starting monitored process 20 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with mathsat -unsat_core_generation=3 [2019-12-07 17:01:05,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:01:05,434 INFO L264 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 17:01:05,435 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:01:05,449 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 17:01:05,449 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:01:05,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:01:05,485 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 17:01:05,485 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 17:01:05,499 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:01:05,500 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 17:01:05,500 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:12 [2019-12-07 17:01:05,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 17:01:05,531 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [263521930] [2019-12-07 17:01:05,531 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:01:05,531 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2019-12-07 17:01:05,531 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215328687] [2019-12-07 17:01:05,531 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 17:01:05,531 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 17:01:05,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 17:01:05,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:01:05,531 INFO L87 Difference]: Start difference. First operand 107 states and 120 transitions. Second operand 6 states. [2019-12-07 17:01:05,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:01:05,601 INFO L93 Difference]: Finished difference Result 103 states and 115 transitions. [2019-12-07 17:01:05,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:01:05,601 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2019-12-07 17:01:05,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:01:05,602 INFO L225 Difference]: With dead ends: 103 [2019-12-07 17:01:05,602 INFO L226 Difference]: Without dead ends: 103 [2019-12-07 17:01:05,602 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:01:05,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-12-07 17:01:05,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 98. [2019-12-07 17:01:05,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-12-07 17:01:05,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 107 transitions. [2019-12-07 17:01:05,604 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 107 transitions. Word has length 23 [2019-12-07 17:01:05,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:01:05,604 INFO L462 AbstractCegarLoop]: Abstraction has 98 states and 107 transitions. [2019-12-07 17:01:05,604 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 17:01:05,604 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 107 transitions. [2019-12-07 17:01:05,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 17:01:05,605 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:01:05,605 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:01:05,805 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 mathsat -unsat_core_generation=3 [2019-12-07 17:01:05,806 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr37REQUIRES_VIOLATION]=== [2019-12-07 17:01:05,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:01:05,807 INFO L82 PathProgramCache]: Analyzing trace with hash 577213201, now seen corresponding path program 1 times [2019-12-07 17:01:05,807 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 17:01:05,808 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [236847514] [2019-12-07 17:01:05,808 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_031189cb-02dd-46a2-b9ab-4c48dc668343/bin/utaipan/mathsat Starting monitored process 21 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with mathsat -unsat_core_generation=3 [2019-12-07 17:01:05,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:01:06,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:01:06,048 INFO L174 FreeRefinementEngine]: Strategy WALRUS found a feasible trace [2019-12-07 17:01:06,048 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 17:01:06,248 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 mathsat -unsat_core_generation=3 [2019-12-07 17:01:06,279 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 05:01:06 BoogieIcfgContainer [2019-12-07 17:01:06,280 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 17:01:06,280 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 17:01:06,280 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 17:01:06,280 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 17:01:06,280 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:00:14" (3/4) ... [2019-12-07 17:01:06,282 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-12-07 17:01:06,282 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 17:01:06,283 INFO L168 Benchmark]: Toolchain (without parser) took 52771.90 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 324.5 MB). Free memory was 947.0 MB in the beginning and 917.6 MB in the end (delta: 29.4 MB). Peak memory consumption was 353.9 MB. Max. memory is 11.5 GB. [2019-12-07 17:01:06,283 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 17:01:06,284 INFO L168 Benchmark]: CACSL2BoogieTranslator took 317.53 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 128.5 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -162.9 MB). Peak memory consumption was 21.0 MB. Max. memory is 11.5 GB. [2019-12-07 17:01:06,284 INFO L168 Benchmark]: Boogie Procedure Inliner took 32.76 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: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2019-12-07 17:01:06,284 INFO L168 Benchmark]: Boogie Preprocessor took 22.49 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 17:01:06,284 INFO L168 Benchmark]: RCFGBuilder took 402.03 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: 34.2 MB). Peak memory consumption was 34.2 MB. Max. memory is 11.5 GB. [2019-12-07 17:01:06,284 INFO L168 Benchmark]: TraceAbstraction took 51991.55 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 196.1 MB). Free memory was 1.1 GB in the beginning and 917.6 MB in the end (delta: 144.2 MB). Peak memory consumption was 340.3 MB. Max. memory is 11.5 GB. [2019-12-07 17:01:06,284 INFO L168 Benchmark]: Witness Printer took 2.62 ms. Allocated memory is still 1.4 GB. Free memory is still 917.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 17:01:06,286 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 317.53 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 128.5 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -162.9 MB). Peak memory consumption was 21.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 32.76 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: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 22.49 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 402.03 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: 34.2 MB). Peak memory consumption was 34.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 51991.55 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 196.1 MB). Free memory was 1.1 GB in the beginning and 917.6 MB in the end (delta: 144.2 MB). Peak memory consumption was 340.3 MB. Max. memory is 11.5 GB. * Witness Printer took 2.62 ms. Allocated memory is still 1.4 GB. Free memory is still 917.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 528]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 528. Possible FailurePath: [L513] int c = 0; VAL [c=0] [L530] struct item *list = ((void *)0); [L531] int length = 0; VAL [c=0] [L520] c++ [L521] struct item *item = malloc(sizeof *item); VAL [c=1] [L522] EXPR \read(**plist) VAL [c=1] [L522] item->next = *plist VAL [c=1] [L523] EXPR item->next VAL [c=1] [L523-L525] EXPR (item->next) ? item->next->data : malloc(sizeof *item) [L523-L525] EXPR (item->next) ? item->next->data : malloc(sizeof *item) VAL [c=1] [L523-L525] item->data = (item->next) ? item->next->data : malloc(sizeof *item) VAL [c=1] [L526] *plist = item VAL [c=1] [L534] length++ VAL [c=1] [L535] COND FALSE !(__VERIFIER_nondet_int() && c < 20) [L536] COND TRUE length > 0 VAL [c=1] [L537] COND FALSE !(length < 0) VAL [c=1] [L540] EXPR \read(*list) VAL [c=1] [L540] EXPR list->next VAL [c=1] [L540] struct item *next = list->next; [L541] EXPR \read(*list) VAL [c=1] [L541] free(list) VAL [c=1] [L541] free(list) VAL [c=1] [L541] free(list) [L542] list = next VAL [c=1] [L543] length-- VAL [c=1] [L545] COND FALSE !(length > 0) VAL [c=1] [L551] return 0; [L530] struct item *list = ((void *)0); [L551] return 0; VAL [c=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 90 locations, 44 error locations. Result: UNSAFE, OverallTime: 51.9s, OverallIterations: 16, TraceHistogramMax: 2, AutomataDifference: 32.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 686 SDtfs, 3093 SDslu, 1507 SDs, 0 SdLazy, 2140 SolverSat, 264 SolverUnsat, 12 SolverUnknown, 0 SolverNotchecked, 28.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 639 GetRequests, 436 SyntacticMatches, 39 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 1179 ImplicationChecksByTransitivity, 11.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=113occurred in iteration=8, 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, 15 MinimizatonAttempts, 369 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 13.3s InterpolantComputationTime, 341 NumberOfCodeBlocks, 341 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 590 ConstructedInterpolants, 107 QuantifiedInterpolants, 166921 SizeOfPredicates, 269 NumberOfNonLiveVariables, 1648 ConjunctsInSsa, 234 ConjunctsInUnsatCore, 38 InterpolantComputations, 26 PerfectInterpolantSequences, 12/72 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 could not prove your program: unable to determine feasibility of some traces Received shutdown request...