./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/array-memsafety/cstrncmp-alloca-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 7b2dab56 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_f3b1e071-9075-4a0f-b2e0-a3c1da29d57a/bin/utaipan/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_f3b1e071-9075-4a0f-b2e0-a3c1da29d57a/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_f3b1e071-9075-4a0f-b2e0-a3c1da29d57a/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_f3b1e071-9075-4a0f-b2e0-a3c1da29d57a/bin/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/array-memsafety/cstrncmp-alloca-1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_f3b1e071-9075-4a0f-b2e0-a3c1da29d57a/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_f3b1e071-9075-4a0f-b2e0-a3c1da29d57a/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 2d5a995d825785bc5dc95f3825623b1e4ecd07fe .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_f3b1e071-9075-4a0f-b2e0-a3c1da29d57a/bin/utaipan/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_f3b1e071-9075-4a0f-b2e0-a3c1da29d57a/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_f3b1e071-9075-4a0f-b2e0-a3c1da29d57a/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_f3b1e071-9075-4a0f-b2e0-a3c1da29d57a/bin/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/array-memsafety/cstrncmp-alloca-1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_f3b1e071-9075-4a0f-b2e0-a3c1da29d57a/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_f3b1e071-9075-4a0f-b2e0-a3c1da29d57a/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 2d5a995d825785bc5dc95f3825623b1e4ecd07fe ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN --- Real Ultimate output --- This is Ultimate 0.2.0-7b2dab5 [2020-12-09 16:16:48,874 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-09 16:16:48,885 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-09 16:16:48,913 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-09 16:16:48,913 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-09 16:16:48,915 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-09 16:16:48,916 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-09 16:16:48,919 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-09 16:16:48,921 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-09 16:16:48,922 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-09 16:16:48,923 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-09 16:16:48,925 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-09 16:16:48,925 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-09 16:16:48,927 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-09 16:16:48,928 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-09 16:16:48,929 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-09 16:16:48,930 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-09 16:16:48,931 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-09 16:16:48,933 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-09 16:16:48,935 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-09 16:16:48,937 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-09 16:16:48,939 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-09 16:16:48,940 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-09 16:16:48,941 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-09 16:16:48,944 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-09 16:16:48,944 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-09 16:16:48,945 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-09 16:16:48,946 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-09 16:16:48,946 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-09 16:16:48,947 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-09 16:16:48,947 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-09 16:16:48,948 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-09 16:16:48,949 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-09 16:16:48,950 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-09 16:16:48,951 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-09 16:16:48,951 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-09 16:16:48,951 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-09 16:16:48,952 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-09 16:16:48,952 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-09 16:16:48,953 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-09 16:16:48,953 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-09 16:16:48,954 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_f3b1e071-9075-4a0f-b2e0-a3c1da29d57a/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2020-12-09 16:16:48,975 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-09 16:16:48,976 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-09 16:16:48,976 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2020-12-09 16:16:48,976 INFO L138 SettingsManager]: * User list type=DISABLED [2020-12-09 16:16:48,977 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2020-12-09 16:16:48,977 INFO L138 SettingsManager]: * Explicit value domain=true [2020-12-09 16:16:48,977 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2020-12-09 16:16:48,977 INFO L138 SettingsManager]: * Octagon Domain=false [2020-12-09 16:16:48,977 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2020-12-09 16:16:48,977 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2020-12-09 16:16:48,978 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2020-12-09 16:16:48,978 INFO L138 SettingsManager]: * Interval Domain=false [2020-12-09 16:16:48,978 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2020-12-09 16:16:48,978 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2020-12-09 16:16:48,978 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2020-12-09 16:16:48,979 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-09 16:16:48,979 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-09 16:16:48,979 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-09 16:16:48,979 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-09 16:16:48,980 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-12-09 16:16:48,980 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-09 16:16:48,980 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-09 16:16:48,980 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-09 16:16:48,980 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2020-12-09 16:16:48,980 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2020-12-09 16:16:48,981 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2020-12-09 16:16:48,981 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-09 16:16:48,981 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-12-09 16:16:48,981 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-09 16:16:48,981 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-09 16:16:48,981 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-09 16:16:48,982 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-09 16:16:48,982 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-09 16:16:48,982 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-09 16:16:48,982 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-09 16:16:48,982 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2020-12-09 16:16:48,982 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-09 16:16:48,983 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-09 16:16:48,983 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-12-09 16:16:48,983 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud-vcloud-master/worker/run_dir_f3b1e071-9075-4a0f-b2e0-a3c1da29d57a/bin/utaipan/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_f3b1e071-9075-4a0f-b2e0-a3c1da29d57a/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 -> 2d5a995d825785bc5dc95f3825623b1e4ecd07fe [2020-12-09 16:16:49,180 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-09 16:16:49,200 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-09 16:16:49,202 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-09 16:16:49,203 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-09 16:16:49,203 INFO L275 PluginConnector]: CDTParser initialized [2020-12-09 16:16:49,204 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_f3b1e071-9075-4a0f-b2e0-a3c1da29d57a/bin/utaipan/../../sv-benchmarks/c/array-memsafety/cstrncmp-alloca-1.i [2020-12-09 16:16:49,245 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_f3b1e071-9075-4a0f-b2e0-a3c1da29d57a/bin/utaipan/data/f9452d056/ef6c223dcef946b7b4bcfda355cc2d95/FLAG0d1490293 [2020-12-09 16:16:49,654 INFO L306 CDTParser]: Found 1 translation units. [2020-12-09 16:16:49,654 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_f3b1e071-9075-4a0f-b2e0-a3c1da29d57a/sv-benchmarks/c/array-memsafety/cstrncmp-alloca-1.i [2020-12-09 16:16:49,667 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_f3b1e071-9075-4a0f-b2e0-a3c1da29d57a/bin/utaipan/data/f9452d056/ef6c223dcef946b7b4bcfda355cc2d95/FLAG0d1490293 [2020-12-09 16:16:49,679 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_f3b1e071-9075-4a0f-b2e0-a3c1da29d57a/bin/utaipan/data/f9452d056/ef6c223dcef946b7b4bcfda355cc2d95 [2020-12-09 16:16:49,681 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-09 16:16:49,682 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-09 16:16:49,684 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-09 16:16:49,684 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-09 16:16:49,686 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-09 16:16:49,687 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 04:16:49" (1/1) ... [2020-12-09 16:16:49,688 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47949185 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:16:49, skipping insertion in model container [2020-12-09 16:16:49,688 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 04:16:49" (1/1) ... [2020-12-09 16:16:49,693 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-09 16:16:49,728 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-09 16:16:49,937 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 16:16:49,945 INFO L203 MainTranslator]: Completed pre-run [2020-12-09 16:16:49,980 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 16:16:50,017 INFO L208 MainTranslator]: Completed translation [2020-12-09 16:16:50,018 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:16:50 WrapperNode [2020-12-09 16:16:50,018 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-09 16:16:50,019 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-09 16:16:50,019 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-09 16:16:50,019 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-09 16:16:50,025 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:16:50" (1/1) ... [2020-12-09 16:16:50,038 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:16:50" (1/1) ... [2020-12-09 16:16:50,058 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-09 16:16:50,059 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-09 16:16:50,059 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-09 16:16:50,059 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-09 16:16:50,068 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:16:50" (1/1) ... [2020-12-09 16:16:50,068 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:16:50" (1/1) ... [2020-12-09 16:16:50,071 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:16:50" (1/1) ... [2020-12-09 16:16:50,072 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:16:50" (1/1) ... [2020-12-09 16:16:50,077 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:16:50" (1/1) ... [2020-12-09 16:16:50,082 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:16:50" (1/1) ... [2020-12-09 16:16:50,084 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:16:50" (1/1) ... [2020-12-09 16:16:50,087 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-09 16:16:50,088 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-09 16:16:50,088 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-09 16:16:50,088 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-09 16:16:50,089 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:16:50" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f3b1e071-9075-4a0f-b2e0-a3c1da29d57a/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-09 16:16:50,146 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-12-09 16:16:50,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-12-09 16:16:50,146 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-09 16:16:50,146 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-12-09 16:16:50,146 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-09 16:16:50,147 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-09 16:16:50,524 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-09 16:16:50,524 INFO L299 CfgBuilder]: Removed 9 assume(true) statements. [2020-12-09 16:16:50,526 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 04:16:50 BoogieIcfgContainer [2020-12-09 16:16:50,526 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-09 16:16:50,527 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-09 16:16:50,527 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-09 16:16:50,530 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-09 16:16:50,530 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 04:16:49" (1/3) ... [2020-12-09 16:16:50,530 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36aaa909 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 04:16:50, skipping insertion in model container [2020-12-09 16:16:50,531 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:16:50" (2/3) ... [2020-12-09 16:16:50,531 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36aaa909 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 04:16:50, skipping insertion in model container [2020-12-09 16:16:50,531 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 04:16:50" (3/3) ... [2020-12-09 16:16:50,532 INFO L111 eAbstractionObserver]: Analyzing ICFG cstrncmp-alloca-1.i [2020-12-09 16:16:50,541 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-09 16:16:50,544 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 19 error locations. [2020-12-09 16:16:50,551 INFO L253 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2020-12-09 16:16:50,564 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-09 16:16:50,564 INFO L378 AbstractCegarLoop]: Hoare is false [2020-12-09 16:16:50,565 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-09 16:16:50,565 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-09 16:16:50,565 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-09 16:16:50,565 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-09 16:16:50,565 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-09 16:16:50,565 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-09 16:16:50,574 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states. [2020-12-09 16:16:50,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-12-09 16:16:50,578 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 16:16:50,579 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-12-09 16:16:50,579 INFO L429 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]=== [2020-12-09 16:16:50,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 16:16:50,583 INFO L82 PathProgramCache]: Analyzing trace with hash 165069, now seen corresponding path program 1 times [2020-12-09 16:16:50,593 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 16:16:50,593 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547044806] [2020-12-09 16:16:50,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 16:16:50,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 16:16:50,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 16:16:50,754 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547044806] [2020-12-09 16:16:50,755 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 16:16:50,755 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-12-09 16:16:50,755 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099401142] [2020-12-09 16:16:50,759 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 16:16:50,759 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 16:16:50,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 16:16:50,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 16:16:50,775 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 3 states. [2020-12-09 16:16:50,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 16:16:50,823 INFO L93 Difference]: Finished difference Result 38 states and 44 transitions. [2020-12-09 16:16:50,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 16:16:50,825 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-12-09 16:16:50,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 16:16:50,831 INFO L225 Difference]: With dead ends: 38 [2020-12-09 16:16:50,831 INFO L226 Difference]: Without dead ends: 37 [2020-12-09 16:16:50,832 INFO L677 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 [2020-12-09 16:16:50,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-12-09 16:16:50,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2020-12-09 16:16:50,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-12-09 16:16:50,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 43 transitions. [2020-12-09 16:16:50,855 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 43 transitions. Word has length 3 [2020-12-09 16:16:50,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 16:16:50,856 INFO L481 AbstractCegarLoop]: Abstraction has 37 states and 43 transitions. [2020-12-09 16:16:50,856 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 16:16:50,856 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2020-12-09 16:16:50,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-12-09 16:16:50,856 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 16:16:50,856 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-12-09 16:16:50,857 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-09 16:16:50,857 INFO L429 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]=== [2020-12-09 16:16:50,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 16:16:50,857 INFO L82 PathProgramCache]: Analyzing trace with hash 165070, now seen corresponding path program 1 times [2020-12-09 16:16:50,858 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 16:16:50,858 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625270644] [2020-12-09 16:16:50,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 16:16:50,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 16:16:50,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 16:16:50,914 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625270644] [2020-12-09 16:16:50,914 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 16:16:50,914 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 16:16:50,914 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355667562] [2020-12-09 16:16:50,915 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 16:16:50,916 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 16:16:50,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 16:16:50,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 16:16:50,917 INFO L87 Difference]: Start difference. First operand 37 states and 43 transitions. Second operand 4 states. [2020-12-09 16:16:50,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 16:16:50,999 INFO L93 Difference]: Finished difference Result 72 states and 84 transitions. [2020-12-09 16:16:51,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 16:16:51,000 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2020-12-09 16:16:51,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 16:16:51,001 INFO L225 Difference]: With dead ends: 72 [2020-12-09 16:16:51,001 INFO L226 Difference]: Without dead ends: 72 [2020-12-09 16:16:51,001 INFO L677 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 [2020-12-09 16:16:51,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2020-12-09 16:16:51,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 39. [2020-12-09 16:16:51,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-12-09 16:16:51,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 46 transitions. [2020-12-09 16:16:51,006 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 46 transitions. Word has length 3 [2020-12-09 16:16:51,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 16:16:51,006 INFO L481 AbstractCegarLoop]: Abstraction has 39 states and 46 transitions. [2020-12-09 16:16:51,006 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 16:16:51,006 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 46 transitions. [2020-12-09 16:16:51,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-12-09 16:16:51,007 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 16:16:51,007 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-12-09 16:16:51,007 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-09 16:16:51,007 INFO L429 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]=== [2020-12-09 16:16:51,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 16:16:51,008 INFO L82 PathProgramCache]: Analyzing trace with hash 5235302, now seen corresponding path program 1 times [2020-12-09 16:16:51,008 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 16:16:51,008 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620920281] [2020-12-09 16:16:51,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 16:16:51,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 16:16:51,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 16:16:51,062 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620920281] [2020-12-09 16:16:51,062 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 16:16:51,062 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-12-09 16:16:51,062 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045368140] [2020-12-09 16:16:51,063 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 16:16:51,063 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 16:16:51,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 16:16:51,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 16:16:51,063 INFO L87 Difference]: Start difference. First operand 39 states and 46 transitions. Second operand 3 states. [2020-12-09 16:16:51,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 16:16:51,090 INFO L93 Difference]: Finished difference Result 38 states and 45 transitions. [2020-12-09 16:16:51,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 16:16:51,090 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-12-09 16:16:51,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 16:16:51,091 INFO L225 Difference]: With dead ends: 38 [2020-12-09 16:16:51,091 INFO L226 Difference]: Without dead ends: 38 [2020-12-09 16:16:51,092 INFO L677 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 [2020-12-09 16:16:51,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2020-12-09 16:16:51,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2020-12-09 16:16:51,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2020-12-09 16:16:51,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2020-12-09 16:16:51,102 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 45 transitions. Word has length 4 [2020-12-09 16:16:51,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 16:16:51,103 INFO L481 AbstractCegarLoop]: Abstraction has 38 states and 45 transitions. [2020-12-09 16:16:51,103 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 16:16:51,103 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2020-12-09 16:16:51,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-12-09 16:16:51,103 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 16:16:51,103 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-12-09 16:16:51,103 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-09 16:16:51,104 INFO L429 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]=== [2020-12-09 16:16:51,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 16:16:51,104 INFO L82 PathProgramCache]: Analyzing trace with hash 5232037, now seen corresponding path program 1 times [2020-12-09 16:16:51,104 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 16:16:51,104 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810624314] [2020-12-09 16:16:51,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 16:16:51,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 16:16:51,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 16:16:51,125 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810624314] [2020-12-09 16:16:51,125 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 16:16:51,125 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-12-09 16:16:51,126 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679227182] [2020-12-09 16:16:51,126 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 16:16:51,126 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 16:16:51,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 16:16:51,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 16:16:51,127 INFO L87 Difference]: Start difference. First operand 38 states and 45 transitions. Second operand 3 states. [2020-12-09 16:16:51,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 16:16:51,149 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2020-12-09 16:16:51,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 16:16:51,150 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-12-09 16:16:51,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 16:16:51,151 INFO L225 Difference]: With dead ends: 36 [2020-12-09 16:16:51,151 INFO L226 Difference]: Without dead ends: 36 [2020-12-09 16:16:51,151 INFO L677 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 [2020-12-09 16:16:51,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2020-12-09 16:16:51,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2020-12-09 16:16:51,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-12-09 16:16:51,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2020-12-09 16:16:51,155 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 43 transitions. Word has length 4 [2020-12-09 16:16:51,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 16:16:51,155 INFO L481 AbstractCegarLoop]: Abstraction has 36 states and 43 transitions. [2020-12-09 16:16:51,155 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 16:16:51,155 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2020-12-09 16:16:51,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-12-09 16:16:51,155 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 16:16:51,156 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-12-09 16:16:51,156 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-09 16:16:51,156 INFO L429 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]=== [2020-12-09 16:16:51,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 16:16:51,156 INFO L82 PathProgramCache]: Analyzing trace with hash 5232038, now seen corresponding path program 1 times [2020-12-09 16:16:51,157 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 16:16:51,157 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897312514] [2020-12-09 16:16:51,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 16:16:51,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 16:16:51,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 16:16:51,208 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897312514] [2020-12-09 16:16:51,208 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 16:16:51,208 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 16:16:51,208 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31094776] [2020-12-09 16:16:51,208 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 16:16:51,209 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 16:16:51,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 16:16:51,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-09 16:16:51,209 INFO L87 Difference]: Start difference. First operand 36 states and 43 transitions. Second operand 5 states. [2020-12-09 16:16:51,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 16:16:51,279 INFO L93 Difference]: Finished difference Result 65 states and 77 transitions. [2020-12-09 16:16:51,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 16:16:51,280 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2020-12-09 16:16:51,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 16:16:51,281 INFO L225 Difference]: With dead ends: 65 [2020-12-09 16:16:51,281 INFO L226 Difference]: Without dead ends: 65 [2020-12-09 16:16:51,281 INFO L677 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 [2020-12-09 16:16:51,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2020-12-09 16:16:51,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 38. [2020-12-09 16:16:51,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2020-12-09 16:16:51,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2020-12-09 16:16:51,285 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 46 transitions. Word has length 4 [2020-12-09 16:16:51,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 16:16:51,285 INFO L481 AbstractCegarLoop]: Abstraction has 38 states and 46 transitions. [2020-12-09 16:16:51,285 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 16:16:51,286 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2020-12-09 16:16:51,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-12-09 16:16:51,286 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 16:16:51,286 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2020-12-09 16:16:51,286 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-09 16:16:51,286 INFO L429 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]=== [2020-12-09 16:16:51,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 16:16:51,287 INFO L82 PathProgramCache]: Analyzing trace with hash 158734875, now seen corresponding path program 1 times [2020-12-09 16:16:51,287 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 16:16:51,287 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985293226] [2020-12-09 16:16:51,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 16:16:51,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 16:16:51,337 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 16:16:51,337 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985293226] [2020-12-09 16:16:51,337 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1519969029] [2020-12-09 16:16:51,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f3b1e071-9075-4a0f-b2e0-a3c1da29d57a/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 [2020-12-09 16:16:51,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 16:16:51,372 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 12 conjunts are in the unsatisfiable core [2020-12-09 16:16:51,375 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 16:16:51,413 INFO L443 ElimStorePlain]: Different costs {0=[|v_#length_46|], 2=[|v_#valid_70|]} [2020-12-09 16:16:51,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 16:16:51,424 INFO L382 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 [2020-12-09 16:16:51,425 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 16:16:51,434 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 16:16:51,441 INFO L382 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 [2020-12-09 16:16:51,446 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2020-12-09 16:16:51,466 INFO L625 ElimStorePlain]: treesize reduction 14, result has 60.0 percent of original size [2020-12-09 16:16:51,469 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 16:16:51,469 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:27, output treesize:12 [2020-12-09 16:16:51,515 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 16:16:51,516 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 16:16:51,559 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-12-09 16:16:51,585 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 16:16:51,586 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1407644771] [2020-12-09 16:16:51,605 INFO L159 IcfgInterpreter]: Started Sifa with 4 locations of interest [2020-12-09 16:16:51,606 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 16:16:51,609 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-12-09 16:16:51,613 INFO L176 IcfgInterpreter]: Starting interpretation [2020-12-09 16:16:51,613 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-12-09 16:16:51,991 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 16:16:52,012 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 16:16:52,165 INFO L180 IcfgInterpreter]: Interpretation finished [2020-12-09 16:16:52,471 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-09 16:16:52,471 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 16:16:52,471 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2020-12-09 16:16:52,472 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061408077] [2020-12-09 16:16:52,472 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-12-09 16:16:52,472 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 16:16:52,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-12-09 16:16:52,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2020-12-09 16:16:52,473 INFO L87 Difference]: Start difference. First operand 38 states and 46 transitions. Second operand 11 states. [2020-12-09 16:16:52,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 16:16:52,712 INFO L93 Difference]: Finished difference Result 102 states and 123 transitions. [2020-12-09 16:16:52,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-09 16:16:52,712 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 5 [2020-12-09 16:16:52,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 16:16:52,713 INFO L225 Difference]: With dead ends: 102 [2020-12-09 16:16:52,713 INFO L226 Difference]: Without dead ends: 102 [2020-12-09 16:16:52,713 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272 [2020-12-09 16:16:52,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2020-12-09 16:16:52,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 35. [2020-12-09 16:16:52,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-12-09 16:16:52,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 42 transitions. [2020-12-09 16:16:52,716 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 42 transitions. Word has length 5 [2020-12-09 16:16:52,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 16:16:52,717 INFO L481 AbstractCegarLoop]: Abstraction has 35 states and 42 transitions. [2020-12-09 16:16:52,717 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-12-09 16:16:52,717 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 42 transitions. [2020-12-09 16:16:52,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-12-09 16:16:52,717 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 16:16:52,717 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-12-09 16:16:52,918 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2020-12-09 16:16:52,919 INFO L429 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]=== [2020-12-09 16:16:52,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 16:16:52,920 INFO L82 PathProgramCache]: Analyzing trace with hash 162294356, now seen corresponding path program 1 times [2020-12-09 16:16:52,921 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 16:16:52,921 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479873612] [2020-12-09 16:16:52,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 16:16:52,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 16:16:53,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 16:16:53,095 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479873612] [2020-12-09 16:16:53,095 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 16:16:53,095 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 16:16:53,095 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362166356] [2020-12-09 16:16:53,096 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 16:16:53,096 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 16:16:53,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 16:16:53,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-12-09 16:16:53,096 INFO L87 Difference]: Start difference. First operand 35 states and 42 transitions. Second operand 5 states. [2020-12-09 16:16:53,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 16:16:53,140 INFO L93 Difference]: Finished difference Result 61 states and 72 transitions. [2020-12-09 16:16:53,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 16:16:53,140 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2020-12-09 16:16:53,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 16:16:53,141 INFO L225 Difference]: With dead ends: 61 [2020-12-09 16:16:53,141 INFO L226 Difference]: Without dead ends: 61 [2020-12-09 16:16:53,141 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-12-09 16:16:53,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2020-12-09 16:16:53,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 37. [2020-12-09 16:16:53,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-12-09 16:16:53,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 44 transitions. [2020-12-09 16:16:53,143 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 44 transitions. Word has length 5 [2020-12-09 16:16:53,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 16:16:53,144 INFO L481 AbstractCegarLoop]: Abstraction has 37 states and 44 transitions. [2020-12-09 16:16:53,144 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 16:16:53,144 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2020-12-09 16:16:53,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-12-09 16:16:53,144 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 16:16:53,144 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2020-12-09 16:16:53,144 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2020-12-09 16:16:53,144 INFO L429 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]=== [2020-12-09 16:16:53,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 16:16:53,145 INFO L82 PathProgramCache]: Analyzing trace with hash 733109027, now seen corresponding path program 1 times [2020-12-09 16:16:53,145 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 16:16:53,145 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530991543] [2020-12-09 16:16:53,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 16:16:53,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 16:16:53,198 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 16:16:53,199 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530991543] [2020-12-09 16:16:53,199 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1228586] [2020-12-09 16:16:53,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f3b1e071-9075-4a0f-b2e0-a3c1da29d57a/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 [2020-12-09 16:16:53,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 16:16:53,231 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 11 conjunts are in the unsatisfiable core [2020-12-09 16:16:53,232 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 16:16:53,311 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 16:16:53,311 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 16:16:53,376 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 16:16:53,376 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1546971108] [2020-12-09 16:16:53,377 INFO L159 IcfgInterpreter]: Started Sifa with 5 locations of interest [2020-12-09 16:16:53,377 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 16:16:53,378 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-12-09 16:16:53,378 INFO L176 IcfgInterpreter]: Starting interpretation [2020-12-09 16:16:53,378 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-12-09 16:16:53,623 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 16:16:53,629 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 16:16:53,690 INFO L180 IcfgInterpreter]: Interpretation finished [2020-12-09 16:16:53,838 WARN L197 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 50 [2020-12-09 16:16:54,031 WARN L197 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 55 [2020-12-09 16:16:54,207 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-09 16:16:54,207 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 16:16:54,207 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2020-12-09 16:16:54,207 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218330478] [2020-12-09 16:16:54,207 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-12-09 16:16:54,207 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 16:16:54,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-12-09 16:16:54,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2020-12-09 16:16:54,208 INFO L87 Difference]: Start difference. First operand 37 states and 44 transitions. Second operand 13 states. [2020-12-09 16:16:54,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 16:16:54,357 INFO L93 Difference]: Finished difference Result 87 states and 103 transitions. [2020-12-09 16:16:54,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-09 16:16:54,357 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 6 [2020-12-09 16:16:54,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 16:16:54,358 INFO L225 Difference]: With dead ends: 87 [2020-12-09 16:16:54,358 INFO L226 Difference]: Without dead ends: 87 [2020-12-09 16:16:54,359 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=92, Invalid=288, Unknown=0, NotChecked=0, Total=380 [2020-12-09 16:16:54,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2020-12-09 16:16:54,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 37. [2020-12-09 16:16:54,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-12-09 16:16:54,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 45 transitions. [2020-12-09 16:16:54,362 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 45 transitions. Word has length 6 [2020-12-09 16:16:54,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 16:16:54,362 INFO L481 AbstractCegarLoop]: Abstraction has 37 states and 45 transitions. [2020-12-09 16:16:54,363 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-12-09 16:16:54,363 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 45 transitions. [2020-12-09 16:16:54,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-12-09 16:16:54,363 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 16:16:54,363 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-12-09 16:16:54,564 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 16:16:54,565 INFO L429 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]=== [2020-12-09 16:16:54,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 16:16:54,566 INFO L82 PathProgramCache]: Analyzing trace with hash 1251644535, now seen corresponding path program 1 times [2020-12-09 16:16:54,566 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 16:16:54,567 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631147844] [2020-12-09 16:16:54,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 16:16:54,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 16:16:54,651 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 16:16:54,651 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631147844] [2020-12-09 16:16:54,651 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1962259209] [2020-12-09 16:16:54,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f3b1e071-9075-4a0f-b2e0-a3c1da29d57a/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 [2020-12-09 16:16:54,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 16:16:54,680 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 10 conjunts are in the unsatisfiable core [2020-12-09 16:16:54,681 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 16:16:54,725 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 16:16:54,725 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 16:16:54,759 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 16:16:54,759 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2020-12-09 16:16:54,759 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 3] total 9 [2020-12-09 16:16:54,759 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386169197] [2020-12-09 16:16:54,760 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 16:16:54,760 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 16:16:54,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 16:16:54,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2020-12-09 16:16:54,760 INFO L87 Difference]: Start difference. First operand 37 states and 45 transitions. Second operand 5 states. [2020-12-09 16:16:54,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 16:16:54,779 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2020-12-09 16:16:54,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 16:16:54,779 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2020-12-09 16:16:54,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 16:16:54,779 INFO L225 Difference]: With dead ends: 36 [2020-12-09 16:16:54,779 INFO L226 Difference]: Without dead ends: 36 [2020-12-09 16:16:54,780 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2020-12-09 16:16:54,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2020-12-09 16:16:54,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 31. [2020-12-09 16:16:54,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-12-09 16:16:54,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2020-12-09 16:16:54,781 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 7 [2020-12-09 16:16:54,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 16:16:54,782 INFO L481 AbstractCegarLoop]: Abstraction has 31 states and 37 transitions. [2020-12-09 16:16:54,782 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 16:16:54,782 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2020-12-09 16:16:54,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-12-09 16:16:54,782 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 16:16:54,782 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 16:16:54,982 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable43 [2020-12-09 16:16:54,983 INFO L429 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]=== [2020-12-09 16:16:54,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 16:16:54,984 INFO L82 PathProgramCache]: Analyzing trace with hash -1219779455, now seen corresponding path program 1 times [2020-12-09 16:16:54,985 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 16:16:54,985 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019792828] [2020-12-09 16:16:54,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 16:16:55,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 16:16:55,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 16:16:55,050 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019792828] [2020-12-09 16:16:55,050 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 16:16:55,050 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 16:16:55,050 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030399444] [2020-12-09 16:16:55,050 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 16:16:55,051 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 16:16:55,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 16:16:55,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 16:16:55,051 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. Second operand 4 states. [2020-12-09 16:16:55,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 16:16:55,075 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2020-12-09 16:16:55,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 16:16:55,076 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2020-12-09 16:16:55,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 16:16:55,076 INFO L225 Difference]: With dead ends: 30 [2020-12-09 16:16:55,076 INFO L226 Difference]: Without dead ends: 28 [2020-12-09 16:16:55,076 INFO L677 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 [2020-12-09 16:16:55,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-12-09 16:16:55,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2020-12-09 16:16:55,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-12-09 16:16:55,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2020-12-09 16:16:55,078 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 8 [2020-12-09 16:16:55,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 16:16:55,078 INFO L481 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2020-12-09 16:16:55,078 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 16:16:55,078 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2020-12-09 16:16:55,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-12-09 16:16:55,078 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 16:16:55,078 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 16:16:55,079 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2020-12-09 16:16:55,079 INFO L429 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]=== [2020-12-09 16:16:55,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 16:16:55,079 INFO L82 PathProgramCache]: Analyzing trace with hash 841549668, now seen corresponding path program 1 times [2020-12-09 16:16:55,079 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 16:16:55,079 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779289975] [2020-12-09 16:16:55,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 16:16:55,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 16:16:55,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 16:16:55,096 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779289975] [2020-12-09 16:16:55,096 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 16:16:55,096 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 16:16:55,096 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280560465] [2020-12-09 16:16:55,096 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 16:16:55,096 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 16:16:55,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 16:16:55,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 16:16:55,097 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 4 states. [2020-12-09 16:16:55,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 16:16:55,117 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2020-12-09 16:16:55,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 16:16:55,117 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2020-12-09 16:16:55,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 16:16:55,118 INFO L225 Difference]: With dead ends: 25 [2020-12-09 16:16:55,118 INFO L226 Difference]: Without dead ends: 25 [2020-12-09 16:16:55,118 INFO L677 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 [2020-12-09 16:16:55,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2020-12-09 16:16:55,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2020-12-09 16:16:55,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-12-09 16:16:55,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2020-12-09 16:16:55,119 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 9 [2020-12-09 16:16:55,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 16:16:55,119 INFO L481 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2020-12-09 16:16:55,119 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 16:16:55,119 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2020-12-09 16:16:55,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-12-09 16:16:55,120 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 16:16:55,120 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 16:16:55,120 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2020-12-09 16:16:55,120 INFO L429 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]=== [2020-12-09 16:16:55,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 16:16:55,120 INFO L82 PathProgramCache]: Analyzing trace with hash 841549669, now seen corresponding path program 1 times [2020-12-09 16:16:55,120 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 16:16:55,120 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499239287] [2020-12-09 16:16:55,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 16:16:55,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 16:16:55,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 16:16:55,149 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499239287] [2020-12-09 16:16:55,149 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 16:16:55,149 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 16:16:55,149 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383215255] [2020-12-09 16:16:55,150 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 16:16:55,150 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 16:16:55,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 16:16:55,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-09 16:16:55,150 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand 5 states. [2020-12-09 16:16:55,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 16:16:55,201 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2020-12-09 16:16:55,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 16:16:55,202 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2020-12-09 16:16:55,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 16:16:55,202 INFO L225 Difference]: With dead ends: 33 [2020-12-09 16:16:55,202 INFO L226 Difference]: Without dead ends: 33 [2020-12-09 16:16:55,202 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-12-09 16:16:55,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-12-09 16:16:55,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2020-12-09 16:16:55,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-12-09 16:16:55,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2020-12-09 16:16:55,204 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 9 [2020-12-09 16:16:55,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 16:16:55,205 INFO L481 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2020-12-09 16:16:55,205 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 16:16:55,205 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2020-12-09 16:16:55,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-12-09 16:16:55,205 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 16:16:55,205 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 16:16:55,205 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2020-12-09 16:16:55,206 INFO L429 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]=== [2020-12-09 16:16:55,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 16:16:55,206 INFO L82 PathProgramCache]: Analyzing trace with hash 318235976, now seen corresponding path program 1 times [2020-12-09 16:16:55,206 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 16:16:55,206 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679095843] [2020-12-09 16:16:55,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 16:16:55,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 16:16:55,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 16:16:55,222 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679095843] [2020-12-09 16:16:55,222 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 16:16:55,223 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 16:16:55,223 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178860896] [2020-12-09 16:16:55,223 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 16:16:55,223 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 16:16:55,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 16:16:55,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 16:16:55,224 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. Second operand 3 states. [2020-12-09 16:16:55,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 16:16:55,240 INFO L93 Difference]: Finished difference Result 30 states and 37 transitions. [2020-12-09 16:16:55,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 16:16:55,241 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-12-09 16:16:55,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 16:16:55,242 INFO L225 Difference]: With dead ends: 30 [2020-12-09 16:16:55,242 INFO L226 Difference]: Without dead ends: 30 [2020-12-09 16:16:55,243 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 16:16:55,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-12-09 16:16:55,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2020-12-09 16:16:55,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-12-09 16:16:55,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2020-12-09 16:16:55,245 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 10 [2020-12-09 16:16:55,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 16:16:55,245 INFO L481 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2020-12-09 16:16:55,245 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 16:16:55,246 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2020-12-09 16:16:55,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-12-09 16:16:55,246 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 16:16:55,246 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 16:16:55,246 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2020-12-09 16:16:55,246 INFO L429 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]=== [2020-12-09 16:16:55,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 16:16:55,247 INFO L82 PathProgramCache]: Analyzing trace with hash 318235977, now seen corresponding path program 1 times [2020-12-09 16:16:55,247 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 16:16:55,247 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993119575] [2020-12-09 16:16:55,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 16:16:55,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 16:16:55,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 16:16:55,280 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993119575] [2020-12-09 16:16:55,280 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 16:16:55,280 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 16:16:55,280 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014305054] [2020-12-09 16:16:55,281 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 16:16:55,281 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 16:16:55,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 16:16:55,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 16:16:55,282 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand 4 states. [2020-12-09 16:16:55,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 16:16:55,324 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2020-12-09 16:16:55,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 16:16:55,325 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2020-12-09 16:16:55,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 16:16:55,325 INFO L225 Difference]: With dead ends: 33 [2020-12-09 16:16:55,325 INFO L226 Difference]: Without dead ends: 31 [2020-12-09 16:16:55,325 INFO L677 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 [2020-12-09 16:16:55,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2020-12-09 16:16:55,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2020-12-09 16:16:55,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-12-09 16:16:55,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2020-12-09 16:16:55,327 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 10 [2020-12-09 16:16:55,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 16:16:55,327 INFO L481 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2020-12-09 16:16:55,327 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 16:16:55,327 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2020-12-09 16:16:55,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-12-09 16:16:55,327 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 16:16:55,327 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 16:16:55,327 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2020-12-09 16:16:55,327 INFO L429 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]=== [2020-12-09 16:16:55,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 16:16:55,328 INFO L82 PathProgramCache]: Analyzing trace with hash 1398118962, now seen corresponding path program 1 times [2020-12-09 16:16:55,328 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 16:16:55,328 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214247028] [2020-12-09 16:16:55,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 16:16:55,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 16:16:55,343 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 16:16:55,343 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214247028] [2020-12-09 16:16:55,343 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 16:16:55,343 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 16:16:55,344 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532154782] [2020-12-09 16:16:55,344 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 16:16:55,344 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 16:16:55,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 16:16:55,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 16:16:55,345 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand 3 states. [2020-12-09 16:16:55,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 16:16:55,350 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2020-12-09 16:16:55,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 16:16:55,350 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2020-12-09 16:16:55,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 16:16:55,351 INFO L225 Difference]: With dead ends: 28 [2020-12-09 16:16:55,351 INFO L226 Difference]: Without dead ends: 27 [2020-12-09 16:16:55,351 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 16:16:55,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2020-12-09 16:16:55,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2020-12-09 16:16:55,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-12-09 16:16:55,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2020-12-09 16:16:55,352 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 14 [2020-12-09 16:16:55,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 16:16:55,352 INFO L481 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2020-12-09 16:16:55,352 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 16:16:55,352 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2020-12-09 16:16:55,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-12-09 16:16:55,353 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 16:16:55,353 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 16:16:55,353 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2020-12-09 16:16:55,353 INFO L429 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]=== [2020-12-09 16:16:55,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 16:16:55,353 INFO L82 PathProgramCache]: Analyzing trace with hash 456494658, now seen corresponding path program 1 times [2020-12-09 16:16:55,353 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 16:16:55,353 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505876720] [2020-12-09 16:16:55,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 16:16:55,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 16:16:55,369 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 16:16:55,369 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505876720] [2020-12-09 16:16:55,370 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 16:16:55,370 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 16:16:55,370 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732133191] [2020-12-09 16:16:55,370 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 16:16:55,370 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 16:16:55,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 16:16:55,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 16:16:55,371 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand 3 states. [2020-12-09 16:16:55,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 16:16:55,376 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2020-12-09 16:16:55,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 16:16:55,377 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2020-12-09 16:16:55,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 16:16:55,377 INFO L225 Difference]: With dead ends: 28 [2020-12-09 16:16:55,377 INFO L226 Difference]: Without dead ends: 27 [2020-12-09 16:16:55,377 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 16:16:55,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2020-12-09 16:16:55,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2020-12-09 16:16:55,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-12-09 16:16:55,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2020-12-09 16:16:55,378 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 16 [2020-12-09 16:16:55,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 16:16:55,379 INFO L481 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2020-12-09 16:16:55,379 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 16:16:55,379 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2020-12-09 16:16:55,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-12-09 16:16:55,379 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 16:16:55,379 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 16:16:55,379 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2020-12-09 16:16:55,379 INFO L429 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]=== [2020-12-09 16:16:55,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 16:16:55,380 INFO L82 PathProgramCache]: Analyzing trace with hash 1356994247, now seen corresponding path program 1 times [2020-12-09 16:16:55,380 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 16:16:55,380 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754329833] [2020-12-09 16:16:55,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 16:16:55,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 16:16:55,496 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 16:16:55,496 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754329833] [2020-12-09 16:16:55,496 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 16:16:55,496 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-09 16:16:55,496 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716279913] [2020-12-09 16:16:55,496 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-09 16:16:55,496 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 16:16:55,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-09 16:16:55,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-12-09 16:16:55,497 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand 7 states. [2020-12-09 16:16:55,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 16:16:55,641 INFO L93 Difference]: Finished difference Result 42 states and 45 transitions. [2020-12-09 16:16:55,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-09 16:16:55,641 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2020-12-09 16:16:55,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 16:16:55,641 INFO L225 Difference]: With dead ends: 42 [2020-12-09 16:16:55,641 INFO L226 Difference]: Without dead ends: 29 [2020-12-09 16:16:55,641 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2020-12-09 16:16:55,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2020-12-09 16:16:55,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2020-12-09 16:16:55,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-12-09 16:16:55,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2020-12-09 16:16:55,642 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 17 [2020-12-09 16:16:55,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 16:16:55,643 INFO L481 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2020-12-09 16:16:55,643 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-09 16:16:55,643 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2020-12-09 16:16:55,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-12-09 16:16:55,643 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 16:16:55,643 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 16:16:55,643 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2020-12-09 16:16:55,643 INFO L429 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]=== [2020-12-09 16:16:55,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 16:16:55,643 INFO L82 PathProgramCache]: Analyzing trace with hash 283894100, now seen corresponding path program 1 times [2020-12-09 16:16:55,644 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 16:16:55,644 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911982403] [2020-12-09 16:16:55,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 16:16:55,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 16:16:55,697 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 16:16:55,697 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911982403] [2020-12-09 16:16:55,697 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2036840489] [2020-12-09 16:16:55,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f3b1e071-9075-4a0f-b2e0-a3c1da29d57a/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 [2020-12-09 16:16:55,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 16:16:55,738 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 17 conjunts are in the unsatisfiable core [2020-12-09 16:16:55,740 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 16:16:55,765 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 16:16:55,765 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 16:16:55,823 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 16:16:55,824 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [101162149] [2020-12-09 16:16:55,825 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2020-12-09 16:16:55,825 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 16:16:55,825 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-12-09 16:16:55,826 INFO L176 IcfgInterpreter]: Starting interpretation [2020-12-09 16:16:55,826 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-12-09 16:16:56,068 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 16:16:56,090 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 16:16:56,289 INFO L180 IcfgInterpreter]: Interpretation finished [2020-12-09 16:16:56,964 WARN L197 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 86 [2020-12-09 16:16:57,185 WARN L197 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 88 [2020-12-09 16:16:57,439 WARN L197 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 98 [2020-12-09 16:16:57,694 WARN L197 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 88 [2020-12-09 16:16:58,025 WARN L197 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 93 [2020-12-09 16:16:58,339 WARN L197 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 103 [2020-12-09 16:16:58,647 WARN L197 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 98 [2020-12-09 16:16:58,955 WARN L197 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 95 [2020-12-09 16:16:59,277 WARN L197 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 96 [2020-12-09 16:16:59,277 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2020-12-09 16:16:59,278 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [7, 6, 6] total 26 [2020-12-09 16:16:59,278 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835242596] [2020-12-09 16:16:59,278 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-12-09 16:16:59,279 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 16:16:59,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-12-09 16:16:59,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=618, Unknown=0, NotChecked=0, Total=756 [2020-12-09 16:16:59,279 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 16 states. [2020-12-09 16:16:59,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 16:16:59,430 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2020-12-09 16:16:59,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-12-09 16:16:59,431 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 19 [2020-12-09 16:16:59,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 16:16:59,431 INFO L225 Difference]: With dead ends: 41 [2020-12-09 16:16:59,431 INFO L226 Difference]: Without dead ends: 30 [2020-12-09 16:16:59,431 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=138, Invalid=618, Unknown=0, NotChecked=0, Total=756 [2020-12-09 16:16:59,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-12-09 16:16:59,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2020-12-09 16:16:59,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-12-09 16:16:59,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2020-12-09 16:16:59,432 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 19 [2020-12-09 16:16:59,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 16:16:59,433 INFO L481 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2020-12-09 16:16:59,433 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-12-09 16:16:59,433 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2020-12-09 16:16:59,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-12-09 16:16:59,433 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 16:16:59,433 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 16:16:59,634 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 16:16:59,635 INFO L429 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]=== [2020-12-09 16:16:59,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 16:16:59,636 INFO L82 PathProgramCache]: Analyzing trace with hash -1668513865, now seen corresponding path program 1 times [2020-12-09 16:16:59,636 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 16:16:59,636 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871950119] [2020-12-09 16:16:59,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 16:16:59,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 16:16:59,726 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 16:16:59,726 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871950119] [2020-12-09 16:16:59,726 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1657460309] [2020-12-09 16:16:59,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f3b1e071-9075-4a0f-b2e0-a3c1da29d57a/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 [2020-12-09 16:16:59,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 16:16:59,773 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 22 conjunts are in the unsatisfiable core [2020-12-09 16:16:59,775 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 16:16:59,881 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 16:16:59,881 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 16:16:59,971 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 16:16:59,972 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1327855093] [2020-12-09 16:16:59,973 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2020-12-09 16:16:59,973 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 16:16:59,974 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-12-09 16:16:59,974 INFO L176 IcfgInterpreter]: Starting interpretation [2020-12-09 16:16:59,974 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-12-09 16:17:00,205 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 16:17:00,212 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 16:17:00,744 INFO L180 IcfgInterpreter]: Interpretation finished [2020-12-09 16:17:00,953 WARN L197 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 75 [2020-12-09 16:17:01,696 WARN L197 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 86 [2020-12-09 16:17:02,327 WARN L197 SmtUtils]: Spent 529.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 136 [2020-12-09 16:17:02,535 WARN L197 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 76 [2020-12-09 16:17:02,733 WARN L197 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 71 [2020-12-09 16:17:02,954 WARN L197 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 83 [2020-12-09 16:17:03,237 WARN L197 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 100 [2020-12-09 16:17:03,631 WARN L197 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 89 [2020-12-09 16:17:03,803 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-09 16:17:03,803 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 16:17:03,803 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 17 [2020-12-09 16:17:03,803 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183906635] [2020-12-09 16:17:03,803 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-12-09 16:17:03,804 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 16:17:03,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-12-09 16:17:03,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=1047, Unknown=0, NotChecked=0, Total=1190 [2020-12-09 16:17:03,804 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand 19 states. [2020-12-09 16:17:04,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 16:17:04,045 INFO L93 Difference]: Finished difference Result 47 states and 49 transitions. [2020-12-09 16:17:04,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-09 16:17:04,046 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 21 [2020-12-09 16:17:04,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 16:17:04,046 INFO L225 Difference]: With dead ends: 47 [2020-12-09 16:17:04,046 INFO L226 Difference]: Without dead ends: 47 [2020-12-09 16:17:04,047 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 505 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=221, Invalid=1501, Unknown=0, NotChecked=0, Total=1722 [2020-12-09 16:17:04,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2020-12-09 16:17:04,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 38. [2020-12-09 16:17:04,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2020-12-09 16:17:04,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2020-12-09 16:17:04,048 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 21 [2020-12-09 16:17:04,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 16:17:04,049 INFO L481 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2020-12-09 16:17:04,049 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-12-09 16:17:04,049 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2020-12-09 16:17:04,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-12-09 16:17:04,049 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 16:17:04,049 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 16:17:04,250 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable67 [2020-12-09 16:17:04,251 INFO L429 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]=== [2020-12-09 16:17:04,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 16:17:04,252 INFO L82 PathProgramCache]: Analyzing trace with hash -184322249, now seen corresponding path program 1 times [2020-12-09 16:17:04,252 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 16:17:04,252 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921168079] [2020-12-09 16:17:04,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 16:17:04,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 16:17:04,322 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 16:17:04,322 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921168079] [2020-12-09 16:17:04,322 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [152360501] [2020-12-09 16:17:04,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f3b1e071-9075-4a0f-b2e0-a3c1da29d57a/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 [2020-12-09 16:17:04,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 16:17:04,360 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 17 conjunts are in the unsatisfiable core [2020-12-09 16:17:04,361 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 16:17:04,395 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 16:17:04,395 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 16:17:04,459 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 16:17:04,459 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1615089263] [2020-12-09 16:17:04,460 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2020-12-09 16:17:04,460 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 16:17:04,460 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-12-09 16:17:04,461 INFO L176 IcfgInterpreter]: Starting interpretation [2020-12-09 16:17:04,461 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-12-09 16:17:04,663 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 16:17:04,669 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 16:17:05,114 INFO L180 IcfgInterpreter]: Interpretation finished [2020-12-09 16:17:05,382 WARN L197 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 87 [2020-12-09 16:17:06,092 WARN L197 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 86 [2020-12-09 16:17:06,712 WARN L197 SmtUtils]: Spent 527.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 136 [2020-12-09 16:17:06,916 WARN L197 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 76 [2020-12-09 16:17:07,152 WARN L197 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 71 [2020-12-09 16:17:07,391 WARN L197 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 83 [2020-12-09 16:17:07,678 WARN L197 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 100 [2020-12-09 16:17:08,077 WARN L197 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 89 [2020-12-09 16:17:08,245 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-09 16:17:08,246 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 16:17:08,246 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 13 [2020-12-09 16:17:08,246 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495500128] [2020-12-09 16:17:08,246 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-12-09 16:17:08,246 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 16:17:08,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-12-09 16:17:08,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=740, Unknown=0, NotChecked=0, Total=870 [2020-12-09 16:17:08,247 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand 14 states. [2020-12-09 16:17:08,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 16:17:08,423 INFO L93 Difference]: Finished difference Result 45 states and 47 transitions. [2020-12-09 16:17:08,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-09 16:17:08,424 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-12-09 16:17:08,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 16:17:08,424 INFO L225 Difference]: With dead ends: 45 [2020-12-09 16:17:08,424 INFO L226 Difference]: Without dead ends: 42 [2020-12-09 16:17:08,424 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 343 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=186, Invalid=1074, Unknown=0, NotChecked=0, Total=1260 [2020-12-09 16:17:08,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-12-09 16:17:08,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 37. [2020-12-09 16:17:08,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-12-09 16:17:08,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2020-12-09 16:17:08,426 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 22 [2020-12-09 16:17:08,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 16:17:08,426 INFO L481 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2020-12-09 16:17:08,426 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-12-09 16:17:08,426 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2020-12-09 16:17:08,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-12-09 16:17:08,426 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 16:17:08,427 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 16:17:08,627 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable118,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 16:17:08,628 INFO L429 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]=== [2020-12-09 16:17:08,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 16:17:08,629 INFO L82 PathProgramCache]: Analyzing trace with hash 976821529, now seen corresponding path program 2 times [2020-12-09 16:17:08,630 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 16:17:08,630 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696470737] [2020-12-09 16:17:08,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 16:17:08,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 16:17:08,827 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 16:17:08,827 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696470737] [2020-12-09 16:17:08,827 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1786981071] [2020-12-09 16:17:08,827 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f3b1e071-9075-4a0f-b2e0-a3c1da29d57a/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 [2020-12-09 16:17:08,879 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2020-12-09 16:17:08,880 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-09 16:17:08,881 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 31 conjunts are in the unsatisfiable core [2020-12-09 16:17:08,885 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 16:17:09,179 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 16:17:09,180 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 16:17:09,831 WARN L838 $PredicateComparison]: unable to prove that (forall ((ULTIMATE.start_main_~length2~0 Int) (ULTIMATE.start_main_~nondetString2~0.offset Int)) (= (select (select (store |c_#memory_int| c_ULTIMATE.start_main_~nondetString2~0.base (store (select |c_#memory_int| c_ULTIMATE.start_main_~nondetString2~0.base) (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset (- 1)) 0)) c_ULTIMATE.start_main_~nondetString1~0.base) (+ c_ULTIMATE.start_main_~nondetString1~0.offset 1)) 0)) is different from false [2020-12-09 16:17:09,935 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 16:17:09,935 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1606397829] [2020-12-09 16:17:09,936 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2020-12-09 16:17:09,936 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 16:17:09,937 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-12-09 16:17:09,937 INFO L176 IcfgInterpreter]: Starting interpretation [2020-12-09 16:17:09,937 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-12-09 16:17:10,173 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 16:17:10,186 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 16:17:10,603 INFO L180 IcfgInterpreter]: Interpretation finished [2020-12-09 16:17:10,847 WARN L197 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 75 [2020-12-09 16:17:11,732 WARN L197 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 86 [2020-12-09 16:17:12,455 WARN L197 SmtUtils]: Spent 563.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 136 [2020-12-09 16:17:12,678 WARN L197 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 76 [2020-12-09 16:17:12,913 WARN L197 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 71 [2020-12-09 16:17:13,176 WARN L197 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 83 [2020-12-09 16:17:13,503 WARN L197 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 100 [2020-12-09 16:17:13,971 WARN L197 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 89 [2020-12-09 16:17:14,198 WARN L197 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2020-12-09 16:17:14,199 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-09 16:17:14,200 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 16:17:14,200 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 25 [2020-12-09 16:17:14,200 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731162928] [2020-12-09 16:17:14,200 INFO L461 AbstractCegarLoop]: Interpolant automaton has 26 states [2020-12-09 16:17:14,200 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 16:17:14,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2020-12-09 16:17:14,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=1497, Unknown=1, NotChecked=78, Total=1722 [2020-12-09 16:17:14,201 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand 26 states. [2020-12-09 16:17:14,941 WARN L197 SmtUtils]: Spent 515.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 24 [2020-12-09 16:17:15,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 16:17:15,189 INFO L93 Difference]: Finished difference Result 62 states and 65 transitions. [2020-12-09 16:17:15,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-12-09 16:17:15,189 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 29 [2020-12-09 16:17:15,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 16:17:15,189 INFO L225 Difference]: With dead ends: 62 [2020-12-09 16:17:15,189 INFO L226 Difference]: Without dead ends: 40 [2020-12-09 16:17:15,190 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 553 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=257, Invalid=2098, Unknown=1, NotChecked=94, Total=2450 [2020-12-09 16:17:15,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2020-12-09 16:17:15,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2020-12-09 16:17:15,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-12-09 16:17:15,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2020-12-09 16:17:15,191 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 29 [2020-12-09 16:17:15,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 16:17:15,192 INFO L481 AbstractCegarLoop]: Abstraction has 39 states and 41 transitions. [2020-12-09 16:17:15,192 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2020-12-09 16:17:15,192 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2020-12-09 16:17:15,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-12-09 16:17:15,193 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 16:17:15,193 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 16:17:15,393 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable169 [2020-12-09 16:17:15,394 INFO L429 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]=== [2020-12-09 16:17:15,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 16:17:15,395 INFO L82 PathProgramCache]: Analyzing trace with hash -166822874, now seen corresponding path program 3 times [2020-12-09 16:17:15,395 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 16:17:15,396 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338740093] [2020-12-09 16:17:15,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 16:17:15,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 16:17:15,478 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 16:17:15,478 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338740093] [2020-12-09 16:17:15,478 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [158009509] [2020-12-09 16:17:15,478 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f3b1e071-9075-4a0f-b2e0-a3c1da29d57a/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 [2020-12-09 16:17:15,523 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-12-09 16:17:15,523 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-09 16:17:15,524 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 25 conjunts are in the unsatisfiable core [2020-12-09 16:17:15,526 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 16:17:15,681 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 16:17:15,682 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 16:17:15,839 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 16:17:15,839 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [61756610] [2020-12-09 16:17:15,841 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2020-12-09 16:17:15,841 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 16:17:15,842 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-12-09 16:17:15,842 INFO L176 IcfgInterpreter]: Starting interpretation [2020-12-09 16:17:15,842 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-12-09 16:17:16,080 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 16:17:16,085 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 16:17:16,546 INFO L180 IcfgInterpreter]: Interpretation finished [2020-12-09 16:17:16,757 WARN L197 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 75 [2020-12-09 16:17:17,572 WARN L197 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 86 [2020-12-09 16:17:18,286 WARN L197 SmtUtils]: Spent 559.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 136 [2020-12-09 16:17:18,515 WARN L197 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 76 [2020-12-09 16:17:18,752 WARN L197 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 71 [2020-12-09 16:17:19,014 WARN L197 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 83 [2020-12-09 16:17:19,347 WARN L197 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 100 [2020-12-09 16:17:19,795 WARN L197 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 89 [2020-12-09 16:17:20,001 WARN L197 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2020-12-09 16:17:20,002 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-09 16:17:20,002 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 16:17:20,002 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 22 [2020-12-09 16:17:20,002 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957786033] [2020-12-09 16:17:20,003 INFO L461 AbstractCegarLoop]: Interpolant automaton has 24 states [2020-12-09 16:17:20,003 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 16:17:20,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2020-12-09 16:17:20,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=1395, Unknown=0, NotChecked=0, Total=1560 [2020-12-09 16:17:20,004 INFO L87 Difference]: Start difference. First operand 39 states and 41 transitions. Second operand 24 states. [2020-12-09 16:17:20,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 16:17:20,286 INFO L93 Difference]: Finished difference Result 56 states and 58 transitions. [2020-12-09 16:17:20,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-09 16:17:20,286 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 31 [2020-12-09 16:17:20,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 16:17:20,287 INFO L225 Difference]: With dead ends: 56 [2020-12-09 16:17:20,287 INFO L226 Difference]: Without dead ends: 56 [2020-12-09 16:17:20,288 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 548 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=264, Invalid=1898, Unknown=0, NotChecked=0, Total=2162 [2020-12-09 16:17:20,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2020-12-09 16:17:20,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 48. [2020-12-09 16:17:20,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-12-09 16:17:20,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 51 transitions. [2020-12-09 16:17:20,289 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 51 transitions. Word has length 31 [2020-12-09 16:17:20,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 16:17:20,289 INFO L481 AbstractCegarLoop]: Abstraction has 48 states and 51 transitions. [2020-12-09 16:17:20,289 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2020-12-09 16:17:20,289 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 51 transitions. [2020-12-09 16:17:20,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-12-09 16:17:20,289 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 16:17:20,289 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 16:17:20,490 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable218 [2020-12-09 16:17:20,491 INFO L429 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]=== [2020-12-09 16:17:20,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 16:17:20,492 INFO L82 PathProgramCache]: Analyzing trace with hash -876541784, now seen corresponding path program 2 times [2020-12-09 16:17:20,492 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 16:17:20,492 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360783356] [2020-12-09 16:17:20,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 16:17:20,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 16:17:20,825 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-12-09 16:17:20,825 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360783356] [2020-12-09 16:17:20,825 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [3569581] [2020-12-09 16:17:20,825 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f3b1e071-9075-4a0f-b2e0-a3c1da29d57a/bin/utaipan/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 16:17:20,880 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2020-12-09 16:17:20,880 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-09 16:17:20,881 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 31 conjunts are in the unsatisfiable core [2020-12-09 16:17:20,883 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 16:17:21,157 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-12-09 16:17:21,157 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 16:17:21,353 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: incompatible size [2020-12-09 16:17:21,354 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [891746106] [2020-12-09 16:17:21,355 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2020-12-09 16:17:21,355 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 16:17:21,355 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-12-09 16:17:21,355 INFO L176 IcfgInterpreter]: Starting interpretation [2020-12-09 16:17:21,356 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-12-09 16:17:21,367 FATAL L? ?]: Ignoring exception! java.lang.IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@6a32f3a1 at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.lock(ManagedScript.java:81) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker.assertLhs(IncrementalPlicationChecker.java:103) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker.checkPlication(IncrementalPlicationChecker.java:135) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.ArrayIndexEqualityManager.(ArrayIndexEqualityManager.java:92) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.computeCostEstimation(ElimStorePlain.java:568) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:441) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:239) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:313) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.quantifier(PartialQuantifierElimination.java:153) 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:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-09 16:17:21,368 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-12-09 16:17:21,368 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-12-09 16:17:21,369 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803303919] [2020-12-09 16:17:21,369 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-12-09 16:17:21,369 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 16:17:21,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-12-09 16:17:21,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=717, Unknown=0, NotChecked=0, Total=812 [2020-12-09 16:17:21,370 INFO L87 Difference]: Start difference. First operand 48 states and 51 transitions. Second operand 14 states. [2020-12-09 16:17:21,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-12-09 16:17:21,571 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable269,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 16:17:21,572 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.smtlibutils.IncrementalPlicationChecker@6a32f3a1 at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.lock(ManagedScript.java:81) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.assertCodeBlock(IncrementalHoareTripleChecker.java:356) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.prepareAssertionStackAndAddTransition(IncrementalHoareTripleChecker.java:204) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.checkInternal(IncrementalHoareTripleChecker.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ProtectiveHoareTripleChecker.checkInternal(ProtectiveHoareTripleChecker.java:61) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.EfficientHoareTripleChecker.checkInternal(EfficientHoareTripleChecker.java:63) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.CachingHoareTripleChecker.checkInternal(CachingHoareTripleChecker.java:97) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$InternalSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:357) 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:233) 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:1064) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:966) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:187) 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:743) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:674) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:473) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-09 16:17:21,578 INFO L168 Benchmark]: Toolchain (without parser) took 31893.95 ms. Allocated memory was 92.3 MB in the beginning and 111.1 MB in the end (delta: 18.9 MB). Free memory was 68.8 MB in the beginning and 58.0 MB in the end (delta: 10.9 MB). Peak memory consumption was 31.4 MB. Max. memory is 16.1 GB. [2020-12-09 16:17:21,578 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 67.1 MB. Free memory is still 41.8 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-12-09 16:17:21,579 INFO L168 Benchmark]: CACSL2BoogieTranslator took 334.47 ms. Allocated memory is still 92.3 MB. Free memory was 68.6 MB in the beginning and 47.6 MB in the end (delta: 21.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.1 GB. [2020-12-09 16:17:21,580 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.88 ms. Allocated memory is still 92.3 MB. Free memory was 47.6 MB in the beginning and 46.0 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-09 16:17:21,581 INFO L168 Benchmark]: Boogie Preprocessor took 27.88 ms. Allocated memory is still 92.3 MB. Free memory was 46.0 MB in the beginning and 44.4 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-09 16:17:21,581 INFO L168 Benchmark]: RCFGBuilder took 438.58 ms. Allocated memory is still 92.3 MB. Free memory was 44.4 MB in the beginning and 35.7 MB in the end (delta: 8.7 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2020-12-09 16:17:21,582 INFO L168 Benchmark]: TraceAbstraction took 31048.62 ms. Allocated memory was 92.3 MB in the beginning and 111.1 MB in the end (delta: 18.9 MB). Free memory was 35.1 MB in the beginning and 58.0 MB in the end (delta: -22.9 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-09 16:17:21,587 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 67.1 MB. Free memory is still 41.8 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 334.47 ms. Allocated memory is still 92.3 MB. Free memory was 68.6 MB in the beginning and 47.6 MB in the end (delta: 21.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 39.88 ms. Allocated memory is still 92.3 MB. Free memory was 47.6 MB in the beginning and 46.0 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 27.88 ms. Allocated memory is still 92.3 MB. Free memory was 46.0 MB in the beginning and 44.4 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 438.58 ms. Allocated memory is still 92.3 MB. Free memory was 44.4 MB in the beginning and 35.7 MB in the end (delta: 8.7 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * TraceAbstraction took 31048.62 ms. Allocated memory was 92.3 MB in the beginning and 111.1 MB in the end (delta: 18.9 MB). Free memory was 35.1 MB in the beginning and 58.0 MB in the end (delta: -22.9 MB). There was no memory consumed. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@6a32f3a1 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@6a32f3a1: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.lock(ManagedScript.java:81) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.2.0-7b2dab5 [2020-12-09 16:17:23,114 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-09 16:17:23,116 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-09 16:17:23,137 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-09 16:17:23,138 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-09 16:17:23,139 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-09 16:17:23,140 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-09 16:17:23,142 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-09 16:17:23,143 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-09 16:17:23,144 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-09 16:17:23,145 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-09 16:17:23,146 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-09 16:17:23,146 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-09 16:17:23,147 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-09 16:17:23,148 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-09 16:17:23,149 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-09 16:17:23,150 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-09 16:17:23,151 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-09 16:17:23,152 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-09 16:17:23,154 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-09 16:17:23,155 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-09 16:17:23,156 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-09 16:17:23,157 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-09 16:17:23,158 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-09 16:17:23,160 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-09 16:17:23,161 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-09 16:17:23,161 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-09 16:17:23,162 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-09 16:17:23,162 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-09 16:17:23,163 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-09 16:17:23,163 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-09 16:17:23,164 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-09 16:17:23,165 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-09 16:17:23,165 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-09 16:17:23,166 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-09 16:17:23,166 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-09 16:17:23,167 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-09 16:17:23,167 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-09 16:17:23,167 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-09 16:17:23,168 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-09 16:17:23,168 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-09 16:17:23,169 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_f3b1e071-9075-4a0f-b2e0-a3c1da29d57a/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2020-12-09 16:17:23,186 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-09 16:17:23,186 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-09 16:17:23,187 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2020-12-09 16:17:23,187 INFO L138 SettingsManager]: * User list type=DISABLED [2020-12-09 16:17:23,188 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2020-12-09 16:17:23,188 INFO L138 SettingsManager]: * Explicit value domain=true [2020-12-09 16:17:23,188 INFO L138 SettingsManager]: * Octagon Domain=false [2020-12-09 16:17:23,188 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2020-12-09 16:17:23,188 INFO L138 SettingsManager]: * Interval Domain=false [2020-12-09 16:17:23,189 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-09 16:17:23,189 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-09 16:17:23,189 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-09 16:17:23,190 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-09 16:17:23,190 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-12-09 16:17:23,190 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-09 16:17:23,190 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-09 16:17:23,190 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-09 16:17:23,190 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2020-12-09 16:17:23,191 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2020-12-09 16:17:23,191 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2020-12-09 16:17:23,191 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-09 16:17:23,191 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-12-09 16:17:23,191 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2020-12-09 16:17:23,191 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2020-12-09 16:17:23,192 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-09 16:17:23,192 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-09 16:17:23,192 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-09 16:17:23,192 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-09 16:17:23,192 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-09 16:17:23,197 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-09 16:17:23,197 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-09 16:17:23,197 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-09 16:17:23,197 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2020-12-09 16:17:23,198 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2020-12-09 16:17:23,198 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-09 16:17:23,198 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-12-09 16:17:23,198 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud-vcloud-master/worker/run_dir_f3b1e071-9075-4a0f-b2e0-a3c1da29d57a/bin/utaipan/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_f3b1e071-9075-4a0f-b2e0-a3c1da29d57a/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 -> 2d5a995d825785bc5dc95f3825623b1e4ecd07fe [2020-12-09 16:17:23,412 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-09 16:17:23,428 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-09 16:17:23,430 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-09 16:17:23,431 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-09 16:17:23,431 INFO L275 PluginConnector]: CDTParser initialized [2020-12-09 16:17:23,432 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_f3b1e071-9075-4a0f-b2e0-a3c1da29d57a/bin/utaipan/../../sv-benchmarks/c/array-memsafety/cstrncmp-alloca-1.i [2020-12-09 16:17:23,473 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_f3b1e071-9075-4a0f-b2e0-a3c1da29d57a/bin/utaipan/data/13b18ac92/d20ff8b2b6754ce5ad12f1561520bd65/FLAG39b6f0d86 [2020-12-09 16:17:23,905 INFO L306 CDTParser]: Found 1 translation units. [2020-12-09 16:17:23,906 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_f3b1e071-9075-4a0f-b2e0-a3c1da29d57a/sv-benchmarks/c/array-memsafety/cstrncmp-alloca-1.i [2020-12-09 16:17:23,920 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_f3b1e071-9075-4a0f-b2e0-a3c1da29d57a/bin/utaipan/data/13b18ac92/d20ff8b2b6754ce5ad12f1561520bd65/FLAG39b6f0d86 [2020-12-09 16:17:23,930 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_f3b1e071-9075-4a0f-b2e0-a3c1da29d57a/bin/utaipan/data/13b18ac92/d20ff8b2b6754ce5ad12f1561520bd65 [2020-12-09 16:17:23,932 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-09 16:17:23,934 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-09 16:17:23,935 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-09 16:17:23,935 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-09 16:17:23,937 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-09 16:17:23,938 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 04:17:23" (1/1) ... [2020-12-09 16:17:23,939 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ff7c5ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:17:23, skipping insertion in model container [2020-12-09 16:17:23,940 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 04:17:23" (1/1) ... [2020-12-09 16:17:23,945 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-09 16:17:23,976 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-09 16:17:24,186 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 16:17:24,203 INFO L203 MainTranslator]: Completed pre-run [2020-12-09 16:17:24,240 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 16:17:24,278 INFO L208 MainTranslator]: Completed translation [2020-12-09 16:17:24,278 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:17:24 WrapperNode [2020-12-09 16:17:24,278 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-09 16:17:24,279 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-09 16:17:24,279 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-09 16:17:24,279 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-09 16:17:24,285 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:17:24" (1/1) ... [2020-12-09 16:17:24,298 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:17:24" (1/1) ... [2020-12-09 16:17:24,314 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-09 16:17:24,315 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-09 16:17:24,315 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-09 16:17:24,315 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-09 16:17:24,321 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:17:24" (1/1) ... [2020-12-09 16:17:24,321 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:17:24" (1/1) ... [2020-12-09 16:17:24,325 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:17:24" (1/1) ... [2020-12-09 16:17:24,325 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:17:24" (1/1) ... [2020-12-09 16:17:24,331 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:17:24" (1/1) ... [2020-12-09 16:17:24,335 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:17:24" (1/1) ... [2020-12-09 16:17:24,336 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:17:24" (1/1) ... [2020-12-09 16:17:24,339 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-09 16:17:24,339 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-09 16:17:24,340 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-09 16:17:24,340 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-09 16:17:24,340 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:17:24" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f3b1e071-9075-4a0f-b2e0-a3c1da29d57a/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-09 16:17:24,399 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2020-12-09 16:17:24,399 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-09 16:17:24,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2020-12-09 16:17:24,400 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-12-09 16:17:24,400 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-09 16:17:24,400 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-09 16:17:24,748 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-09 16:17:24,748 INFO L299 CfgBuilder]: Removed 9 assume(true) statements. [2020-12-09 16:17:24,749 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 04:17:24 BoogieIcfgContainer [2020-12-09 16:17:24,750 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-09 16:17:24,751 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-09 16:17:24,751 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-09 16:17:24,753 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-09 16:17:24,753 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 04:17:23" (1/3) ... [2020-12-09 16:17:24,753 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a5ff494 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 04:17:24, skipping insertion in model container [2020-12-09 16:17:24,754 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:17:24" (2/3) ... [2020-12-09 16:17:24,754 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a5ff494 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 04:17:24, skipping insertion in model container [2020-12-09 16:17:24,754 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 04:17:24" (3/3) ... [2020-12-09 16:17:24,755 INFO L111 eAbstractionObserver]: Analyzing ICFG cstrncmp-alloca-1.i [2020-12-09 16:17:24,764 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-09 16:17:24,767 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 19 error locations. [2020-12-09 16:17:24,775 INFO L253 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2020-12-09 16:17:24,788 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-09 16:17:24,789 INFO L378 AbstractCegarLoop]: Hoare is false [2020-12-09 16:17:24,789 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-09 16:17:24,789 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-09 16:17:24,789 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-09 16:17:24,789 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-09 16:17:24,789 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-09 16:17:24,789 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-09 16:17:24,799 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states. [2020-12-09 16:17:24,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-12-09 16:17:24,803 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 16:17:24,804 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-12-09 16:17:24,804 INFO L429 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]=== [2020-12-09 16:17:24,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 16:17:24,808 INFO L82 PathProgramCache]: Analyzing trace with hash 1805029096, now seen corresponding path program 1 times [2020-12-09 16:17:24,816 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 16:17:24,816 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1509053120] [2020-12-09 16:17:24,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f3b1e071-9075-4a0f-b2e0-a3c1da29d57a/bin/utaipan/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2020-12-09 16:17:24,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 16:17:24,873 INFO L263 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-09 16:17:24,877 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 16:17:24,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 16:17:24,934 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 16:17:24,934 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1509053120] [2020-12-09 16:17:24,935 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 16:17:24,935 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 16:17:24,936 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447078416] [2020-12-09 16:17:24,940 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 16:17:24,941 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 16:17:24,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 16:17:24,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-09 16:17:24,953 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 4 states. [2020-12-09 16:17:25,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 16:17:25,015 INFO L93 Difference]: Finished difference Result 106 states and 122 transitions. [2020-12-09 16:17:25,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 16:17:25,017 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2020-12-09 16:17:25,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 16:17:25,025 INFO L225 Difference]: With dead ends: 106 [2020-12-09 16:17:25,026 INFO L226 Difference]: Without dead ends: 102 [2020-12-09 16:17:25,027 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-09 16:17:25,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2020-12-09 16:17:25,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 58. [2020-12-09 16:17:25,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2020-12-09 16:17:25,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 68 transitions. [2020-12-09 16:17:25,058 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 68 transitions. Word has length 7 [2020-12-09 16:17:25,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 16:17:25,058 INFO L481 AbstractCegarLoop]: Abstraction has 58 states and 68 transitions. [2020-12-09 16:17:25,058 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 16:17:25,059 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 68 transitions. [2020-12-09 16:17:25,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-12-09 16:17:25,059 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 16:17:25,059 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-12-09 16:17:25,260 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2020-12-09 16:17:25,261 INFO L429 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]=== [2020-12-09 16:17:25,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 16:17:25,264 INFO L82 PathProgramCache]: Analyzing trace with hash 1806876138, now seen corresponding path program 1 times [2020-12-09 16:17:25,266 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 16:17:25,267 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1702943574] [2020-12-09 16:17:25,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f3b1e071-9075-4a0f-b2e0-a3c1da29d57a/bin/utaipan/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2020-12-09 16:17:25,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 16:17:25,416 INFO L263 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-09 16:17:25,418 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 16:17:25,515 INFO L348 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2020-12-09 16:17:25,515 INFO L382 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 [2020-12-09 16:17:25,518 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 16:17:25,523 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 16:17:25,527 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-09 16:17:25,527 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:9, output treesize:13 [2020-12-09 16:17:25,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 16:17:25,538 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 16:17:25,538 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1702943574] [2020-12-09 16:17:25,539 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 16:17:25,539 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 16:17:25,539 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974630317] [2020-12-09 16:17:25,540 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 16:17:25,540 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 16:17:25,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 16:17:25,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 16:17:25,541 INFO L87 Difference]: Start difference. First operand 58 states and 68 transitions. Second operand 3 states. [2020-12-09 16:17:25,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 16:17:25,624 INFO L93 Difference]: Finished difference Result 56 states and 66 transitions. [2020-12-09 16:17:25,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 16:17:25,624 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-12-09 16:17:25,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 16:17:25,625 INFO L225 Difference]: With dead ends: 56 [2020-12-09 16:17:25,625 INFO L226 Difference]: Without dead ends: 56 [2020-12-09 16:17:25,626 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 16:17:25,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2020-12-09 16:17:25,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2020-12-09 16:17:25,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-12-09 16:17:25,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 66 transitions. [2020-12-09 16:17:25,633 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 66 transitions. Word has length 7 [2020-12-09 16:17:25,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 16:17:25,633 INFO L481 AbstractCegarLoop]: Abstraction has 56 states and 66 transitions. [2020-12-09 16:17:25,633 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 16:17:25,633 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 66 transitions. [2020-12-09 16:17:25,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-12-09 16:17:25,634 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 16:17:25,634 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-12-09 16:17:25,834 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2020-12-09 16:17:25,836 INFO L429 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]=== [2020-12-09 16:17:25,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 16:17:25,839 INFO L82 PathProgramCache]: Analyzing trace with hash 1806876139, now seen corresponding path program 1 times [2020-12-09 16:17:25,841 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 16:17:25,842 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1846735572] [2020-12-09 16:17:25,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f3b1e071-9075-4a0f-b2e0-a3c1da29d57a/bin/utaipan/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2020-12-09 16:17:25,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 16:17:25,969 INFO L263 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 8 conjunts are in the unsatisfiable core [2020-12-09 16:17:25,971 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 16:17:25,998 INFO L443 ElimStorePlain]: Different costs {0=[|v_#length_22|], 1=[|v_#valid_31|]} [2020-12-09 16:17:26,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 16:17:26,004 INFO L382 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 [2020-12-09 16:17:26,005 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 16:17:26,021 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 16:17:26,029 INFO L382 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 [2020-12-09 16:17:26,031 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 16:17:26,046 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 16:17:26,051 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 16:17:26,052 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:28, output treesize:13 [2020-12-09 16:17:26,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 16:17:26,065 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 16:17:26,065 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1846735572] [2020-12-09 16:17:26,065 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 16:17:26,065 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 16:17:26,065 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778103439] [2020-12-09 16:17:26,066 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 16:17:26,066 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 16:17:26,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 16:17:26,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 16:17:26,066 INFO L87 Difference]: Start difference. First operand 56 states and 66 transitions. Second operand 4 states. [2020-12-09 16:17:26,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 16:17:26,260 INFO L93 Difference]: Finished difference Result 103 states and 120 transitions. [2020-12-09 16:17:26,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 16:17:26,260 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2020-12-09 16:17:26,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 16:17:26,262 INFO L225 Difference]: With dead ends: 103 [2020-12-09 16:17:26,262 INFO L226 Difference]: Without dead ends: 103 [2020-12-09 16:17:26,262 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-09 16:17:26,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2020-12-09 16:17:26,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 58. [2020-12-09 16:17:26,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2020-12-09 16:17:26,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 69 transitions. [2020-12-09 16:17:26,269 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 69 transitions. Word has length 7 [2020-12-09 16:17:26,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 16:17:26,269 INFO L481 AbstractCegarLoop]: Abstraction has 58 states and 69 transitions. [2020-12-09 16:17:26,269 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 16:17:26,269 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 69 transitions. [2020-12-09 16:17:26,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-12-09 16:17:26,270 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 16:17:26,270 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 16:17:26,470 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2020-12-09 16:17:26,471 INFO L429 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]=== [2020-12-09 16:17:26,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 16:17:26,474 INFO L82 PathProgramCache]: Analyzing trace with hash -533876960, now seen corresponding path program 1 times [2020-12-09 16:17:26,476 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 16:17:26,477 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1085686285] [2020-12-09 16:17:26,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f3b1e071-9075-4a0f-b2e0-a3c1da29d57a/bin/utaipan/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2020-12-09 16:17:26,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 16:17:26,546 INFO L263 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 7 conjunts are in the unsatisfiable core [2020-12-09 16:17:26,547 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 16:17:26,576 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 16:17:26,576 INFO L382 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 [2020-12-09 16:17:26,579 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 16:17:26,597 INFO L625 ElimStorePlain]: treesize reduction 14, result has 57.6 percent of original size [2020-12-09 16:17:26,599 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-09 16:17:26,599 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:19 [2020-12-09 16:17:26,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 16:17:26,623 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 16:17:26,623 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1085686285] [2020-12-09 16:17:26,623 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 16:17:26,623 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 16:17:26,623 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406607095] [2020-12-09 16:17:26,624 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 16:17:26,624 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 16:17:26,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 16:17:26,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-09 16:17:26,624 INFO L87 Difference]: Start difference. First operand 58 states and 69 transitions. Second operand 5 states. [2020-12-09 16:17:26,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 16:17:26,867 INFO L93 Difference]: Finished difference Result 144 states and 167 transitions. [2020-12-09 16:17:26,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-09 16:17:26,868 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2020-12-09 16:17:26,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 16:17:26,869 INFO L225 Difference]: With dead ends: 144 [2020-12-09 16:17:26,869 INFO L226 Difference]: Without dead ends: 144 [2020-12-09 16:17:26,869 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2020-12-09 16:17:26,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2020-12-09 16:17:26,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 64. [2020-12-09 16:17:26,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2020-12-09 16:17:26,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 78 transitions. [2020-12-09 16:17:26,874 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 78 transitions. Word has length 9 [2020-12-09 16:17:26,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 16:17:26,874 INFO L481 AbstractCegarLoop]: Abstraction has 64 states and 78 transitions. [2020-12-09 16:17:26,874 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 16:17:26,874 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 78 transitions. [2020-12-09 16:17:26,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-12-09 16:17:26,875 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 16:17:26,875 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 16:17:27,076 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2020-12-09 16:17:27,077 INFO L429 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]=== [2020-12-09 16:17:27,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 16:17:27,078 INFO L82 PathProgramCache]: Analyzing trace with hash -533876908, now seen corresponding path program 1 times [2020-12-09 16:17:27,079 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 16:17:27,080 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1214751007] [2020-12-09 16:17:27,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f3b1e071-9075-4a0f-b2e0-a3c1da29d57a/bin/utaipan/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2020-12-09 16:17:27,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 16:17:27,164 INFO L263 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-09 16:17:27,165 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 16:17:27,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 16:17:27,180 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 16:17:27,180 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1214751007] [2020-12-09 16:17:27,180 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 16:17:27,180 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 16:17:27,180 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633071092] [2020-12-09 16:17:27,180 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 16:17:27,181 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 16:17:27,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 16:17:27,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-09 16:17:27,181 INFO L87 Difference]: Start difference. First operand 64 states and 78 transitions. Second operand 4 states. [2020-12-09 16:17:27,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 16:17:27,224 INFO L93 Difference]: Finished difference Result 115 states and 136 transitions. [2020-12-09 16:17:27,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 16:17:27,225 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2020-12-09 16:17:27,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 16:17:27,226 INFO L225 Difference]: With dead ends: 115 [2020-12-09 16:17:27,226 INFO L226 Difference]: Without dead ends: 115 [2020-12-09 16:17:27,226 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-09 16:17:27,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2020-12-09 16:17:27,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 77. [2020-12-09 16:17:27,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2020-12-09 16:17:27,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 94 transitions. [2020-12-09 16:17:27,231 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 94 transitions. Word has length 9 [2020-12-09 16:17:27,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 16:17:27,231 INFO L481 AbstractCegarLoop]: Abstraction has 77 states and 94 transitions. [2020-12-09 16:17:27,231 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 16:17:27,231 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 94 transitions. [2020-12-09 16:17:27,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-12-09 16:17:27,232 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 16:17:27,232 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 16:17:27,432 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2020-12-09 16:17:27,433 INFO L429 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]=== [2020-12-09 16:17:27,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 16:17:27,435 INFO L82 PathProgramCache]: Analyzing trace with hash -476618606, now seen corresponding path program 1 times [2020-12-09 16:17:27,436 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 16:17:27,436 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [15363936] [2020-12-09 16:17:27,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f3b1e071-9075-4a0f-b2e0-a3c1da29d57a/bin/utaipan/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2020-12-09 16:17:27,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 16:17:27,477 INFO L263 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-09 16:17:27,478 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 16:17:27,496 INFO L348 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2020-12-09 16:17:27,496 INFO L382 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 [2020-12-09 16:17:27,498 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 16:17:27,502 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 16:17:27,503 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-09 16:17:27,503 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:9, output treesize:15 [2020-12-09 16:17:27,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 16:17:27,513 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 16:17:27,514 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [15363936] [2020-12-09 16:17:27,514 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 16:17:27,514 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 16:17:27,514 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741390514] [2020-12-09 16:17:27,514 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 16:17:27,514 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 16:17:27,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 16:17:27,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 16:17:27,515 INFO L87 Difference]: Start difference. First operand 77 states and 94 transitions. Second operand 3 states. [2020-12-09 16:17:27,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 16:17:27,571 INFO L93 Difference]: Finished difference Result 75 states and 91 transitions. [2020-12-09 16:17:27,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 16:17:27,571 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-12-09 16:17:27,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 16:17:27,572 INFO L225 Difference]: With dead ends: 75 [2020-12-09 16:17:27,572 INFO L226 Difference]: Without dead ends: 75 [2020-12-09 16:17:27,572 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 16:17:27,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2020-12-09 16:17:27,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2020-12-09 16:17:27,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2020-12-09 16:17:27,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 91 transitions. [2020-12-09 16:17:27,576 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 91 transitions. Word has length 9 [2020-12-09 16:17:27,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 16:17:27,576 INFO L481 AbstractCegarLoop]: Abstraction has 75 states and 91 transitions. [2020-12-09 16:17:27,576 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 16:17:27,576 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 91 transitions. [2020-12-09 16:17:27,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-12-09 16:17:27,576 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 16:17:27,576 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 16:17:27,777 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2020-12-09 16:17:27,778 INFO L429 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]=== [2020-12-09 16:17:27,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 16:17:27,779 INFO L82 PathProgramCache]: Analyzing trace with hash -476618605, now seen corresponding path program 1 times [2020-12-09 16:17:27,780 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 16:17:27,781 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [599406440] [2020-12-09 16:17:27,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f3b1e071-9075-4a0f-b2e0-a3c1da29d57a/bin/utaipan/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2020-12-09 16:17:27,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 16:17:27,818 INFO L263 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 7 conjunts are in the unsatisfiable core [2020-12-09 16:17:27,818 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 16:17:27,846 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 16:17:27,847 INFO L382 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 [2020-12-09 16:17:27,848 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 16:17:27,874 INFO L625 ElimStorePlain]: treesize reduction 10, result has 68.8 percent of original size [2020-12-09 16:17:27,877 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 16:17:27,878 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:17, output treesize:10 [2020-12-09 16:17:27,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 16:17:27,901 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 16:17:27,902 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [599406440] [2020-12-09 16:17:27,902 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 16:17:27,902 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 16:17:27,902 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29628429] [2020-12-09 16:17:27,902 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 16:17:27,903 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 16:17:27,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 16:17:27,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-09 16:17:27,903 INFO L87 Difference]: Start difference. First operand 75 states and 91 transitions. Second operand 5 states. [2020-12-09 16:17:28,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 16:17:28,063 INFO L93 Difference]: Finished difference Result 119 states and 142 transitions. [2020-12-09 16:17:28,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 16:17:28,064 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2020-12-09 16:17:28,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 16:17:28,064 INFO L225 Difference]: With dead ends: 119 [2020-12-09 16:17:28,065 INFO L226 Difference]: Without dead ends: 119 [2020-12-09 16:17:28,065 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-12-09 16:17:28,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2020-12-09 16:17:28,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 79. [2020-12-09 16:17:28,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2020-12-09 16:17:28,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 97 transitions. [2020-12-09 16:17:28,069 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 97 transitions. Word has length 9 [2020-12-09 16:17:28,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 16:17:28,069 INFO L481 AbstractCegarLoop]: Abstraction has 79 states and 97 transitions. [2020-12-09 16:17:28,069 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 16:17:28,069 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 97 transitions. [2020-12-09 16:17:28,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-12-09 16:17:28,069 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 16:17:28,069 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 16:17:28,270 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2020-12-09 16:17:28,271 INFO L429 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]=== [2020-12-09 16:17:28,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 16:17:28,273 INFO L82 PathProgramCache]: Analyzing trace with hash 1241130402, now seen corresponding path program 1 times [2020-12-09 16:17:28,273 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 16:17:28,274 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1191921801] [2020-12-09 16:17:28,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f3b1e071-9075-4a0f-b2e0-a3c1da29d57a/bin/utaipan/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2020-12-09 16:17:28,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 16:17:28,393 INFO L263 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 9 conjunts are in the unsatisfiable core [2020-12-09 16:17:28,394 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 16:17:28,440 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 16:17:28,440 INFO L382 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 [2020-12-09 16:17:28,442 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 16:17:28,469 INFO L625 ElimStorePlain]: treesize reduction 10, result has 73.0 percent of original size [2020-12-09 16:17:28,470 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 16:17:28,473 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-09 16:17:28,473 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:27 [2020-12-09 16:17:28,475 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 16:17:28,500 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 16:17:28,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 16:17:28,555 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 16:17:28,555 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1191921801] [2020-12-09 16:17:28,555 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 16:17:28,556 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-09 16:17:28,556 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24891574] [2020-12-09 16:17:28,556 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-09 16:17:28,556 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 16:17:28,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-09 16:17:28,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-12-09 16:17:28,557 INFO L87 Difference]: Start difference. First operand 79 states and 97 transitions. Second operand 6 states. [2020-12-09 16:17:28,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 16:17:28,995 INFO L93 Difference]: Finished difference Result 154 states and 181 transitions. [2020-12-09 16:17:28,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-09 16:17:28,996 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2020-12-09 16:17:28,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 16:17:28,997 INFO L225 Difference]: With dead ends: 154 [2020-12-09 16:17:28,997 INFO L226 Difference]: Without dead ends: 154 [2020-12-09 16:17:28,997 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-12-09 16:17:28,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2020-12-09 16:17:29,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 79. [2020-12-09 16:17:29,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2020-12-09 16:17:29,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 97 transitions. [2020-12-09 16:17:29,003 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 97 transitions. Word has length 9 [2020-12-09 16:17:29,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 16:17:29,003 INFO L481 AbstractCegarLoop]: Abstraction has 79 states and 97 transitions. [2020-12-09 16:17:29,003 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-09 16:17:29,003 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 97 transitions. [2020-12-09 16:17:29,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-12-09 16:17:29,004 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 16:17:29,004 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 16:17:29,204 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2020-12-09 16:17:29,206 INFO L429 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]=== [2020-12-09 16:17:29,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 16:17:29,207 INFO L82 PathProgramCache]: Analyzing trace with hash 1298388704, now seen corresponding path program 1 times [2020-12-09 16:17:29,208 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 16:17:29,208 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1692879333] [2020-12-09 16:17:29,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f3b1e071-9075-4a0f-b2e0-a3c1da29d57a/bin/utaipan/mathsat Starting monitored process 10 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with mathsat -unsat_core_generation=3 [2020-12-09 16:17:29,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 16:17:29,340 INFO L263 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 11 conjunts are in the unsatisfiable core [2020-12-09 16:17:29,341 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 16:17:29,392 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 16:17:29,392 INFO L382 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 [2020-12-09 16:17:29,393 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 16:17:29,427 INFO L625 ElimStorePlain]: treesize reduction 10, result has 74.4 percent of original size [2020-12-09 16:17:29,428 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 16:17:29,429 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-09 16:17:29,429 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:29 [2020-12-09 16:17:29,430 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 16:17:29,452 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 16:17:29,580 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 1] term [2020-12-09 16:17:29,581 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 16:17:29,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 16:17:29,649 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 16:17:29,649 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1692879333] [2020-12-09 16:17:29,649 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 16:17:29,649 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-09 16:17:29,649 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577174850] [2020-12-09 16:17:29,649 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-09 16:17:29,650 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 16:17:29,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-09 16:17:29,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-12-09 16:17:29,650 INFO L87 Difference]: Start difference. First operand 79 states and 97 transitions. Second operand 8 states. [2020-12-09 16:17:29,895 WARN L197 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 31 [2020-12-09 16:17:30,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 16:17:30,390 INFO L93 Difference]: Finished difference Result 164 states and 194 transitions. [2020-12-09 16:17:30,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-09 16:17:30,391 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2020-12-09 16:17:30,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 16:17:30,392 INFO L225 Difference]: With dead ends: 164 [2020-12-09 16:17:30,392 INFO L226 Difference]: Without dead ends: 164 [2020-12-09 16:17:30,392 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2020-12-09 16:17:30,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2020-12-09 16:17:30,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 79. [2020-12-09 16:17:30,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2020-12-09 16:17:30,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 97 transitions. [2020-12-09 16:17:30,396 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 97 transitions. Word has length 9 [2020-12-09 16:17:30,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 16:17:30,397 INFO L481 AbstractCegarLoop]: Abstraction has 79 states and 97 transitions. [2020-12-09 16:17:30,397 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-09 16:17:30,397 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 97 transitions. [2020-12-09 16:17:30,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-12-09 16:17:30,397 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 16:17:30,397 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 16:17:30,598 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 mathsat -unsat_core_generation=3 [2020-12-09 16:17:30,599 INFO L429 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]=== [2020-12-09 16:17:30,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 16:17:30,600 INFO L82 PathProgramCache]: Analyzing trace with hash 629683418, now seen corresponding path program 1 times [2020-12-09 16:17:30,601 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 16:17:30,601 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [511331385] [2020-12-09 16:17:30,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f3b1e071-9075-4a0f-b2e0-a3c1da29d57a/bin/utaipan/mathsat Starting monitored process 11 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with mathsat -unsat_core_generation=3 [2020-12-09 16:17:30,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 16:17:30,705 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 6 conjunts are in the unsatisfiable core [2020-12-09 16:17:30,705 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 16:17:30,725 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 16:17:30,725 INFO L382 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 [2020-12-09 16:17:30,726 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 16:17:30,749 INFO L625 ElimStorePlain]: treesize reduction 10, result has 67.7 percent of original size [2020-12-09 16:17:30,751 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 16:17:30,751 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:16, output treesize:12 [2020-12-09 16:17:30,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 16:17:30,764 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 16:17:30,764 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [511331385] [2020-12-09 16:17:30,764 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 16:17:30,764 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 16:17:30,764 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255565619] [2020-12-09 16:17:30,765 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 16:17:30,765 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 16:17:30,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 16:17:30,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-09 16:17:30,765 INFO L87 Difference]: Start difference. First operand 79 states and 97 transitions. Second operand 4 states. [2020-12-09 16:17:30,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 16:17:30,829 INFO L93 Difference]: Finished difference Result 115 states and 137 transitions. [2020-12-09 16:17:30,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 16:17:30,830 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2020-12-09 16:17:30,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 16:17:30,830 INFO L225 Difference]: With dead ends: 115 [2020-12-09 16:17:30,830 INFO L226 Difference]: Without dead ends: 115 [2020-12-09 16:17:30,831 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-09 16:17:30,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2020-12-09 16:17:30,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 82. [2020-12-09 16:17:30,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2020-12-09 16:17:30,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 101 transitions. [2020-12-09 16:17:30,834 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 101 transitions. Word has length 10 [2020-12-09 16:17:30,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 16:17:30,834 INFO L481 AbstractCegarLoop]: Abstraction has 82 states and 101 transitions. [2020-12-09 16:17:30,834 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 16:17:30,834 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 101 transitions. [2020-12-09 16:17:30,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-12-09 16:17:30,835 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 16:17:30,835 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 16:17:31,035 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 mathsat -unsat_core_generation=3 [2020-12-09 16:17:31,037 INFO L429 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]=== [2020-12-09 16:17:31,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 16:17:31,038 INFO L82 PathProgramCache]: Analyzing trace with hash -1890276516, now seen corresponding path program 1 times [2020-12-09 16:17:31,039 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 16:17:31,040 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2124694624] [2020-12-09 16:17:31,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f3b1e071-9075-4a0f-b2e0-a3c1da29d57a/bin/utaipan/mathsat Starting monitored process 12 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with mathsat -unsat_core_generation=3 [2020-12-09 16:17:31,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 16:17:31,170 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 8 conjunts are in the unsatisfiable core [2020-12-09 16:17:31,170 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 16:17:31,196 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 16:17:31,196 INFO L382 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 [2020-12-09 16:17:31,197 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 16:17:31,220 INFO L625 ElimStorePlain]: treesize reduction 10, result has 68.8 percent of original size [2020-12-09 16:17:31,222 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 16:17:31,222 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:17, output treesize:13 [2020-12-09 16:17:31,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 16:17:31,264 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 16:17:31,264 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2124694624] [2020-12-09 16:17:31,264 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 16:17:31,264 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-09 16:17:31,264 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992322160] [2020-12-09 16:17:31,264 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-09 16:17:31,265 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 16:17:31,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-09 16:17:31,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2020-12-09 16:17:31,265 INFO L87 Difference]: Start difference. First operand 82 states and 101 transitions. Second operand 6 states. [2020-12-09 16:17:31,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 16:17:31,489 INFO L93 Difference]: Finished difference Result 120 states and 144 transitions. [2020-12-09 16:17:31,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-09 16:17:31,490 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2020-12-09 16:17:31,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 16:17:31,490 INFO L225 Difference]: With dead ends: 120 [2020-12-09 16:17:31,490 INFO L226 Difference]: Without dead ends: 120 [2020-12-09 16:17:31,491 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2020-12-09 16:17:31,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2020-12-09 16:17:31,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 78. [2020-12-09 16:17:31,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2020-12-09 16:17:31,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 96 transitions. [2020-12-09 16:17:31,493 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 96 transitions. Word has length 10 [2020-12-09 16:17:31,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 16:17:31,493 INFO L481 AbstractCegarLoop]: Abstraction has 78 states and 96 transitions. [2020-12-09 16:17:31,493 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-09 16:17:31,493 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 96 transitions. [2020-12-09 16:17:31,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-12-09 16:17:31,494 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 16:17:31,494 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 16:17:31,694 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 mathsat -unsat_core_generation=3 [2020-12-09 16:17:31,695 INFO L429 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]=== [2020-12-09 16:17:31,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 16:17:31,696 INFO L82 PathProgramCache]: Analyzing trace with hash -1226025170, now seen corresponding path program 1 times [2020-12-09 16:17:31,697 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 16:17:31,697 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [586986923] [2020-12-09 16:17:31,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f3b1e071-9075-4a0f-b2e0-a3c1da29d57a/bin/utaipan/mathsat Starting monitored process 13 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with mathsat -unsat_core_generation=3 [2020-12-09 16:17:31,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 16:17:31,794 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 11 conjunts are in the unsatisfiable core [2020-12-09 16:17:31,795 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 16:17:31,808 INFO L443 ElimStorePlain]: Different costs {0=[|v_#length_29|], 1=[|v_#valid_33|]} [2020-12-09 16:17:31,812 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 16:17:31,813 INFO L382 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 [2020-12-09 16:17:31,814 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 16:17:31,826 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 16:17:31,831 INFO L382 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 [2020-12-09 16:17:31,832 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 16:17:31,844 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 16:17:31,846 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 16:17:31,846 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:16 [2020-12-09 16:17:31,940 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 16:17:31,940 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 16:17:32,332 INFO L443 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2020-12-09 16:17:32,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 16:17:32,336 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 16:17:32,337 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 16:17:32,337 INFO L515 ElimStorePlain]: Eliminatee |#length| vanished before elimination [2020-12-09 16:17:32,337 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 16:17:32,337 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:33, output treesize:1 [2020-12-09 16:17:32,339 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 16:17:32,339 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [586986923] [2020-12-09 16:17:32,340 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [920153872] [2020-12-09 16:17:32,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f3b1e071-9075-4a0f-b2e0-a3c1da29d57a/bin/utaipan/cvc4 Starting monitored process 14 with cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with cvc4 --incremental --print-success --lang smt [2020-12-09 16:17:32,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 16:17:32,405 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 11 conjunts are in the unsatisfiable core [2020-12-09 16:17:32,406 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 16:17:32,412 INFO L443 ElimStorePlain]: Different costs {0=[|v_#length_31|], 1=[|v_#valid_35|]} [2020-12-09 16:17:32,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 16:17:32,416 INFO L382 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 [2020-12-09 16:17:32,417 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 16:17:32,430 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 16:17:32,435 INFO L382 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 [2020-12-09 16:17:32,436 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 16:17:32,448 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 16:17:32,450 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 16:17:32,450 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:16 [2020-12-09 16:17:32,526 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 16:17:32,526 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 16:17:32,938 INFO L443 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2020-12-09 16:17:32,941 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 16:17:32,941 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 16:17:32,942 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 16:17:32,942 INFO L515 ElimStorePlain]: Eliminatee |#length| vanished before elimination [2020-12-09 16:17:32,942 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 16:17:32,942 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:39, output treesize:1 [2020-12-09 16:17:32,944 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 16:17:32,944 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [329968431] [2020-12-09 16:17:32,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f3b1e071-9075-4a0f-b2e0-a3c1da29d57a/bin/utaipan/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 16:17:32,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 16:17:32,976 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 10 conjunts are in the unsatisfiable core [2020-12-09 16:17:32,976 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 16:17:32,986 INFO L443 ElimStorePlain]: Different costs {0=[|v_#length_33|], 1=[|v_#valid_37|]} [2020-12-09 16:17:32,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 16:17:32,991 INFO L382 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 [2020-12-09 16:17:32,991 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 16:17:33,003 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 16:17:33,008 INFO L382 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 [2020-12-09 16:17:33,008 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 16:17:33,020 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 16:17:33,021 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 16:17:33,022 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:16 [2020-12-09 16:17:33,049 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 16:17:33,049 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 16:17:33,060 INFO L443 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2020-12-09 16:17:33,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 16:17:33,063 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 16:17:33,064 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 16:17:33,064 INFO L515 ElimStorePlain]: Eliminatee |#length| vanished before elimination [2020-12-09 16:17:33,064 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 16:17:33,064 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:27, output treesize:1 [2020-12-09 16:17:33,066 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 16:17:33,066 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2020-12-09 16:17:33,067 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5, 5, 5, 4] total 16 [2020-12-09 16:17:33,067 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603467576] [2020-12-09 16:17:33,067 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-12-09 16:17:33,067 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 16:17:33,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-12-09 16:17:33,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=188, Unknown=0, NotChecked=0, Total=272 [2020-12-09 16:17:33,068 INFO L87 Difference]: Start difference. First operand 78 states and 96 transitions. Second operand 17 states. [2020-12-09 16:17:33,569 WARN L197 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 28 [2020-12-09 16:17:33,818 WARN L197 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 17 [2020-12-09 16:17:34,414 WARN L197 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 24 [2020-12-09 16:17:35,046 WARN L197 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 24 [2020-12-09 16:17:35,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 16:17:35,588 INFO L93 Difference]: Finished difference Result 266 states and 315 transitions. [2020-12-09 16:17:35,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-12-09 16:17:35,590 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 11 [2020-12-09 16:17:35,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 16:17:35,591 INFO L225 Difference]: With dead ends: 266 [2020-12-09 16:17:35,591 INFO L226 Difference]: Without dead ends: 266 [2020-12-09 16:17:35,591 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=162, Invalid=344, Unknown=0, NotChecked=0, Total=506 [2020-12-09 16:17:35,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2020-12-09 16:17:35,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 102. [2020-12-09 16:17:35,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2020-12-09 16:17:35,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 126 transitions. [2020-12-09 16:17:35,594 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 126 transitions. Word has length 11 [2020-12-09 16:17:35,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 16:17:35,594 INFO L481 AbstractCegarLoop]: Abstraction has 102 states and 126 transitions. [2020-12-09 16:17:35,594 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-12-09 16:17:35,594 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 126 transitions. [2020-12-09 16:17:35,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-12-09 16:17:35,595 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 16:17:35,595 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 16:17:36,196 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 cvc4 --incremental --print-success --lang smt,13 mathsat -unsat_core_generation=3,15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 16:17:36,197 INFO L429 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]=== [2020-12-09 16:17:36,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 16:17:36,198 INFO L82 PathProgramCache]: Analyzing trace with hash -1862804906, now seen corresponding path program 1 times [2020-12-09 16:17:36,199 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 16:17:36,199 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [464137817] [2020-12-09 16:17:36,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f3b1e071-9075-4a0f-b2e0-a3c1da29d57a/bin/utaipan/mathsat Starting monitored process 16 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with mathsat -unsat_core_generation=3 [2020-12-09 16:17:36,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 16:17:36,239 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 9 conjunts are in the unsatisfiable core [2020-12-09 16:17:36,240 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 16:17:36,264 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 16:17:36,264 INFO L382 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 [2020-12-09 16:17:36,265 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 16:17:36,288 INFO L625 ElimStorePlain]: treesize reduction 10, result has 68.8 percent of original size [2020-12-09 16:17:36,289 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 16:17:36,289 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:17, output treesize:13 [2020-12-09 16:17:36,353 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 16:17:36,353 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 16:17:36,717 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 16:17:36,717 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [464137817] [2020-12-09 16:17:36,717 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1174638350] [2020-12-09 16:17:36,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f3b1e071-9075-4a0f-b2e0-a3c1da29d57a/bin/utaipan/cvc4 Starting monitored process 17 with cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with cvc4 --incremental --print-success --lang smt [2020-12-09 16:17:36,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 16:17:36,776 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 9 conjunts are in the unsatisfiable core [2020-12-09 16:17:36,776 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 16:17:36,794 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 16:17:36,794 INFO L382 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 [2020-12-09 16:17:36,795 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 16:17:36,820 INFO L625 ElimStorePlain]: treesize reduction 10, result has 68.8 percent of original size [2020-12-09 16:17:36,821 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 16:17:36,821 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:17, output treesize:13 [2020-12-09 16:17:36,844 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 16:17:36,844 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 16:17:36,859 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 16:17:36,859 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1600497095] [2020-12-09 16:17:36,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f3b1e071-9075-4a0f-b2e0-a3c1da29d57a/bin/utaipan/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 16:17:36,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 16:17:36,890 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 10 conjunts are in the unsatisfiable core [2020-12-09 16:17:36,891 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 16:17:36,912 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 16:17:36,912 INFO L382 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 [2020-12-09 16:17:36,913 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 16:17:36,944 INFO L625 ElimStorePlain]: treesize reduction 10, result has 68.8 percent of original size [2020-12-09 16:17:36,946 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 16:17:36,946 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:17, output treesize:13 [2020-12-09 16:17:37,020 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 16:17:37,020 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 16:17:37,717 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 16:17:37,717 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2020-12-09 16:17:37,717 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6, 5, 6, 6] total 16 [2020-12-09 16:17:37,717 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250696453] [2020-12-09 16:17:37,718 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-12-09 16:17:37,718 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 16:17:37,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-12-09 16:17:37,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2020-12-09 16:17:37,718 INFO L87 Difference]: Start difference. First operand 102 states and 126 transitions. Second operand 17 states. [2020-12-09 16:17:38,489 WARN L197 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 17 [2020-12-09 16:17:38,668 WARN L197 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 20 [2020-12-09 16:17:39,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 16:17:39,025 INFO L93 Difference]: Finished difference Result 183 states and 218 transitions. [2020-12-09 16:17:39,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-12-09 16:17:39,027 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 13 [2020-12-09 16:17:39,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 16:17:39,028 INFO L225 Difference]: With dead ends: 183 [2020-12-09 16:17:39,028 INFO L226 Difference]: Without dead ends: 183 [2020-12-09 16:17:39,028 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 52 SyntacticMatches, 5 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=165, Invalid=341, Unknown=0, NotChecked=0, Total=506 [2020-12-09 16:17:39,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2020-12-09 16:17:39,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 97. [2020-12-09 16:17:39,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2020-12-09 16:17:39,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 118 transitions. [2020-12-09 16:17:39,032 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 118 transitions. Word has length 13 [2020-12-09 16:17:39,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 16:17:39,032 INFO L481 AbstractCegarLoop]: Abstraction has 97 states and 118 transitions. [2020-12-09 16:17:39,032 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-12-09 16:17:39,032 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 118 transitions. [2020-12-09 16:17:39,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-12-09 16:17:39,033 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 16:17:39,033 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 16:17:39,634 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 mathsat -unsat_core_generation=3,18 z3 -smt2 -in SMTLIB2_COMPLIANT=true,17 cvc4 --incremental --print-success --lang smt [2020-12-09 16:17:39,635 INFO L429 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]=== [2020-12-09 16:17:39,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 16:17:39,636 INFO L82 PathProgramCache]: Analyzing trace with hash 172810813, now seen corresponding path program 1 times [2020-12-09 16:17:39,637 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 16:17:39,637 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1838315782] [2020-12-09 16:17:39,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f3b1e071-9075-4a0f-b2e0-a3c1da29d57a/bin/utaipan/mathsat Starting monitored process 19 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with mathsat -unsat_core_generation=3 [2020-12-09 16:17:39,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 16:17:39,728 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 7 conjunts are in the unsatisfiable core [2020-12-09 16:17:39,729 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 16:17:39,733 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-12-09 16:17:39,734 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 16:17:39,735 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 16:17:39,735 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 16:17:39,736 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-12-09 16:17:41,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 16:17:41,821 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 16:17:41,821 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1838315782] [2020-12-09 16:17:41,821 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 16:17:41,821 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 16:17:41,821 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38798885] [2020-12-09 16:17:41,822 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-09 16:17:41,822 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 16:17:41,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-09 16:17:41,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=17, Unknown=1, NotChecked=0, Total=30 [2020-12-09 16:17:41,823 INFO L87 Difference]: Start difference. First operand 97 states and 118 transitions. Second operand 6 states. [2020-12-09 16:17:52,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 16:17:52,080 INFO L93 Difference]: Finished difference Result 96 states and 117 transitions. [2020-12-09 16:17:52,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-09 16:17:52,081 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2020-12-09 16:17:52,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 16:17:52,081 INFO L225 Difference]: With dead ends: 96 [2020-12-09 16:17:52,081 INFO L226 Difference]: Without dead ends: 91 [2020-12-09 16:17:52,081 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=16, Invalid=25, Unknown=1, NotChecked=0, Total=42 [2020-12-09 16:17:52,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2020-12-09 16:17:52,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2020-12-09 16:17:52,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2020-12-09 16:17:52,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 109 transitions. [2020-12-09 16:17:52,084 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 109 transitions. Word has length 14 [2020-12-09 16:17:52,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 16:17:52,084 INFO L481 AbstractCegarLoop]: Abstraction has 91 states and 109 transitions. [2020-12-09 16:17:52,084 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-09 16:17:52,084 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 109 transitions. [2020-12-09 16:17:52,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-12-09 16:17:52,085 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 16:17:52,085 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 16:17:52,286 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 mathsat -unsat_core_generation=3 [2020-12-09 16:17:52,287 INFO L429 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]=== [2020-12-09 16:17:52,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 16:17:52,288 INFO L82 PathProgramCache]: Analyzing trace with hash 1062175016, now seen corresponding path program 1 times [2020-12-09 16:17:52,288 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 16:17:52,289 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [933023812] [2020-12-09 16:17:52,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f3b1e071-9075-4a0f-b2e0-a3c1da29d57a/bin/utaipan/mathsat Starting monitored process 20 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with mathsat -unsat_core_generation=3 [2020-12-09 16:17:52,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 16:17:52,339 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 4 conjunts are in the unsatisfiable core [2020-12-09 16:17:52,340 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 16:17:52,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 16:17:52,353 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 16:17:52,353 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [933023812] [2020-12-09 16:17:52,353 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 16:17:52,353 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 16:17:52,353 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101673735] [2020-12-09 16:17:52,354 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 16:17:52,354 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 16:17:52,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 16:17:52,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 16:17:52,354 INFO L87 Difference]: Start difference. First operand 91 states and 109 transitions. Second operand 4 states. [2020-12-09 16:17:52,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 16:17:52,434 INFO L93 Difference]: Finished difference Result 88 states and 106 transitions. [2020-12-09 16:17:52,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 16:17:52,435 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2020-12-09 16:17:52,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 16:17:52,436 INFO L225 Difference]: With dead ends: 88 [2020-12-09 16:17:52,436 INFO L226 Difference]: Without dead ends: 88 [2020-12-09 16:17:52,436 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-09 16:17:52,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2020-12-09 16:17:52,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2020-12-09 16:17:52,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2020-12-09 16:17:52,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 106 transitions. [2020-12-09 16:17:52,438 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 106 transitions. Word has length 15 [2020-12-09 16:17:52,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 16:17:52,438 INFO L481 AbstractCegarLoop]: Abstraction has 88 states and 106 transitions. [2020-12-09 16:17:52,438 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 16:17:52,438 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 106 transitions. [2020-12-09 16:17:52,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-12-09 16:17:52,438 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 16:17:52,438 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 16:17:52,639 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 mathsat -unsat_core_generation=3 [2020-12-09 16:17:52,640 INFO L429 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]=== [2020-12-09 16:17:52,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 16:17:52,641 INFO L82 PathProgramCache]: Analyzing trace with hash 1062175017, now seen corresponding path program 1 times [2020-12-09 16:17:52,641 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 16:17:52,642 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1199923576] [2020-12-09 16:17:52,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f3b1e071-9075-4a0f-b2e0-a3c1da29d57a/bin/utaipan/mathsat Starting monitored process 21 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with mathsat -unsat_core_generation=3 [2020-12-09 16:17:52,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 16:17:52,698 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2020-12-09 16:17:52,699 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 16:17:52,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 16:17:52,743 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 16:17:52,744 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1199923576] [2020-12-09 16:17:52,744 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 16:17:52,744 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-09 16:17:52,744 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928344891] [2020-12-09 16:17:52,744 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-09 16:17:52,744 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 16:17:52,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-09 16:17:52,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-12-09 16:17:52,745 INFO L87 Difference]: Start difference. First operand 88 states and 106 transitions. Second operand 6 states. [2020-12-09 16:17:52,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 16:17:52,971 INFO L93 Difference]: Finished difference Result 136 states and 159 transitions. [2020-12-09 16:17:52,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 16:17:52,972 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2020-12-09 16:17:52,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 16:17:52,972 INFO L225 Difference]: With dead ends: 136 [2020-12-09 16:17:52,972 INFO L226 Difference]: Without dead ends: 136 [2020-12-09 16:17:52,972 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-12-09 16:17:52,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2020-12-09 16:17:52,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 108. [2020-12-09 16:17:52,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2020-12-09 16:17:52,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 132 transitions. [2020-12-09 16:17:52,974 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 132 transitions. Word has length 15 [2020-12-09 16:17:52,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 16:17:52,975 INFO L481 AbstractCegarLoop]: Abstraction has 108 states and 132 transitions. [2020-12-09 16:17:52,975 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-09 16:17:52,975 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 132 transitions. [2020-12-09 16:17:52,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-12-09 16:17:52,975 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 16:17:52,975 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 16:17:53,175 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 mathsat -unsat_core_generation=3 [2020-12-09 16:17:53,176 INFO L429 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]=== [2020-12-09 16:17:53,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 16:17:53,176 INFO L82 PathProgramCache]: Analyzing trace with hash 475369003, now seen corresponding path program 1 times [2020-12-09 16:17:53,176 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 16:17:53,176 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [623465079] [2020-12-09 16:17:53,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f3b1e071-9075-4a0f-b2e0-a3c1da29d57a/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 [2020-12-09 16:17:53,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 16:17:53,215 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 9 conjunts are in the unsatisfiable core [2020-12-09 16:17:53,216 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 16:17:53,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 16:17:53,274 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 16:17:53,275 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [623465079] [2020-12-09 16:17:53,275 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 16:17:53,275 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-09 16:17:53,275 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662815141] [2020-12-09 16:17:53,275 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-09 16:17:53,275 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 16:17:53,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-09 16:17:53,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-12-09 16:17:53,276 INFO L87 Difference]: Start difference. First operand 108 states and 132 transitions. Second operand 6 states. [2020-12-09 16:17:53,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 16:17:53,471 INFO L93 Difference]: Finished difference Result 125 states and 151 transitions. [2020-12-09 16:17:53,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 16:17:53,473 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2020-12-09 16:17:53,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 16:17:53,473 INFO L225 Difference]: With dead ends: 125 [2020-12-09 16:17:53,473 INFO L226 Difference]: Without dead ends: 125 [2020-12-09 16:17:53,474 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-12-09 16:17:53,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2020-12-09 16:17:53,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 97. [2020-12-09 16:17:53,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2020-12-09 16:17:53,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 120 transitions. [2020-12-09 16:17:53,476 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 120 transitions. Word has length 15 [2020-12-09 16:17:53,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 16:17:53,476 INFO L481 AbstractCegarLoop]: Abstraction has 97 states and 120 transitions. [2020-12-09 16:17:53,476 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-09 16:17:53,476 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 120 transitions. [2020-12-09 16:17:53,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-12-09 16:17:53,476 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 16:17:53,476 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 16:17:53,677 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 mathsat -unsat_core_generation=3 [2020-12-09 16:17:53,678 INFO L429 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]=== [2020-12-09 16:17:53,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 16:17:53,679 INFO L82 PathProgramCache]: Analyzing trace with hash -1432312828, now seen corresponding path program 1 times [2020-12-09 16:17:53,680 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 16:17:53,680 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [543005188] [2020-12-09 16:17:53,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f3b1e071-9075-4a0f-b2e0-a3c1da29d57a/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 [2020-12-09 16:17:53,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 16:17:53,748 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 5 conjunts are in the unsatisfiable core [2020-12-09 16:17:53,749 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 16:17:53,770 INFO L348 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2020-12-09 16:17:53,770 INFO L382 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 [2020-12-09 16:17:53,771 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 16:17:53,778 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 16:17:53,779 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-09 16:17:53,779 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:9, output treesize:15 [2020-12-09 16:17:53,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 16:17:53,808 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 16:17:53,808 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [543005188] [2020-12-09 16:17:53,809 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 16:17:53,809 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 16:17:53,809 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183813030] [2020-12-09 16:17:53,809 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 16:17:53,809 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 16:17:53,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 16:17:53,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 16:17:53,810 INFO L87 Difference]: Start difference. First operand 97 states and 120 transitions. Second operand 4 states. [2020-12-09 16:17:53,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 16:17:53,882 INFO L93 Difference]: Finished difference Result 95 states and 117 transitions. [2020-12-09 16:17:53,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 16:17:53,883 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2020-12-09 16:17:53,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 16:17:53,883 INFO L225 Difference]: With dead ends: 95 [2020-12-09 16:17:53,883 INFO L226 Difference]: Without dead ends: 95 [2020-12-09 16:17:53,884 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-09 16:17:53,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2020-12-09 16:17:53,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2020-12-09 16:17:53,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2020-12-09 16:17:53,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 117 transitions. [2020-12-09 16:17:53,885 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 117 transitions. Word has length 16 [2020-12-09 16:17:53,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 16:17:53,885 INFO L481 AbstractCegarLoop]: Abstraction has 95 states and 117 transitions. [2020-12-09 16:17:53,885 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 16:17:53,886 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 117 transitions. [2020-12-09 16:17:53,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-12-09 16:17:53,886 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 16:17:53,886 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 16:17:54,086 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 mathsat -unsat_core_generation=3 [2020-12-09 16:17:54,087 INFO L429 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]=== [2020-12-09 16:17:54,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 16:17:54,088 INFO L82 PathProgramCache]: Analyzing trace with hash -1432312827, now seen corresponding path program 1 times [2020-12-09 16:17:54,089 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 16:17:54,089 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [659493131] [2020-12-09 16:17:54,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f3b1e071-9075-4a0f-b2e0-a3c1da29d57a/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 [2020-12-09 16:17:54,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 16:17:54,173 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 10 conjunts are in the unsatisfiable core [2020-12-09 16:17:54,174 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 16:17:54,194 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 16:17:54,194 INFO L382 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 [2020-12-09 16:17:54,195 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 16:17:54,219 INFO L625 ElimStorePlain]: treesize reduction 12, result has 60.0 percent of original size [2020-12-09 16:17:54,222 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 16:17:54,222 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2020-12-09 16:17:54,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 16:17:54,251 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 16:17:54,251 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [659493131] [2020-12-09 16:17:54,252 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 16:17:54,252 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 16:17:54,252 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775468365] [2020-12-09 16:17:54,252 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 16:17:54,252 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 16:17:54,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 16:17:54,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-09 16:17:54,253 INFO L87 Difference]: Start difference. First operand 95 states and 117 transitions. Second operand 5 states. [2020-12-09 16:17:54,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 16:17:54,407 INFO L93 Difference]: Finished difference Result 133 states and 158 transitions. [2020-12-09 16:17:54,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 16:17:54,408 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-12-09 16:17:54,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 16:17:54,409 INFO L225 Difference]: With dead ends: 133 [2020-12-09 16:17:54,409 INFO L226 Difference]: Without dead ends: 130 [2020-12-09 16:17:54,409 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-12-09 16:17:54,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2020-12-09 16:17:54,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 106. [2020-12-09 16:17:54,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2020-12-09 16:17:54,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 130 transitions. [2020-12-09 16:17:54,411 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 130 transitions. Word has length 16 [2020-12-09 16:17:54,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 16:17:54,411 INFO L481 AbstractCegarLoop]: Abstraction has 106 states and 130 transitions. [2020-12-09 16:17:54,411 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 16:17:54,411 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 130 transitions. [2020-12-09 16:17:54,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-12-09 16:17:54,411 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 16:17:54,411 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 16:17:54,612 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 mathsat -unsat_core_generation=3 [2020-12-09 16:17:54,613 INFO L429 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]=== [2020-12-09 16:17:54,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 16:17:54,614 INFO L82 PathProgramCache]: Analyzing trace with hash -2019118841, now seen corresponding path program 1 times [2020-12-09 16:17:54,615 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 16:17:54,615 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [159204269] [2020-12-09 16:17:54,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f3b1e071-9075-4a0f-b2e0-a3c1da29d57a/bin/utaipan/mathsat Starting monitored process 25 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with mathsat -unsat_core_generation=3 [2020-12-09 16:17:54,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 16:17:54,761 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 10 conjunts are in the unsatisfiable core [2020-12-09 16:17:54,762 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 16:17:54,782 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 16:17:54,782 INFO L382 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 [2020-12-09 16:17:54,783 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 16:17:54,806 INFO L625 ElimStorePlain]: treesize reduction 10, result has 68.8 percent of original size [2020-12-09 16:17:54,808 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 16:17:54,808 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:17, output treesize:10 [2020-12-09 16:17:54,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 16:17:54,829 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 16:17:54,829 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [159204269] [2020-12-09 16:17:54,829 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 16:17:54,829 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 16:17:54,829 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850763975] [2020-12-09 16:17:54,830 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 16:17:54,830 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 16:17:54,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 16:17:54,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-09 16:17:54,830 INFO L87 Difference]: Start difference. First operand 106 states and 130 transitions. Second operand 5 states. [2020-12-09 16:17:54,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 16:17:54,963 INFO L93 Difference]: Finished difference Result 110 states and 132 transitions. [2020-12-09 16:17:54,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 16:17:54,964 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-12-09 16:17:54,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 16:17:54,965 INFO L225 Difference]: With dead ends: 110 [2020-12-09 16:17:54,965 INFO L226 Difference]: Without dead ends: 107 [2020-12-09 16:17:54,965 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-12-09 16:17:54,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2020-12-09 16:17:54,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 94. [2020-12-09 16:17:54,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2020-12-09 16:17:54,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 114 transitions. [2020-12-09 16:17:54,967 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 114 transitions. Word has length 16 [2020-12-09 16:17:54,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 16:17:54,967 INFO L481 AbstractCegarLoop]: Abstraction has 94 states and 114 transitions. [2020-12-09 16:17:54,967 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 16:17:54,967 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 114 transitions. [2020-12-09 16:17:54,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-12-09 16:17:54,967 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 16:17:54,967 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 16:17:55,168 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 mathsat -unsat_core_generation=3 [2020-12-09 16:17:55,169 INFO L429 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]=== [2020-12-09 16:17:55,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 16:17:55,170 INFO L82 PathProgramCache]: Analyzing trace with hash 1532417320, now seen corresponding path program 1 times [2020-12-09 16:17:55,171 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 16:17:55,171 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [504304243] [2020-12-09 16:17:55,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f3b1e071-9075-4a0f-b2e0-a3c1da29d57a/bin/utaipan/mathsat Starting monitored process 26 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with mathsat -unsat_core_generation=3 [2020-12-09 16:17:55,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 16:17:55,224 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 13 conjunts are in the unsatisfiable core [2020-12-09 16:17:55,225 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 16:17:55,234 INFO L443 ElimStorePlain]: Different costs {0=[|v_#length_43|], 1=[|v_#valid_46|]} [2020-12-09 16:17:55,238 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 16:17:55,239 INFO L382 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 [2020-12-09 16:17:55,240 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 16:17:55,254 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 16:17:55,260 INFO L382 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 [2020-12-09 16:17:55,261 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 16:17:55,275 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 16:17:55,277 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 16:17:55,277 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:16 [2020-12-09 16:17:55,442 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 16:17:55,442 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 16:17:56,155 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 16:17:56,156 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-12-09 16:17:56,159 INFO L443 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2020-12-09 16:17:56,162 INFO L173 IndexEqualityManager]: detected equality via solver [2020-12-09 16:17:56,164 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-12-09 16:17:56,165 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 16:17:56,168 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 16:17:56,169 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 16:17:56,169 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 16:17:56,169 INFO L515 ElimStorePlain]: Eliminatee |#length| vanished before elimination [2020-12-09 16:17:56,170 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 16:17:56,170 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:83, output treesize:1 [2020-12-09 16:17:56,172 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 16:17:56,172 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [504304243] [2020-12-09 16:17:56,172 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1585505175] [2020-12-09 16:17:56,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f3b1e071-9075-4a0f-b2e0-a3c1da29d57a/bin/utaipan/cvc4 Starting monitored process 27 with cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with cvc4 --incremental --print-success --lang smt [2020-12-09 16:17:56,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 16:17:56,238 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 14 conjunts are in the unsatisfiable core [2020-12-09 16:17:56,239 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 16:17:56,245 INFO L443 ElimStorePlain]: Different costs {0=[|v_#length_45|], 1=[|v_#valid_48|]} [2020-12-09 16:17:56,250 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 16:17:56,250 INFO L382 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 [2020-12-09 16:17:56,251 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 16:17:56,265 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 16:17:56,271 INFO L382 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 [2020-12-09 16:17:56,272 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 16:17:56,287 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 16:17:56,289 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 16:17:56,289 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:16 [2020-12-09 16:17:56,408 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 16:17:56,408 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 16:17:56,682 WARN L197 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2020-12-09 16:17:56,688 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 16:17:56,689 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-12-09 16:17:56,692 INFO L443 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2020-12-09 16:17:56,695 INFO L173 IndexEqualityManager]: detected equality via solver [2020-12-09 16:17:56,698 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-12-09 16:17:56,698 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 16:17:56,701 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 16:17:56,702 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 16:17:56,702 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 16:17:56,702 INFO L515 ElimStorePlain]: Eliminatee |#length| vanished before elimination [2020-12-09 16:17:56,703 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 16:17:56,703 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:95, output treesize:1 [2020-12-09 16:17:56,705 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 16:17:56,706 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [975713864] [2020-12-09 16:17:56,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f3b1e071-9075-4a0f-b2e0-a3c1da29d57a/bin/utaipan/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 16:17:56,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 16:17:56,740 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 14 conjunts are in the unsatisfiable core [2020-12-09 16:17:56,741 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 16:17:56,746 INFO L443 ElimStorePlain]: Different costs {0=[|v_#length_47|], 1=[|v_#valid_50|]} [2020-12-09 16:17:56,750 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 16:17:56,751 INFO L382 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 [2020-12-09 16:17:56,751 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 16:17:56,766 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 16:17:56,771 INFO L382 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 [2020-12-09 16:17:56,772 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 16:17:56,784 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 16:17:56,785 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 16:17:56,785 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:16 [2020-12-09 16:17:56,856 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 16:17:56,857 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 16:17:56,872 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 16:17:56,872 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-12-09 16:17:56,876 INFO L443 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2020-12-09 16:17:56,878 INFO L173 IndexEqualityManager]: detected equality via solver [2020-12-09 16:17:56,881 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-12-09 16:17:56,882 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 16:17:56,885 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 16:17:56,885 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 16:17:56,886 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 16:17:56,886 INFO L515 ElimStorePlain]: Eliminatee |#length| vanished before elimination [2020-12-09 16:17:56,887 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 16:17:56,887 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:95, output treesize:1 [2020-12-09 16:17:56,889 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 16:17:56,889 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2020-12-09 16:17:56,889 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 8, 8, 8, 8] total 16 [2020-12-09 16:17:56,890 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333687416] [2020-12-09 16:17:56,890 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-12-09 16:17:56,890 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 16:17:56,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-12-09 16:17:56,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=171, Unknown=0, NotChecked=0, Total=272 [2020-12-09 16:17:56,891 INFO L87 Difference]: Start difference. First operand 94 states and 114 transitions. Second operand 17 states. [2020-12-09 16:17:57,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 16:17:57,512 INFO L93 Difference]: Finished difference Result 196 states and 230 transitions. [2020-12-09 16:17:57,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-09 16:17:57,513 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 [2020-12-09 16:17:57,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 16:17:57,514 INFO L225 Difference]: With dead ends: 196 [2020-12-09 16:17:57,514 INFO L226 Difference]: Without dead ends: 196 [2020-12-09 16:17:57,514 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 73 SyntacticMatches, 8 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=131, Invalid=211, Unknown=0, NotChecked=0, Total=342 [2020-12-09 16:17:57,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2020-12-09 16:17:57,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 85. [2020-12-09 16:17:57,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2020-12-09 16:17:57,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 104 transitions. [2020-12-09 16:17:57,516 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 104 transitions. Word has length 17 [2020-12-09 16:17:57,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 16:17:57,517 INFO L481 AbstractCegarLoop]: Abstraction has 85 states and 104 transitions. [2020-12-09 16:17:57,517 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-12-09 16:17:57,517 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 104 transitions. [2020-12-09 16:17:57,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-12-09 16:17:57,517 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 16:17:57,517 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 16:17:58,119 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 z3 -smt2 -in SMTLIB2_COMPLIANT=true,27 cvc4 --incremental --print-success --lang smt,26 mathsat -unsat_core_generation=3 [2020-12-09 16:17:58,120 INFO L429 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]=== [2020-12-09 16:17:58,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 16:17:58,121 INFO L82 PathProgramCache]: Analyzing trace with hash 1455987438, now seen corresponding path program 1 times [2020-12-09 16:17:58,122 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 16:17:58,122 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [241348472] [2020-12-09 16:17:58,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f3b1e071-9075-4a0f-b2e0-a3c1da29d57a/bin/utaipan/mathsat Starting monitored process 29 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with mathsat -unsat_core_generation=3 [2020-12-09 16:17:58,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 16:17:58,180 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 2 conjunts are in the unsatisfiable core [2020-12-09 16:17:58,181 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 16:17:58,191 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 16:17:58,191 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 16:17:58,191 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [241348472] [2020-12-09 16:17:58,191 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 16:17:58,191 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 16:17:58,191 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984470413] [2020-12-09 16:17:58,192 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 16:17:58,192 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 16:17:58,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 16:17:58,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 16:17:58,192 INFO L87 Difference]: Start difference. First operand 85 states and 104 transitions. Second operand 3 states. [2020-12-09 16:17:58,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 16:17:58,201 INFO L93 Difference]: Finished difference Result 87 states and 105 transitions. [2020-12-09 16:17:58,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 16:17:58,202 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2020-12-09 16:17:58,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 16:17:58,203 INFO L225 Difference]: With dead ends: 87 [2020-12-09 16:17:58,203 INFO L226 Difference]: Without dead ends: 86 [2020-12-09 16:17:58,203 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 16:17:58,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2020-12-09 16:17:58,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2020-12-09 16:17:58,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2020-12-09 16:17:58,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 104 transitions. [2020-12-09 16:17:58,206 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 104 transitions. Word has length 20 [2020-12-09 16:17:58,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 16:17:58,209 INFO L481 AbstractCegarLoop]: Abstraction has 86 states and 104 transitions. [2020-12-09 16:17:58,210 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 16:17:58,210 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 104 transitions. [2020-12-09 16:17:58,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-12-09 16:17:58,210 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 16:17:58,210 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 16:17:58,410 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 mathsat -unsat_core_generation=3 [2020-12-09 16:17:58,411 INFO L429 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]=== [2020-12-09 16:17:58,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 16:17:58,412 INFO L82 PathProgramCache]: Analyzing trace with hash 420786095, now seen corresponding path program 1 times [2020-12-09 16:17:58,413 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 16:17:58,413 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [722629841] [2020-12-09 16:17:58,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f3b1e071-9075-4a0f-b2e0-a3c1da29d57a/bin/utaipan/mathsat Starting monitored process 30 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with mathsat -unsat_core_generation=3 [2020-12-09 16:17:58,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 16:17:58,542 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 2 conjunts are in the unsatisfiable core [2020-12-09 16:17:58,543 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 16:17:58,554 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 16:17:58,554 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 16:17:58,555 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [722629841] [2020-12-09 16:17:58,555 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 16:17:58,555 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 16:17:58,555 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175176612] [2020-12-09 16:17:58,555 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 16:17:58,555 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 16:17:58,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 16:17:58,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 16:17:58,556 INFO L87 Difference]: Start difference. First operand 86 states and 104 transitions. Second operand 3 states. [2020-12-09 16:17:58,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 16:17:58,567 INFO L93 Difference]: Finished difference Result 87 states and 104 transitions. [2020-12-09 16:17:58,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 16:17:58,568 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2020-12-09 16:17:58,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 16:17:58,569 INFO L225 Difference]: With dead ends: 87 [2020-12-09 16:17:58,569 INFO L226 Difference]: Without dead ends: 86 [2020-12-09 16:17:58,569 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 16:17:58,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2020-12-09 16:17:58,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2020-12-09 16:17:58,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2020-12-09 16:17:58,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 102 transitions. [2020-12-09 16:17:58,571 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 102 transitions. Word has length 23 [2020-12-09 16:17:58,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 16:17:58,571 INFO L481 AbstractCegarLoop]: Abstraction has 86 states and 102 transitions. [2020-12-09 16:17:58,571 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 16:17:58,572 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 102 transitions. [2020-12-09 16:17:58,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-12-09 16:17:58,572 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 16:17:58,572 INFO L422 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2020-12-09 16:17:58,773 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 mathsat -unsat_core_generation=3 [2020-12-09 16:17:58,774 INFO L429 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]=== [2020-12-09 16:17:58,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 16:17:58,775 INFO L82 PathProgramCache]: Analyzing trace with hash -591263241, now seen corresponding path program 2 times [2020-12-09 16:17:58,775 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 16:17:58,776 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [830191293] [2020-12-09 16:17:58,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f3b1e071-9075-4a0f-b2e0-a3c1da29d57a/bin/utaipan/mathsat Starting monitored process 31 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with mathsat -unsat_core_generation=3 [2020-12-09 16:17:58,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 16:17:58,874 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 15 conjunts are in the unsatisfiable core [2020-12-09 16:17:58,874 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 16:17:58,883 INFO L443 ElimStorePlain]: Different costs {0=[|v_#length_49|], 1=[|v_#valid_52|]} [2020-12-09 16:17:58,887 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 16:17:58,888 INFO L382 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 [2020-12-09 16:17:58,888 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 16:17:58,904 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 16:17:58,910 INFO L382 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 [2020-12-09 16:17:58,912 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 16:17:58,926 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 16:17:58,928 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 16:17:58,928 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:16 [2020-12-09 16:17:59,177 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 16:17:59,178 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 16:18:00,443 INFO L443 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2020-12-09 16:18:00,446 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 16:18:00,447 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 16:18:00,448 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 16:18:00,448 INFO L515 ElimStorePlain]: Eliminatee |#length| vanished before elimination [2020-12-09 16:18:00,448 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 16:18:00,448 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:45, output treesize:1 [2020-12-09 16:18:00,452 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 16:18:00,452 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [830191293] [2020-12-09 16:18:00,452 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2098412621] [2020-12-09 16:18:00,452 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f3b1e071-9075-4a0f-b2e0-a3c1da29d57a/bin/utaipan/cvc4 Starting monitored process 32 with cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with cvc4 --incremental --print-success --lang smt [2020-12-09 16:18:00,534 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-12-09 16:18:00,535 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-09 16:18:00,536 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 15 conjunts are in the unsatisfiable core [2020-12-09 16:18:00,536 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 16:18:00,543 INFO L443 ElimStorePlain]: Different costs {0=[|v_#length_51|], 1=[|v_#valid_54|]} [2020-12-09 16:18:00,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 16:18:00,548 INFO L382 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 [2020-12-09 16:18:00,548 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 16:18:00,562 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 16:18:00,567 INFO L382 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 [2020-12-09 16:18:00,568 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 16:18:00,581 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 16:18:00,582 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 16:18:00,583 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:16 [2020-12-09 16:18:00,925 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 16:18:00,925 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 16:18:02,924 INFO L443 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2020-12-09 16:18:02,929 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 16:18:02,930 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 16:18:02,932 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 16:18:02,932 INFO L515 ElimStorePlain]: Eliminatee |#length| vanished before elimination [2020-12-09 16:18:02,932 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 16:18:02,932 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:45, output treesize:1 [2020-12-09 16:18:02,936 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 16:18:02,936 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [845828203] [2020-12-09 16:18:02,936 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f3b1e071-9075-4a0f-b2e0-a3c1da29d57a/bin/utaipan/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 16:18:02,973 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-12-09 16:18:02,973 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-09 16:18:02,975 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 14 conjunts are in the unsatisfiable core [2020-12-09 16:18:02,976 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 16:18:02,981 INFO L443 ElimStorePlain]: Different costs {0=[|v_#length_53|], 1=[|v_#valid_56|]} [2020-12-09 16:18:02,986 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 16:18:02,987 INFO L382 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 [2020-12-09 16:18:02,987 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 16:18:03,002 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 16:18:03,010 INFO L382 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 [2020-12-09 16:18:03,011 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 16:18:03,025 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 16:18:03,026 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 16:18:03,026 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:16 [2020-12-09 16:18:03,169 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 16:18:03,170 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 16:18:03,190 INFO L443 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2020-12-09 16:18:03,194 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 16:18:03,194 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 16:18:03,195 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 16:18:03,195 INFO L515 ElimStorePlain]: Eliminatee |#length| vanished before elimination [2020-12-09 16:18:03,196 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 16:18:03,196 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:39, output treesize:1 [2020-12-09 16:18:03,199 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 16:18:03,199 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2020-12-09 16:18:03,200 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9, 9, 8, 8] total 33 [2020-12-09 16:18:03,200 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344189444] [2020-12-09 16:18:03,200 INFO L461 AbstractCegarLoop]: Interpolant automaton has 34 states [2020-12-09 16:18:03,200 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 16:18:03,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2020-12-09 16:18:03,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=284, Invalid=838, Unknown=0, NotChecked=0, Total=1122 [2020-12-09 16:18:03,201 INFO L87 Difference]: Start difference. First operand 86 states and 102 transitions. Second operand 34 states. [2020-12-09 16:18:06,258 WARN L197 SmtUtils]: Spent 1.59 s on a formula simplification. DAG size of input: 62 DAG size of output: 61 [2020-12-09 16:18:07,511 WARN L197 SmtUtils]: Spent 970.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2020-12-09 16:18:10,665 WARN L197 SmtUtils]: Spent 1.11 s on a formula simplification. DAG size of input: 51 DAG size of output: 50 [2020-12-09 16:18:12,618 WARN L197 SmtUtils]: Spent 1.55 s on a formula simplification. DAG size of input: 58 DAG size of output: 57 [2020-12-09 16:18:13,655 WARN L197 SmtUtils]: Spent 735.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 43 [2020-12-09 16:18:16,249 WARN L197 SmtUtils]: Spent 568.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 39 [2020-12-09 16:18:18,132 WARN L197 SmtUtils]: Spent 1.34 s on a formula simplification. DAG size of input: 57 DAG size of output: 56 [2020-12-09 16:18:18,796 WARN L197 SmtUtils]: Spent 338.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 32 [2020-12-09 16:18:21,159 WARN L197 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 28 [2020-12-09 16:18:22,444 WARN L197 SmtUtils]: Spent 796.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 48 [2020-12-09 16:18:22,870 WARN L197 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 17 [2020-12-09 16:18:24,684 WARN L197 SmtUtils]: Spent 824.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 44 [2020-12-09 16:18:26,323 WARN L197 SmtUtils]: Spent 953.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 44 [2020-12-09 16:18:28,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 16:18:28,229 INFO L93 Difference]: Finished difference Result 514 states and 562 transitions. [2020-12-09 16:18:28,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2020-12-09 16:18:28,231 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 23 [2020-12-09 16:18:28,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 16:18:28,233 INFO L225 Difference]: With dead ends: 514 [2020-12-09 16:18:28,233 INFO L226 Difference]: Without dead ends: 514 [2020-12-09 16:18:28,234 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 98 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 855 ImplicationChecksByTransitivity, 19.0s TimeCoverageRelationStatistics Valid=711, Invalid=1941, Unknown=0, NotChecked=0, Total=2652 [2020-12-09 16:18:28,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2020-12-09 16:18:28,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 134. [2020-12-09 16:18:28,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2020-12-09 16:18:28,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 162 transitions. [2020-12-09 16:18:28,238 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 162 transitions. Word has length 23 [2020-12-09 16:18:28,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 16:18:28,238 INFO L481 AbstractCegarLoop]: Abstraction has 134 states and 162 transitions. [2020-12-09 16:18:28,238 INFO L482 AbstractCegarLoop]: Interpolant automaton has 34 states. [2020-12-09 16:18:28,238 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 162 transitions. [2020-12-09 16:18:28,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-12-09 16:18:28,238 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 16:18:28,238 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 16:18:28,840 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 z3 -smt2 -in SMTLIB2_COMPLIANT=true,32 cvc4 --incremental --print-success --lang smt,31 mathsat -unsat_core_generation=3 [2020-12-09 16:18:28,841 INFO L429 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]=== [2020-12-09 16:18:28,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 16:18:28,842 INFO L82 PathProgramCache]: Analyzing trace with hash -2103285548, now seen corresponding path program 1 times [2020-12-09 16:18:28,843 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 16:18:28,843 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [603454200] [2020-12-09 16:18:28,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f3b1e071-9075-4a0f-b2e0-a3c1da29d57a/bin/utaipan/mathsat Starting monitored process 34 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with mathsat -unsat_core_generation=3 [2020-12-09 16:18:28,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 16:18:28,919 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 18 conjunts are in the unsatisfiable core [2020-12-09 16:18:28,920 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 16:18:28,940 INFO L382 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 [2020-12-09 16:18:28,941 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 16:18:28,944 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 16:18:28,945 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 16:18:28,945 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:12 [2020-12-09 16:18:28,999 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 16:18:29,083 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 16:18:29,083 INFO L382 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 [2020-12-09 16:18:29,084 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-09 16:18:29,085 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-09 16:18:29,086 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-09 16:18:29,100 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 16:18:29,102 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-09 16:18:29,103 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:32, output treesize:13 [2020-12-09 16:18:29,138 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 16:18:29,163 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 16:18:29,163 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 16:18:29,163 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [603454200] [2020-12-09 16:18:29,163 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 16:18:29,163 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-12-09 16:18:29,163 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429565244] [2020-12-09 16:18:29,164 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-12-09 16:18:29,164 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 16:18:29,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-12-09 16:18:29,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2020-12-09 16:18:29,164 INFO L87 Difference]: Start difference. First operand 134 states and 162 transitions. Second operand 12 states. [2020-12-09 16:18:29,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 16:18:29,715 INFO L93 Difference]: Finished difference Result 149 states and 175 transitions. [2020-12-09 16:18:29,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-12-09 16:18:29,716 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 25 [2020-12-09 16:18:29,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 16:18:29,716 INFO L225 Difference]: With dead ends: 149 [2020-12-09 16:18:29,716 INFO L226 Difference]: Without dead ends: 131 [2020-12-09 16:18:29,716 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2020-12-09 16:18:29,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2020-12-09 16:18:29,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 130. [2020-12-09 16:18:29,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2020-12-09 16:18:29,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 146 transitions. [2020-12-09 16:18:29,718 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 146 transitions. Word has length 25 [2020-12-09 16:18:29,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 16:18:29,719 INFO L481 AbstractCegarLoop]: Abstraction has 130 states and 146 transitions. [2020-12-09 16:18:29,719 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-12-09 16:18:29,719 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 146 transitions. [2020-12-09 16:18:29,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-12-09 16:18:29,719 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 16:18:29,719 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 16:18:29,920 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 mathsat -unsat_core_generation=3 [2020-12-09 16:18:29,920 INFO L429 AbstractCegarLoop]: === Iteration 26 === [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]=== [2020-12-09 16:18:29,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 16:18:29,921 INFO L82 PathProgramCache]: Analyzing trace with hash -1884430830, now seen corresponding path program 1 times [2020-12-09 16:18:29,922 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 16:18:29,923 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1540822417] [2020-12-09 16:18:29,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f3b1e071-9075-4a0f-b2e0-a3c1da29d57a/bin/utaipan/mathsat Starting monitored process 35 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with mathsat -unsat_core_generation=3 [2020-12-09 16:18:29,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 16:18:29,989 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 20 conjunts are in the unsatisfiable core [2020-12-09 16:18:29,990 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 16:18:30,034 INFO L382 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 15 treesize of output 11 [2020-12-09 16:18:30,035 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 16:18:30,049 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 16:18:30,049 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-09 16:18:30,050 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2020-12-09 16:18:30,181 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 16:18:30,182 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 16:18:30,326 INFO L173 IndexEqualityManager]: detected equality via solver [2020-12-09 16:18:30,359 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 16:18:30,360 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 45 [2020-12-09 16:18:30,362 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-12-09 16:18:30,362 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-09 16:18:30,364 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-12-09 16:18:30,364 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-09 16:18:30,365 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-09 16:18:30,414 INFO L625 ElimStorePlain]: treesize reduction 15, result has 70.6 percent of original size [2020-12-09 16:18:30,419 INFO L547 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-09 16:18:30,420 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:44, output treesize:13 [2020-12-09 16:18:30,462 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 16:18:30,491 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 16:18:30,492 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 16:18:30,492 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1540822417] [2020-12-09 16:18:30,492 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 16:18:30,492 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-12-09 16:18:30,492 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377806248] [2020-12-09 16:18:30,492 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-12-09 16:18:30,492 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 16:18:30,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-12-09 16:18:30,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2020-12-09 16:18:30,493 INFO L87 Difference]: Start difference. First operand 130 states and 146 transitions. Second operand 14 states. [2020-12-09 16:18:31,293 WARN L197 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2020-12-09 16:18:31,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 16:18:31,793 INFO L93 Difference]: Finished difference Result 148 states and 164 transitions. [2020-12-09 16:18:31,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-12-09 16:18:31,794 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2020-12-09 16:18:31,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 16:18:31,795 INFO L225 Difference]: With dead ends: 148 [2020-12-09 16:18:31,795 INFO L226 Difference]: Without dead ends: 134 [2020-12-09 16:18:31,795 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=139, Invalid=367, Unknown=0, NotChecked=0, Total=506 [2020-12-09 16:18:31,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2020-12-09 16:18:31,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 131. [2020-12-09 16:18:31,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2020-12-09 16:18:31,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 147 transitions. [2020-12-09 16:18:31,797 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 147 transitions. Word has length 25 [2020-12-09 16:18:31,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 16:18:31,797 INFO L481 AbstractCegarLoop]: Abstraction has 131 states and 147 transitions. [2020-12-09 16:18:31,797 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-12-09 16:18:31,797 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 147 transitions. [2020-12-09 16:18:31,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-12-09 16:18:31,798 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 16:18:31,798 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 16:18:31,998 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 mathsat -unsat_core_generation=3 [2020-12-09 16:18:31,999 INFO L429 AbstractCegarLoop]: === Iteration 27 === [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]=== [2020-12-09 16:18:32,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 16:18:32,000 INFO L82 PathProgramCache]: Analyzing trace with hash 945844693, now seen corresponding path program 1 times [2020-12-09 16:18:32,001 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 16:18:32,001 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1125313829] [2020-12-09 16:18:32,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f3b1e071-9075-4a0f-b2e0-a3c1da29d57a/bin/utaipan/mathsat Starting monitored process 36 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with mathsat -unsat_core_generation=3 [2020-12-09 16:18:32,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 16:18:32,103 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 15 conjunts are in the unsatisfiable core [2020-12-09 16:18:32,104 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 16:18:32,112 INFO L382 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 [2020-12-09 16:18:32,113 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 16:18:32,122 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 16:18:32,122 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 16:18:32,122 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2020-12-09 16:18:32,139 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2020-12-09 16:18:32,140 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 16:18:32,145 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 16:18:32,146 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 16:18:32,146 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2020-12-09 16:18:32,163 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2020-12-09 16:18:32,164 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 16:18:32,182 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 16:18:32,183 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-12-09 16:18:32,184 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:31, output treesize:27 [2020-12-09 16:18:32,299 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 13 [2020-12-09 16:18:32,300 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 16:18:32,305 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 16:18:32,306 INFO L547 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 16:18:32,306 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:32, output treesize:5 [2020-12-09 16:18:32,343 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 16:18:32,343 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 16:18:32,343 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1125313829] [2020-12-09 16:18:32,343 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 16:18:32,343 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-12-09 16:18:32,344 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857411527] [2020-12-09 16:18:32,344 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-09 16:18:32,344 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 16:18:32,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-09 16:18:32,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2020-12-09 16:18:32,344 INFO L87 Difference]: Start difference. First operand 131 states and 147 transitions. Second operand 9 states. [2020-12-09 16:18:34,852 WARN L197 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2020-12-09 16:18:35,121 WARN L197 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 38 [2020-12-09 16:18:35,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 16:18:35,167 INFO L93 Difference]: Finished difference Result 151 states and 167 transitions. [2020-12-09 16:18:35,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-09 16:18:35,168 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2020-12-09 16:18:35,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 16:18:35,168 INFO L225 Difference]: With dead ends: 151 [2020-12-09 16:18:35,168 INFO L226 Difference]: Without dead ends: 128 [2020-12-09 16:18:35,169 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2020-12-09 16:18:35,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2020-12-09 16:18:35,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2020-12-09 16:18:35,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2020-12-09 16:18:35,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 143 transitions. [2020-12-09 16:18:35,171 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 143 transitions. Word has length 29 [2020-12-09 16:18:35,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 16:18:35,171 INFO L481 AbstractCegarLoop]: Abstraction has 128 states and 143 transitions. [2020-12-09 16:18:35,171 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-09 16:18:35,171 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 143 transitions. [2020-12-09 16:18:35,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-12-09 16:18:35,171 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 16:18:35,171 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 16:18:35,372 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 mathsat -unsat_core_generation=3 [2020-12-09 16:18:35,372 INFO L429 AbstractCegarLoop]: === Iteration 28 === [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]=== [2020-12-09 16:18:35,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 16:18:35,373 INFO L82 PathProgramCache]: Analyzing trace with hash -1425894569, now seen corresponding path program 1 times [2020-12-09 16:18:35,374 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 16:18:35,375 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [745465789] [2020-12-09 16:18:35,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f3b1e071-9075-4a0f-b2e0-a3c1da29d57a/bin/utaipan/mathsat Starting monitored process 37 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with mathsat -unsat_core_generation=3 [2020-12-09 16:18:35,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 16:18:35,524 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 20 conjunts are in the unsatisfiable core [2020-12-09 16:18:35,525 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 16:18:35,533 INFO L443 ElimStorePlain]: Different costs {0=[|v_#length_55|], 1=[|v_#valid_59|]} [2020-12-09 16:18:35,536 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 16:18:35,537 INFO L382 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 [2020-12-09 16:18:35,537 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 16:18:35,549 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 16:18:35,557 INFO L382 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 [2020-12-09 16:18:35,558 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 16:18:35,570 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 16:18:35,570 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 16:18:35,570 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:22 [2020-12-09 16:18:35,599 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2020-12-09 16:18:35,600 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 16:18:35,635 INFO L625 ElimStorePlain]: treesize reduction 9, result has 78.0 percent of original size [2020-12-09 16:18:35,636 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 16:18:35,636 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:45, output treesize:32 [2020-12-09 16:18:35,669 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 30 [2020-12-09 16:18:35,670 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 16:18:35,695 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 16:18:35,696 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-12-09 16:18:35,696 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:40 [2020-12-09 16:18:35,834 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 16:18:35,834 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 25 [2020-12-09 16:18:35,835 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 16:18:35,836 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 16:18:35,836 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-09 16:18:35,854 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 16:18:35,855 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 16:18:35,856 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-09 16:18:35,856 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:47, output treesize:27 [2020-12-09 16:18:35,857 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 16:18:35,898 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 16:18:35,990 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 16:18:35,990 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 16:18:36,677 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2020-12-09 16:18:36,700 INFO L382 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 29 treesize of output 27 [2020-12-09 16:18:36,703 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2020-12-09 16:18:36,706 INFO L625 ElimStorePlain]: treesize reduction 7, result has 30.0 percent of original size [2020-12-09 16:18:36,706 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 16:18:36,714 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2020-12-09 16:18:36,738 INFO L382 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 29 treesize of output 27 [2020-12-09 16:18:36,741 INFO L547 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2020-12-09 16:18:36,744 INFO L625 ElimStorePlain]: treesize reduction 7, result has 30.0 percent of original size [2020-12-09 16:18:36,744 INFO L547 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 16:18:36,786 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 16:18:36,787 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-12-09 16:18:36,787 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:65, output treesize:39 [2020-12-09 16:18:36,915 INFO L443 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2020-12-09 16:18:36,919 INFO L382 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 [2020-12-09 16:18:36,921 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 16:18:36,934 INFO L625 ElimStorePlain]: treesize reduction 12, result has 60.0 percent of original size [2020-12-09 16:18:36,935 INFO L173 IndexEqualityManager]: detected equality via solver [2020-12-09 16:18:36,936 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 16:18:36,941 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 16:18:36,942 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 16:18:36,942 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:36, output treesize:7 [2020-12-09 16:18:36,998 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 16:18:36,998 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [745465789] [2020-12-09 16:18:36,998 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [217773926] [2020-12-09 16:18:36,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f3b1e071-9075-4a0f-b2e0-a3c1da29d57a/bin/utaipan/cvc4 Starting monitored process 38 with cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with cvc4 --incremental --print-success --lang smt [2020-12-09 16:18:37,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 16:18:37,106 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 24 conjunts are in the unsatisfiable core [2020-12-09 16:18:37,107 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 16:18:37,115 INFO L382 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 [2020-12-09 16:18:37,116 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 16:18:37,124 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 16:18:37,124 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 16:18:37,124 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2020-12-09 16:18:37,196 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2020-12-09 16:18:37,197 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 16:18:37,251 INFO L625 ElimStorePlain]: treesize reduction 8, result has 80.5 percent of original size [2020-12-09 16:18:37,252 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-09 16:18:37,252 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:45, output treesize:33 [2020-12-09 16:18:37,348 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2020-12-09 16:18:37,349 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 16:18:37,383 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 16:18:37,384 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-12-09 16:18:37,384 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:40 [2020-12-09 16:18:39,654 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 16:18:39,654 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 24 [2020-12-09 16:18:39,655 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 16:18:39,656 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 16:18:39,657 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-09 16:18:39,679 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 16:18:39,680 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 16:18:39,681 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 16:18:39,681 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 16:18:39,683 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-12-09 16:18:39,683 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:28 [2020-12-09 16:18:39,684 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 16:18:39,684 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 16:18:39,685 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 16:18:39,781 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 16:18:39,784 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-09 16:18:40,031 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 16:18:40,032 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 16:18:40,274 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 16:18:40,285 INFO L382 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 [2020-12-09 16:18:40,287 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 16:18:40,301 INFO L382 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 [2020-12-09 16:18:40,302 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 16:18:40,382 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 16:18:40,399 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2020-12-09 16:18:40,424 INFO L382 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 29 treesize of output 27 [2020-12-09 16:18:40,426 INFO L547 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2020-12-09 16:18:40,430 INFO L625 ElimStorePlain]: treesize reduction 7, result has 30.0 percent of original size [2020-12-09 16:18:40,430 INFO L547 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 16:18:40,449 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2020-12-09 16:18:40,485 INFO L382 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 29 treesize of output 27 [2020-12-09 16:18:40,487 INFO L547 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2020-12-09 16:18:40,490 INFO L625 ElimStorePlain]: treesize reduction 7, result has 30.0 percent of original size [2020-12-09 16:18:40,490 INFO L547 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 16:18:40,558 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 16:18:40,559 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-12-09 16:18:40,559 INFO L244 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:83, output treesize:41 [2020-12-09 16:18:40,838 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 16:18:40,838 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [37798040] [2020-12-09 16:18:40,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f3b1e071-9075-4a0f-b2e0-a3c1da29d57a/bin/utaipan/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 16:18:40,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 16:18:40,893 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 21 conjunts are in the unsatisfiable core [2020-12-09 16:18:40,893 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 16:18:40,900 INFO L382 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 [2020-12-09 16:18:40,902 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 16:18:40,910 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 16:18:40,910 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 16:18:40,911 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2020-12-09 16:18:41,067 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2020-12-09 16:18:41,067 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 16:18:41,105 INFO L625 ElimStorePlain]: treesize reduction 8, result has 78.4 percent of original size [2020-12-09 16:18:41,106 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-09 16:18:41,106 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:41, output treesize:29 [2020-12-09 16:18:41,219 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2020-12-09 16:18:41,221 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 16:18:41,250 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 16:18:41,251 INFO L547 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-12-09 16:18:41,252 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:44, output treesize:40 [2020-12-09 16:18:41,894 INFO L173 IndexEqualityManager]: detected equality via solver [2020-12-09 16:18:41,895 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2020-12-09 16:18:41,896 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 16:18:41,908 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 16:18:41,911 INFO L547 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 16:18:41,911 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:44, output treesize:5 [2020-12-09 16:18:42,046 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 16:18:42,046 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 16:18:42,046 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 4 imperfect interpolant sequences. [2020-12-09 16:18:42,046 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [9, 8, 9, 7] total 33 [2020-12-09 16:18:42,046 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276353199] [2020-12-09 16:18:42,046 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-12-09 16:18:42,046 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 16:18:42,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-12-09 16:18:42,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=940, Unknown=2, NotChecked=0, Total=1056 [2020-12-09 16:18:42,047 INFO L87 Difference]: Start difference. First operand 128 states and 143 transitions. Second operand 11 states. [2020-12-09 16:18:44,915 WARN L197 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2020-12-09 16:18:45,367 WARN L197 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 50 [2020-12-09 16:18:45,876 WARN L197 SmtUtils]: Spent 330.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2020-12-09 16:18:46,212 WARN L197 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 50 [2020-12-09 16:18:46,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 16:18:46,279 INFO L93 Difference]: Finished difference Result 148 states and 163 transitions. [2020-12-09 16:18:46,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-12-09 16:18:46,280 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 29 [2020-12-09 16:18:46,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 16:18:46,280 INFO L225 Difference]: With dead ends: 148 [2020-12-09 16:18:46,280 INFO L226 Difference]: Without dead ends: 128 [2020-12-09 16:18:46,281 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 105 SyntacticMatches, 4 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 395 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=221, Invalid=1337, Unknown=2, NotChecked=0, Total=1560 [2020-12-09 16:18:46,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2020-12-09 16:18:46,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2020-12-09 16:18:46,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2020-12-09 16:18:46,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 142 transitions. [2020-12-09 16:18:46,283 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 142 transitions. Word has length 29 [2020-12-09 16:18:46,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 16:18:46,283 INFO L481 AbstractCegarLoop]: Abstraction has 128 states and 142 transitions. [2020-12-09 16:18:46,283 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-12-09 16:18:46,283 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 142 transitions. [2020-12-09 16:18:46,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-12-09 16:18:46,284 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 16:18:46,284 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 16:18:46,886 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 mathsat -unsat_core_generation=3,39 z3 -smt2 -in SMTLIB2_COMPLIANT=true,38 cvc4 --incremental --print-success --lang smt [2020-12-09 16:18:46,887 INFO L429 AbstractCegarLoop]: === Iteration 29 === [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]=== [2020-12-09 16:18:46,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 16:18:46,888 INFO L82 PathProgramCache]: Analyzing trace with hash -491439782, now seen corresponding path program 1 times [2020-12-09 16:18:46,888 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 16:18:46,889 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1776575574] [2020-12-09 16:18:46,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f3b1e071-9075-4a0f-b2e0-a3c1da29d57a/bin/utaipan/mathsat Starting monitored process 40 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with mathsat -unsat_core_generation=3 [2020-12-09 16:18:46,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 16:18:46,977 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 13 conjunts are in the unsatisfiable core [2020-12-09 16:18:46,977 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 16:18:47,136 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 16:18:47,136 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 16:18:47,341 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 16:18:47,358 INFO L382 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 [2020-12-09 16:18:47,359 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 16:18:47,364 INFO L382 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 [2020-12-09 16:18:47,365 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 16:18:47,379 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 16:18:47,379 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2020-12-09 16:18:47,379 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:15 [2020-12-09 16:18:47,533 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 16:18:47,533 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1776575574] [2020-12-09 16:18:47,533 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [178842656] [2020-12-09 16:18:47,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f3b1e071-9075-4a0f-b2e0-a3c1da29d57a/bin/utaipan/cvc4 Starting monitored process 41 with cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with cvc4 --incremental --print-success --lang smt [2020-12-09 16:18:47,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 16:18:47,629 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 16 conjunts are in the unsatisfiable core [2020-12-09 16:18:47,630 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 16:18:47,854 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 16:18:47,854 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 16:18:47,866 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 16:18:47,884 INFO L382 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 [2020-12-09 16:18:47,886 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 16:18:47,891 INFO L382 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 [2020-12-09 16:18:47,892 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 16:18:47,903 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 16:18:47,904 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2020-12-09 16:18:47,904 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:15 [2020-12-09 16:18:48,256 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 16:18:48,256 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2128447334] [2020-12-09 16:18:48,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f3b1e071-9075-4a0f-b2e0-a3c1da29d57a/bin/utaipan/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 16:18:48,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 16:18:48,307 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 14 conjunts are in the unsatisfiable core [2020-12-09 16:18:48,307 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 16:18:48,512 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 16:18:48,512 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 16:18:48,524 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 16:18:48,542 INFO L382 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 [2020-12-09 16:18:48,543 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 16:18:48,547 INFO L382 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 [2020-12-09 16:18:48,547 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 16:18:48,557 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 16:18:48,558 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2020-12-09 16:18:48,558 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:15 [2020-12-09 16:18:48,566 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-12-09 16:18:48,767 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 16:18:48,767 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2020-12-09 16:18:48,767 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 9, 8, 8, 8] total 22 [2020-12-09 16:18:48,767 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574867451] [2020-12-09 16:18:48,767 INFO L461 AbstractCegarLoop]: Interpolant automaton has 23 states [2020-12-09 16:18:48,767 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 16:18:48,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2020-12-09 16:18:48,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=398, Unknown=0, NotChecked=0, Total=506 [2020-12-09 16:18:48,768 INFO L87 Difference]: Start difference. First operand 128 states and 142 transitions. Second operand 23 states. [2020-12-09 16:18:49,200 WARN L197 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 28 [2020-12-09 16:18:49,957 WARN L197 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 36 [2020-12-09 16:18:50,525 WARN L197 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 37 [2020-12-09 16:18:51,202 WARN L197 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 34 [2020-12-09 16:18:51,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 16:18:51,255 INFO L93 Difference]: Finished difference Result 201 states and 219 transitions. [2020-12-09 16:18:51,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-12-09 16:18:51,256 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 33 [2020-12-09 16:18:51,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 16:18:51,257 INFO L225 Difference]: With dead ends: 201 [2020-12-09 16:18:51,257 INFO L226 Difference]: Without dead ends: 201 [2020-12-09 16:18:51,258 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 165 SyntacticMatches, 6 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=303, Invalid=819, Unknown=0, NotChecked=0, Total=1122 [2020-12-09 16:18:51,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2020-12-09 16:18:51,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 134. [2020-12-09 16:18:51,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2020-12-09 16:18:51,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 149 transitions. [2020-12-09 16:18:51,260 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 149 transitions. Word has length 33 [2020-12-09 16:18:51,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 16:18:51,260 INFO L481 AbstractCegarLoop]: Abstraction has 134 states and 149 transitions. [2020-12-09 16:18:51,260 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2020-12-09 16:18:51,260 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 149 transitions. [2020-12-09 16:18:51,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-12-09 16:18:51,261 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 16:18:51,261 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 16:18:51,862 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 mathsat -unsat_core_generation=3,42 z3 -smt2 -in SMTLIB2_COMPLIANT=true,41 cvc4 --incremental --print-success --lang smt [2020-12-09 16:18:51,863 INFO L429 AbstractCegarLoop]: === Iteration 30 === [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]=== [2020-12-09 16:18:51,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 16:18:51,864 INFO L82 PathProgramCache]: Analyzing trace with hash 1945235956, now seen corresponding path program 1 times [2020-12-09 16:18:51,865 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 16:18:51,865 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1080823514] [2020-12-09 16:18:51,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f3b1e071-9075-4a0f-b2e0-a3c1da29d57a/bin/utaipan/mathsat Starting monitored process 43 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with mathsat -unsat_core_generation=3 [2020-12-09 16:18:51,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 16:18:51,967 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 14 conjunts are in the unsatisfiable core [2020-12-09 16:18:51,967 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 16:18:51,990 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 16:18:51,990 INFO L382 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 [2020-12-09 16:18:51,991 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 16:18:52,017 INFO L625 ElimStorePlain]: treesize reduction 10, result has 68.8 percent of original size [2020-12-09 16:18:52,019 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 16:18:52,019 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:17, output treesize:13 [2020-12-09 16:18:52,132 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 16:18:52,132 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 16:18:52,504 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 16:18:52,504 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1080823514] [2020-12-09 16:18:52,504 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1724434150] [2020-12-09 16:18:52,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f3b1e071-9075-4a0f-b2e0-a3c1da29d57a/bin/utaipan/cvc4 Starting monitored process 44 with cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with cvc4 --incremental --print-success --lang smt [2020-12-09 16:18:52,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 16:18:52,604 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 15 conjunts are in the unsatisfiable core [2020-12-09 16:18:52,605 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 16:18:52,624 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 16:18:52,624 INFO L382 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 [2020-12-09 16:18:52,625 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 16:18:52,645 INFO L625 ElimStorePlain]: treesize reduction 10, result has 64.3 percent of original size [2020-12-09 16:18:52,646 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 16:18:52,646 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2020-12-09 16:18:52,966 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 16:18:52,966 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 16:18:53,537 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 16:18:53,538 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1385133656] [2020-12-09 16:18:53,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f3b1e071-9075-4a0f-b2e0-a3c1da29d57a/bin/utaipan/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 16:18:53,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 16:18:53,585 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 15 conjunts are in the unsatisfiable core [2020-12-09 16:18:53,586 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 16:18:53,606 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 16:18:53,606 INFO L382 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 [2020-12-09 16:18:53,607 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 16:18:53,629 INFO L625 ElimStorePlain]: treesize reduction 10, result has 64.3 percent of original size [2020-12-09 16:18:53,631 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 16:18:53,631 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2020-12-09 16:18:53,650 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 16:18:53,651 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 16:18:53,681 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 16:18:53,681 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2020-12-09 16:18:53,682 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 8, 8, 8, 8] total 23 [2020-12-09 16:18:53,682 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854739828] [2020-12-09 16:18:53,682 INFO L461 AbstractCegarLoop]: Interpolant automaton has 24 states [2020-12-09 16:18:53,682 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 16:18:53,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2020-12-09 16:18:53,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=439, Unknown=0, NotChecked=0, Total=552 [2020-12-09 16:18:53,683 INFO L87 Difference]: Start difference. First operand 134 states and 149 transitions. Second operand 24 states. [2020-12-09 16:18:55,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 16:18:55,272 INFO L93 Difference]: Finished difference Result 202 states and 218 transitions. [2020-12-09 16:18:55,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-12-09 16:18:55,273 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 34 [2020-12-09 16:18:55,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 16:18:55,274 INFO L225 Difference]: With dead ends: 202 [2020-12-09 16:18:55,274 INFO L226 Difference]: Without dead ends: 188 [2020-12-09 16:18:55,274 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 175 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=311, Invalid=879, Unknown=0, NotChecked=0, Total=1190 [2020-12-09 16:18:55,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2020-12-09 16:18:55,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 133. [2020-12-09 16:18:55,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2020-12-09 16:18:55,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 146 transitions. [2020-12-09 16:18:55,277 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 146 transitions. Word has length 34 [2020-12-09 16:18:55,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 16:18:55,277 INFO L481 AbstractCegarLoop]: Abstraction has 133 states and 146 transitions. [2020-12-09 16:18:55,277 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2020-12-09 16:18:55,277 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 146 transitions. [2020-12-09 16:18:55,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-12-09 16:18:55,278 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 16:18:55,278 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 16:18:55,880 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 z3 -smt2 -in SMTLIB2_COMPLIANT=true,43 mathsat -unsat_core_generation=3,44 cvc4 --incremental --print-success --lang smt [2020-12-09 16:18:55,881 INFO L429 AbstractCegarLoop]: === Iteration 31 === [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]=== [2020-12-09 16:18:55,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 16:18:55,882 INFO L82 PathProgramCache]: Analyzing trace with hash -871868475, now seen corresponding path program 2 times [2020-12-09 16:18:55,883 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 16:18:55,883 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1563341199] [2020-12-09 16:18:55,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f3b1e071-9075-4a0f-b2e0-a3c1da29d57a/bin/utaipan/mathsat Starting monitored process 46 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with mathsat -unsat_core_generation=3 [2020-12-09 16:18:55,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 16:18:55,992 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 30 conjunts are in the unsatisfiable core [2020-12-09 16:18:55,993 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 16:18:56,024 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 16:18:56,024 INFO L382 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 [2020-12-09 16:18:56,025 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 16:18:56,064 INFO L625 ElimStorePlain]: treesize reduction 10, result has 74.4 percent of original size [2020-12-09 16:18:56,065 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 16:18:56,065 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:20 [2020-12-09 16:18:56,263 INFO L382 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 17 treesize of output 13 [2020-12-09 16:18:56,264 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 16:18:56,278 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 16:18:56,278 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 16:18:56,278 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2020-12-09 16:18:56,466 INFO L382 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 32 treesize of output 24 [2020-12-09 16:18:56,467 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-09 16:18:56,489 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 16:18:56,490 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-12-09 16:18:56,490 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:40 [2020-12-09 16:18:56,559 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 16:18:56,560 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 16:18:56,756 INFO L173 IndexEqualityManager]: detected equality via solver [2020-12-09 16:18:56,789 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 16:18:56,789 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 45 [2020-12-09 16:18:56,790 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-12-09 16:18:56,791 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-09 16:18:56,792 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-12-09 16:18:56,792 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-09 16:18:56,793 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-09 16:18:56,844 INFO L625 ElimStorePlain]: treesize reduction 15, result has 73.2 percent of original size [2020-12-09 16:18:56,849 INFO L547 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-09 16:18:56,849 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:47, output treesize:13 [2020-12-09 16:18:56,911 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 16:18:56,959 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 16:18:56,959 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 16:18:57,650 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1563341199] [2020-12-09 16:18:57,650 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: incompatible size [2020-12-09 16:18:57,650 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1547090870] [2020-12-09 16:18:57,650 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f3b1e071-9075-4a0f-b2e0-a3c1da29d57a/bin/utaipan/cvc4 Starting monitored process 47 with cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with cvc4 --incremental --print-success --lang smt [2020-12-09 16:18:57,778 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-12-09 16:18:57,778 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-09 16:18:57,780 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 23 conjunts are in the unsatisfiable core [2020-12-09 16:18:57,781 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 16:18:57,785 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@6a5a13f [2020-12-09 16:18:57,785 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [670996415] [2020-12-09 16:18:57,785 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f3b1e071-9075-4a0f-b2e0-a3c1da29d57a/bin/utaipan/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 16:18:57,841 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-12-09 16:18:57,841 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-09 16:18:57,844 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 25 conjunts are in the unsatisfiable core [2020-12-09 16:18:57,845 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 16:18:57,848 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@6a5a13f [2020-12-09 16:18:57,848 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 0 imperfect interpolant sequences. [2020-12-09 16:18:57,848 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [] total 0 [2020-12-09 16:18:57,848 ERROR L205 FreeRefinementEngine]: Strategy WALRUS failed to provide any proof altough trace is infeasible [2020-12-09 16:18:57,848 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-12-09 16:18:58,452 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 mathsat -unsat_core_generation=3,47 cvc4 --incremental --print-success --lang smt,48 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 16:18:58,467 WARN L254 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2020-12-09 16:18:58,468 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 04:18:58 BoogieIcfgContainer [2020-12-09 16:18:58,468 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-09 16:18:58,468 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-09 16:18:58,468 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-09 16:18:58,468 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-09 16:18:58,469 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 04:17:24" (3/4) ... [2020-12-09 16:18:58,471 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-12-09 16:18:58,471 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-09 16:18:58,472 INFO L168 Benchmark]: Toolchain (without parser) took 94538.01 ms. Allocated memory was 56.6 MB in the beginning and 86.0 MB in the end (delta: 29.4 MB). Free memory was 35.1 MB in the beginning and 40.2 MB in the end (delta: -5.1 MB). Peak memory consumption was 24.9 MB. Max. memory is 16.1 GB. [2020-12-09 16:18:58,472 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 56.6 MB. Free memory was 39.6 MB in the beginning and 39.5 MB in the end (delta: 73.4 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-09 16:18:58,472 INFO L168 Benchmark]: CACSL2BoogieTranslator took 343.85 ms. Allocated memory was 56.6 MB in the beginning and 71.3 MB in the end (delta: 14.7 MB). Free memory was 34.7 MB in the beginning and 44.0 MB in the end (delta: -9.3 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2020-12-09 16:18:58,472 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.37 ms. Allocated memory is still 71.3 MB. Free memory was 44.0 MB in the beginning and 42.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-09 16:18:58,473 INFO L168 Benchmark]: Boogie Preprocessor took 24.05 ms. Allocated memory is still 71.3 MB. Free memory was 42.0 MB in the beginning and 40.4 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-09 16:18:58,473 INFO L168 Benchmark]: RCFGBuilder took 410.19 ms. Allocated memory is still 71.3 MB. Free memory was 40.4 MB in the beginning and 49.7 MB in the end (delta: -9.4 MB). Peak memory consumption was 7.6 MB. Max. memory is 16.1 GB. [2020-12-09 16:18:58,473 INFO L168 Benchmark]: TraceAbstraction took 93717.24 ms. Allocated memory was 71.3 MB in the beginning and 86.0 MB in the end (delta: 14.7 MB). Free memory was 49.0 MB in the beginning and 40.2 MB in the end (delta: 8.9 MB). Peak memory consumption was 23.4 MB. Max. memory is 16.1 GB. [2020-12-09 16:18:58,473 INFO L168 Benchmark]: Witness Printer took 2.85 ms. Allocated memory is still 86.0 MB. Free memory is still 40.2 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-12-09 16:18:58,475 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10 ms. Allocated memory is still 56.6 MB. Free memory was 39.6 MB in the beginning and 39.5 MB in the end (delta: 73.4 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 343.85 ms. Allocated memory was 56.6 MB in the beginning and 71.3 MB in the end (delta: 14.7 MB). Free memory was 34.7 MB in the beginning and 44.0 MB in the end (delta: -9.3 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 35.37 ms. Allocated memory is still 71.3 MB. Free memory was 44.0 MB in the beginning and 42.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 24.05 ms. Allocated memory is still 71.3 MB. Free memory was 42.0 MB in the beginning and 40.4 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 410.19 ms. Allocated memory is still 71.3 MB. Free memory was 40.4 MB in the beginning and 49.7 MB in the end (delta: -9.4 MB). Peak memory consumption was 7.6 MB. Max. memory is 16.1 GB. * TraceAbstraction took 93717.24 ms. Allocated memory was 71.3 MB in the beginning and 86.0 MB in the end (delta: 14.7 MB). Free memory was 49.0 MB in the beginning and 40.2 MB in the end (delta: 8.9 MB). Peak memory consumption was 23.4 MB. Max. memory is 16.1 GB. * Witness Printer took 2.85 ms. Allocated memory is still 86.0 MB. Free memory is still 40.2 MB. There was no memory consumed. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 519]: 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: [L530] int length1 = __VERIFIER_nondet_int(); [L531] int length2 = __VERIFIER_nondet_int(); [L532] COND FALSE !(length1 < 1) [L535] COND FALSE !(length2 < 1) [L538] char* nondetString1 = (char*) __builtin_alloca (length1 * sizeof(char)); [L539] char* nondetString2 = (char*) __builtin_alloca (length2 * sizeof(char)); [L541] int i = 0; [L541] COND TRUE i < length1 - 1 [L543] nondetString1[i] = __VERIFIER_nondet_char() [L541] i++ [L541] COND FALSE !(i < length1 - 1) [L546] int i = 0; [L546] COND TRUE i < length2 - 1 [L548] nondetString2[i] = __VERIFIER_nondet_char() [L546] i++ [L546] COND FALSE !(i < length2 - 1) [L551] nondetString1[length1-1] = '\0' [L552] nondetString2[length2-1] = '\0' [L516] unsigned char uc1, uc2; [L517] COND FALSE !(n == 0) [L519] EXPR n-- [L519] n-- > 0 && *s1 == *s2 [L519] EXPR \read(*s1) [L519] EXPR \read(*s2) [L519] n-- > 0 && *s1 == *s2 [L519] COND TRUE n-- > 0 && *s1 == *s2 [L520] n == 0 || *s1 == '\0' [L520] EXPR \read(*s1) [L520] n == 0 || *s1 == '\0' [L520] COND FALSE !(n == 0 || *s1 == '\0') [L522] s1++ [L523] s2++ [L519] EXPR n-- [L519] n-- > 0 && *s1 == *s2 [L519] EXPR \read(*s1) [L519] EXPR \read(*s2) [L519] n-- > 0 && *s1 == *s2 [L519] COND TRUE n-- > 0 && *s1 == *s2 [L520] n == 0 || *s1 == '\0' [L520] EXPR \read(*s1) [L520] n == 0 || *s1 == '\0' [L520] COND FALSE !(n == 0 || *s1 == '\0') [L522] s1++ [L523] s2++ [L519] EXPR n-- [L519] n-- > 0 && *s1 == *s2 [L519] \read(*s1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 57 locations, 19 error locations. Started 1 CEGAR loops. VerificationResult: UNKNOWN, OverallTime: 93.6s, OverallIterations: 31, TraceHistogramMax: 5, AutomataDifference: 56.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1239 SDtfs, 8468 SDslu, 4576 SDs, 0 SdLazy, 4016 SolverSat, 309 SolverUnsat, 7 SolverUnknown, 0 SolverNotchecked, 30.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1295 GetRequests, 930 SyntacticMatches, 27 SemanticMatches, 338 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2273 ImplicationChecksByTransitivity, 41.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=134occurred in iteration=24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 30 MinimizatonAttempts, 1442 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 22.5s InterpolantComputationTime, 804 NumberOfCodeBlocks, 804 NumberOfCodeBlocksAsserted, 46 NumberOfCheckSat, 1191 ConstructedInterpolants, 124 QuantifiedInterpolants, 452761 SizeOfPredicates, 344 NumberOfNonLiveVariables, 2571 ConjunctsInSsa, 476 ConjunctsInUnsatCore, 64 InterpolantComputations, 24 PerfectInterpolantSequences, 37/353 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request...