./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/array-memsafety/openbsd_cstrcmp-alloca-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_713257e4-5a52-4d95-afa7-c20a834f2096/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_713257e4-5a52-4d95-afa7-c20a834f2096/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_713257e4-5a52-4d95-afa7-c20a834f2096/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_713257e4-5a52-4d95-afa7-c20a834f2096/bin/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/array-memsafety/openbsd_cstrcmp-alloca-1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_713257e4-5a52-4d95-afa7-c20a834f2096/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_713257e4-5a52-4d95-afa7-c20a834f2096/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 f68b319d77fa756392ca29e618a1e0accd9b6c9e ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_713257e4-5a52-4d95-afa7-c20a834f2096/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_713257e4-5a52-4d95-afa7-c20a834f2096/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_713257e4-5a52-4d95-afa7-c20a834f2096/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_713257e4-5a52-4d95-afa7-c20a834f2096/bin/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/array-memsafety/openbsd_cstrcmp-alloca-1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_713257e4-5a52-4d95-afa7-c20a834f2096/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_713257e4-5a52-4d95-afa7-c20a834f2096/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 f68b319d77fa756392ca29e618a1e0accd9b6c9e ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 22:07:58,845 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 22:07:58,846 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 22:07:58,854 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 22:07:58,854 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 22:07:58,855 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 22:07:58,856 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 22:07:58,857 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 22:07:58,858 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 22:07:58,859 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 22:07:58,859 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 22:07:58,860 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 22:07:58,860 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 22:07:58,861 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 22:07:58,862 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 22:07:58,863 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 22:07:58,863 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 22:07:58,864 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 22:07:58,865 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 22:07:58,867 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 22:07:58,868 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 22:07:58,868 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 22:07:58,869 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 22:07:58,869 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 22:07:58,871 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 22:07:58,871 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 22:07:58,872 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 22:07:58,872 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 22:07:58,872 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 22:07:58,873 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 22:07:58,873 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 22:07:58,873 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 22:07:58,874 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 22:07:58,874 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 22:07:58,875 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 22:07:58,875 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 22:07:58,875 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 22:07:58,875 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 22:07:58,876 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 22:07:58,876 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 22:07:58,877 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 22:07:58,877 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_713257e4-5a52-4d95-afa7-c20a834f2096/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2019-12-07 22:07:58,887 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 22:07:58,888 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 22:07:58,888 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 22:07:58,888 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 22:07:58,888 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 22:07:58,889 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 22:07:58,889 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 22:07:58,889 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 22:07:58,889 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 22:07:58,889 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 22:07:58,889 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 22:07:58,889 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 22:07:58,889 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 22:07:58,890 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 22:07:58,890 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 22:07:58,890 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 22:07:58,890 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 22:07:58,890 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 22:07:58,891 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 22:07:58,891 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 22:07:58,891 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 22:07:58,891 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 22:07:58,891 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 22:07:58,891 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-12-07 22:07:58,891 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-12-07 22:07:58,891 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-12-07 22:07:58,891 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 22:07:58,892 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 22:07:58,892 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 22:07:58,892 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 22:07:58,892 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 22:07:58,892 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 22:07:58,892 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 22:07:58,892 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 22:07:58,892 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 22:07:58,892 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 22:07:58,893 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 22:07:58,893 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 22:07:58,893 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 22:07:58,893 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 22:07:58,893 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_713257e4-5a52-4d95-afa7-c20a834f2096/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 -> f68b319d77fa756392ca29e618a1e0accd9b6c9e [2019-12-07 22:07:58,992 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 22:07:58,999 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 22:07:59,001 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 22:07:59,002 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 22:07:59,003 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 22:07:59,003 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_713257e4-5a52-4d95-afa7-c20a834f2096/bin/utaipan/../../sv-benchmarks/c/array-memsafety/openbsd_cstrcmp-alloca-1.i [2019-12-07 22:07:59,038 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_713257e4-5a52-4d95-afa7-c20a834f2096/bin/utaipan/data/8a76ebbbe/700237a5626e4e7ea378290e14b648ac/FLAGbf04043db [2019-12-07 22:07:59,469 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 22:07:59,469 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_713257e4-5a52-4d95-afa7-c20a834f2096/sv-benchmarks/c/array-memsafety/openbsd_cstrcmp-alloca-1.i [2019-12-07 22:07:59,478 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_713257e4-5a52-4d95-afa7-c20a834f2096/bin/utaipan/data/8a76ebbbe/700237a5626e4e7ea378290e14b648ac/FLAGbf04043db [2019-12-07 22:07:59,487 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_713257e4-5a52-4d95-afa7-c20a834f2096/bin/utaipan/data/8a76ebbbe/700237a5626e4e7ea378290e14b648ac [2019-12-07 22:07:59,489 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 22:07:59,490 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 22:07:59,491 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 22:07:59,491 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 22:07:59,493 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 22:07:59,494 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 10:07:59" (1/1) ... [2019-12-07 22:07:59,496 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@513e5c80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:59, skipping insertion in model container [2019-12-07 22:07:59,496 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 10:07:59" (1/1) ... [2019-12-07 22:07:59,501 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 22:07:59,530 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 22:07:59,728 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 22:07:59,734 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 22:07:59,762 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 22:07:59,792 INFO L208 MainTranslator]: Completed translation [2019-12-07 22:07:59,793 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:59 WrapperNode [2019-12-07 22:07:59,793 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 22:07:59,793 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 22:07:59,793 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 22:07:59,793 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 22:07:59,799 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:59" (1/1) ... [2019-12-07 22:07:59,808 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:59" (1/1) ... [2019-12-07 22:07:59,824 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 22:07:59,824 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 22:07:59,824 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 22:07:59,824 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 22:07:59,830 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:59" (1/1) ... [2019-12-07 22:07:59,830 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:59" (1/1) ... [2019-12-07 22:07:59,832 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:59" (1/1) ... [2019-12-07 22:07:59,833 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:59" (1/1) ... [2019-12-07 22:07:59,837 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:59" (1/1) ... [2019-12-07 22:07:59,840 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:59" (1/1) ... [2019-12-07 22:07:59,842 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:59" (1/1) ... [2019-12-07 22:07:59,844 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 22:07:59,844 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 22:07:59,844 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 22:07:59,844 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 22:07:59,844 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:59" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_713257e4-5a52-4d95-afa7-c20a834f2096/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 22:07:59,885 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-07 22:07:59,885 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 22:07:59,885 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 22:07:59,885 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 22:07:59,886 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 22:07:59,886 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 22:08:00,168 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 22:08:00,168 INFO L287 CfgBuilder]: Removed 9 assume(true) statements. [2019-12-07 22:08:00,169 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:08:00 BoogieIcfgContainer [2019-12-07 22:08:00,169 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 22:08:00,170 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 22:08:00,170 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 22:08:00,172 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 22:08:00,172 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 10:07:59" (1/3) ... [2019-12-07 22:08:00,173 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77478feb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 10:08:00, skipping insertion in model container [2019-12-07 22:08:00,173 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:59" (2/3) ... [2019-12-07 22:08:00,173 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77478feb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 10:08:00, skipping insertion in model container [2019-12-07 22:08:00,173 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:08:00" (3/3) ... [2019-12-07 22:08:00,174 INFO L109 eAbstractionObserver]: Analyzing ICFG openbsd_cstrcmp-alloca-1.i [2019-12-07 22:08:00,181 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 22:08:00,186 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 19 error locations. [2019-12-07 22:08:00,193 INFO L249 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2019-12-07 22:08:00,205 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 22:08:00,206 INFO L374 AbstractCegarLoop]: Hoare is false [2019-12-07 22:08:00,206 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 22:08:00,206 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 22:08:00,206 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 22:08:00,206 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 22:08:00,206 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 22:08:00,206 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 22:08:00,216 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states. [2019-12-07 22:08:00,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-07 22:08:00,221 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 22:08:00,221 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-07 22:08:00,221 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 22:08:00,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 22:08:00,225 INFO L82 PathProgramCache]: Analyzing trace with hash 142005, now seen corresponding path program 1 times [2019-12-07 22:08:00,231 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 22:08:00,231 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017025128] [2019-12-07 22:08:00,232 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 22:08:00,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 22:08:00,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 22:08:00,342 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017025128] [2019-12-07 22:08:00,343 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 22:08:00,343 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 22:08:00,343 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556634811] [2019-12-07 22:08:00,346 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 22:08:00,347 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 22:08:00,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 22:08:00,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 22:08:00,357 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 3 states. [2019-12-07 22:08:00,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 22:08:00,397 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2019-12-07 22:08:00,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 22:08:00,398 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-07 22:08:00,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 22:08:00,404 INFO L225 Difference]: With dead ends: 34 [2019-12-07 22:08:00,404 INFO L226 Difference]: Without dead ends: 33 [2019-12-07 22:08:00,405 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 22:08:00,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-12-07 22:08:00,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-12-07 22:08:00,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-12-07 22:08:00,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2019-12-07 22:08:00,427 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 3 [2019-12-07 22:08:00,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 22:08:00,427 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2019-12-07 22:08:00,427 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 22:08:00,427 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2019-12-07 22:08:00,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-07 22:08:00,427 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 22:08:00,427 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-07 22:08:00,427 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 22:08:00,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 22:08:00,428 INFO L82 PathProgramCache]: Analyzing trace with hash 142006, now seen corresponding path program 1 times [2019-12-07 22:08:00,428 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 22:08:00,428 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464932233] [2019-12-07 22:08:00,428 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 22:08:00,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 22:08:00,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 22:08:00,471 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464932233] [2019-12-07 22:08:00,471 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 22:08:00,471 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 22:08:00,471 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109783252] [2019-12-07 22:08:00,472 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 22:08:00,472 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 22:08:00,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 22:08:00,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 22:08:00,473 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand 4 states. [2019-12-07 22:08:00,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 22:08:00,553 INFO L93 Difference]: Finished difference Result 64 states and 70 transitions. [2019-12-07 22:08:00,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 22:08:00,553 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-12-07 22:08:00,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 22:08:00,554 INFO L225 Difference]: With dead ends: 64 [2019-12-07 22:08:00,554 INFO L226 Difference]: Without dead ends: 64 [2019-12-07 22:08:00,554 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 22:08:00,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-12-07 22:08:00,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 35. [2019-12-07 22:08:00,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-12-07 22:08:00,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2019-12-07 22:08:00,558 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 3 [2019-12-07 22:08:00,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 22:08:00,559 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2019-12-07 22:08:00,559 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 22:08:00,559 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2019-12-07 22:08:00,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-12-07 22:08:00,559 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 22:08:00,559 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-12-07 22:08:00,559 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 22:08:00,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 22:08:00,560 INFO L82 PathProgramCache]: Analyzing trace with hash 4488543, now seen corresponding path program 1 times [2019-12-07 22:08:00,560 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 22:08:00,560 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966143736] [2019-12-07 22:08:00,560 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 22:08:00,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 22:08:00,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 22:08:00,599 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966143736] [2019-12-07 22:08:00,599 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 22:08:00,599 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 22:08:00,600 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820138069] [2019-12-07 22:08:00,600 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 22:08:00,600 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 22:08:00,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 22:08:00,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 22:08:00,600 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 3 states. [2019-12-07 22:08:00,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 22:08:00,621 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2019-12-07 22:08:00,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 22:08:00,622 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-12-07 22:08:00,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 22:08:00,622 INFO L225 Difference]: With dead ends: 34 [2019-12-07 22:08:00,622 INFO L226 Difference]: Without dead ends: 34 [2019-12-07 22:08:00,623 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 22:08:00,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-12-07 22:08:00,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-12-07 22:08:00,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-12-07 22:08:00,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2019-12-07 22:08:00,625 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 4 [2019-12-07 22:08:00,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 22:08:00,625 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2019-12-07 22:08:00,625 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 22:08:00,625 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2019-12-07 22:08:00,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-12-07 22:08:00,626 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 22:08:00,626 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-12-07 22:08:00,626 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 22:08:00,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 22:08:00,626 INFO L82 PathProgramCache]: Analyzing trace with hash 4486301, now seen corresponding path program 1 times [2019-12-07 22:08:00,626 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 22:08:00,626 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613008195] [2019-12-07 22:08:00,627 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 22:08:00,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 22:08:00,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 22:08:00,644 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613008195] [2019-12-07 22:08:00,644 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 22:08:00,644 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 22:08:00,644 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323629974] [2019-12-07 22:08:00,644 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 22:08:00,644 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 22:08:00,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 22:08:00,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 22:08:00,645 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand 3 states. [2019-12-07 22:08:00,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 22:08:00,664 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2019-12-07 22:08:00,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 22:08:00,665 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-12-07 22:08:00,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 22:08:00,665 INFO L225 Difference]: With dead ends: 32 [2019-12-07 22:08:00,665 INFO L226 Difference]: Without dead ends: 32 [2019-12-07 22:08:00,665 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 22:08:00,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-12-07 22:08:00,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-12-07 22:08:00,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-12-07 22:08:00,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2019-12-07 22:08:00,668 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 4 [2019-12-07 22:08:00,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 22:08:00,668 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2019-12-07 22:08:00,668 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 22:08:00,668 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2019-12-07 22:08:00,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-12-07 22:08:00,668 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 22:08:00,668 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-12-07 22:08:00,669 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 22:08:00,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 22:08:00,669 INFO L82 PathProgramCache]: Analyzing trace with hash 4486302, now seen corresponding path program 1 times [2019-12-07 22:08:00,669 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 22:08:00,669 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753442151] [2019-12-07 22:08:00,669 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 22:08:00,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 22:08:00,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 22:08:00,706 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753442151] [2019-12-07 22:08:00,706 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 22:08:00,706 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 22:08:00,707 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122470459] [2019-12-07 22:08:00,707 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 22:08:00,707 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 22:08:00,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 22:08:00,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 22:08:00,707 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand 5 states. [2019-12-07 22:08:00,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 22:08:00,764 INFO L93 Difference]: Finished difference Result 57 states and 63 transitions. [2019-12-07 22:08:00,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 22:08:00,765 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2019-12-07 22:08:00,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 22:08:00,765 INFO L225 Difference]: With dead ends: 57 [2019-12-07 22:08:00,765 INFO L226 Difference]: Without dead ends: 57 [2019-12-07 22:08:00,765 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 22:08:00,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-12-07 22:08:00,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 34. [2019-12-07 22:08:00,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-12-07 22:08:00,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2019-12-07 22:08:00,768 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 4 [2019-12-07 22:08:00,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 22:08:00,769 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2019-12-07 22:08:00,769 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 22:08:00,769 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2019-12-07 22:08:00,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-07 22:08:00,769 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 22:08:00,769 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-12-07 22:08:00,769 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 22:08:00,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 22:08:00,769 INFO L82 PathProgramCache]: Analyzing trace with hash 136543463, now seen corresponding path program 1 times [2019-12-07 22:08:00,770 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 22:08:00,770 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458167745] [2019-12-07 22:08:00,770 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 22:08:00,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 22:08:00,813 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 22:08:00,813 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458167745] [2019-12-07 22:08:00,813 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1490961647] [2019-12-07 22:08:00,813 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_713257e4-5a52-4d95-afa7-c20a834f2096/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 22:08:00,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 22:08:00,845 INFO L264 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-07 22:08:00,848 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 22:08:00,877 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_42|], 2=[|v_#valid_62|]} [2019-12-07 22:08:00,884 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 22:08:00,892 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-12-07 22:08:00,893 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 22:08:00,902 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 22:08:00,908 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 23 treesize of output 21 [2019-12-07 22:08:00,909 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-12-07 22:08:00,931 INFO L614 ElimStorePlain]: treesize reduction 14, result has 60.0 percent of original size [2019-12-07 22:08:00,933 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 22:08:00,933 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:27, output treesize:12 [2019-12-07 22:08:00,951 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 22:08:00,952 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 22:08:00,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 22:08:00,991 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 22:08:00,992 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [5955463] [2019-12-07 22:08:01,006 INFO L159 IcfgInterpreter]: Started Sifa with 4 locations of interest [2019-12-07 22:08:01,007 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 22:08:01,010 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 22:08:01,014 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 22:08:01,015 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 22:08:01,325 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 22:08:01,341 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 22:08:01,506 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 22:08:01,759 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 22:08:01,759 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 22:08:01,759 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2019-12-07 22:08:01,759 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137879236] [2019-12-07 22:08:01,760 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 22:08:01,760 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 22:08:01,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 22:08:01,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-07 22:08:01,761 INFO L87 Difference]: Start difference. First operand 34 states and 39 transitions. Second operand 9 states. [2019-12-07 22:08:01,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 22:08:01,924 INFO L93 Difference]: Finished difference Result 90 states and 102 transitions. [2019-12-07 22:08:01,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 22:08:01,925 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 5 [2019-12-07 22:08:01,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 22:08:01,926 INFO L225 Difference]: With dead ends: 90 [2019-12-07 22:08:01,926 INFO L226 Difference]: Without dead ends: 90 [2019-12-07 22:08:01,926 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2019-12-07 22:08:01,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-12-07 22:08:01,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 31. [2019-12-07 22:08:01,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-12-07 22:08:01,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2019-12-07 22:08:01,929 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 5 [2019-12-07 22:08:01,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 22:08:01,929 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2019-12-07 22:08:01,930 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 22:08:01,930 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2019-12-07 22:08:01,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-07 22:08:01,930 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 22:08:01,930 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-07 22:08:02,131 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 22:08:02,132 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 22:08:02,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 22:08:02,132 INFO L82 PathProgramCache]: Analyzing trace with hash 139144827, now seen corresponding path program 1 times [2019-12-07 22:08:02,133 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 22:08:02,133 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907633983] [2019-12-07 22:08:02,133 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 22:08:02,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 22:08:02,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 22:08:02,198 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907633983] [2019-12-07 22:08:02,198 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 22:08:02,198 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 22:08:02,199 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322988668] [2019-12-07 22:08:02,199 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 22:08:02,200 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 22:08:02,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 22:08:02,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 22:08:02,201 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand 3 states. [2019-12-07 22:08:02,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 22:08:02,256 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2019-12-07 22:08:02,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 22:08:02,257 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-07 22:08:02,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 22:08:02,258 INFO L225 Difference]: With dead ends: 30 [2019-12-07 22:08:02,258 INFO L226 Difference]: Without dead ends: 30 [2019-12-07 22:08:02,259 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 22:08:02,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-12-07 22:08:02,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-12-07 22:08:02,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-12-07 22:08:02,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2019-12-07 22:08:02,265 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 5 [2019-12-07 22:08:02,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 22:08:02,265 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2019-12-07 22:08:02,266 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 22:08:02,266 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2019-12-07 22:08:02,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-12-07 22:08:02,267 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 22:08:02,267 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-12-07 22:08:02,268 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 22:08:02,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 22:08:02,268 INFO L82 PathProgramCache]: Analyzing trace with hash 18524017, now seen corresponding path program 1 times [2019-12-07 22:08:02,269 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 22:08:02,269 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010617982] [2019-12-07 22:08:02,269 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 22:08:02,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 22:08:02,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 22:08:02,311 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010617982] [2019-12-07 22:08:02,311 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 22:08:02,311 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 22:08:02,312 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577594399] [2019-12-07 22:08:02,312 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 22:08:02,312 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 22:08:02,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 22:08:02,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 22:08:02,312 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 5 states. [2019-12-07 22:08:02,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 22:08:02,350 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2019-12-07 22:08:02,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 22:08:02,350 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 6 [2019-12-07 22:08:02,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 22:08:02,351 INFO L225 Difference]: With dead ends: 44 [2019-12-07 22:08:02,351 INFO L226 Difference]: Without dead ends: 44 [2019-12-07 22:08:02,351 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 22:08:02,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-12-07 22:08:02,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 34. [2019-12-07 22:08:02,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-12-07 22:08:02,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 43 transitions. [2019-12-07 22:08:02,354 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 43 transitions. Word has length 6 [2019-12-07 22:08:02,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 22:08:02,354 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 43 transitions. [2019-12-07 22:08:02,355 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 22:08:02,355 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2019-12-07 22:08:02,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-12-07 22:08:02,355 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 22:08:02,355 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-12-07 22:08:02,355 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 22:08:02,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 22:08:02,356 INFO L82 PathProgramCache]: Analyzing trace with hash 18524016, now seen corresponding path program 1 times [2019-12-07 22:08:02,356 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 22:08:02,356 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618588538] [2019-12-07 22:08:02,356 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 22:08:02,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 22:08:02,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 22:08:02,376 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618588538] [2019-12-07 22:08:02,376 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 22:08:02,376 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 22:08:02,376 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157706343] [2019-12-07 22:08:02,376 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 22:08:02,377 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 22:08:02,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 22:08:02,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 22:08:02,377 INFO L87 Difference]: Start difference. First operand 34 states and 43 transitions. Second operand 4 states. [2019-12-07 22:08:02,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 22:08:02,405 INFO L93 Difference]: Finished difference Result 32 states and 39 transitions. [2019-12-07 22:08:02,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 22:08:02,405 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-12-07 22:08:02,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 22:08:02,406 INFO L225 Difference]: With dead ends: 32 [2019-12-07 22:08:02,406 INFO L226 Difference]: Without dead ends: 32 [2019-12-07 22:08:02,406 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 22:08:02,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-12-07 22:08:02,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-12-07 22:08:02,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-12-07 22:08:02,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2019-12-07 22:08:02,408 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 6 [2019-12-07 22:08:02,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 22:08:02,408 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2019-12-07 22:08:02,408 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 22:08:02,408 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2019-12-07 22:08:02,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-12-07 22:08:02,408 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 22:08:02,408 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-12-07 22:08:02,408 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 22:08:02,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 22:08:02,409 INFO L82 PathProgramCache]: Analyzing trace with hash 16430784, now seen corresponding path program 1 times [2019-12-07 22:08:02,409 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 22:08:02,409 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58342035] [2019-12-07 22:08:02,409 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 22:08:02,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 22:08:02,438 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 22:08:02,438 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58342035] [2019-12-07 22:08:02,438 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1565744334] [2019-12-07 22:08:02,439 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_713257e4-5a52-4d95-afa7-c20a834f2096/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 22:08:02,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 22:08:02,463 INFO L264 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 11 conjunts are in the unsatisfiable core [2019-12-07 22:08:02,463 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 22:08:02,503 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 22:08:02,503 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 22:08:02,550 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 22:08:02,550 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [662524397] [2019-12-07 22:08:02,551 INFO L159 IcfgInterpreter]: Started Sifa with 5 locations of interest [2019-12-07 22:08:02,551 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 22:08:02,551 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 22:08:02,551 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 22:08:02,552 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 22:08:02,772 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 22:08:02,777 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 22:08:02,877 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 22:08:03,135 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 55 [2019-12-07 22:08:03,285 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 22:08:03,285 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 22:08:03,285 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 8 [2019-12-07 22:08:03,285 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013199024] [2019-12-07 22:08:03,286 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 22:08:03,286 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 22:08:03,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 22:08:03,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2019-12-07 22:08:03,286 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. Second operand 10 states. [2019-12-07 22:08:03,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 22:08:03,417 INFO L93 Difference]: Finished difference Result 80 states and 96 transitions. [2019-12-07 22:08:03,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 22:08:03,417 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-12-07 22:08:03,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 22:08:03,418 INFO L225 Difference]: With dead ends: 80 [2019-12-07 22:08:03,418 INFO L226 Difference]: Without dead ends: 80 [2019-12-07 22:08:03,418 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2019-12-07 22:08:03,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-12-07 22:08:03,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 29. [2019-12-07 22:08:03,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-12-07 22:08:03,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2019-12-07 22:08:03,420 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 6 [2019-12-07 22:08:03,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 22:08:03,420 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2019-12-07 22:08:03,421 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 22:08:03,421 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2019-12-07 22:08:03,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-07 22:08:03,421 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 22:08:03,421 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-07 22:08:03,621 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 22:08:03,622 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 22:08:03,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 22:08:03,622 INFO L82 PathProgramCache]: Analyzing trace with hash 574245710, now seen corresponding path program 1 times [2019-12-07 22:08:03,622 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 22:08:03,623 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062129675] [2019-12-07 22:08:03,623 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 22:08:03,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 22:08:03,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 22:08:03,659 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062129675] [2019-12-07 22:08:03,660 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 22:08:03,660 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 22:08:03,660 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985713800] [2019-12-07 22:08:03,660 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 22:08:03,660 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 22:08:03,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 22:08:03,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 22:08:03,661 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand 4 states. [2019-12-07 22:08:03,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 22:08:03,707 INFO L93 Difference]: Finished difference Result 28 states and 33 transitions. [2019-12-07 22:08:03,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 22:08:03,707 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-12-07 22:08:03,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 22:08:03,707 INFO L225 Difference]: With dead ends: 28 [2019-12-07 22:08:03,708 INFO L226 Difference]: Without dead ends: 28 [2019-12-07 22:08:03,708 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 22:08:03,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-12-07 22:08:03,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-12-07 22:08:03,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-12-07 22:08:03,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2019-12-07 22:08:03,710 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 7 [2019-12-07 22:08:03,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 22:08:03,711 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2019-12-07 22:08:03,711 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 22:08:03,711 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2019-12-07 22:08:03,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-07 22:08:03,711 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 22:08:03,711 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-07 22:08:03,711 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 22:08:03,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 22:08:03,712 INFO L82 PathProgramCache]: Analyzing trace with hash 574245711, now seen corresponding path program 1 times [2019-12-07 22:08:03,712 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 22:08:03,712 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271433010] [2019-12-07 22:08:03,712 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 22:08:03,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 22:08:03,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 22:08:03,749 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271433010] [2019-12-07 22:08:03,749 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 22:08:03,749 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 22:08:03,749 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147855754] [2019-12-07 22:08:03,749 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 22:08:03,749 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 22:08:03,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 22:08:03,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 22:08:03,750 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. Second operand 5 states. [2019-12-07 22:08:03,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 22:08:03,792 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2019-12-07 22:08:03,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 22:08:03,792 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2019-12-07 22:08:03,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 22:08:03,792 INFO L225 Difference]: With dead ends: 28 [2019-12-07 22:08:03,792 INFO L226 Difference]: Without dead ends: 28 [2019-12-07 22:08:03,793 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 22:08:03,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-12-07 22:08:03,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-12-07 22:08:03,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-12-07 22:08:03,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2019-12-07 22:08:03,794 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 7 [2019-12-07 22:08:03,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 22:08:03,794 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2019-12-07 22:08:03,794 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 22:08:03,794 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2019-12-07 22:08:03,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 22:08:03,795 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 22:08:03,795 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 22:08:03,795 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 22:08:03,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 22:08:03,795 INFO L82 PathProgramCache]: Analyzing trace with hash 2094314799, now seen corresponding path program 1 times [2019-12-07 22:08:03,795 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 22:08:03,795 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123379617] [2019-12-07 22:08:03,795 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 22:08:03,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 22:08:03,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 22:08:03,818 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123379617] [2019-12-07 22:08:03,818 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 22:08:03,818 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 22:08:03,818 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874035922] [2019-12-07 22:08:03,819 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 22:08:03,819 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 22:08:03,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 22:08:03,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 22:08:03,819 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 5 states. [2019-12-07 22:08:03,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 22:08:03,852 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2019-12-07 22:08:03,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 22:08:03,852 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-12-07 22:08:03,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 22:08:03,852 INFO L225 Difference]: With dead ends: 27 [2019-12-07 22:08:03,853 INFO L226 Difference]: Without dead ends: 27 [2019-12-07 22:08:03,853 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 22:08:03,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-12-07 22:08:03,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-12-07 22:08:03,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-12-07 22:08:03,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2019-12-07 22:08:03,854 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 9 [2019-12-07 22:08:03,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 22:08:03,854 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2019-12-07 22:08:03,854 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 22:08:03,854 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2019-12-07 22:08:03,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 22:08:03,855 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 22:08:03,855 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 22:08:03,855 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 22:08:03,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 22:08:03,855 INFO L82 PathProgramCache]: Analyzing trace with hash 2094314800, now seen corresponding path program 1 times [2019-12-07 22:08:03,855 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 22:08:03,855 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95591795] [2019-12-07 22:08:03,855 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 22:08:03,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 22:08:03,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 22:08:03,885 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95591795] [2019-12-07 22:08:03,885 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 22:08:03,885 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 22:08:03,885 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188034258] [2019-12-07 22:08:03,885 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 22:08:03,885 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 22:08:03,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 22:08:03,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 22:08:03,886 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand 6 states. [2019-12-07 22:08:03,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 22:08:03,936 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2019-12-07 22:08:03,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 22:08:03,937 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2019-12-07 22:08:03,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 22:08:03,937 INFO L225 Difference]: With dead ends: 35 [2019-12-07 22:08:03,937 INFO L226 Difference]: Without dead ends: 35 [2019-12-07 22:08:03,937 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-12-07 22:08:03,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-12-07 22:08:03,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 28. [2019-12-07 22:08:03,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-12-07 22:08:03,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2019-12-07 22:08:03,939 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 9 [2019-12-07 22:08:03,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 22:08:03,939 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2019-12-07 22:08:03,939 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 22:08:03,939 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2019-12-07 22:08:03,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-07 22:08:03,940 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 22:08:03,940 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 22:08:03,940 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 22:08:03,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 22:08:03,940 INFO L82 PathProgramCache]: Analyzing trace with hash 499248334, now seen corresponding path program 1 times [2019-12-07 22:08:03,940 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 22:08:03,941 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917273116] [2019-12-07 22:08:03,941 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 22:08:03,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 22:08:03,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 22:08:03,959 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917273116] [2019-12-07 22:08:03,959 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 22:08:03,959 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 22:08:03,960 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537535520] [2019-12-07 22:08:03,960 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 22:08:03,960 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 22:08:03,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 22:08:03,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 22:08:03,960 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 5 states. [2019-12-07 22:08:03,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 22:08:03,992 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2019-12-07 22:08:03,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 22:08:03,992 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2019-12-07 22:08:03,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 22:08:03,993 INFO L225 Difference]: With dead ends: 27 [2019-12-07 22:08:03,993 INFO L226 Difference]: Without dead ends: 27 [2019-12-07 22:08:03,993 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 22:08:03,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-12-07 22:08:03,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-12-07 22:08:03,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-12-07 22:08:03,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2019-12-07 22:08:03,995 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 10 [2019-12-07 22:08:03,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 22:08:03,995 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2019-12-07 22:08:03,995 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 22:08:03,995 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2019-12-07 22:08:03,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-07 22:08:03,995 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 22:08:03,995 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 22:08:03,995 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 22:08:03,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 22:08:03,996 INFO L82 PathProgramCache]: Analyzing trace with hash 499248335, now seen corresponding path program 1 times [2019-12-07 22:08:03,996 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 22:08:03,996 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387678397] [2019-12-07 22:08:03,996 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 22:08:04,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 22:08:04,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 22:08:04,047 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387678397] [2019-12-07 22:08:04,047 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 22:08:04,047 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 22:08:04,048 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093027414] [2019-12-07 22:08:04,048 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 22:08:04,048 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 22:08:04,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 22:08:04,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-07 22:08:04,048 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand 7 states. [2019-12-07 22:08:04,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 22:08:04,144 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2019-12-07 22:08:04,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 22:08:04,145 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 10 [2019-12-07 22:08:04,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 22:08:04,145 INFO L225 Difference]: With dead ends: 34 [2019-12-07 22:08:04,145 INFO L226 Difference]: Without dead ends: 34 [2019-12-07 22:08:04,145 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-12-07 22:08:04,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-12-07 22:08:04,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 28. [2019-12-07 22:08:04,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-12-07 22:08:04,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2019-12-07 22:08:04,147 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 10 [2019-12-07 22:08:04,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 22:08:04,148 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2019-12-07 22:08:04,148 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 22:08:04,148 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2019-12-07 22:08:04,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 22:08:04,148 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 22:08:04,148 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 22:08:04,149 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 22:08:04,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 22:08:04,149 INFO L82 PathProgramCache]: Analyzing trace with hash -1703138371, now seen corresponding path program 1 times [2019-12-07 22:08:04,149 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 22:08:04,149 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855299590] [2019-12-07 22:08:04,149 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 22:08:04,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 22:08:04,264 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 22:08:04,264 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855299590] [2019-12-07 22:08:04,264 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 22:08:04,264 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 22:08:04,264 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295060119] [2019-12-07 22:08:04,264 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 22:08:04,264 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 22:08:04,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 22:08:04,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-07 22:08:04,265 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 8 states. [2019-12-07 22:08:04,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 22:08:04,385 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2019-12-07 22:08:04,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 22:08:04,385 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 11 [2019-12-07 22:08:04,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 22:08:04,386 INFO L225 Difference]: With dead ends: 47 [2019-12-07 22:08:04,386 INFO L226 Difference]: Without dead ends: 47 [2019-12-07 22:08:04,387 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2019-12-07 22:08:04,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-12-07 22:08:04,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 38. [2019-12-07 22:08:04,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-12-07 22:08:04,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2019-12-07 22:08:04,390 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 45 transitions. Word has length 11 [2019-12-07 22:08:04,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 22:08:04,391 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 45 transitions. [2019-12-07 22:08:04,391 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 22:08:04,391 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2019-12-07 22:08:04,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-12-07 22:08:04,392 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 22:08:04,392 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 22:08:04,392 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 22:08:04,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 22:08:04,392 INFO L82 PathProgramCache]: Analyzing trace with hash -1258669792, now seen corresponding path program 1 times [2019-12-07 22:08:04,393 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 22:08:04,393 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282813518] [2019-12-07 22:08:04,393 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 22:08:04,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 22:08:04,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 22:08:04,679 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282813518] [2019-12-07 22:08:04,680 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 22:08:04,680 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 22:08:04,680 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949027644] [2019-12-07 22:08:04,680 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 22:08:04,680 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 22:08:04,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 22:08:04,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-07 22:08:04,681 INFO L87 Difference]: Start difference. First operand 38 states and 45 transitions. Second operand 9 states. [2019-12-07 22:08:05,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 22:08:05,267 INFO L93 Difference]: Finished difference Result 56 states and 62 transitions. [2019-12-07 22:08:05,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 22:08:05,267 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2019-12-07 22:08:05,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 22:08:05,267 INFO L225 Difference]: With dead ends: 56 [2019-12-07 22:08:05,267 INFO L226 Difference]: Without dead ends: 56 [2019-12-07 22:08:05,268 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2019-12-07 22:08:05,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-12-07 22:08:05,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 44. [2019-12-07 22:08:05,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-12-07 22:08:05,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 52 transitions. [2019-12-07 22:08:05,270 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 52 transitions. Word has length 12 [2019-12-07 22:08:05,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 22:08:05,270 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 52 transitions. [2019-12-07 22:08:05,270 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 22:08:05,270 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2019-12-07 22:08:05,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-12-07 22:08:05,270 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 22:08:05,271 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 22:08:05,271 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 22:08:05,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 22:08:05,271 INFO L82 PathProgramCache]: Analyzing trace with hash -1257682845, now seen corresponding path program 1 times [2019-12-07 22:08:05,271 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 22:08:05,271 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23676432] [2019-12-07 22:08:05,271 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 22:08:05,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 22:08:05,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 22:08:05,308 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23676432] [2019-12-07 22:08:05,309 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 22:08:05,309 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 22:08:05,309 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343630799] [2019-12-07 22:08:05,309 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 22:08:05,309 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 22:08:05,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 22:08:05,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 22:08:05,309 INFO L87 Difference]: Start difference. First operand 44 states and 52 transitions. Second operand 4 states. [2019-12-07 22:08:05,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 22:08:05,326 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2019-12-07 22:08:05,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 22:08:05,326 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-12-07 22:08:05,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 22:08:05,326 INFO L225 Difference]: With dead ends: 43 [2019-12-07 22:08:05,326 INFO L226 Difference]: Without dead ends: 24 [2019-12-07 22:08:05,327 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 22:08:05,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-12-07 22:08:05,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-12-07 22:08:05,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-12-07 22:08:05,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2019-12-07 22:08:05,328 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 12 [2019-12-07 22:08:05,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 22:08:05,328 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2019-12-07 22:08:05,328 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 22:08:05,328 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2019-12-07 22:08:05,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 22:08:05,328 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 22:08:05,328 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 22:08:05,329 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 22:08:05,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 22:08:05,329 INFO L82 PathProgramCache]: Analyzing trace with hash 1044692206, now seen corresponding path program 1 times [2019-12-07 22:08:05,329 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 22:08:05,329 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155066476] [2019-12-07 22:08:05,329 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 22:08:05,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 22:08:05,384 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 22:08:05,384 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155066476] [2019-12-07 22:08:05,384 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [223979787] [2019-12-07 22:08:05,385 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_713257e4-5a52-4d95-afa7-c20a834f2096/bin/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 22:08:05,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 22:08:05,422 INFO L264 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 20 conjunts are in the unsatisfiable core [2019-12-07 22:08:05,422 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 22:08:05,464 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 22:08:05,464 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 22:08:05,528 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 22:08:05,529 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1316639238] [2019-12-07 22:08:05,530 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2019-12-07 22:08:05,530 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 22:08:05,530 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 22:08:05,530 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 22:08:05,530 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 22:08:05,750 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 22:08:05,764 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 22:08:05,939 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 22:08:06,549 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 78 [2019-12-07 22:08:06,775 WARN L192 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 86 [2019-12-07 22:08:07,035 WARN L192 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 91 [2019-12-07 22:08:07,284 WARN L192 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 89 [2019-12-07 22:08:07,606 WARN L192 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 92 [2019-12-07 22:08:07,607 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2019-12-07 22:08:07,607 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [7, 6, 6] total 26 [2019-12-07 22:08:07,608 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172801839] [2019-12-07 22:08:07,608 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 22:08:07,608 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 22:08:07,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 22:08:07,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=629, Unknown=0, NotChecked=0, Total=756 [2019-12-07 22:08:07,609 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 12 states. [2019-12-07 22:08:07,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 22:08:07,726 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2019-12-07 22:08:07,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 22:08:07,727 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 13 [2019-12-07 22:08:07,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 22:08:07,727 INFO L225 Difference]: With dead ends: 33 [2019-12-07 22:08:07,727 INFO L226 Difference]: Without dead ends: 26 [2019-12-07 22:08:07,728 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 15 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=127, Invalid=629, Unknown=0, NotChecked=0, Total=756 [2019-12-07 22:08:07,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-12-07 22:08:07,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2019-12-07 22:08:07,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-12-07 22:08:07,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2019-12-07 22:08:07,729 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 13 [2019-12-07 22:08:07,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 22:08:07,729 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2019-12-07 22:08:07,729 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 22:08:07,729 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2019-12-07 22:08:07,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 22:08:07,730 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 22:08:07,730 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 22:08:07,930 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 22:08:07,932 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 22:08:07,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 22:08:07,933 INFO L82 PathProgramCache]: Analyzing trace with hash 778610764, now seen corresponding path program 1 times [2019-12-07 22:08:07,933 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 22:08:07,934 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686307127] [2019-12-07 22:08:07,934 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 22:08:07,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 22:08:08,019 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 22:08:08,020 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686307127] [2019-12-07 22:08:08,020 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1295027660] [2019-12-07 22:08:08,020 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_713257e4-5a52-4d95-afa7-c20a834f2096/bin/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 22:08:08,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 22:08:08,051 INFO L264 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 20 conjunts are in the unsatisfiable core [2019-12-07 22:08:08,052 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 22:08:08,094 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 22:08:08,094 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 22:08:08,162 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 22:08:08,162 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [422054070] [2019-12-07 22:08:08,163 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-12-07 22:08:08,163 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 22:08:08,164 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 22:08:08,164 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 22:08:08,164 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 22:08:08,361 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 22:08:08,380 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 22:08:08,580 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 22:08:08,615 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 22:08:09,071 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 22:08:09,438 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 62 [2019-12-07 22:08:09,898 WARN L192 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 64 [2019-12-07 22:08:10,233 WARN L192 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 73 [2019-12-07 22:08:10,653 WARN L192 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 60 [2019-12-07 22:08:11,042 WARN L192 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 72 [2019-12-07 22:08:11,044 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 22:08:11,044 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 22:08:11,044 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 16 [2019-12-07 22:08:11,044 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600973143] [2019-12-07 22:08:11,045 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-07 22:08:11,045 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 22:08:11,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-07 22:08:11,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=703, Unknown=0, NotChecked=0, Total=812 [2019-12-07 22:08:11,046 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand 18 states. [2019-12-07 22:08:11,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 22:08:11,389 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2019-12-07 22:08:11,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 22:08:11,390 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 15 [2019-12-07 22:08:11,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 22:08:11,390 INFO L225 Difference]: With dead ends: 32 [2019-12-07 22:08:11,390 INFO L226 Difference]: Without dead ends: 32 [2019-12-07 22:08:11,391 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 296 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=217, Invalid=1115, Unknown=0, NotChecked=0, Total=1332 [2019-12-07 22:08:11,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-12-07 22:08:11,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 26. [2019-12-07 22:08:11,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-12-07 22:08:11,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2019-12-07 22:08:11,393 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 15 [2019-12-07 22:08:11,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 22:08:11,393 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2019-12-07 22:08:11,393 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-07 22:08:11,393 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2019-12-07 22:08:11,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 22:08:11,394 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 22:08:11,394 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 22:08:11,594 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 22:08:11,595 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 22:08:11,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 22:08:11,596 INFO L82 PathProgramCache]: Analyzing trace with hash -1632868908, now seen corresponding path program 1 times [2019-12-07 22:08:11,596 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 22:08:11,596 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804094617] [2019-12-07 22:08:11,596 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 22:08:11,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 22:08:11,687 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 22:08:11,687 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804094617] [2019-12-07 22:08:11,687 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [312776770] [2019-12-07 22:08:11,687 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_713257e4-5a52-4d95-afa7-c20a834f2096/bin/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 22:08:11,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 22:08:11,724 INFO L264 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 24 conjunts are in the unsatisfiable core [2019-12-07 22:08:11,725 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 22:08:11,759 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 22:08:11,759 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 22:08:11,828 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 22:08:11,829 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1873045106] [2019-12-07 22:08:11,829 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-12-07 22:08:11,829 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 22:08:11,830 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 22:08:11,830 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 22:08:11,830 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 22:08:12,023 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 22:08:12,028 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 22:08:12,267 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 22:08:12,273 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 22:08:12,660 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 22:08:13,181 WARN L192 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 62 [2019-12-07 22:08:13,371 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 44 [2019-12-07 22:08:13,639 WARN L192 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 64 [2019-12-07 22:08:13,983 WARN L192 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 73 [2019-12-07 22:08:14,414 WARN L192 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 60 [2019-12-07 22:08:14,658 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 72 [2019-12-07 22:08:14,659 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 22:08:14,659 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 22:08:14,659 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2019-12-07 22:08:14,659 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611464475] [2019-12-07 22:08:14,659 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-07 22:08:14,659 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 22:08:14,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-07 22:08:14,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=667, Unknown=0, NotChecked=0, Total=756 [2019-12-07 22:08:14,660 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand 17 states. [2019-12-07 22:08:15,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 22:08:15,358 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2019-12-07 22:08:15,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 22:08:15,359 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2019-12-07 22:08:15,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 22:08:15,360 INFO L225 Difference]: With dead ends: 28 [2019-12-07 22:08:15,360 INFO L226 Difference]: Without dead ends: 28 [2019-12-07 22:08:15,362 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 259 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=169, Invalid=1091, Unknown=0, NotChecked=0, Total=1260 [2019-12-07 22:08:15,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-12-07 22:08:15,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2019-12-07 22:08:15,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-12-07 22:08:15,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2019-12-07 22:08:15,365 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 16 [2019-12-07 22:08:15,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 22:08:15,365 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2019-12-07 22:08:15,366 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-07 22:08:15,366 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2019-12-07 22:08:15,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 22:08:15,367 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 22:08:15,367 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 22:08:15,568 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 22:08:15,569 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 22:08:15,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 22:08:15,569 INFO L82 PathProgramCache]: Analyzing trace with hash -1523957131, now seen corresponding path program 1 times [2019-12-07 22:08:15,570 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 22:08:15,570 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425426982] [2019-12-07 22:08:15,570 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 22:08:15,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 22:08:15,649 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 22:08:15,649 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425426982] [2019-12-07 22:08:15,649 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [566442968] [2019-12-07 22:08:15,649 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_713257e4-5a52-4d95-afa7-c20a834f2096/bin/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 22:08:15,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 22:08:15,684 INFO L264 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 28 conjunts are in the unsatisfiable core [2019-12-07 22:08:15,685 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 22:08:15,776 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 22:08:15,776 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 22:08:15,862 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 22:08:15,863 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [945559894] [2019-12-07 22:08:15,863 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-12-07 22:08:15,864 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 22:08:15,864 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 22:08:15,864 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 22:08:15,864 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 22:08:16,043 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 22:08:16,048 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 22:08:16,253 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 22:08:16,286 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 22:08:16,669 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 22:08:16,823 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 64 [2019-12-07 22:08:17,185 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 62 [2019-12-07 22:08:17,570 WARN L192 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 64 [2019-12-07 22:08:17,951 WARN L192 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 73 [2019-12-07 22:08:18,482 WARN L192 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 60 [2019-12-07 22:08:18,918 WARN L192 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 72 [2019-12-07 22:08:18,919 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 22:08:18,919 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 22:08:18,919 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 20 [2019-12-07 22:08:18,919 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551420780] [2019-12-07 22:08:18,920 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-12-07 22:08:18,920 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 22:08:18,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-12-07 22:08:18,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=934, Unknown=0, NotChecked=0, Total=1056 [2019-12-07 22:08:18,921 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand 22 states. [2019-12-07 22:08:19,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 22:08:19,272 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2019-12-07 22:08:19,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 22:08:19,272 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 18 [2019-12-07 22:08:19,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 22:08:19,273 INFO L225 Difference]: With dead ends: 32 [2019-12-07 22:08:19,273 INFO L226 Difference]: Without dead ends: 32 [2019-12-07 22:08:19,273 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 382 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=243, Invalid=1479, Unknown=0, NotChecked=0, Total=1722 [2019-12-07 22:08:19,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-12-07 22:08:19,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 26. [2019-12-07 22:08:19,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-12-07 22:08:19,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2019-12-07 22:08:19,274 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 18 [2019-12-07 22:08:19,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 22:08:19,274 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2019-12-07 22:08:19,274 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-12-07 22:08:19,274 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2019-12-07 22:08:19,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 22:08:19,275 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 22:08:19,275 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 22:08:19,475 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 22:08:19,476 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 22:08:19,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 22:08:19,477 INFO L82 PathProgramCache]: Analyzing trace with hash 1968170, now seen corresponding path program 1 times [2019-12-07 22:08:19,477 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 22:08:19,477 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450787545] [2019-12-07 22:08:19,477 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 22:08:19,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 22:08:19,570 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 22:08:19,570 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450787545] [2019-12-07 22:08:19,570 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2038143261] [2019-12-07 22:08:19,570 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_713257e4-5a52-4d95-afa7-c20a834f2096/bin/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 22:08:19,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 22:08:19,604 INFO L264 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 32 conjunts are in the unsatisfiable core [2019-12-07 22:08:19,605 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 22:08:19,640 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 22:08:19,640 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 22:08:19,725 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 22:08:19,725 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [197445647] [2019-12-07 22:08:19,726 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2019-12-07 22:08:19,726 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 22:08:19,726 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 22:08:19,726 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 22:08:19,726 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 22:08:19,908 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 22:08:19,920 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 22:08:20,089 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 22:08:20,126 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 22:08:20,516 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 22:08:20,834 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 62 [2019-12-07 22:08:21,181 WARN L192 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 64 [2019-12-07 22:08:21,511 WARN L192 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 73 [2019-12-07 22:08:21,801 WARN L192 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 60 [2019-12-07 22:08:22,121 WARN L192 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 72 [2019-12-07 22:08:22,250 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2019-12-07 22:08:22,250 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [8, 8, 8] total 30 [2019-12-07 22:08:22,250 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699501397] [2019-12-07 22:08:22,251 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-07 22:08:22,251 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 22:08:22,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-07 22:08:22,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=829, Unknown=0, NotChecked=0, Total=930 [2019-12-07 22:08:22,252 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand 14 states. [2019-12-07 22:08:22,698 WARN L192 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 65 [2019-12-07 22:08:22,947 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2019-12-07 22:08:23,118 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 101 [2019-12-07 22:08:23,674 WARN L192 SmtUtils]: Spent 497.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95 [2019-12-07 22:08:24,214 WARN L192 SmtUtils]: Spent 453.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 104 [2019-12-07 22:08:24,449 WARN L192 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-12-07 22:08:24,793 WARN L192 SmtUtils]: Spent 268.00 ms on a formula simplification that was a NOOP. DAG size: 101 [2019-12-07 22:08:24,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 22:08:24,833 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2019-12-07 22:08:24,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-07 22:08:24,834 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 19 [2019-12-07 22:08:24,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 22:08:24,835 INFO L225 Difference]: With dead ends: 25 [2019-12-07 22:08:24,835 INFO L226 Difference]: Without dead ends: 23 [2019-12-07 22:08:24,837 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 31 SyntacticMatches, 3 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 284 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=164, Invalid=1242, Unknown=0, NotChecked=0, Total=1406 [2019-12-07 22:08:24,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-12-07 22:08:24,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-12-07 22:08:24,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-12-07 22:08:24,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2019-12-07 22:08:24,840 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 19 [2019-12-07 22:08:24,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 22:08:24,841 INFO L462 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2019-12-07 22:08:24,841 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-07 22:08:24,841 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2019-12-07 22:08:24,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 22:08:24,842 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 22:08:24,842 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 22:08:25,043 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 22:08:25,044 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 22:08:25,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 22:08:25,045 INFO L82 PathProgramCache]: Analyzing trace with hash 61045698, now seen corresponding path program 2 times [2019-12-07 22:08:25,045 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 22:08:25,046 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537920860] [2019-12-07 22:08:25,046 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 22:08:25,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 22:08:25,257 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 22:08:25,257 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537920860] [2019-12-07 22:08:25,258 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1381634789] [2019-12-07 22:08:25,258 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_713257e4-5a52-4d95-afa7-c20a834f2096/bin/utaipan/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 22:08:25,298 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-12-07 22:08:25,298 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 22:08:25,299 INFO L264 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 50 conjunts are in the unsatisfiable core [2019-12-07 22:08:25,301 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 22:08:25,626 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 22:08:25,626 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 22:08:25,785 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: incompatible size [2019-12-07 22:08:25,785 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1591760974] [2019-12-07 22:08:25,785 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-12-07 22:08:25,786 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 22:08:25,786 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 22:08:25,786 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 22:08:25,786 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 22:08:25,791 FATAL L? ?]: Ignoring exception! java.lang.IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@2c1e9626 at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.managedscript.ManagedScript.lock(ManagedScript.java:83) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker.assertLhs(IncrementalPlicationChecker.java:74) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker.checkPlication(IncrementalPlicationChecker.java:106) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ArrayIndexEqualityManager.(ArrayIndexEqualityManager.java:91) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.computeCostEstimation(ElimStorePlain.java:555) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:428) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:234) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.quantifier(PartialQuantifierElimination.java:146) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools$EliminatingTermDomainOperationProvider.newQuantifier(SymbolicTools.java:279) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools$EliminatingTermDomainOperationProvider.projectExistentially(SymbolicTools.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.TermDomainOperationProvider.projectExistentially(TermDomainOperationProvider.java:1) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateTransformer.strongestPostcondition(PredicateTransformer.java:131) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools.post(SymbolicTools.java:116) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretInternal(DagInterpreter.java:227) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTransAndStoreLoiPred(DagInterpreter.java:209) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTrans(DagInterpreter.java:187) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:165) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:123) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:136) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:297) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:180) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-12-07 22:08:25,792 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-12-07 22:08:25,792 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-12-07 22:08:25,792 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427085197] [2019-12-07 22:08:25,792 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 22:08:25,792 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 22:08:25,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 22:08:25,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=625, Unknown=0, NotChecked=0, Total=702 [2019-12-07 22:08:25,793 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand 12 states. [2019-12-07 22:08:25,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-12-07 22:08:25,993 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 22:08:25,994 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@2c1e9626 at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.managedscript.ManagedScript.lock(ManagedScript.java:83) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.assertCodeBlock(IncrementalHoareTripleChecker.java:354) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.prepareAssertionStackAndAddTransition(IncrementalHoareTripleChecker.java:202) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.checkInternal(IncrementalHoareTripleChecker.java:127) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ProtectiveHoareTripleChecker.checkInternal(ProtectiveHoareTripleChecker.java:60) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.EfficientHoareTripleChecker.checkInternal(EfficientHoareTripleChecker.java:62) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.CachingHoareTripleChecker.checkInternal(CachingHoareTripleChecker.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$InternalSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:359) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.addOtherSuccessors(DeterministicInterpolantAutomaton.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1066) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:968) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:188) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:698) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:627) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:454) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-12-07 22:08:25,996 INFO L168 Benchmark]: Toolchain (without parser) took 26505.84 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 394.8 MB). Free memory was 939.3 MB in the beginning and 1.4 GB in the end (delta: -419.3 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 22:08:25,996 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 960.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 22:08:25,996 INFO L168 Benchmark]: CACSL2BoogieTranslator took 302.14 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 96.5 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -141.2 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. [2019-12-07 22:08:25,996 INFO L168 Benchmark]: Boogie Procedure Inliner took 30.74 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 22:08:25,996 INFO L168 Benchmark]: Boogie Preprocessor took 19.54 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 22:08:25,997 INFO L168 Benchmark]: RCFGBuilder took 325.55 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: 39.9 MB). Peak memory consumption was 39.9 MB. Max. memory is 11.5 GB. [2019-12-07 22:08:25,997 INFO L168 Benchmark]: TraceAbstraction took 25825.13 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 298.3 MB). Free memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: -323.3 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 22:08:25,998 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 960.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 302.14 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 96.5 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -141.2 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 30.74 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.54 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 325.55 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: 39.9 MB). Peak memory consumption was 39.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 25825.13 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 298.3 MB). Free memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: -323.3 MB). There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@2c1e9626 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@2c1e9626: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.managedscript.ManagedScript.lock(ManagedScript.java:83) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.25-f470102 [2019-12-07 22:08:27,385 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 22:08:27,386 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 22:08:27,395 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 22:08:27,395 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 22:08:27,396 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 22:08:27,397 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 22:08:27,399 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 22:08:27,400 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 22:08:27,401 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 22:08:27,402 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 22:08:27,403 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 22:08:27,404 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 22:08:27,404 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 22:08:27,405 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 22:08:27,406 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 22:08:27,407 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 22:08:27,408 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 22:08:27,410 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 22:08:27,412 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 22:08:27,413 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 22:08:27,414 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 22:08:27,415 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 22:08:27,416 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 22:08:27,419 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 22:08:27,419 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 22:08:27,419 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 22:08:27,420 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 22:08:27,420 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 22:08:27,421 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 22:08:27,421 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 22:08:27,422 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 22:08:27,422 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 22:08:27,423 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 22:08:27,423 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 22:08:27,424 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 22:08:27,424 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 22:08:27,424 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 22:08:27,425 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 22:08:27,425 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 22:08:27,426 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 22:08:27,427 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_713257e4-5a52-4d95-afa7-c20a834f2096/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2019-12-07 22:08:27,439 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 22:08:27,439 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 22:08:27,440 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 22:08:27,440 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 22:08:27,440 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 22:08:27,440 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 22:08:27,440 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 22:08:27,440 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 22:08:27,441 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 22:08:27,441 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 22:08:27,441 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 22:08:27,441 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 22:08:27,442 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 22:08:27,442 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 22:08:27,442 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 22:08:27,442 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 22:08:27,442 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 22:08:27,442 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-12-07 22:08:27,443 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-12-07 22:08:27,443 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-12-07 22:08:27,443 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 22:08:27,443 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 22:08:27,443 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-12-07 22:08:27,443 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-12-07 22:08:27,443 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 22:08:27,444 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 22:08:27,444 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 22:08:27,444 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 22:08:27,444 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 22:08:27,444 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 22:08:27,444 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 22:08:27,444 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 22:08:27,445 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 22:08:27,445 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2019-12-07 22:08:27,445 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-12-07 22:08:27,445 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 22:08:27,445 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 22:08:27,445 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_713257e4-5a52-4d95-afa7-c20a834f2096/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 -> f68b319d77fa756392ca29e618a1e0accd9b6c9e [2019-12-07 22:08:27,632 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 22:08:27,642 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 22:08:27,645 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 22:08:27,646 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 22:08:27,646 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 22:08:27,647 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_713257e4-5a52-4d95-afa7-c20a834f2096/bin/utaipan/../../sv-benchmarks/c/array-memsafety/openbsd_cstrcmp-alloca-1.i [2019-12-07 22:08:27,690 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_713257e4-5a52-4d95-afa7-c20a834f2096/bin/utaipan/data/8cf4235f8/3ce495b5f6cf4e86bedf392911d982a9/FLAG551ec8d50 [2019-12-07 22:08:28,109 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 22:08:28,110 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_713257e4-5a52-4d95-afa7-c20a834f2096/sv-benchmarks/c/array-memsafety/openbsd_cstrcmp-alloca-1.i [2019-12-07 22:08:28,118 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_713257e4-5a52-4d95-afa7-c20a834f2096/bin/utaipan/data/8cf4235f8/3ce495b5f6cf4e86bedf392911d982a9/FLAG551ec8d50 [2019-12-07 22:08:28,457 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_713257e4-5a52-4d95-afa7-c20a834f2096/bin/utaipan/data/8cf4235f8/3ce495b5f6cf4e86bedf392911d982a9 [2019-12-07 22:08:28,459 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 22:08:28,460 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 22:08:28,461 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 22:08:28,461 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 22:08:28,463 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 22:08:28,464 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 10:08:28" (1/1) ... [2019-12-07 22:08:28,466 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3bf51b27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:08:28, skipping insertion in model container [2019-12-07 22:08:28,466 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 10:08:28" (1/1) ... [2019-12-07 22:08:28,472 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 22:08:28,499 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 22:08:28,721 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 22:08:28,730 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 22:08:28,761 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 22:08:28,799 INFO L208 MainTranslator]: Completed translation [2019-12-07 22:08:28,799 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:08:28 WrapperNode [2019-12-07 22:08:28,799 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 22:08:28,800 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 22:08:28,800 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 22:08:28,800 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 22:08:28,805 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:08:28" (1/1) ... [2019-12-07 22:08:28,818 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:08:28" (1/1) ... [2019-12-07 22:08:28,835 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 22:08:28,835 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 22:08:28,835 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 22:08:28,835 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 22:08:28,841 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:08:28" (1/1) ... [2019-12-07 22:08:28,841 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:08:28" (1/1) ... [2019-12-07 22:08:28,844 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:08:28" (1/1) ... [2019-12-07 22:08:28,844 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:08:28" (1/1) ... [2019-12-07 22:08:28,850 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:08:28" (1/1) ... [2019-12-07 22:08:28,853 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:08:28" (1/1) ... [2019-12-07 22:08:28,855 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:08:28" (1/1) ... [2019-12-07 22:08:28,857 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 22:08:28,857 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 22:08:28,857 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 22:08:28,858 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 22:08:28,858 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:08:28" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_713257e4-5a52-4d95-afa7-c20a834f2096/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 22:08:28,898 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2019-12-07 22:08:28,898 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 22:08:28,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2019-12-07 22:08:28,898 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 22:08:28,898 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 22:08:28,898 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 22:08:29,183 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 22:08:29,183 INFO L287 CfgBuilder]: Removed 9 assume(true) statements. [2019-12-07 22:08:29,184 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:08:29 BoogieIcfgContainer [2019-12-07 22:08:29,184 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 22:08:29,184 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 22:08:29,184 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 22:08:29,186 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 22:08:29,186 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 10:08:28" (1/3) ... [2019-12-07 22:08:29,187 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fe1878c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 10:08:29, skipping insertion in model container [2019-12-07 22:08:29,187 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:08:28" (2/3) ... [2019-12-07 22:08:29,187 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fe1878c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 10:08:29, skipping insertion in model container [2019-12-07 22:08:29,187 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:08:29" (3/3) ... [2019-12-07 22:08:29,188 INFO L109 eAbstractionObserver]: Analyzing ICFG openbsd_cstrcmp-alloca-1.i [2019-12-07 22:08:29,194 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 22:08:29,198 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 19 error locations. [2019-12-07 22:08:29,206 INFO L249 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2019-12-07 22:08:29,218 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 22:08:29,218 INFO L374 AbstractCegarLoop]: Hoare is false [2019-12-07 22:08:29,218 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 22:08:29,218 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 22:08:29,218 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 22:08:29,218 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 22:08:29,218 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 22:08:29,218 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 22:08:29,228 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states. [2019-12-07 22:08:29,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-07 22:08:29,233 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 22:08:29,233 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-07 22:08:29,234 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 22:08:29,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 22:08:29,237 INFO L82 PathProgramCache]: Analyzing trace with hash 1805029096, now seen corresponding path program 1 times [2019-12-07 22:08:29,245 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 22:08:29,245 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1173707373] [2019-12-07 22:08:29,245 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_713257e4-5a52-4d95-afa7-c20a834f2096/bin/utaipan/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2019-12-07 22:08:29,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 22:08:29,294 INFO L264 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 22:08:29,298 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 22:08:29,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 22:08:29,331 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 22:08:29,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 22:08:29,359 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1173707373] [2019-12-07 22:08:29,360 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 22:08:29,360 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 22:08:29,361 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686037194] [2019-12-07 22:08:29,365 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 22:08:29,365 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 22:08:29,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 22:08:29,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 22:08:29,379 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 6 states. [2019-12-07 22:08:29,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 22:08:29,467 INFO L93 Difference]: Finished difference Result 92 states and 100 transitions. [2019-12-07 22:08:29,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 22:08:29,469 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2019-12-07 22:08:29,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 22:08:29,476 INFO L225 Difference]: With dead ends: 92 [2019-12-07 22:08:29,476 INFO L226 Difference]: Without dead ends: 88 [2019-12-07 22:08:29,477 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 22:08:29,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-12-07 22:08:29,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 51. [2019-12-07 22:08:29,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-12-07 22:08:29,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2019-12-07 22:08:29,502 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 57 transitions. Word has length 7 [2019-12-07 22:08:29,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 22:08:29,502 INFO L462 AbstractCegarLoop]: Abstraction has 51 states and 57 transitions. [2019-12-07 22:08:29,502 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 22:08:29,502 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2019-12-07 22:08:29,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-07 22:08:29,503 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 22:08:29,503 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-07 22:08:29,703 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-12-07 22:08:29,704 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 22:08:29,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 22:08:29,706 INFO L82 PathProgramCache]: Analyzing trace with hash 1806876138, now seen corresponding path program 1 times [2019-12-07 22:08:29,707 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 22:08:29,707 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [411885231] [2019-12-07 22:08:29,708 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_713257e4-5a52-4d95-afa7-c20a834f2096/bin/utaipan/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2019-12-07 22:08:29,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 22:08:29,793 INFO L264 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 22:08:29,794 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 22:08:29,842 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-12-07 22:08:29,843 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 19 treesize of output 18 [2019-12-07 22:08:29,843 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 22:08:29,849 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 22:08:29,850 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 22:08:29,850 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:15 [2019-12-07 22:08:29,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 22:08:29,865 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 22:08:29,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 22:08:29,878 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [411885231] [2019-12-07 22:08:29,878 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 22:08:29,878 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-12-07 22:08:29,878 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271408504] [2019-12-07 22:08:29,879 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 22:08:29,879 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 22:08:29,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 22:08:29,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 22:08:29,880 INFO L87 Difference]: Start difference. First operand 51 states and 57 transitions. Second operand 4 states. [2019-12-07 22:08:29,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 22:08:29,952 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2019-12-07 22:08:29,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 22:08:29,953 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-12-07 22:08:29,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 22:08:29,954 INFO L225 Difference]: With dead ends: 49 [2019-12-07 22:08:29,954 INFO L226 Difference]: Without dead ends: 49 [2019-12-07 22:08:29,954 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 22:08:29,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-12-07 22:08:29,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-12-07 22:08:29,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-12-07 22:08:29,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 55 transitions. [2019-12-07 22:08:29,958 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 55 transitions. Word has length 7 [2019-12-07 22:08:29,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 22:08:29,958 INFO L462 AbstractCegarLoop]: Abstraction has 49 states and 55 transitions. [2019-12-07 22:08:29,958 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 22:08:29,959 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2019-12-07 22:08:29,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-07 22:08:29,959 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 22:08:29,959 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-07 22:08:30,159 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-12-07 22:08:30,160 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 22:08:30,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 22:08:30,161 INFO L82 PathProgramCache]: Analyzing trace with hash 1806876139, now seen corresponding path program 1 times [2019-12-07 22:08:30,162 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 22:08:30,162 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1032318045] [2019-12-07 22:08:30,163 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_713257e4-5a52-4d95-afa7-c20a834f2096/bin/utaipan/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2019-12-07 22:08:30,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 22:08:30,231 INFO L264 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-07 22:08:30,231 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 22:08:30,243 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_24|], 1=[|v_#valid_33|]} [2019-12-07 22:08:30,249 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 22:08:30,251 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-12-07 22:08:30,252 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 22:08:30,270 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 22:08:30,278 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-12-07 22:08:30,279 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 22:08:30,297 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 22:08:30,299 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 22:08:30,299 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:28, output treesize:13 [2019-12-07 22:08:30,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 22:08:30,316 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 22:08:30,430 INFO L430 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2019-12-07 22:08:30,435 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-12-07 22:08:30,435 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 22:08:30,442 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 22:08:30,444 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 22:08:30,444 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 22:08:30,451 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 22:08:30,453 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 22:08:30,453 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:21, output treesize:3 [2019-12-07 22:08:30,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 22:08:30,469 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1032318045] [2019-12-07 22:08:30,469 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 22:08:30,469 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2019-12-07 22:08:30,469 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963157061] [2019-12-07 22:08:30,470 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 22:08:30,470 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 22:08:30,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 22:08:30,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 22:08:30,470 INFO L87 Difference]: Start difference. First operand 49 states and 55 transitions. Second operand 6 states. [2019-12-07 22:08:30,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 22:08:30,902 INFO L93 Difference]: Finished difference Result 89 states and 98 transitions. [2019-12-07 22:08:30,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 22:08:30,903 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2019-12-07 22:08:30,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 22:08:30,904 INFO L225 Difference]: With dead ends: 89 [2019-12-07 22:08:30,904 INFO L226 Difference]: Without dead ends: 89 [2019-12-07 22:08:30,905 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-12-07 22:08:30,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-12-07 22:08:30,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 51. [2019-12-07 22:08:30,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-12-07 22:08:30,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 58 transitions. [2019-12-07 22:08:30,909 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 58 transitions. Word has length 7 [2019-12-07 22:08:30,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 22:08:30,909 INFO L462 AbstractCegarLoop]: Abstraction has 51 states and 58 transitions. [2019-12-07 22:08:30,909 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 22:08:30,909 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2019-12-07 22:08:30,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 22:08:30,910 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 22:08:30,910 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 22:08:31,110 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-12-07 22:08:31,112 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 22:08:31,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 22:08:31,112 INFO L82 PathProgramCache]: Analyzing trace with hash -533876960, now seen corresponding path program 1 times [2019-12-07 22:08:31,113 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 22:08:31,114 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1262026006] [2019-12-07 22:08:31,114 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_713257e4-5a52-4d95-afa7-c20a834f2096/bin/utaipan/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2019-12-07 22:08:31,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 22:08:31,176 INFO L264 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 22:08:31,177 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 22:08:31,183 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_26|], 1=[|v_#valid_35|]} [2019-12-07 22:08:31,187 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 22:08:31,188 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-12-07 22:08:31,188 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 22:08:31,199 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 22:08:31,204 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-12-07 22:08:31,204 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 22:08:31,216 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 22:08:31,216 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 22:08:31,217 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:24, output treesize:12 [2019-12-07 22:08:31,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 22:08:31,225 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 22:08:31,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 22:08:31,304 INFO L430 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2019-12-07 22:08:31,312 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 22:08:31,313 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 22:08:31,315 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 22:08:31,315 INFO L502 ElimStorePlain]: Eliminatee |#length| vanished before elimination [2019-12-07 22:08:31,316 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 22:08:31,316 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:27, output treesize:5 [2019-12-07 22:08:31,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 22:08:31,335 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1262026006] [2019-12-07 22:08:31,336 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 22:08:31,336 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2019-12-07 22:08:31,336 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33490970] [2019-12-07 22:08:31,336 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 22:08:31,336 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 22:08:31,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 22:08:31,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 22:08:31,337 INFO L87 Difference]: Start difference. First operand 51 states and 58 transitions. Second operand 6 states. [2019-12-07 22:08:31,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 22:08:31,744 INFO L93 Difference]: Finished difference Result 85 states and 94 transitions. [2019-12-07 22:08:31,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 22:08:31,745 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2019-12-07 22:08:31,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 22:08:31,746 INFO L225 Difference]: With dead ends: 85 [2019-12-07 22:08:31,746 INFO L226 Difference]: Without dead ends: 85 [2019-12-07 22:08:31,747 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 22:08:31,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-12-07 22:08:31,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 50. [2019-12-07 22:08:31,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-12-07 22:08:31,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 57 transitions. [2019-12-07 22:08:31,752 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 57 transitions. Word has length 9 [2019-12-07 22:08:31,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 22:08:31,752 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 57 transitions. [2019-12-07 22:08:31,752 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 22:08:31,753 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2019-12-07 22:08:31,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 22:08:31,753 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 22:08:31,753 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 22:08:31,954 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-12-07 22:08:31,955 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 22:08:31,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 22:08:31,957 INFO L82 PathProgramCache]: Analyzing trace with hash -533876908, now seen corresponding path program 1 times [2019-12-07 22:08:31,958 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 22:08:31,958 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1728172564] [2019-12-07 22:08:31,959 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_713257e4-5a52-4d95-afa7-c20a834f2096/bin/utaipan/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2019-12-07 22:08:32,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 22:08:32,029 INFO L264 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 22:08:32,030 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 22:08:32,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 22:08:32,038 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 22:08:32,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 22:08:32,060 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1728172564] [2019-12-07 22:08:32,060 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 22:08:32,060 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 22:08:32,061 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257737236] [2019-12-07 22:08:32,061 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 22:08:32,061 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 22:08:32,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 22:08:32,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 22:08:32,061 INFO L87 Difference]: Start difference. First operand 50 states and 57 transitions. Second operand 6 states. [2019-12-07 22:08:32,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 22:08:32,117 INFO L93 Difference]: Finished difference Result 90 states and 100 transitions. [2019-12-07 22:08:32,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 22:08:32,117 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2019-12-07 22:08:32,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 22:08:32,118 INFO L225 Difference]: With dead ends: 90 [2019-12-07 22:08:32,119 INFO L226 Difference]: Without dead ends: 90 [2019-12-07 22:08:32,119 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 22:08:32,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-12-07 22:08:32,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 61. [2019-12-07 22:08:32,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-12-07 22:08:32,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 71 transitions. [2019-12-07 22:08:32,124 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 71 transitions. Word has length 9 [2019-12-07 22:08:32,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 22:08:32,125 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 71 transitions. [2019-12-07 22:08:32,125 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 22:08:32,125 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 71 transitions. [2019-12-07 22:08:32,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 22:08:32,125 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 22:08:32,126 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 22:08:32,326 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-12-07 22:08:32,327 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 22:08:32,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 22:08:32,328 INFO L82 PathProgramCache]: Analyzing trace with hash -476618606, now seen corresponding path program 1 times [2019-12-07 22:08:32,329 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 22:08:32,330 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1232049760] [2019-12-07 22:08:32,330 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_713257e4-5a52-4d95-afa7-c20a834f2096/bin/utaipan/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2019-12-07 22:08:32,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 22:08:32,402 INFO L264 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 22:08:32,403 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 22:08:32,432 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-12-07 22:08:32,432 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 1 case distinctions, treesize of input 9 treesize of output 11 [2019-12-07 22:08:32,432 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 22:08:32,437 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 22:08:32,437 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 22:08:32,438 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:9, output treesize:11 [2019-12-07 22:08:32,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 22:08:32,445 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 22:08:32,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 22:08:32,449 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1232049760] [2019-12-07 22:08:32,449 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 22:08:32,449 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-12-07 22:08:32,449 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660676802] [2019-12-07 22:08:32,449 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 22:08:32,450 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 22:08:32,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 22:08:32,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 22:08:32,450 INFO L87 Difference]: Start difference. First operand 61 states and 71 transitions. Second operand 3 states. [2019-12-07 22:08:32,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 22:08:32,502 INFO L93 Difference]: Finished difference Result 59 states and 69 transitions. [2019-12-07 22:08:32,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 22:08:32,503 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-07 22:08:32,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 22:08:32,503 INFO L225 Difference]: With dead ends: 59 [2019-12-07 22:08:32,504 INFO L226 Difference]: Without dead ends: 59 [2019-12-07 22:08:32,504 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 22:08:32,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-12-07 22:08:32,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-12-07 22:08:32,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-12-07 22:08:32,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 69 transitions. [2019-12-07 22:08:32,508 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 69 transitions. Word has length 9 [2019-12-07 22:08:32,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 22:08:32,508 INFO L462 AbstractCegarLoop]: Abstraction has 59 states and 69 transitions. [2019-12-07 22:08:32,508 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 22:08:32,508 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 69 transitions. [2019-12-07 22:08:32,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 22:08:32,509 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 22:08:32,509 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 22:08:32,710 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-12-07 22:08:32,711 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 22:08:32,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 22:08:32,711 INFO L82 PathProgramCache]: Analyzing trace with hash -476618605, now seen corresponding path program 1 times [2019-12-07 22:08:32,712 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 22:08:32,712 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1192371863] [2019-12-07 22:08:32,713 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_713257e4-5a52-4d95-afa7-c20a834f2096/bin/utaipan/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2019-12-07 22:08:32,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 22:08:32,778 INFO L264 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 22:08:32,779 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 22:08:32,803 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 22:08:32,804 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 1 case distinctions, treesize of input 9 treesize of output 25 [2019-12-07 22:08:32,804 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 22:08:32,834 INFO L614 ElimStorePlain]: treesize reduction 10, result has 68.8 percent of original size [2019-12-07 22:08:32,834 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 22:08:32,835 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:17, output treesize:10 [2019-12-07 22:08:32,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 22:08:32,862 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 22:08:33,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 22:08:33,009 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1192371863] [2019-12-07 22:08:33,010 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 22:08:33,010 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2019-12-07 22:08:33,010 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31150604] [2019-12-07 22:08:33,010 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 22:08:33,010 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 22:08:33,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 22:08:33,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-12-07 22:08:33,011 INFO L87 Difference]: Start difference. First operand 59 states and 69 transitions. Second operand 8 states. [2019-12-07 22:08:33,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 22:08:33,358 INFO L93 Difference]: Finished difference Result 90 states and 102 transitions. [2019-12-07 22:08:33,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 22:08:33,359 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2019-12-07 22:08:33,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 22:08:33,360 INFO L225 Difference]: With dead ends: 90 [2019-12-07 22:08:33,360 INFO L226 Difference]: Without dead ends: 90 [2019-12-07 22:08:33,360 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2019-12-07 22:08:33,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-12-07 22:08:33,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 61. [2019-12-07 22:08:33,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-12-07 22:08:33,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 72 transitions. [2019-12-07 22:08:33,364 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 72 transitions. Word has length 9 [2019-12-07 22:08:33,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 22:08:33,364 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 72 transitions. [2019-12-07 22:08:33,364 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 22:08:33,364 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 72 transitions. [2019-12-07 22:08:33,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-07 22:08:33,365 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 22:08:33,365 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 22:08:33,566 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2019-12-07 22:08:33,567 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 22:08:33,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 22:08:33,568 INFO L82 PathProgramCache]: Analyzing trace with hash 629683418, now seen corresponding path program 1 times [2019-12-07 22:08:33,569 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 22:08:33,569 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1532167536] [2019-12-07 22:08:33,570 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_713257e4-5a52-4d95-afa7-c20a834f2096/bin/utaipan/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2019-12-07 22:08:33,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 22:08:33,639 INFO L264 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 22:08:33,639 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 22:08:33,670 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 22:08:33,670 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 1 case distinctions, treesize of input 9 treesize of output 25 [2019-12-07 22:08:33,671 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 22:08:33,692 INFO L614 ElimStorePlain]: treesize reduction 10, result has 67.7 percent of original size [2019-12-07 22:08:33,693 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 22:08:33,693 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:16, output treesize:12 [2019-12-07 22:08:33,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 22:08:33,701 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 22:08:33,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 22:08:33,793 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1532167536] [2019-12-07 22:08:33,793 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 22:08:33,794 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2019-12-07 22:08:33,794 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602464134] [2019-12-07 22:08:33,794 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 22:08:33,794 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 22:08:33,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 22:08:33,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 22:08:33,794 INFO L87 Difference]: Start difference. First operand 61 states and 72 transitions. Second operand 6 states. [2019-12-07 22:08:34,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 22:08:34,011 INFO L93 Difference]: Finished difference Result 87 states and 98 transitions. [2019-12-07 22:08:34,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 22:08:34,013 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2019-12-07 22:08:34,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 22:08:34,013 INFO L225 Difference]: With dead ends: 87 [2019-12-07 22:08:34,013 INFO L226 Difference]: Without dead ends: 87 [2019-12-07 22:08:34,014 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 22:08:34,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-12-07 22:08:34,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 60. [2019-12-07 22:08:34,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-12-07 22:08:34,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 71 transitions. [2019-12-07 22:08:34,016 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 71 transitions. Word has length 10 [2019-12-07 22:08:34,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 22:08:34,017 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 71 transitions. [2019-12-07 22:08:34,017 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 22:08:34,017 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 71 transitions. [2019-12-07 22:08:34,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 22:08:34,017 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 22:08:34,017 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 22:08:34,218 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2019-12-07 22:08:34,219 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 22:08:34,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 22:08:34,219 INFO L82 PathProgramCache]: Analyzing trace with hash -1226025170, now seen corresponding path program 1 times [2019-12-07 22:08:34,220 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 22:08:34,220 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [488290197] [2019-12-07 22:08:34,220 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_713257e4-5a52-4d95-afa7-c20a834f2096/bin/utaipan/mathsat Starting monitored process 10 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with mathsat -unsat_core_generation=3 [2019-12-07 22:08:34,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 22:08:34,297 INFO L264 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 11 conjunts are in the unsatisfiable core [2019-12-07 22:08:34,298 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 22:08:34,312 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_34|], 1=[|v_#valid_42|]} [2019-12-07 22:08:34,322 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 22:08:34,323 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-12-07 22:08:34,323 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 22:08:34,355 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 22:08:34,365 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-12-07 22:08:34,366 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 22:08:34,402 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 22:08:34,403 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 22:08:34,403 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:16 [2019-12-07 22:08:34,636 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 22:08:34,637 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 22:08:35,067 INFO L430 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2019-12-07 22:08:35,070 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 22:08:35,071 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 22:08:35,072 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 22:08:35,072 INFO L502 ElimStorePlain]: Eliminatee |#length| vanished before elimination [2019-12-07 22:08:35,072 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 22:08:35,072 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:33, output treesize:1 [2019-12-07 22:08:35,073 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 22:08:35,073 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [488290197] [2019-12-07 22:08:35,073 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2136638488] [2019-12-07 22:08:35,073 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_713257e4-5a52-4d95-afa7-c20a834f2096/bin/utaipan/cvc4 Starting monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 22:08:35,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 22:08:35,132 INFO L264 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 11 conjunts are in the unsatisfiable core [2019-12-07 22:08:35,133 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 22:08:35,137 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_36|], 1=[|v_#valid_44|]} [2019-12-07 22:08:35,142 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 22:08:35,143 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-12-07 22:08:35,144 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 22:08:35,159 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 22:08:35,165 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-12-07 22:08:35,166 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 22:08:35,186 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 22:08:35,186 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 22:08:35,186 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:16 [2019-12-07 22:08:35,312 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 22:08:35,312 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 22:08:35,729 INFO L430 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2019-12-07 22:08:35,732 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 22:08:35,733 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 22:08:35,734 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 22:08:35,734 INFO L502 ElimStorePlain]: Eliminatee |#length| vanished before elimination [2019-12-07 22:08:35,734 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 22:08:35,734 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:39, output treesize:1 [2019-12-07 22:08:35,735 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 22:08:35,736 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1344449533] [2019-12-07 22:08:35,736 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_713257e4-5a52-4d95-afa7-c20a834f2096/bin/utaipan/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 22:08:35,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 22:08:35,804 INFO L264 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 22:08:35,804 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 22:08:35,809 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_38|], 1=[|v_#valid_46|]} [2019-12-07 22:08:35,813 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 22:08:35,814 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-12-07 22:08:35,814 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 22:08:35,827 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 22:08:35,832 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-12-07 22:08:35,833 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 22:08:35,845 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 22:08:35,846 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 22:08:35,846 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:24, output treesize:12 [2019-12-07 22:08:36,059 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 22:08:36,059 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 22:08:36,067 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 22:08:36,067 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2019-12-07 22:08:36,068 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5, 5, 4, 5] total 18 [2019-12-07 22:08:36,068 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043615114] [2019-12-07 22:08:36,068 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-07 22:08:36,068 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 22:08:36,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-07 22:08:36,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=240, Unknown=0, NotChecked=0, Total=342 [2019-12-07 22:08:36,069 INFO L87 Difference]: Start difference. First operand 60 states and 71 transitions. Second operand 19 states. [2019-12-07 22:08:36,756 WARN L192 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 28 [2019-12-07 22:08:37,028 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 17 [2019-12-07 22:08:37,582 WARN L192 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 24 [2019-12-07 22:08:38,153 WARN L192 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 24 [2019-12-07 22:08:38,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 22:08:38,749 INFO L93 Difference]: Finished difference Result 228 states and 257 transitions. [2019-12-07 22:08:38,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 22:08:38,751 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 11 [2019-12-07 22:08:38,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 22:08:38,752 INFO L225 Difference]: With dead ends: 228 [2019-12-07 22:08:38,752 INFO L226 Difference]: Without dead ends: 228 [2019-12-07 22:08:38,752 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=179, Invalid=421, Unknown=0, NotChecked=0, Total=600 [2019-12-07 22:08:38,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2019-12-07 22:08:38,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 84. [2019-12-07 22:08:38,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-12-07 22:08:38,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 101 transitions. [2019-12-07 22:08:38,756 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 101 transitions. Word has length 11 [2019-12-07 22:08:38,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 22:08:38,756 INFO L462 AbstractCegarLoop]: Abstraction has 84 states and 101 transitions. [2019-12-07 22:08:38,756 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-07 22:08:38,756 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 101 transitions. [2019-12-07 22:08:38,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-12-07 22:08:38,757 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 22:08:38,757 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 22:08:39,358 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,10 mathsat -unsat_core_generation=3,11 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 22:08:39,360 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 22:08:39,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 22:08:39,361 INFO L82 PathProgramCache]: Analyzing trace with hash -464624129, now seen corresponding path program 1 times [2019-12-07 22:08:39,361 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 22:08:39,362 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [63901628] [2019-12-07 22:08:39,362 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_713257e4-5a52-4d95-afa7-c20a834f2096/bin/utaipan/mathsat Starting monitored process 13 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with mathsat -unsat_core_generation=3 [2019-12-07 22:08:39,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 22:08:39,432 INFO L264 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-07 22:08:39,433 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 22:08:39,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 22:08:39,479 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 22:08:39,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 22:08:39,567 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 22:08:39,568 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 22:08:39,579 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2019-12-07 22:08:39,579 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 22:08:39,605 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 22:08:39,606 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-12-07 22:08:39,606 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:25 [2019-12-07 22:08:39,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 22:08:39,724 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [63901628] [2019-12-07 22:08:39,724 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 22:08:39,724 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2019-12-07 22:08:39,724 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966860729] [2019-12-07 22:08:39,724 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 22:08:39,724 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 22:08:39,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 22:08:39,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-12-07 22:08:39,725 INFO L87 Difference]: Start difference. First operand 84 states and 101 transitions. Second operand 10 states. [2019-12-07 22:08:40,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 22:08:40,355 INFO L93 Difference]: Finished difference Result 158 states and 176 transitions. [2019-12-07 22:08:40,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 22:08:40,356 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 12 [2019-12-07 22:08:40,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 22:08:40,358 INFO L225 Difference]: With dead ends: 158 [2019-12-07 22:08:40,358 INFO L226 Difference]: Without dead ends: 158 [2019-12-07 22:08:40,358 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2019-12-07 22:08:40,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-12-07 22:08:40,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 84. [2019-12-07 22:08:40,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-12-07 22:08:40,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 102 transitions. [2019-12-07 22:08:40,362 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 102 transitions. Word has length 12 [2019-12-07 22:08:40,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 22:08:40,362 INFO L462 AbstractCegarLoop]: Abstraction has 84 states and 102 transitions. [2019-12-07 22:08:40,362 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 22:08:40,362 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 102 transitions. [2019-12-07 22:08:40,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-12-07 22:08:40,363 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 22:08:40,363 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 22:08:40,564 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 mathsat -unsat_core_generation=3 [2019-12-07 22:08:40,564 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 22:08:40,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 22:08:40,565 INFO L82 PathProgramCache]: Analyzing trace with hash -464624130, now seen corresponding path program 1 times [2019-12-07 22:08:40,566 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 22:08:40,566 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1510657726] [2019-12-07 22:08:40,566 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_713257e4-5a52-4d95-afa7-c20a834f2096/bin/utaipan/mathsat Starting monitored process 14 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with mathsat -unsat_core_generation=3 [2019-12-07 22:08:40,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 22:08:40,609 INFO L264 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 22:08:40,610 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 22:08:40,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 22:08:40,619 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 22:08:40,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 22:08:40,626 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1510657726] [2019-12-07 22:08:40,626 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 22:08:40,626 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-12-07 22:08:40,626 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642641542] [2019-12-07 22:08:40,626 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 22:08:40,627 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 22:08:40,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 22:08:40,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 22:08:40,627 INFO L87 Difference]: Start difference. First operand 84 states and 102 transitions. Second operand 4 states. [2019-12-07 22:08:40,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 22:08:40,713 INFO L93 Difference]: Finished difference Result 82 states and 99 transitions. [2019-12-07 22:08:40,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 22:08:40,714 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-12-07 22:08:40,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 22:08:40,715 INFO L225 Difference]: With dead ends: 82 [2019-12-07 22:08:40,715 INFO L226 Difference]: Without dead ends: 82 [2019-12-07 22:08:40,715 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 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 22:08:40,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-12-07 22:08:40,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2019-12-07 22:08:40,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-12-07 22:08:40,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 99 transitions. [2019-12-07 22:08:40,717 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 99 transitions. Word has length 12 [2019-12-07 22:08:40,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 22:08:40,717 INFO L462 AbstractCegarLoop]: Abstraction has 82 states and 99 transitions. [2019-12-07 22:08:40,717 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 22:08:40,717 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 99 transitions. [2019-12-07 22:08:40,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 22:08:40,718 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 22:08:40,718 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 22:08:40,919 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 mathsat -unsat_core_generation=3 [2019-12-07 22:08:40,920 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 22:08:40,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 22:08:40,920 INFO L82 PathProgramCache]: Analyzing trace with hash -1862804906, now seen corresponding path program 1 times [2019-12-07 22:08:40,921 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 22:08:40,921 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1593365640] [2019-12-07 22:08:40,921 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_713257e4-5a52-4d95-afa7-c20a834f2096/bin/utaipan/mathsat Starting monitored process 15 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with mathsat -unsat_core_generation=3 [2019-12-07 22:08:40,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 22:08:40,998 INFO L264 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-07 22:08:40,999 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 22:08:41,020 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 22:08:41,021 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 1 case distinctions, treesize of input 9 treesize of output 25 [2019-12-07 22:08:41,021 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 22:08:41,048 INFO L614 ElimStorePlain]: treesize reduction 10, result has 68.8 percent of original size [2019-12-07 22:08:41,049 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 22:08:41,049 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:17, output treesize:13 [2019-12-07 22:08:41,138 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 22:08:41,139 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 22:08:41,508 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 22:08:41,508 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1593365640] [2019-12-07 22:08:41,508 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [28113254] [2019-12-07 22:08:41,508 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_713257e4-5a52-4d95-afa7-c20a834f2096/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 22:08:41,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 22:08:41,566 INFO L264 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-07 22:08:41,566 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 22:08:41,585 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 22:08:41,585 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 1 case distinctions, treesize of input 9 treesize of output 25 [2019-12-07 22:08:41,585 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 22:08:41,615 INFO L614 ElimStorePlain]: treesize reduction 10, result has 68.8 percent of original size [2019-12-07 22:08:41,616 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 22:08:41,616 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:17, output treesize:13 [2019-12-07 22:08:41,618 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 22:08:41,618 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 22:08:41,625 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 22:08:41,625 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [563176140] [2019-12-07 22:08:41,625 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_713257e4-5a52-4d95-afa7-c20a834f2096/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 22:08:41,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 22:08:41,660 INFO L264 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 22:08:41,660 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 22:08:41,677 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 22:08:41,677 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 1 case distinctions, treesize of input 9 treesize of output 25 [2019-12-07 22:08:41,677 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 22:08:41,705 INFO L614 ElimStorePlain]: treesize reduction 10, result has 68.8 percent of original size [2019-12-07 22:08:41,706 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 22:08:41,706 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:17, output treesize:13 [2019-12-07 22:08:41,789 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 22:08:41,789 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 22:08:42,480 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 22:08:42,481 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2019-12-07 22:08:42,481 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6, 5, 6, 6] total 16 [2019-12-07 22:08:42,481 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650612239] [2019-12-07 22:08:42,481 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-07 22:08:42,482 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 22:08:42,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-07 22:08:42,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2019-12-07 22:08:42,482 INFO L87 Difference]: Start difference. First operand 82 states and 99 transitions. Second operand 17 states. [2019-12-07 22:08:43,349 WARN L192 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 17 [2019-12-07 22:08:43,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 22:08:43,789 INFO L93 Difference]: Finished difference Result 135 states and 155 transitions. [2019-12-07 22:08:43,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 22:08:43,790 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 13 [2019-12-07 22:08:43,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 22:08:43,791 INFO L225 Difference]: With dead ends: 135 [2019-12-07 22:08:43,791 INFO L226 Difference]: Without dead ends: 135 [2019-12-07 22:08:43,792 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 53 SyntacticMatches, 4 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=165, Invalid=341, Unknown=0, NotChecked=0, Total=506 [2019-12-07 22:08:43,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-12-07 22:08:43,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 79. [2019-12-07 22:08:43,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-12-07 22:08:43,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 95 transitions. [2019-12-07 22:08:43,794 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 95 transitions. Word has length 13 [2019-12-07 22:08:43,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 22:08:43,794 INFO L462 AbstractCegarLoop]: Abstraction has 79 states and 95 transitions. [2019-12-07 22:08:43,794 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-07 22:08:43,794 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 95 transitions. [2019-12-07 22:08:43,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 22:08:43,794 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 22:08:43,794 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 22:08:44,396 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 22:08:44,397 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 22:08:44,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 22:08:44,397 INFO L82 PathProgramCache]: Analyzing trace with hash 172810975, now seen corresponding path program 1 times [2019-12-07 22:08:44,398 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 22:08:44,398 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2041073850] [2019-12-07 22:08:44,399 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_713257e4-5a52-4d95-afa7-c20a834f2096/bin/utaipan/mathsat Starting monitored process 18 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with mathsat -unsat_core_generation=3 [2019-12-07 22:08:44,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 22:08:44,446 INFO L264 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 22:08:44,447 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 22:08:44,456 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-12-07 22:08:44,457 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 1 case distinctions, treesize of input 9 treesize of output 11 [2019-12-07 22:08:44,457 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 22:08:44,460 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 22:08:44,461 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 22:08:44,461 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:9, output treesize:11 [2019-12-07 22:08:44,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 22:08:44,475 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 22:08:44,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 22:08:44,478 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2041073850] [2019-12-07 22:08:44,478 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 22:08:44,479 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-12-07 22:08:44,479 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148004038] [2019-12-07 22:08:44,479 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 22:08:44,479 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 22:08:44,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 22:08:44,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 22:08:44,479 INFO L87 Difference]: Start difference. First operand 79 states and 95 transitions. Second operand 5 states. [2019-12-07 22:08:44,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 22:08:44,577 INFO L93 Difference]: Finished difference Result 78 states and 94 transitions. [2019-12-07 22:08:44,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 22:08:44,577 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-07 22:08:44,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 22:08:44,578 INFO L225 Difference]: With dead ends: 78 [2019-12-07 22:08:44,578 INFO L226 Difference]: Without dead ends: 78 [2019-12-07 22:08:44,578 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 22 SyntacticMatches, 1 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 22:08:44,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-12-07 22:08:44,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-12-07 22:08:44,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-12-07 22:08:44,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 94 transitions. [2019-12-07 22:08:44,580 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 94 transitions. Word has length 14 [2019-12-07 22:08:44,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 22:08:44,580 INFO L462 AbstractCegarLoop]: Abstraction has 78 states and 94 transitions. [2019-12-07 22:08:44,580 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 22:08:44,580 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 94 transitions. [2019-12-07 22:08:44,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 22:08:44,581 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 22:08:44,581 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 22:08:44,781 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 mathsat -unsat_core_generation=3 [2019-12-07 22:08:44,782 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 22:08:44,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 22:08:44,782 INFO L82 PathProgramCache]: Analyzing trace with hash 172810976, now seen corresponding path program 1 times [2019-12-07 22:08:44,782 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 22:08:44,783 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1971676008] [2019-12-07 22:08:44,783 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_713257e4-5a52-4d95-afa7-c20a834f2096/bin/utaipan/mathsat Starting monitored process 19 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with mathsat -unsat_core_generation=3 [2019-12-07 22:08:44,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 22:08:44,879 INFO L264 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-07 22:08:44,881 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 22:08:44,897 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 22:08:44,897 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 1 case distinctions, treesize of input 9 treesize of output 25 [2019-12-07 22:08:44,898 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 22:08:44,917 INFO L614 ElimStorePlain]: treesize reduction 10, result has 64.3 percent of original size [2019-12-07 22:08:44,918 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 22:08:44,918 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2019-12-07 22:08:44,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 22:08:44,943 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 22:08:45,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 22:08:45,057 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1971676008] [2019-12-07 22:08:45,057 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 22:08:45,057 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2019-12-07 22:08:45,057 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345218435] [2019-12-07 22:08:45,058 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 22:08:45,058 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 22:08:45,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 22:08:45,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-12-07 22:08:45,058 INFO L87 Difference]: Start difference. First operand 78 states and 94 transitions. Second operand 10 states. [2019-12-07 22:08:45,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 22:08:45,600 INFO L93 Difference]: Finished difference Result 107 states and 124 transitions. [2019-12-07 22:08:45,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 22:08:45,601 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 14 [2019-12-07 22:08:45,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 22:08:45,602 INFO L225 Difference]: With dead ends: 107 [2019-12-07 22:08:45,602 INFO L226 Difference]: Without dead ends: 107 [2019-12-07 22:08:45,602 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2019-12-07 22:08:45,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-12-07 22:08:45,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 80. [2019-12-07 22:08:45,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-12-07 22:08:45,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 96 transitions. [2019-12-07 22:08:45,604 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 96 transitions. Word has length 14 [2019-12-07 22:08:45,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 22:08:45,604 INFO L462 AbstractCegarLoop]: Abstraction has 80 states and 96 transitions. [2019-12-07 22:08:45,604 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 22:08:45,604 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 96 transitions. [2019-12-07 22:08:45,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 22:08:45,604 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 22:08:45,604 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 22:08:45,805 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 mathsat -unsat_core_generation=3 [2019-12-07 22:08:45,806 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 22:08:45,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 22:08:45,806 INFO L82 PathProgramCache]: Analyzing trace with hash -1432376192, now seen corresponding path program 1 times [2019-12-07 22:08:45,807 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 22:08:45,807 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1889144101] [2019-12-07 22:08:45,808 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_713257e4-5a52-4d95-afa7-c20a834f2096/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 22:08:45,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 22:08:45,922 INFO L264 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 22:08:45,922 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 22:08:45,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 22:08:45,933 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 22:08:45,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 22:08:45,943 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1889144101] [2019-12-07 22:08:45,943 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 22:08:45,943 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-12-07 22:08:45,943 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45612711] [2019-12-07 22:08:45,943 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 22:08:45,943 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 22:08:45,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 22:08:45,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 22:08:45,944 INFO L87 Difference]: Start difference. First operand 80 states and 96 transitions. Second operand 5 states. [2019-12-07 22:08:46,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 22:08:46,038 INFO L93 Difference]: Finished difference Result 79 states and 95 transitions. [2019-12-07 22:08:46,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 22:08:46,039 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-07 22:08:46,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 22:08:46,039 INFO L225 Difference]: With dead ends: 79 [2019-12-07 22:08:46,039 INFO L226 Difference]: Without dead ends: 79 [2019-12-07 22:08:46,040 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 3 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 22:08:46,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-12-07 22:08:46,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-12-07 22:08:46,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-12-07 22:08:46,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 95 transitions. [2019-12-07 22:08:46,041 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 95 transitions. Word has length 16 [2019-12-07 22:08:46,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 22:08:46,041 INFO L462 AbstractCegarLoop]: Abstraction has 79 states and 95 transitions. [2019-12-07 22:08:46,041 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 22:08:46,041 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 95 transitions. [2019-12-07 22:08:46,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 22:08:46,042 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 22:08:46,042 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 22:08:46,242 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 mathsat -unsat_core_generation=3 [2019-12-07 22:08:46,243 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 22:08:46,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 22:08:46,244 INFO L82 PathProgramCache]: Analyzing trace with hash -1432376191, now seen corresponding path program 1 times [2019-12-07 22:08:46,244 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 22:08:46,245 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1416083366] [2019-12-07 22:08:46,245 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_713257e4-5a52-4d95-afa7-c20a834f2096/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 22:08:46,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 22:08:46,308 INFO L264 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 11 conjunts are in the unsatisfiable core [2019-12-07 22:08:46,309 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 22:08:46,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 22:08:46,368 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 22:08:46,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 22:08:46,532 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2019-12-07 22:08:46,533 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 22:08:46,544 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2019-12-07 22:08:46,544 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 22:08:46,568 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 22:08:46,569 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-12-07 22:08:46,569 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:25 [2019-12-07 22:08:46,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 22:08:46,701 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1416083366] [2019-12-07 22:08:46,702 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 22:08:46,702 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 11 [2019-12-07 22:08:46,702 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289484973] [2019-12-07 22:08:46,702 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 22:08:46,702 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 22:08:46,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 22:08:46,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-12-07 22:08:46,702 INFO L87 Difference]: Start difference. First operand 79 states and 95 transitions. Second operand 12 states. [2019-12-07 22:08:47,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 22:08:47,796 INFO L93 Difference]: Finished difference Result 138 states and 156 transitions. [2019-12-07 22:08:47,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-07 22:08:47,796 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 16 [2019-12-07 22:08:47,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 22:08:47,797 INFO L225 Difference]: With dead ends: 138 [2019-12-07 22:08:47,797 INFO L226 Difference]: Without dead ends: 138 [2019-12-07 22:08:47,797 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=134, Invalid=328, Unknown=0, NotChecked=0, Total=462 [2019-12-07 22:08:47,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-12-07 22:08:47,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 78. [2019-12-07 22:08:47,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-12-07 22:08:47,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 94 transitions. [2019-12-07 22:08:47,799 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 94 transitions. Word has length 16 [2019-12-07 22:08:47,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 22:08:47,800 INFO L462 AbstractCegarLoop]: Abstraction has 78 states and 94 transitions. [2019-12-07 22:08:47,800 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 22:08:47,800 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 94 transitions. [2019-12-07 22:08:47,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 22:08:47,800 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 22:08:47,800 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 22:08:48,001 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 mathsat -unsat_core_generation=3 [2019-12-07 22:08:48,001 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 22:08:48,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 22:08:48,001 INFO L82 PathProgramCache]: Analyzing trace with hash -2124032946, now seen corresponding path program 1 times [2019-12-07 22:08:48,001 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 22:08:48,001 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1588312903] [2019-12-07 22:08:48,002 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_713257e4-5a52-4d95-afa7-c20a834f2096/bin/utaipan/mathsat Starting monitored process 22 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with mathsat -unsat_core_generation=3 [2019-12-07 22:08:48,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 22:08:48,048 INFO L264 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-07 22:08:48,049 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 22:08:48,062 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-12-07 22:08:48,063 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 1 case distinctions, treesize of input 9 treesize of output 11 [2019-12-07 22:08:48,063 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 22:08:48,067 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 22:08:48,067 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 22:08:48,068 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:9, output treesize:11 [2019-12-07 22:08:48,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 22:08:48,086 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 22:08:48,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 22:08:48,090 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1588312903] [2019-12-07 22:08:48,090 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 22:08:48,090 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-12-07 22:08:48,090 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859696106] [2019-12-07 22:08:48,091 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 22:08:48,091 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 22:08:48,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 22:08:48,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 22:08:48,091 INFO L87 Difference]: Start difference. First operand 78 states and 94 transitions. Second operand 5 states. [2019-12-07 22:08:48,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 22:08:48,181 INFO L93 Difference]: Finished difference Result 77 states and 93 transitions. [2019-12-07 22:08:48,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 22:08:48,181 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-12-07 22:08:48,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 22:08:48,182 INFO L225 Difference]: With dead ends: 77 [2019-12-07 22:08:48,182 INFO L226 Difference]: Without dead ends: 77 [2019-12-07 22:08:48,182 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 30 SyntacticMatches, 1 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 22:08:48,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-12-07 22:08:48,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-12-07 22:08:48,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-12-07 22:08:48,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 93 transitions. [2019-12-07 22:08:48,184 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 93 transitions. Word has length 18 [2019-12-07 22:08:48,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 22:08:48,184 INFO L462 AbstractCegarLoop]: Abstraction has 77 states and 93 transitions. [2019-12-07 22:08:48,184 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 22:08:48,184 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 93 transitions. [2019-12-07 22:08:48,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 22:08:48,185 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 22:08:48,185 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 22:08:48,385 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 mathsat -unsat_core_generation=3 [2019-12-07 22:08:48,386 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 22:08:48,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 22:08:48,387 INFO L82 PathProgramCache]: Analyzing trace with hash -2124032945, now seen corresponding path program 1 times [2019-12-07 22:08:48,387 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 22:08:48,388 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [893264057] [2019-12-07 22:08:48,388 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_713257e4-5a52-4d95-afa7-c20a834f2096/bin/utaipan/mathsat Starting monitored process 23 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with mathsat -unsat_core_generation=3 [2019-12-07 22:08:48,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 22:08:48,472 INFO L264 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 16 conjunts are in the unsatisfiable core [2019-12-07 22:08:48,474 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 22:08:48,490 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 22:08:48,491 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 1 case distinctions, treesize of input 9 treesize of output 25 [2019-12-07 22:08:48,491 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 22:08:48,509 INFO L614 ElimStorePlain]: treesize reduction 10, result has 64.3 percent of original size [2019-12-07 22:08:48,509 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 22:08:48,509 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2019-12-07 22:08:48,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 22:08:48,540 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 22:08: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 22:08:48,728 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [893264057] [2019-12-07 22:08:48,728 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 22:08:48,728 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 11 [2019-12-07 22:08:48,728 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13012386] [2019-12-07 22:08:48,728 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 22:08:48,728 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 22:08:48,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 22:08:48,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-12-07 22:08:48,729 INFO L87 Difference]: Start difference. First operand 77 states and 93 transitions. Second operand 12 states. [2019-12-07 22:08:49,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 22:08:49,618 INFO L93 Difference]: Finished difference Result 132 states and 148 transitions. [2019-12-07 22:08:49,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-07 22:08:49,619 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 18 [2019-12-07 22:08:49,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 22:08:49,620 INFO L225 Difference]: With dead ends: 132 [2019-12-07 22:08:49,620 INFO L226 Difference]: Without dead ends: 132 [2019-12-07 22:08:49,620 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=113, Invalid=349, Unknown=0, NotChecked=0, Total=462 [2019-12-07 22:08:49,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-12-07 22:08:49,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 81. [2019-12-07 22:08:49,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-12-07 22:08:49,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 98 transitions. [2019-12-07 22:08:49,622 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 98 transitions. Word has length 18 [2019-12-07 22:08:49,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 22:08:49,622 INFO L462 AbstractCegarLoop]: Abstraction has 81 states and 98 transitions. [2019-12-07 22:08:49,622 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 22:08:49,622 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 98 transitions. [2019-12-07 22:08:49,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 22:08:49,622 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 22:08:49,622 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 22:08:49,823 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 mathsat -unsat_core_generation=3 [2019-12-07 22:08:49,824 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 22:08:49,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 22:08:49,824 INFO L82 PathProgramCache]: Analyzing trace with hash -2123984178, now seen corresponding path program 1 times [2019-12-07 22:08:49,825 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 22:08:49,825 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1687514703] [2019-12-07 22:08:49,825 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_713257e4-5a52-4d95-afa7-c20a834f2096/bin/utaipan/mathsat Starting monitored process 24 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with mathsat -unsat_core_generation=3 [2019-12-07 22:08:49,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 22:08:49,943 INFO L264 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 20 conjunts are in the unsatisfiable core [2019-12-07 22:08:49,944 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 22:08:49,955 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 12 treesize of output 8 [2019-12-07 22:08:49,955 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 22:08:49,959 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 22:08:49,959 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 22:08:49,959 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:12 [2019-12-07 22:08:50,060 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 22:08:50,061 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 32 treesize of output 28 [2019-12-07 22:08:50,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 22:08:50,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 22:08:50,063 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 22:08:50,073 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 22:08:50,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 22:08:50,075 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 2 xjuncts. [2019-12-07 22:08:50,075 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:32, output treesize:19 [2019-12-07 22:08:50,106 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 22:08:50,106 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 22:08:50,329 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1687514703] [2019-12-07 22:08:50,330 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: incompatible size [2019-12-07 22:08:50,330 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1549357663] [2019-12-07 22:08:50,330 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_713257e4-5a52-4d95-afa7-c20a834f2096/bin/utaipan/cvc4 Starting monitored process 25 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 22:08:50,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 22:08:50,440 INFO L264 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 25 conjunts are in the unsatisfiable core [2019-12-07 22:08:50,441 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 22:08:50,442 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@5a69a570 [2019-12-07 22:08:50,442 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [663410002] [2019-12-07 22:08:50,442 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_713257e4-5a52-4d95-afa7-c20a834f2096/bin/utaipan/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 22:08:50,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 22:08:50,481 INFO L264 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 17 conjunts are in the unsatisfiable core [2019-12-07 22:08:50,482 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 22:08:50,484 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@5a69a570 [2019-12-07 22:08:50,484 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 0 imperfect interpolant sequences. [2019-12-07 22:08:50,484 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [] total 0 [2019-12-07 22:08:50,484 ERROR L206 FreeRefinementEngine]: Strategy WALRUS failed to provide any proof altough trace is infeasible [2019-12-07 22:08:50,484 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 22:08:51,088 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 z3 -smt2 -in SMTLIB2_COMPLIANT=true,25 cvc4 --incremental --print-success --lang smt --rewrite-divk,24 mathsat -unsat_core_generation=3 [2019-12-07 22:08:51,100 WARN L229 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2019-12-07 22:08:51,101 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 10:08:51 BoogieIcfgContainer [2019-12-07 22:08:51,101 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 22:08:51,101 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 22:08:51,101 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 22:08:51,101 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 22:08:51,101 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:08:29" (3/4) ... [2019-12-07 22:08:51,104 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-12-07 22:08:51,104 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 22:08:51,105 INFO L168 Benchmark]: Toolchain (without parser) took 22645.08 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 305.1 MB). Free memory was 947.0 MB in the beginning and 1.3 GB in the end (delta: -338.2 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 22:08:51,105 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 22:08:51,105 INFO L168 Benchmark]: CACSL2BoogieTranslator took 338.59 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.9 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -157.0 MB). Peak memory consumption was 20.9 MB. Max. memory is 11.5 GB. [2019-12-07 22:08:51,105 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.16 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-12-07 22:08:51,105 INFO L168 Benchmark]: Boogie Preprocessor took 22.27 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 22:08:51,106 INFO L168 Benchmark]: RCFGBuilder took 326.48 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: 31.1 MB). Peak memory consumption was 31.1 MB. Max. memory is 11.5 GB. [2019-12-07 22:08:51,106 INFO L168 Benchmark]: TraceAbstraction took 21916.48 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 177.2 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -225.6 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 22:08:51,106 INFO L168 Benchmark]: Witness Printer took 2.82 ms. Allocated memory is still 1.3 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 22:08:51,107 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 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 338.59 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.9 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -157.0 MB). Peak memory consumption was 20.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 35.16 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 22.27 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 326.48 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: 31.1 MB). Peak memory consumption was 31.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 21916.48 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 177.2 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -225.6 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 2.82 ms. Allocated memory is still 1.3 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 516]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: unable to decide satisfiability of path constraint. Possible FailurePath: [L522] int length1 = __VERIFIER_nondet_int(); [L523] int length2 = __VERIFIER_nondet_int(); [L524] COND TRUE length1 < 1 [L525] length1 = 1 [L527] COND TRUE length2 < 1 [L528] length2 = 1 [L530] char* nondetString1 = (char*) __builtin_alloca (length1 * sizeof(char)); [L531] char* nondetString2 = (char*) __builtin_alloca (length2 * sizeof(char)); [L533] int i = 0; [L533] COND FALSE !(i < length1 -1) [L537] int i = 0; [L537] COND FALSE !(i< length2 -1) [L542] nondetString1[length1-1] = '\0' [L543] nondetString2[length2-1] = '\0' [L516] EXPR \read(*s1) [L516] EXPR s2++ [L516] COND TRUE *s1 == *s2++ [L517] EXPR s1++ [L517] COND FALSE !(*s1++ == 0) [L516] \read(*s1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 50 locations, 19 error locations. Result: UNKNOWN, OverallTime: 21.8s, OverallIterations: 19, TraceHistogramMax: 2, AutomataDifference: 9.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 551 SDtfs, 3473 SDslu, 1272 SDs, 0 SdLazy, 1425 SolverSat, 147 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 533 GetRequests, 352 SyntacticMatches, 14 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 456 ImplicationChecksByTransitivity, 8.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=84occurred in iteration=9, 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, 18 MinimizatonAttempts, 607 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 5.3s InterpolantComputationTime, 259 NumberOfCodeBlocks, 259 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 474 ConstructedInterpolants, 14 QuantifiedInterpolants, 45700 SizeOfPredicates, 145 NumberOfNonLiveVariables, 961 ConjunctsInSsa, 172 ConjunctsInUnsatCore, 44 InterpolantComputations, 32 PerfectInterpolantSequences, 0/24 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...