./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/array-memsafety/cstrcmp-alloca-2.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_f9066140-8ed7-4b24-9e42-e35294023b38/bin/utaipan/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_f9066140-8ed7-4b24-9e42-e35294023b38/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_f9066140-8ed7-4b24-9e42-e35294023b38/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_f9066140-8ed7-4b24-9e42-e35294023b38/bin/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/array-memsafety/cstrcmp-alloca-2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_f9066140-8ed7-4b24-9e42-e35294023b38/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_f9066140-8ed7-4b24-9e42-e35294023b38/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 df3db790fa8159689a8da2e25598b93c123cddf7 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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_f9066140-8ed7-4b24-9e42-e35294023b38/bin/utaipan/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_f9066140-8ed7-4b24-9e42-e35294023b38/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_f9066140-8ed7-4b24-9e42-e35294023b38/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_f9066140-8ed7-4b24-9e42-e35294023b38/bin/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/array-memsafety/cstrcmp-alloca-2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_f9066140-8ed7-4b24-9e42-e35294023b38/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_f9066140-8ed7-4b24-9e42-e35294023b38/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 df3db790fa8159689a8da2e25598b93c123cddf7 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 05:50:34,988 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-09 05:50:34,990 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-09 05:50:35,028 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-09 05:50:35,029 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-09 05:50:35,030 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-09 05:50:35,031 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-09 05:50:35,034 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-09 05:50:35,036 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-09 05:50:35,037 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-09 05:50:35,038 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-09 05:50:35,039 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-09 05:50:35,040 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-09 05:50:35,041 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-09 05:50:35,042 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-09 05:50:35,043 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-09 05:50:35,044 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-09 05:50:35,045 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-09 05:50:35,047 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-09 05:50:35,049 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-09 05:50:35,050 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-09 05:50:35,051 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-09 05:50:35,053 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-09 05:50:35,054 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-09 05:50:35,057 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-09 05:50:35,057 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-09 05:50:35,057 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-09 05:50:35,059 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-09 05:50:35,059 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-09 05:50:35,060 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-09 05:50:35,061 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-09 05:50:35,061 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-09 05:50:35,062 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-09 05:50:35,063 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-09 05:50:35,064 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-09 05:50:35,064 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-09 05:50:35,065 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-09 05:50:35,065 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-09 05:50:35,066 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-09 05:50:35,066 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-09 05:50:35,067 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-09 05:50:35,068 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_f9066140-8ed7-4b24-9e42-e35294023b38/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2020-12-09 05:50:35,088 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-09 05:50:35,088 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-09 05:50:35,089 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2020-12-09 05:50:35,089 INFO L138 SettingsManager]: * User list type=DISABLED [2020-12-09 05:50:35,089 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2020-12-09 05:50:35,089 INFO L138 SettingsManager]: * Explicit value domain=true [2020-12-09 05:50:35,089 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2020-12-09 05:50:35,089 INFO L138 SettingsManager]: * Octagon Domain=false [2020-12-09 05:50:35,089 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2020-12-09 05:50:35,089 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2020-12-09 05:50:35,090 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2020-12-09 05:50:35,090 INFO L138 SettingsManager]: * Interval Domain=false [2020-12-09 05:50:35,090 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2020-12-09 05:50:35,090 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2020-12-09 05:50:35,090 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2020-12-09 05:50:35,090 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-09 05:50:35,091 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-09 05:50:35,091 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-09 05:50:35,091 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-09 05:50:35,091 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-12-09 05:50:35,091 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-09 05:50:35,091 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-09 05:50:35,091 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-09 05:50:35,091 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2020-12-09 05:50:35,092 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2020-12-09 05:50:35,092 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2020-12-09 05:50:35,092 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-09 05:50:35,092 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-12-09 05:50:35,092 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-09 05:50:35,092 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-09 05:50:35,092 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-09 05:50:35,093 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-09 05:50:35,093 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-09 05:50:35,093 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-09 05:50:35,093 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-09 05:50:35,093 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2020-12-09 05:50:35,093 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-09 05:50:35,093 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-09 05:50:35,093 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-12-09 05:50:35,094 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_f9066140-8ed7-4b24-9e42-e35294023b38/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_f9066140-8ed7-4b24-9e42-e35294023b38/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 -> df3db790fa8159689a8da2e25598b93c123cddf7 [2020-12-09 05:50:35,273 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-09 05:50:35,288 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-09 05:50:35,290 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-09 05:50:35,291 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-09 05:50:35,292 INFO L275 PluginConnector]: CDTParser initialized [2020-12-09 05:50:35,292 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_f9066140-8ed7-4b24-9e42-e35294023b38/bin/utaipan/../../sv-benchmarks/c/array-memsafety/cstrcmp-alloca-2.i [2020-12-09 05:50:35,333 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_f9066140-8ed7-4b24-9e42-e35294023b38/bin/utaipan/data/ac53865f8/89f7ff5c5ba1418d8b6e2d3c96f7cf60/FLAGa89d72ab4 [2020-12-09 05:50:35,743 INFO L306 CDTParser]: Found 1 translation units. [2020-12-09 05:50:35,743 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_f9066140-8ed7-4b24-9e42-e35294023b38/sv-benchmarks/c/array-memsafety/cstrcmp-alloca-2.i [2020-12-09 05:50:35,755 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_f9066140-8ed7-4b24-9e42-e35294023b38/bin/utaipan/data/ac53865f8/89f7ff5c5ba1418d8b6e2d3c96f7cf60/FLAGa89d72ab4 [2020-12-09 05:50:36,132 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_f9066140-8ed7-4b24-9e42-e35294023b38/bin/utaipan/data/ac53865f8/89f7ff5c5ba1418d8b6e2d3c96f7cf60 [2020-12-09 05:50:36,138 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-09 05:50:36,141 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-09 05:50:36,144 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-09 05:50:36,145 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-09 05:50:36,150 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-09 05:50:36,151 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 05:50:36" (1/1) ... [2020-12-09 05:50:36,153 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21ffd719 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:50:36, skipping insertion in model container [2020-12-09 05:50:36,154 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 05:50:36" (1/1) ... [2020-12-09 05:50:36,161 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-09 05:50:36,188 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-09 05:50:36,384 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 05:50:36,392 INFO L203 MainTranslator]: Completed pre-run [2020-12-09 05:50:36,425 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 05:50:36,466 INFO L208 MainTranslator]: Completed translation [2020-12-09 05:50:36,466 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:50:36 WrapperNode [2020-12-09 05:50:36,466 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-09 05:50:36,467 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-09 05:50:36,467 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-09 05:50:36,467 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-09 05:50:36,473 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:50:36" (1/1) ... [2020-12-09 05:50:36,485 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:50:36" (1/1) ... [2020-12-09 05:50:36,506 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-09 05:50:36,507 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-09 05:50:36,507 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-09 05:50:36,507 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-09 05:50:36,514 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:50:36" (1/1) ... [2020-12-09 05:50:36,514 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:50:36" (1/1) ... [2020-12-09 05:50:36,517 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:50:36" (1/1) ... [2020-12-09 05:50:36,518 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:50:36" (1/1) ... [2020-12-09 05:50:36,523 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:50:36" (1/1) ... [2020-12-09 05:50:36,528 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:50:36" (1/1) ... [2020-12-09 05:50:36,530 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:50:36" (1/1) ... [2020-12-09 05:50:36,532 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-09 05:50:36,533 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-09 05:50:36,534 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-09 05:50:36,534 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-09 05:50:36,535 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:50:36" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f9066140-8ed7-4b24-9e42-e35294023b38/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 05:50:36,597 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-12-09 05:50:36,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-12-09 05:50:36,597 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-09 05:50:36,597 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-12-09 05:50:36,597 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-09 05:50:36,597 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-09 05:50:36,983 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-09 05:50:36,983 INFO L299 CfgBuilder]: Removed 9 assume(true) statements. [2020-12-09 05:50:36,985 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 05:50:36 BoogieIcfgContainer [2020-12-09 05:50:36,985 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-09 05:50:36,986 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-09 05:50:36,986 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-09 05:50:36,990 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-09 05:50:36,990 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 05:50:36" (1/3) ... [2020-12-09 05:50:36,991 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a6b21b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 05:50:36, skipping insertion in model container [2020-12-09 05:50:36,991 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:50:36" (2/3) ... [2020-12-09 05:50:36,991 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a6b21b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 05:50:36, skipping insertion in model container [2020-12-09 05:50:36,991 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 05:50:36" (3/3) ... [2020-12-09 05:50:36,993 INFO L111 eAbstractionObserver]: Analyzing ICFG cstrcmp-alloca-2.i [2020-12-09 05:50:37,005 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-09 05:50:37,008 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 19 error locations. [2020-12-09 05:50:37,015 INFO L253 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2020-12-09 05:50:37,031 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-09 05:50:37,031 INFO L378 AbstractCegarLoop]: Hoare is false [2020-12-09 05:50:37,031 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-09 05:50:37,031 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-09 05:50:37,032 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-09 05:50:37,032 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-09 05:50:37,032 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-09 05:50:37,032 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-09 05:50:37,043 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states. [2020-12-09 05:50:37,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-12-09 05:50:37,047 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:50:37,047 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-12-09 05:50:37,047 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 05:50:37,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:50:37,051 INFO L82 PathProgramCache]: Analyzing trace with hash 155459, now seen corresponding path program 1 times [2020-12-09 05:50:37,057 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:50:37,057 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441972902] [2020-12-09 05:50:37,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:50:37,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:50:37,191 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 05:50:37,191 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441972902] [2020-12-09 05:50:37,192 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 05:50:37,192 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-12-09 05:50:37,192 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870177982] [2020-12-09 05:50:37,196 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 05:50:37,197 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:50:37,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 05:50:37,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 05:50:37,212 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 3 states. [2020-12-09 05:50:37,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:50:37,251 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2020-12-09 05:50:37,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 05:50:37,253 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-12-09 05:50:37,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:50:37,258 INFO L225 Difference]: With dead ends: 33 [2020-12-09 05:50:37,259 INFO L226 Difference]: Without dead ends: 32 [2020-12-09 05:50:37,259 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 05:50:37,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-12-09 05:50:37,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2020-12-09 05:50:37,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-12-09 05:50:37,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2020-12-09 05:50:37,281 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 3 [2020-12-09 05:50:37,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:50:37,281 INFO L481 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2020-12-09 05:50:37,282 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 05:50:37,282 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2020-12-09 05:50:37,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-12-09 05:50:37,282 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:50:37,282 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-12-09 05:50:37,282 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-09 05:50:37,282 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 05:50:37,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:50:37,283 INFO L82 PathProgramCache]: Analyzing trace with hash 155460, now seen corresponding path program 1 times [2020-12-09 05:50:37,283 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:50:37,283 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077633714] [2020-12-09 05:50:37,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:50:37,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:50:37,331 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 05:50:37,332 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077633714] [2020-12-09 05:50:37,332 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 05:50:37,332 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 05:50:37,332 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343449028] [2020-12-09 05:50:37,333 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 05:50:37,333 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:50:37,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 05:50:37,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 05:50:37,334 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand 4 states. [2020-12-09 05:50:37,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:50:37,409 INFO L93 Difference]: Finished difference Result 62 states and 68 transitions. [2020-12-09 05:50:37,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 05:50:37,409 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2020-12-09 05:50:37,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:50:37,410 INFO L225 Difference]: With dead ends: 62 [2020-12-09 05:50:37,410 INFO L226 Difference]: Without dead ends: 62 [2020-12-09 05:50:37,411 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 05:50:37,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2020-12-09 05:50:37,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 34. [2020-12-09 05:50:37,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-12-09 05:50:37,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2020-12-09 05:50:37,414 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 3 [2020-12-09 05:50:37,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:50:37,415 INFO L481 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2020-12-09 05:50:37,415 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 05:50:37,415 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2020-12-09 05:50:37,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-12-09 05:50:37,415 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:50:37,415 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-12-09 05:50:37,415 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-09 05:50:37,415 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 05:50:37,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:50:37,416 INFO L82 PathProgramCache]: Analyzing trace with hash 4915868, now seen corresponding path program 1 times [2020-12-09 05:50:37,416 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:50:37,416 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066518873] [2020-12-09 05:50:37,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:50:37,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:50:37,436 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 05:50:37,436 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066518873] [2020-12-09 05:50:37,437 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 05:50:37,437 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-12-09 05:50:37,437 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580219052] [2020-12-09 05:50:37,437 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 05:50:37,437 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:50:37,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 05:50:37,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 05:50:37,438 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand 3 states. [2020-12-09 05:50:37,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:50:37,458 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2020-12-09 05:50:37,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 05:50:37,459 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-12-09 05:50:37,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:50:37,459 INFO L225 Difference]: With dead ends: 32 [2020-12-09 05:50:37,459 INFO L226 Difference]: Without dead ends: 32 [2020-12-09 05:50:37,459 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 05:50:37,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-12-09 05:50:37,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2020-12-09 05:50:37,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-12-09 05:50:37,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2020-12-09 05:50:37,462 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 4 [2020-12-09 05:50:37,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:50:37,462 INFO L481 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2020-12-09 05:50:37,462 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 05:50:37,462 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2020-12-09 05:50:37,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-12-09 05:50:37,463 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:50:37,463 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-12-09 05:50:37,463 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-09 05:50:37,463 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 05:50:37,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:50:37,463 INFO L82 PathProgramCache]: Analyzing trace with hash 4915869, now seen corresponding path program 1 times [2020-12-09 05:50:37,463 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:50:37,464 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265760066] [2020-12-09 05:50:37,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:50:37,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:50:37,509 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 05:50:37,509 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265760066] [2020-12-09 05:50:37,509 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 05:50:37,509 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 05:50:37,510 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549588043] [2020-12-09 05:50:37,510 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 05:50:37,510 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:50:37,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 05:50:37,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-09 05:50:37,511 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand 5 states. [2020-12-09 05:50:37,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:50:37,574 INFO L93 Difference]: Finished difference Result 57 states and 63 transitions. [2020-12-09 05:50:37,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 05:50:37,575 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2020-12-09 05:50:37,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:50:37,575 INFO L225 Difference]: With dead ends: 57 [2020-12-09 05:50:37,575 INFO L226 Difference]: Without dead ends: 57 [2020-12-09 05:50:37,576 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 05:50:37,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2020-12-09 05:50:37,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 34. [2020-12-09 05:50:37,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-12-09 05:50:37,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2020-12-09 05:50:37,579 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 4 [2020-12-09 05:50:37,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:50:37,579 INFO L481 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2020-12-09 05:50:37,579 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 05:50:37,579 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2020-12-09 05:50:37,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-12-09 05:50:37,579 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:50:37,579 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-12-09 05:50:37,579 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-09 05:50:37,579 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 05:50:37,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:50:37,580 INFO L82 PathProgramCache]: Analyzing trace with hash 4918544, now seen corresponding path program 1 times [2020-12-09 05:50:37,580 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:50:37,580 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885242177] [2020-12-09 05:50:37,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:50:37,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:50:37,687 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 05:50:37,687 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885242177] [2020-12-09 05:50:37,687 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 05:50:37,687 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 05:50:37,687 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524315601] [2020-12-09 05:50:37,688 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 05:50:37,688 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:50:37,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 05:50:37,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-12-09 05:50:37,688 INFO L87 Difference]: Start difference. First operand 34 states and 39 transitions. Second operand 5 states. [2020-12-09 05:50:37,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:50:37,760 INFO L93 Difference]: Finished difference Result 84 states and 93 transitions. [2020-12-09 05:50:37,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 05:50:37,760 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2020-12-09 05:50:37,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:50:37,761 INFO L225 Difference]: With dead ends: 84 [2020-12-09 05:50:37,761 INFO L226 Difference]: Without dead ends: 84 [2020-12-09 05:50:37,761 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 05:50:37,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2020-12-09 05:50:37,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 36. [2020-12-09 05:50:37,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-12-09 05:50:37,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2020-12-09 05:50:37,765 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 42 transitions. Word has length 4 [2020-12-09 05:50:37,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:50:37,765 INFO L481 AbstractCegarLoop]: Abstraction has 36 states and 42 transitions. [2020-12-09 05:50:37,765 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 05:50:37,765 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2020-12-09 05:50:37,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-12-09 05:50:37,765 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:50:37,766 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2020-12-09 05:50:37,766 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-09 05:50:37,766 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 05:50:37,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:50:37,766 INFO L82 PathProgramCache]: Analyzing trace with hash 149486211, now seen corresponding path program 1 times [2020-12-09 05:50:37,766 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:50:37,766 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544665405] [2020-12-09 05:50:37,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:50:37,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:50:37,810 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 05:50:37,810 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544665405] [2020-12-09 05:50:37,810 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [628410659] [2020-12-09 05:50:37,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f9066140-8ed7-4b24-9e42-e35294023b38/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 05:50:37,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:50:37,850 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 12 conjunts are in the unsatisfiable core [2020-12-09 05:50:37,853 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 05:50:37,888 INFO L443 ElimStorePlain]: Different costs {0=[|v_#length_50|], 1=[|ULTIMATE.start_main_old_#valid|]} [2020-12-09 05:50:37,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 05:50:37,900 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 05:50:37,901 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 05:50:37,909 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 05:50:37,915 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 05:50:37,919 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 05:50:37,926 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 05:50:37,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 05:50:37,928 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:24, output treesize:12 [2020-12-09 05:50:37,951 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 05:50:37,951 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 05:50:37,983 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-12-09 05:50:38,008 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 05:50:38,008 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1769280695] [2020-12-09 05:50:38,023 INFO L159 IcfgInterpreter]: Started Sifa with 4 locations of interest [2020-12-09 05:50:38,023 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 05:50:38,026 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-12-09 05:50:38,030 INFO L176 IcfgInterpreter]: Starting interpretation [2020-12-09 05:50:38,030 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-12-09 05:50:38,365 INFO L180 IcfgInterpreter]: Interpretation finished [2020-12-09 05:50:38,490 WARN L197 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 48 [2020-12-09 05:50:38,693 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-09 05:50:38,693 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 05:50:38,693 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2020-12-09 05:50:38,693 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053192955] [2020-12-09 05:50:38,694 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-09 05:50:38,694 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:50:38,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-09 05:50:38,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2020-12-09 05:50:38,695 INFO L87 Difference]: Start difference. First operand 36 states and 42 transitions. Second operand 9 states. [2020-12-09 05:50:38,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:50:38,875 INFO L93 Difference]: Finished difference Result 89 states and 101 transitions. [2020-12-09 05:50:38,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-09 05:50:38,875 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 5 [2020-12-09 05:50:38,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:50:38,876 INFO L225 Difference]: With dead ends: 89 [2020-12-09 05:50:38,876 INFO L226 Difference]: Without dead ends: 89 [2020-12-09 05:50:38,877 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2020-12-09 05:50:38,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2020-12-09 05:50:38,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 39. [2020-12-09 05:50:38,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-12-09 05:50:38,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 48 transitions. [2020-12-09 05:50:38,881 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 48 transitions. Word has length 5 [2020-12-09 05:50:38,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:50:38,881 INFO L481 AbstractCegarLoop]: Abstraction has 39 states and 48 transitions. [2020-12-09 05:50:38,882 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-09 05:50:38,882 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 48 transitions. [2020-12-09 05:50:38,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-12-09 05:50:38,882 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:50:38,882 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-12-09 05:50:39,083 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2020-12-09 05:50:39,084 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 05:50:39,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:50:39,084 INFO L82 PathProgramCache]: Analyzing trace with hash 152474858, now seen corresponding path program 1 times [2020-12-09 05:50:39,085 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:50:39,085 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327792373] [2020-12-09 05:50:39,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:50:39,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:50:39,192 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 05:50:39,193 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327792373] [2020-12-09 05:50:39,194 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 05:50:39,194 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-12-09 05:50:39,195 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969430534] [2020-12-09 05:50:39,196 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 05:50:39,197 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:50:39,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 05:50:39,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 05:50:39,200 INFO L87 Difference]: Start difference. First operand 39 states and 48 transitions. Second operand 3 states. [2020-12-09 05:50:39,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:50:39,249 INFO L93 Difference]: Finished difference Result 38 states and 47 transitions. [2020-12-09 05:50:39,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 05:50:39,250 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-12-09 05:50:39,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:50:39,251 INFO L225 Difference]: With dead ends: 38 [2020-12-09 05:50:39,251 INFO L226 Difference]: Without dead ends: 38 [2020-12-09 05:50:39,251 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 05:50:39,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2020-12-09 05:50:39,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2020-12-09 05:50:39,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2020-12-09 05:50:39,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 47 transitions. [2020-12-09 05:50:39,255 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 47 transitions. Word has length 5 [2020-12-09 05:50:39,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:50:39,255 INFO L481 AbstractCegarLoop]: Abstraction has 38 states and 47 transitions. [2020-12-09 05:50:39,255 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 05:50:39,256 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 47 transitions. [2020-12-09 05:50:39,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-12-09 05:50:39,256 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:50:39,256 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-12-09 05:50:39,256 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-12-09 05:50:39,256 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 05:50:39,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:50:39,257 INFO L82 PathProgramCache]: Analyzing trace with hash 339204529, now seen corresponding path program 1 times [2020-12-09 05:50:39,257 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:50:39,257 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901019083] [2020-12-09 05:50:39,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:50:39,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:50:39,300 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 05:50:39,300 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901019083] [2020-12-09 05:50:39,300 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1324302244] [2020-12-09 05:50:39,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f9066140-8ed7-4b24-9e42-e35294023b38/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 05:50:39,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:50:39,332 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 11 conjunts are in the unsatisfiable core [2020-12-09 05:50:39,333 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 05:50:39,381 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 05:50:39,381 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 05:50:39,410 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 05:50:39,410 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2020-12-09 05:50:39,411 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3, 2] total 6 [2020-12-09 05:50:39,411 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533277481] [2020-12-09 05:50:39,411 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 05:50:39,411 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:50:39,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 05:50:39,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-12-09 05:50:39,412 INFO L87 Difference]: Start difference. First operand 38 states and 47 transitions. Second operand 4 states. [2020-12-09 05:50:39,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:50:39,439 INFO L93 Difference]: Finished difference Result 37 states and 46 transitions. [2020-12-09 05:50:39,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 05:50:39,440 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2020-12-09 05:50:39,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:50:39,440 INFO L225 Difference]: With dead ends: 37 [2020-12-09 05:50:39,441 INFO L226 Difference]: Without dead ends: 37 [2020-12-09 05:50:39,441 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-12-09 05:50:39,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-12-09 05:50:39,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 29. [2020-12-09 05:50:39,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-12-09 05:50:39,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2020-12-09 05:50:39,444 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 6 [2020-12-09 05:50:39,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:50:39,444 INFO L481 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2020-12-09 05:50:39,444 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 05:50:39,444 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2020-12-09 05:50:39,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-12-09 05:50:39,444 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:50:39,444 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2020-12-09 05:50:39,645 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2020-12-09 05:50:39,646 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 05:50:39,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:50:39,647 INFO L82 PathProgramCache]: Analyzing trace with hash 429256203, now seen corresponding path program 1 times [2020-12-09 05:50:39,647 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:50:39,648 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835275925] [2020-12-09 05:50:39,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:50:39,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:50:39,877 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 05:50:39,877 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835275925] [2020-12-09 05:50:39,878 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [174416898] [2020-12-09 05:50:39,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f9066140-8ed7-4b24-9e42-e35294023b38/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 05:50:40,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:50:40,010 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 11 conjunts are in the unsatisfiable core [2020-12-09 05:50:40,011 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 05:50:40,055 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 05:50:40,056 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 05:50:40,109 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 05:50:40,109 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1441541513] [2020-12-09 05:50:40,110 INFO L159 IcfgInterpreter]: Started Sifa with 5 locations of interest [2020-12-09 05:50:40,110 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 05:50:40,111 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-12-09 05:50:40,111 INFO L176 IcfgInterpreter]: Starting interpretation [2020-12-09 05:50:40,111 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-12-09 05:50:40,207 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 05:50:40,327 INFO L180 IcfgInterpreter]: Interpretation finished [2020-12-09 05:50:40,450 WARN L197 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 50 [2020-12-09 05:50:40,592 WARN L197 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 50 [2020-12-09 05:50:40,785 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-09 05:50:40,785 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 05:50:40,785 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2020-12-09 05:50:40,785 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51853328] [2020-12-09 05:50:40,786 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-12-09 05:50:40,786 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:50:40,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-12-09 05:50:40,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2020-12-09 05:50:40,786 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand 11 states. [2020-12-09 05:50:40,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:50:40,933 INFO L93 Difference]: Finished difference Result 71 states and 78 transitions. [2020-12-09 05:50:40,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-09 05:50:40,933 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 6 [2020-12-09 05:50:40,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:50:40,934 INFO L225 Difference]: With dead ends: 71 [2020-12-09 05:50:40,934 INFO L226 Difference]: Without dead ends: 71 [2020-12-09 05:50:40,934 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=79, Invalid=227, Unknown=0, NotChecked=0, Total=306 [2020-12-09 05:50:40,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2020-12-09 05:50:40,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 26. [2020-12-09 05:50:40,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-12-09 05:50:40,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2020-12-09 05:50:40,936 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 6 [2020-12-09 05:50:40,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:50:40,936 INFO L481 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2020-12-09 05:50:40,936 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-12-09 05:50:40,937 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2020-12-09 05:50:40,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-12-09 05:50:40,937 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:50:40,937 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-12-09 05:50:41,138 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2020-12-09 05:50:41,139 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 05:50:41,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:50:41,140 INFO L82 PathProgramCache]: Analyzing trace with hash 431754978, now seen corresponding path program 1 times [2020-12-09 05:50:41,140 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:50:41,141 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723482700] [2020-12-09 05:50:41,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:50:41,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:50:41,199 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 05:50:41,199 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723482700] [2020-12-09 05:50:41,200 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 05:50:41,200 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 05:50:41,200 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016915760] [2020-12-09 05:50:41,200 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 05:50:41,200 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:50:41,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 05:50:41,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-09 05:50:41,201 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand 5 states. [2020-12-09 05:50:41,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:50:41,242 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2020-12-09 05:50:41,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 05:50:41,242 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 6 [2020-12-09 05:50:41,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:50:41,243 INFO L225 Difference]: With dead ends: 42 [2020-12-09 05:50:41,243 INFO L226 Difference]: Without dead ends: 42 [2020-12-09 05:50:41,243 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 05:50:41,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-12-09 05:50:41,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 32. [2020-12-09 05:50:41,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-12-09 05:50:41,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2020-12-09 05:50:41,245 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 42 transitions. Word has length 6 [2020-12-09 05:50:41,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:50:41,245 INFO L481 AbstractCegarLoop]: Abstraction has 32 states and 42 transitions. [2020-12-09 05:50:41,245 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 05:50:41,245 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2020-12-09 05:50:41,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-12-09 05:50:41,245 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:50:41,245 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-12-09 05:50:41,245 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2020-12-09 05:50:41,245 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 05:50:41,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:50:41,246 INFO L82 PathProgramCache]: Analyzing trace with hash 431754977, now seen corresponding path program 1 times [2020-12-09 05:50:41,246 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:50:41,246 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610255509] [2020-12-09 05:50:41,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:50:41,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:50:41,259 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 05:50:41,260 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610255509] [2020-12-09 05:50:41,260 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 05:50:41,260 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 05:50:41,260 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091142822] [2020-12-09 05:50:41,260 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 05:50:41,260 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:50:41,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 05:50:41,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 05:50:41,261 INFO L87 Difference]: Start difference. First operand 32 states and 42 transitions. Second operand 4 states. [2020-12-09 05:50:41,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:50:41,286 INFO L93 Difference]: Finished difference Result 29 states and 36 transitions. [2020-12-09 05:50:41,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 05:50:41,286 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2020-12-09 05:50:41,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:50:41,287 INFO L225 Difference]: With dead ends: 29 [2020-12-09 05:50:41,287 INFO L226 Difference]: Without dead ends: 29 [2020-12-09 05:50:41,287 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 05:50:41,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2020-12-09 05:50:41,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2020-12-09 05:50:41,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-12-09 05:50:41,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2020-12-09 05:50:41,288 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 36 transitions. Word has length 6 [2020-12-09 05:50:41,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:50:41,288 INFO L481 AbstractCegarLoop]: Abstraction has 29 states and 36 transitions. [2020-12-09 05:50:41,288 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 05:50:41,289 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2020-12-09 05:50:41,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-12-09 05:50:41,289 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:50:41,289 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 05:50:41,289 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2020-12-09 05:50:41,289 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 05:50:41,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:50:41,289 INFO L82 PathProgramCache]: Analyzing trace with hash -1013093767, now seen corresponding path program 1 times [2020-12-09 05:50:41,289 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:50:41,290 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513783751] [2020-12-09 05:50:41,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:50:41,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:50:41,305 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 05:50:41,305 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513783751] [2020-12-09 05:50:41,306 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 05:50:41,306 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 05:50:41,306 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231509862] [2020-12-09 05:50:41,306 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 05:50:41,306 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:50:41,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 05:50:41,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 05:50:41,307 INFO L87 Difference]: Start difference. First operand 29 states and 36 transitions. Second operand 3 states. [2020-12-09 05:50:41,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:50:41,324 INFO L93 Difference]: Finished difference Result 27 states and 33 transitions. [2020-12-09 05:50:41,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 05:50:41,324 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-12-09 05:50:41,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:50:41,325 INFO L225 Difference]: With dead ends: 27 [2020-12-09 05:50:41,325 INFO L226 Difference]: Without dead ends: 27 [2020-12-09 05:50:41,325 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 05:50:41,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2020-12-09 05:50:41,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2020-12-09 05:50:41,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-12-09 05:50:41,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2020-12-09 05:50:41,327 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 9 [2020-12-09 05:50:41,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:50:41,327 INFO L481 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2020-12-09 05:50:41,327 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 05:50:41,327 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2020-12-09 05:50:41,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-12-09 05:50:41,328 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:50:41,328 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 05:50:41,328 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2020-12-09 05:50:41,328 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 05:50:41,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:50:41,328 INFO L82 PathProgramCache]: Analyzing trace with hash -1013093766, now seen corresponding path program 1 times [2020-12-09 05:50:41,328 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:50:41,329 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500740945] [2020-12-09 05:50:41,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:50:41,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:50:41,357 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 05:50:41,358 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500740945] [2020-12-09 05:50:41,358 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 05:50:41,358 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 05:50:41,358 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712383724] [2020-12-09 05:50:41,358 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 05:50:41,358 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:50:41,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 05:50:41,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 05:50:41,359 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. Second operand 4 states. [2020-12-09 05:50:41,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:50:41,390 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2020-12-09 05:50:41,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 05:50:41,390 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2020-12-09 05:50:41,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:50:41,391 INFO L225 Difference]: With dead ends: 30 [2020-12-09 05:50:41,391 INFO L226 Difference]: Without dead ends: 30 [2020-12-09 05:50:41,391 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 05:50:41,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-12-09 05:50:41,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2020-12-09 05:50:41,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-12-09 05:50:41,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2020-12-09 05:50:41,392 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 9 [2020-12-09 05:50:41,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:50:41,393 INFO L481 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2020-12-09 05:50:41,393 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 05:50:41,393 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2020-12-09 05:50:41,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-12-09 05:50:41,393 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:50:41,393 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 05:50:41,393 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2020-12-09 05:50:41,393 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 05:50:41,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:50:41,393 INFO L82 PathProgramCache]: Analyzing trace with hash -1013084693, now seen corresponding path program 1 times [2020-12-09 05:50:41,394 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:50:41,394 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675904220] [2020-12-09 05:50:41,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:50:41,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:50:41,404 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 05:50:41,404 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675904220] [2020-12-09 05:50:41,405 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 05:50:41,405 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 05:50:41,405 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955183002] [2020-12-09 05:50:41,405 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 05:50:41,405 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:50:41,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 05:50:41,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 05:50:41,405 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. Second operand 3 states. [2020-12-09 05:50:41,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:50:41,412 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2020-12-09 05:50:41,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 05:50:41,412 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-12-09 05:50:41,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:50:41,412 INFO L225 Difference]: With dead ends: 30 [2020-12-09 05:50:41,412 INFO L226 Difference]: Without dead ends: 30 [2020-12-09 05:50:41,412 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 05:50:41,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-12-09 05:50:41,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2020-12-09 05:50:41,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-12-09 05:50:41,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2020-12-09 05:50:41,414 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 9 [2020-12-09 05:50:41,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:50:41,414 INFO L481 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2020-12-09 05:50:41,414 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 05:50:41,414 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2020-12-09 05:50:41,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-12-09 05:50:41,414 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:50:41,414 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 05:50:41,414 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2020-12-09 05:50:41,414 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 05:50:41,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:50:41,415 INFO L82 PathProgramCache]: Analyzing trace with hash 1374511026, now seen corresponding path program 1 times [2020-12-09 05:50:41,415 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:50:41,415 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098230551] [2020-12-09 05:50:41,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:50:41,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:50:41,495 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 05:50:41,495 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098230551] [2020-12-09 05:50:41,495 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 05:50:41,495 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-09 05:50:41,495 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99351177] [2020-12-09 05:50:41,496 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-09 05:50:41,496 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:50:41,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-09 05:50:41,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-12-09 05:50:41,496 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand 7 states. [2020-12-09 05:50:41,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:50:41,625 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2020-12-09 05:50:41,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-09 05:50:41,625 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2020-12-09 05:50:41,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:50:41,625 INFO L225 Difference]: With dead ends: 43 [2020-12-09 05:50:41,625 INFO L226 Difference]: Without dead ends: 43 [2020-12-09 05:50:41,626 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 05:50:41,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2020-12-09 05:50:41,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 37. [2020-12-09 05:50:41,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-12-09 05:50:41,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 44 transitions. [2020-12-09 05:50:41,627 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 44 transitions. Word has length 11 [2020-12-09 05:50:41,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:50:41,627 INFO L481 AbstractCegarLoop]: Abstraction has 37 states and 44 transitions. [2020-12-09 05:50:41,627 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-09 05:50:41,627 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2020-12-09 05:50:41,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-12-09 05:50:41,628 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:50:41,628 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 05:50:41,628 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2020-12-09 05:50:41,628 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 05:50:41,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:50:41,628 INFO L82 PathProgramCache]: Analyzing trace with hash 1383175815, now seen corresponding path program 1 times [2020-12-09 05:50:41,628 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:50:41,628 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789853031] [2020-12-09 05:50:41,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:50:41,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:50:41,683 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 05:50:41,683 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789853031] [2020-12-09 05:50:41,683 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 05:50:41,683 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 05:50:41,683 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841490813] [2020-12-09 05:50:41,683 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 05:50:41,683 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:50:41,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 05:50:41,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 05:50:41,684 INFO L87 Difference]: Start difference. First operand 37 states and 44 transitions. Second operand 4 states. [2020-12-09 05:50:41,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:50:41,698 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2020-12-09 05:50:41,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 05:50:41,698 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-12-09 05:50:41,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:50:41,698 INFO L225 Difference]: With dead ends: 36 [2020-12-09 05:50:41,698 INFO L226 Difference]: Without dead ends: 26 [2020-12-09 05:50:41,699 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 1 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 05:50:41,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2020-12-09 05:50:41,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2020-12-09 05:50:41,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-12-09 05:50:41,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2020-12-09 05:50:41,700 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 11 [2020-12-09 05:50:41,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:50:41,700 INFO L481 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2020-12-09 05:50:41,700 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 05:50:41,700 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2020-12-09 05:50:41,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-12-09 05:50:41,701 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:50:41,701 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 05:50:41,701 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2020-12-09 05:50:41,701 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 05:50:41,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:50:41,701 INFO L82 PathProgramCache]: Analyzing trace with hash 14699505, now seen corresponding path program 1 times [2020-12-09 05:50:41,701 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:50:41,702 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333913969] [2020-12-09 05:50:41,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:50:41,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:50:41,769 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 05:50:41,769 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333913969] [2020-12-09 05:50:41,770 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [549759743] [2020-12-09 05:50:41,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f9066140-8ed7-4b24-9e42-e35294023b38/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 05:50:41,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:50:41,804 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 17 conjunts are in the unsatisfiable core [2020-12-09 05:50:41,805 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 05:50:41,863 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 05:50:41,863 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 05:50:41,922 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 05:50:41,922 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1652219833] [2020-12-09 05:50:41,923 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2020-12-09 05:50:41,923 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 05:50:41,924 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-12-09 05:50:41,924 INFO L176 IcfgInterpreter]: Starting interpretation [2020-12-09 05:50:41,924 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-12-09 05:50:42,031 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 05:50:42,244 INFO L180 IcfgInterpreter]: Interpretation finished [2020-12-09 05:50:42,838 WARN L197 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 77 [2020-12-09 05:50:43,073 WARN L197 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 88 [2020-12-09 05:50:43,290 WARN L197 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 84 [2020-12-09 05:50:43,520 WARN L197 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 86 [2020-12-09 05:50:43,768 WARN L197 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 92 [2020-12-09 05:50:43,769 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2020-12-09 05:50:43,769 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [6, 6, 6] total 25 [2020-12-09 05:50:43,769 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958197515] [2020-12-09 05:50:43,769 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-12-09 05:50:43,769 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:50:43,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-12-09 05:50:43,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=550, Unknown=0, NotChecked=0, Total=702 [2020-12-09 05:50:43,770 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand 12 states. [2020-12-09 05:50:43,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:50:43,879 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2020-12-09 05:50:43,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-12-09 05:50:43,879 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 13 [2020-12-09 05:50:43,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:50:43,879 INFO L225 Difference]: With dead ends: 35 [2020-12-09 05:50:43,879 INFO L226 Difference]: Without dead ends: 28 [2020-12-09 05:50:43,880 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 15 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=152, Invalid=550, Unknown=0, NotChecked=0, Total=702 [2020-12-09 05:50:43,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-12-09 05:50:43,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2020-12-09 05:50:43,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-12-09 05:50:43,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2020-12-09 05:50:43,881 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 13 [2020-12-09 05:50:43,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:50:43,881 INFO L481 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2020-12-09 05:50:43,881 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-12-09 05:50:43,881 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2020-12-09 05:50:43,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-12-09 05:50:43,881 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:50:43,882 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 05:50:44,082 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 05:50:44,083 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 05:50:44,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:50:44,085 INFO L82 PathProgramCache]: Analyzing trace with hash 641611011, now seen corresponding path program 1 times [2020-12-09 05:50:44,085 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:50:44,085 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722558729] [2020-12-09 05:50:44,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:50:44,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:50:44,164 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 05:50:44,164 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722558729] [2020-12-09 05:50:44,164 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [110636867] [2020-12-09 05:50:44,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f9066140-8ed7-4b24-9e42-e35294023b38/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 05:50:44,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:50:44,196 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 22 conjunts are in the unsatisfiable core [2020-12-09 05:50:44,200 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 05:50:44,272 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 05:50:44,272 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 05:50:44,341 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 05:50:44,341 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1193743937] [2020-12-09 05:50:44,343 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2020-12-09 05:50:44,343 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 05:50:44,343 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-12-09 05:50:44,343 INFO L176 IcfgInterpreter]: Starting interpretation [2020-12-09 05:50:44,343 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-12-09 05:50:44,577 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 05:50:44,616 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 05:50:44,857 INFO L180 IcfgInterpreter]: Interpretation finished [2020-12-09 05:50:44,999 WARN L197 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 62 [2020-12-09 05:50:45,233 WARN L197 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 78 [2020-12-09 05:50:45,809 WARN L197 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 58 [2020-12-09 05:50:45,987 WARN L197 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 77 [2020-12-09 05:50:46,165 WARN L197 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 73 [2020-12-09 05:50:46,363 WARN L197 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 75 [2020-12-09 05:50:46,484 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-09 05:50:46,484 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 05:50:46,484 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 15 [2020-12-09 05:50:46,485 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302694790] [2020-12-09 05:50:46,485 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-12-09 05:50:46,485 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:50:46,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-12-09 05:50:46,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=716, Unknown=0, NotChecked=0, Total=812 [2020-12-09 05:50:46,486 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand 17 states. [2020-12-09 05:50:46,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:50:46,661 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2020-12-09 05:50:46,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-09 05:50:46,661 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 15 [2020-12-09 05:50:46,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:50:46,662 INFO L225 Difference]: With dead ends: 36 [2020-12-09 05:50:46,662 INFO L226 Difference]: Without dead ends: 36 [2020-12-09 05:50:46,662 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 257 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=159, Invalid=1031, Unknown=0, NotChecked=0, Total=1190 [2020-12-09 05:50:46,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2020-12-09 05:50:46,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 26. [2020-12-09 05:50:46,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-12-09 05:50:46,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2020-12-09 05:50:46,663 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 15 [2020-12-09 05:50:46,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:50:46,663 INFO L481 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2020-12-09 05:50:46,663 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-12-09 05:50:46,664 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2020-12-09 05:50:46,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-12-09 05:50:46,664 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:50:46,664 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 05:50:46,865 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable85 [2020-12-09 05:50:46,866 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 05:50:46,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:50:46,867 INFO L82 PathProgramCache]: Analyzing trace with hash 1630569657, now seen corresponding path program 1 times [2020-12-09 05:50:46,867 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:50:46,867 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218886813] [2020-12-09 05:50:46,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:50:46,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:50:46,952 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 05:50:46,952 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218886813] [2020-12-09 05:50:46,952 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1405965622] [2020-12-09 05:50:46,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f9066140-8ed7-4b24-9e42-e35294023b38/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 05:50:46,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:50:46,997 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 17 conjunts are in the unsatisfiable core [2020-12-09 05:50:46,999 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 05:50:47,049 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 05:50:47,049 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 05:50:47,111 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 05:50:47,112 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1675371768] [2020-12-09 05:50:47,114 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2020-12-09 05:50:47,114 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 05:50:47,114 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-12-09 05:50:47,114 INFO L176 IcfgInterpreter]: Starting interpretation [2020-12-09 05:50:47,114 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-12-09 05:50:47,240 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 05:50:47,578 INFO L180 IcfgInterpreter]: Interpretation finished [2020-12-09 05:50:47,760 WARN L197 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 78 [2020-12-09 05:50:48,391 WARN L197 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 58 [2020-12-09 05:50:48,564 WARN L197 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 77 [2020-12-09 05:50:48,732 WARN L197 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 73 [2020-12-09 05:50:48,907 WARN L197 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 75 [2020-12-09 05:50:49,016 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-09 05:50:49,016 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 05:50:49,016 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2020-12-09 05:50:49,016 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655703318] [2020-12-09 05:50:49,016 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-12-09 05:50:49,016 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:50:49,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-12-09 05:50:49,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=585, Unknown=0, NotChecked=0, Total=702 [2020-12-09 05:50:49,017 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand 15 states. [2020-12-09 05:50:49,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:50:49,112 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2020-12-09 05:50:49,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-09 05:50:49,112 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 18 [2020-12-09 05:50:49,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:50:49,112 INFO L225 Difference]: With dead ends: 36 [2020-12-09 05:50:49,112 INFO L226 Difference]: Without dead ends: 31 [2020-12-09 05:50:49,113 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 309 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=156, Invalid=774, Unknown=0, NotChecked=0, Total=930 [2020-12-09 05:50:49,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2020-12-09 05:50:49,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2020-12-09 05:50:49,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-12-09 05:50:49,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2020-12-09 05:50:49,114 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 18 [2020-12-09 05:50:49,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:50:49,114 INFO L481 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2020-12-09 05:50:49,114 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-12-09 05:50:49,114 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2020-12-09 05:50:49,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-12-09 05:50:49,114 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:50:49,114 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 05:50:49,315 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable135 [2020-12-09 05:50:49,316 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 05:50:49,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:50:49,317 INFO L82 PathProgramCache]: Analyzing trace with hash -685578703, now seen corresponding path program 2 times [2020-12-09 05:50:49,318 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:50:49,318 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685840612] [2020-12-09 05:50:49,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:50:49,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:50:49,477 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 05:50:49,477 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685840612] [2020-12-09 05:50:49,477 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [167227352] [2020-12-09 05:50:49,477 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f9066140-8ed7-4b24-9e42-e35294023b38/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 05:50:49,522 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2020-12-09 05:50:49,522 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-09 05:50:49,523 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 28 conjunts are in the unsatisfiable core [2020-12-09 05:50:49,525 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 05:50:49,746 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 05:50:49,746 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 05:50:53,740 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 05:50:53,740 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [255608056] [2020-12-09 05:50:53,741 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2020-12-09 05:50:53,742 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 05:50:53,742 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-12-09 05:50:53,742 INFO L176 IcfgInterpreter]: Starting interpretation [2020-12-09 05:50:53,742 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-12-09 05:50:53,856 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 05:50:54,237 INFO L180 IcfgInterpreter]: Interpretation finished [2020-12-09 05:50:54,407 WARN L197 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 62 [2020-12-09 05:50:55,127 WARN L197 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 58 [2020-12-09 05:50:55,312 WARN L197 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 77 [2020-12-09 05:50:55,494 WARN L197 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 73 [2020-12-09 05:50:55,684 WARN L197 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 75 [2020-12-09 05:50:55,810 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-09 05:50:55,811 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 05:50:55,811 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 24 [2020-12-09 05:50:55,811 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528433005] [2020-12-09 05:50:55,811 INFO L461 AbstractCegarLoop]: Interpolant automaton has 25 states [2020-12-09 05:50:55,811 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:50:55,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2020-12-09 05:50:55,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=1194, Unknown=1, NotChecked=0, Total=1332 [2020-12-09 05:50:55,812 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand 25 states. [2020-12-09 05:50:56,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:50:56,146 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions. [2020-12-09 05:50:56,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-12-09 05:50:56,147 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 20 [2020-12-09 05:50:56,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:50:56,147 INFO L225 Difference]: With dead ends: 44 [2020-12-09 05:50:56,147 INFO L226 Difference]: Without dead ends: 32 [2020-12-09 05:50:56,148 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=224, Invalid=1581, Unknown=1, NotChecked=0, Total=1806 [2020-12-09 05:50:56,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-12-09 05:50:56,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2020-12-09 05:50:56,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-12-09 05:50:56,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2020-12-09 05:50:56,149 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 20 [2020-12-09 05:50:56,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:50:56,149 INFO L481 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2020-12-09 05:50:56,149 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2020-12-09 05:50:56,149 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2020-12-09 05:50:56,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-12-09 05:50:56,150 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:50:56,150 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 05:50:56,350 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable190 [2020-12-09 05:50:56,351 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 05:50:56,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:50:56,353 INFO L82 PathProgramCache]: Analyzing trace with hash -1429450542, now seen corresponding path program 3 times [2020-12-09 05:50:56,353 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 05:50:56,353 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957261147] [2020-12-09 05:50:56,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 05:50:56,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:50:56,432 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 05:50:56,432 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957261147] [2020-12-09 05:50:56,432 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1466710784] [2020-12-09 05:50:56,433 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f9066140-8ed7-4b24-9e42-e35294023b38/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 05:50:56,489 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-12-09 05:50:56,489 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-09 05:50:56,490 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 42 conjunts are in the unsatisfiable core [2020-12-09 05:50:56,492 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 05:50:56,779 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-12-09 05:50:56,779 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 05:50:57,535 WARN L197 SmtUtils]: Spent 671.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2020-12-09 05:50:57,584 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: incompatible size [2020-12-09 05:50:57,584 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1172871288] [2020-12-09 05:50:57,585 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2020-12-09 05:50:57,585 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 05:50:57,585 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-12-09 05:50:57,585 INFO L176 IcfgInterpreter]: Starting interpretation [2020-12-09 05:50:57,585 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-12-09 05:50:57,592 FATAL L? ?]: Ignoring exception! java.lang.IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@36ba3a59 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 05:50:57,594 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-12-09 05:50:57,594 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-12-09 05:50:57,594 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659241737] [2020-12-09 05:50:57,594 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-09 05:50:57,594 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 05:50:57,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-09 05:50:57,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=534, Unknown=0, NotChecked=0, Total=600 [2020-12-09 05:50:57,595 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand 9 states. [2020-12-09 05:50:57,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-12-09 05:50:57,795 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable240,9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 05:50:57,796 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@36ba3a59 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 05:50:57,802 INFO L168 Benchmark]: Toolchain (without parser) took 21659.95 ms. Allocated memory was 102.8 MB in the beginning and 127.9 MB in the end (delta: 25.2 MB). Free memory was 61.6 MB in the beginning and 86.8 MB in the end (delta: -25.3 MB). Peak memory consumption was 307.2 kB. Max. memory is 16.1 GB. [2020-12-09 05:50:57,803 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 102.8 MB. Free memory was 78.9 MB in the beginning and 78.8 MB in the end (delta: 136.4 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-09 05:50:57,804 INFO L168 Benchmark]: CACSL2BoogieTranslator took 321.97 ms. Allocated memory is still 102.8 MB. Free memory was 61.4 MB in the beginning and 66.3 MB in the end (delta: -4.8 MB). Peak memory consumption was 9.6 MB. Max. memory is 16.1 GB. [2020-12-09 05:50:57,805 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.19 ms. Allocated memory is still 102.8 MB. Free memory was 66.3 MB in the beginning and 64.6 MB in the end (delta: 1.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-09 05:50:57,805 INFO L168 Benchmark]: Boogie Preprocessor took 25.90 ms. Allocated memory is still 102.8 MB. Free memory was 64.6 MB in the beginning and 63.0 MB in the end (delta: 1.5 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-09 05:50:57,806 INFO L168 Benchmark]: RCFGBuilder took 451.60 ms. Allocated memory is still 102.8 MB. Free memory was 63.0 MB in the beginning and 51.1 MB in the end (delta: 11.9 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2020-12-09 05:50:57,807 INFO L168 Benchmark]: TraceAbstraction took 20814.20 ms. Allocated memory was 102.8 MB in the beginning and 127.9 MB in the end (delta: 25.2 MB). Free memory was 50.6 MB in the beginning and 86.8 MB in the end (delta: -36.2 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-09 05:50:57,812 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.13 ms. Allocated memory is still 102.8 MB. Free memory was 78.9 MB in the beginning and 78.8 MB in the end (delta: 136.4 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 321.97 ms. Allocated memory is still 102.8 MB. Free memory was 61.4 MB in the beginning and 66.3 MB in the end (delta: -4.8 MB). Peak memory consumption was 9.6 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 39.19 ms. Allocated memory is still 102.8 MB. Free memory was 66.3 MB in the beginning and 64.6 MB in the end (delta: 1.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 25.90 ms. Allocated memory is still 102.8 MB. Free memory was 64.6 MB in the beginning and 63.0 MB in the end (delta: 1.5 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 451.60 ms. Allocated memory is still 102.8 MB. Free memory was 63.0 MB in the beginning and 51.1 MB in the end (delta: 11.9 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * TraceAbstraction took 20814.20 ms. Allocated memory was 102.8 MB in the beginning and 127.9 MB in the end (delta: 25.2 MB). Free memory was 50.6 MB in the beginning and 86.8 MB in the end (delta: -36.2 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@36ba3a59 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@36ba3a59: 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 05:50:59,322 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-09 05:50:59,323 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-09 05:50:59,349 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-09 05:50:59,350 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-09 05:50:59,351 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-09 05:50:59,352 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-09 05:50:59,354 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-09 05:50:59,355 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-09 05:50:59,356 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-09 05:50:59,357 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-09 05:50:59,358 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-09 05:50:59,358 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-09 05:50:59,359 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-09 05:50:59,360 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-09 05:50:59,361 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-09 05:50:59,361 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-09 05:50:59,362 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-09 05:50:59,364 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-09 05:50:59,366 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-09 05:50:59,367 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-09 05:50:59,368 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-09 05:50:59,369 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-09 05:50:59,370 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-09 05:50:59,373 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-09 05:50:59,373 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-09 05:50:59,373 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-09 05:50:59,374 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-09 05:50:59,374 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-09 05:50:59,375 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-09 05:50:59,375 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-09 05:50:59,376 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-09 05:50:59,377 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-09 05:50:59,377 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-09 05:50:59,378 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-09 05:50:59,378 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-09 05:50:59,379 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-09 05:50:59,379 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-09 05:50:59,380 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-09 05:50:59,380 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-09 05:50:59,381 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-09 05:50:59,382 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_f9066140-8ed7-4b24-9e42-e35294023b38/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2020-12-09 05:50:59,400 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-09 05:50:59,400 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-09 05:50:59,401 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2020-12-09 05:50:59,401 INFO L138 SettingsManager]: * User list type=DISABLED [2020-12-09 05:50:59,401 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2020-12-09 05:50:59,401 INFO L138 SettingsManager]: * Explicit value domain=true [2020-12-09 05:50:59,402 INFO L138 SettingsManager]: * Octagon Domain=false [2020-12-09 05:50:59,402 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2020-12-09 05:50:59,402 INFO L138 SettingsManager]: * Interval Domain=false [2020-12-09 05:50:59,402 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-09 05:50:59,402 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-09 05:50:59,403 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-09 05:50:59,403 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-09 05:50:59,403 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-12-09 05:50:59,403 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-09 05:50:59,403 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-09 05:50:59,403 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-09 05:50:59,403 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2020-12-09 05:50:59,403 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2020-12-09 05:50:59,403 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2020-12-09 05:50:59,404 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-09 05:50:59,404 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-12-09 05:50:59,404 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2020-12-09 05:50:59,404 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2020-12-09 05:50:59,404 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-09 05:50:59,404 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-09 05:50:59,404 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-09 05:50:59,404 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-09 05:50:59,404 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-09 05:50:59,405 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-09 05:50:59,405 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-09 05:50:59,405 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-09 05:50:59,405 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2020-12-09 05:50:59,405 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2020-12-09 05:50:59,405 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-09 05:50:59,405 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-12-09 05:50:59,405 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_f9066140-8ed7-4b24-9e42-e35294023b38/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_f9066140-8ed7-4b24-9e42-e35294023b38/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 -> df3db790fa8159689a8da2e25598b93c123cddf7 [2020-12-09 05:50:59,654 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-09 05:50:59,669 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-09 05:50:59,671 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-09 05:50:59,672 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-09 05:50:59,672 INFO L275 PluginConnector]: CDTParser initialized [2020-12-09 05:50:59,673 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_f9066140-8ed7-4b24-9e42-e35294023b38/bin/utaipan/../../sv-benchmarks/c/array-memsafety/cstrcmp-alloca-2.i [2020-12-09 05:50:59,717 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_f9066140-8ed7-4b24-9e42-e35294023b38/bin/utaipan/data/919b36446/be0edd915d514cb0a38b14926c503a98/FLAG929c1f5c2 [2020-12-09 05:51:00,166 INFO L306 CDTParser]: Found 1 translation units. [2020-12-09 05:51:00,166 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_f9066140-8ed7-4b24-9e42-e35294023b38/sv-benchmarks/c/array-memsafety/cstrcmp-alloca-2.i [2020-12-09 05:51:00,178 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_f9066140-8ed7-4b24-9e42-e35294023b38/bin/utaipan/data/919b36446/be0edd915d514cb0a38b14926c503a98/FLAG929c1f5c2 [2020-12-09 05:51:00,192 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_f9066140-8ed7-4b24-9e42-e35294023b38/bin/utaipan/data/919b36446/be0edd915d514cb0a38b14926c503a98 [2020-12-09 05:51:00,194 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-09 05:51:00,195 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-09 05:51:00,197 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-09 05:51:00,197 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-09 05:51:00,199 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-09 05:51:00,200 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 05:51:00" (1/1) ... [2020-12-09 05:51:00,202 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1123404a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:51:00, skipping insertion in model container [2020-12-09 05:51:00,202 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 05:51:00" (1/1) ... [2020-12-09 05:51:00,209 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-09 05:51:00,241 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-09 05:51:00,447 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 05:51:00,464 INFO L203 MainTranslator]: Completed pre-run [2020-12-09 05:51:00,507 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 05:51:00,549 INFO L208 MainTranslator]: Completed translation [2020-12-09 05:51:00,549 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:51:00 WrapperNode [2020-12-09 05:51:00,549 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-09 05:51:00,550 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-09 05:51:00,550 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-09 05:51:00,550 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-09 05:51:00,555 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:51:00" (1/1) ... [2020-12-09 05:51:00,567 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:51:00" (1/1) ... [2020-12-09 05:51:00,583 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-09 05:51:00,583 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-09 05:51:00,583 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-09 05:51:00,583 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-09 05:51:00,589 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:51:00" (1/1) ... [2020-12-09 05:51:00,590 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:51:00" (1/1) ... [2020-12-09 05:51:00,593 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:51:00" (1/1) ... [2020-12-09 05:51:00,593 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:51:00" (1/1) ... [2020-12-09 05:51:00,599 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:51:00" (1/1) ... [2020-12-09 05:51:00,602 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:51:00" (1/1) ... [2020-12-09 05:51:00,604 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:51:00" (1/1) ... [2020-12-09 05:51:00,606 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-09 05:51:00,607 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-09 05:51:00,607 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-09 05:51:00,607 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-09 05:51:00,608 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:51:00" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f9066140-8ed7-4b24-9e42-e35294023b38/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 05:51:00,677 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2020-12-09 05:51:00,677 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-09 05:51:00,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2020-12-09 05:51:00,678 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-12-09 05:51:00,678 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-09 05:51:00,678 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-09 05:51:00,995 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-09 05:51:00,996 INFO L299 CfgBuilder]: Removed 9 assume(true) statements. [2020-12-09 05:51:00,997 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 05:51:00 BoogieIcfgContainer [2020-12-09 05:51:00,997 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-09 05:51:00,998 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-09 05:51:00,998 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-09 05:51:01,000 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-09 05:51:01,001 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 05:51:00" (1/3) ... [2020-12-09 05:51:01,001 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@693d4408 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 05:51:01, skipping insertion in model container [2020-12-09 05:51:01,001 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:51:00" (2/3) ... [2020-12-09 05:51:01,001 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@693d4408 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 05:51:01, skipping insertion in model container [2020-12-09 05:51:01,002 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 05:51:00" (3/3) ... [2020-12-09 05:51:01,003 INFO L111 eAbstractionObserver]: Analyzing ICFG cstrcmp-alloca-2.i [2020-12-09 05:51:01,012 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-09 05:51:01,014 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 19 error locations. [2020-12-09 05:51:01,022 INFO L253 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2020-12-09 05:51:01,036 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-09 05:51:01,036 INFO L378 AbstractCegarLoop]: Hoare is false [2020-12-09 05:51:01,036 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-09 05:51:01,037 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-09 05:51:01,037 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-09 05:51:01,037 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-09 05:51:01,037 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-09 05:51:01,037 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-09 05:51:01,046 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states. [2020-12-09 05:51:01,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-12-09 05:51:01,051 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:51:01,051 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-12-09 05:51:01,051 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 05:51:01,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:51:01,055 INFO L82 PathProgramCache]: Analyzing trace with hash 1805029096, now seen corresponding path program 1 times [2020-12-09 05:51:01,063 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 05:51:01,064 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [781542790] [2020-12-09 05:51:01,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f9066140-8ed7-4b24-9e42-e35294023b38/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 05:51:01,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:51:01,115 INFO L263 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-09 05:51:01,118 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 05:51:01,171 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 05:51:01,171 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 05:51:01,172 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [781542790] [2020-12-09 05:51:01,173 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 05:51:01,173 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 05:51:01,174 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449589807] [2020-12-09 05:51:01,178 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 05:51:01,178 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 05:51:01,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 05:51:01,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-09 05:51:01,189 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 4 states. [2020-12-09 05:51:01,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:51:01,245 INFO L93 Difference]: Finished difference Result 98 states and 108 transitions. [2020-12-09 05:51:01,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 05:51:01,247 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2020-12-09 05:51:01,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:51:01,253 INFO L225 Difference]: With dead ends: 98 [2020-12-09 05:51:01,253 INFO L226 Difference]: Without dead ends: 94 [2020-12-09 05:51:01,254 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 05:51:01,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2020-12-09 05:51:01,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 54. [2020-12-09 05:51:01,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-12-09 05:51:01,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 61 transitions. [2020-12-09 05:51:01,278 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 61 transitions. Word has length 7 [2020-12-09 05:51:01,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:51:01,278 INFO L481 AbstractCegarLoop]: Abstraction has 54 states and 61 transitions. [2020-12-09 05:51:01,278 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 05:51:01,278 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 61 transitions. [2020-12-09 05:51:01,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-12-09 05:51:01,279 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:51:01,279 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-12-09 05:51:01,479 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2020-12-09 05:51:01,480 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 05:51:01,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:51:01,481 INFO L82 PathProgramCache]: Analyzing trace with hash 1806876138, now seen corresponding path program 1 times [2020-12-09 05:51:01,482 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 05:51:01,482 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1539170566] [2020-12-09 05:51:01,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f9066140-8ed7-4b24-9e42-e35294023b38/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 05:51:01,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:51:01,578 INFO L263 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 4 conjunts are in the unsatisfiable core [2020-12-09 05:51:01,580 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 05:51:01,648 INFO L348 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2020-12-09 05:51:01,648 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2020-12-09 05:51:01,651 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 05:51:01,657 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 05:51:01,663 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 05:51:01,663 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:17 [2020-12-09 05:51:01,685 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 05:51:01,685 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 05:51:01,686 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1539170566] [2020-12-09 05:51:01,686 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 05:51:01,686 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 05:51:01,686 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201801880] [2020-12-09 05:51:01,687 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 05:51:01,687 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 05:51:01,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 05:51:01,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 05:51:01,688 INFO L87 Difference]: Start difference. First operand 54 states and 61 transitions. Second operand 3 states. [2020-12-09 05:51:01,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:51:01,776 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2020-12-09 05:51:01,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 05:51:01,777 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-12-09 05:51:01,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:51:01,778 INFO L225 Difference]: With dead ends: 52 [2020-12-09 05:51:01,778 INFO L226 Difference]: Without dead ends: 52 [2020-12-09 05:51:01,779 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 05:51:01,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2020-12-09 05:51:01,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2020-12-09 05:51:01,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2020-12-09 05:51:01,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 59 transitions. [2020-12-09 05:51:01,784 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 59 transitions. Word has length 7 [2020-12-09 05:51:01,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:51:01,785 INFO L481 AbstractCegarLoop]: Abstraction has 52 states and 59 transitions. [2020-12-09 05:51:01,785 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 05:51:01,785 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2020-12-09 05:51:01,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-12-09 05:51:01,785 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:51:01,785 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-12-09 05:51:01,986 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2020-12-09 05:51:01,987 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 05:51:01,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:51:01,989 INFO L82 PathProgramCache]: Analyzing trace with hash 1806876139, now seen corresponding path program 1 times [2020-12-09 05:51:01,991 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 05:51:01,991 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1421052703] [2020-12-09 05:51:01,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f9066140-8ed7-4b24-9e42-e35294023b38/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 05:51:02,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:51:02,134 INFO L263 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 8 conjunts are in the unsatisfiable core [2020-12-09 05:51:02,136 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 05:51:02,169 INFO L443 ElimStorePlain]: Different costs {0=[|v_#length_22|], 1=[|v_#valid_31|]} [2020-12-09 05:51:02,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 05:51:02,175 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 05:51:02,176 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 05:51:02,190 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 05:51:02,196 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 05:51:02,198 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 05:51:02,213 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 05:51:02,216 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 05:51:02,216 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:28, output treesize:13 [2020-12-09 05:51:02,228 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 05:51:02,228 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 05:51:02,229 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1421052703] [2020-12-09 05:51:02,229 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 05:51:02,229 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 05:51:02,229 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490180886] [2020-12-09 05:51:02,229 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 05:51:02,229 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 05:51:02,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 05:51:02,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 05:51:02,231 INFO L87 Difference]: Start difference. First operand 52 states and 59 transitions. Second operand 4 states. [2020-12-09 05:51:02,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:51:02,477 INFO L93 Difference]: Finished difference Result 95 states and 106 transitions. [2020-12-09 05:51:02,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 05:51:02,478 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2020-12-09 05:51:02,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:51:02,479 INFO L225 Difference]: With dead ends: 95 [2020-12-09 05:51:02,479 INFO L226 Difference]: Without dead ends: 95 [2020-12-09 05:51:02,479 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 05:51:02,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2020-12-09 05:51:02,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 54. [2020-12-09 05:51:02,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-12-09 05:51:02,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 62 transitions. [2020-12-09 05:51:02,484 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 62 transitions. Word has length 7 [2020-12-09 05:51:02,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:51:02,484 INFO L481 AbstractCegarLoop]: Abstraction has 54 states and 62 transitions. [2020-12-09 05:51:02,484 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 05:51:02,484 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 62 transitions. [2020-12-09 05:51:02,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-12-09 05:51:02,485 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:51:02,485 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 05:51:02,686 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2020-12-09 05:51:02,687 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 05:51:02,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:51:02,689 INFO L82 PathProgramCache]: Analyzing trace with hash -533876960, now seen corresponding path program 1 times [2020-12-09 05:51:02,690 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 05:51:02,691 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1702431801] [2020-12-09 05:51:02,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f9066140-8ed7-4b24-9e42-e35294023b38/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 05:51:02,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:51:02,808 INFO L263 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 7 conjunts are in the unsatisfiable core [2020-12-09 05:51:02,809 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 05:51:02,824 INFO L443 ElimStorePlain]: Different costs {0=[|v_#length_23|], 1=[|v_#valid_32|]} [2020-12-09 05:51:02,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 05:51:02,829 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 05:51:02,830 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 05:51:02,841 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 05:51:02,846 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 05:51:02,847 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 05:51:02,856 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 05:51:02,859 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 05:51:02,859 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:24, output treesize:12 [2020-12-09 05:51:02,872 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 05:51:02,872 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 05:51:02,873 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1702431801] [2020-12-09 05:51:02,873 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 05:51:02,873 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 05:51:02,873 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850905874] [2020-12-09 05:51:02,873 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 05:51:02,873 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 05:51:02,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 05:51:02,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-09 05:51:02,874 INFO L87 Difference]: Start difference. First operand 54 states and 62 transitions. Second operand 4 states. [2020-12-09 05:51:03,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:51:03,025 INFO L93 Difference]: Finished difference Result 92 states and 103 transitions. [2020-12-09 05:51:03,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 05:51:03,025 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2020-12-09 05:51:03,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:51:03,026 INFO L225 Difference]: With dead ends: 92 [2020-12-09 05:51:03,026 INFO L226 Difference]: Without dead ends: 92 [2020-12-09 05:51:03,026 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 05:51:03,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2020-12-09 05:51:03,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 60. [2020-12-09 05:51:03,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2020-12-09 05:51:03,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 71 transitions. [2020-12-09 05:51:03,031 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 71 transitions. Word has length 9 [2020-12-09 05:51:03,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:51:03,031 INFO L481 AbstractCegarLoop]: Abstraction has 60 states and 71 transitions. [2020-12-09 05:51:03,031 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 05:51:03,031 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 71 transitions. [2020-12-09 05:51:03,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-12-09 05:51:03,031 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:51:03,031 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 05:51:03,232 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2020-12-09 05:51:03,233 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 05:51:03,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:51:03,234 INFO L82 PathProgramCache]: Analyzing trace with hash -533876908, now seen corresponding path program 1 times [2020-12-09 05:51:03,235 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 05:51:03,236 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [177600470] [2020-12-09 05:51:03,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f9066140-8ed7-4b24-9e42-e35294023b38/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 05:51:03,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:51:03,351 INFO L263 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-09 05:51:03,352 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 05:51:03,366 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 05:51:03,366 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 05:51:03,366 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [177600470] [2020-12-09 05:51:03,366 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 05:51:03,366 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 05:51:03,366 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550520828] [2020-12-09 05:51:03,367 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 05:51:03,367 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 05:51:03,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 05:51:03,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-09 05:51:03,367 INFO L87 Difference]: Start difference. First operand 60 states and 71 transitions. Second operand 4 states. [2020-12-09 05:51:03,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:51:03,400 INFO L93 Difference]: Finished difference Result 107 states and 122 transitions. [2020-12-09 05:51:03,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 05:51:03,401 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2020-12-09 05:51:03,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:51:03,401 INFO L225 Difference]: With dead ends: 107 [2020-12-09 05:51:03,401 INFO L226 Difference]: Without dead ends: 107 [2020-12-09 05:51:03,402 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 05:51:03,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2020-12-09 05:51:03,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 73. [2020-12-09 05:51:03,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2020-12-09 05:51:03,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 87 transitions. [2020-12-09 05:51:03,406 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 87 transitions. Word has length 9 [2020-12-09 05:51:03,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:51:03,406 INFO L481 AbstractCegarLoop]: Abstraction has 73 states and 87 transitions. [2020-12-09 05:51:03,407 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 05:51:03,407 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 87 transitions. [2020-12-09 05:51:03,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-12-09 05:51:03,407 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:51:03,407 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 05:51:03,608 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2020-12-09 05:51:03,609 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 05:51:03,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:51:03,610 INFO L82 PathProgramCache]: Analyzing trace with hash -476618606, now seen corresponding path program 1 times [2020-12-09 05:51:03,611 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 05:51:03,611 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [38458309] [2020-12-09 05:51:03,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f9066140-8ed7-4b24-9e42-e35294023b38/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 05:51:03,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:51:03,695 INFO L263 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-09 05:51:03,696 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 05:51:03,709 INFO L348 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2020-12-09 05:51:03,710 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 05:51:03,711 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 05:51:03,714 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 05:51:03,716 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 05:51:03,716 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:9, output treesize:13 [2020-12-09 05:51:03,724 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 05:51:03,725 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 05:51:03,725 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [38458309] [2020-12-09 05:51:03,725 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 05:51:03,725 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 05:51:03,725 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673077431] [2020-12-09 05:51:03,725 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 05:51:03,725 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 05:51:03,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 05:51:03,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 05:51:03,726 INFO L87 Difference]: Start difference. First operand 73 states and 87 transitions. Second operand 3 states. [2020-12-09 05:51:03,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:51:03,782 INFO L93 Difference]: Finished difference Result 71 states and 84 transitions. [2020-12-09 05:51:03,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 05:51:03,783 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-12-09 05:51:03,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:51:03,783 INFO L225 Difference]: With dead ends: 71 [2020-12-09 05:51:03,783 INFO L226 Difference]: Without dead ends: 71 [2020-12-09 05:51:03,783 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 05:51:03,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2020-12-09 05:51:03,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2020-12-09 05:51:03,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2020-12-09 05:51:03,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 84 transitions. [2020-12-09 05:51:03,787 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 84 transitions. Word has length 9 [2020-12-09 05:51:03,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:51:03,787 INFO L481 AbstractCegarLoop]: Abstraction has 71 states and 84 transitions. [2020-12-09 05:51:03,787 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 05:51:03,787 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 84 transitions. [2020-12-09 05:51:03,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-12-09 05:51:03,787 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:51:03,788 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 05:51:03,988 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2020-12-09 05:51:03,989 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 05:51:03,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:51:03,991 INFO L82 PathProgramCache]: Analyzing trace with hash -476618605, now seen corresponding path program 1 times [2020-12-09 05:51:03,991 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 05:51:03,992 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2104586522] [2020-12-09 05:51:03,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f9066140-8ed7-4b24-9e42-e35294023b38/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 05:51:04,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:51:04,122 INFO L263 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 7 conjunts are in the unsatisfiable core [2020-12-09 05:51:04,122 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 05:51:04,146 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 05:51:04,146 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 05:51:04,148 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 05:51:04,171 INFO L625 ElimStorePlain]: treesize reduction 10, result has 68.8 percent of original size [2020-12-09 05:51:04,173 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 05:51:04,174 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:17, output treesize:10 [2020-12-09 05:51:04,194 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 05:51:04,194 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 05:51:04,194 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2104586522] [2020-12-09 05:51:04,194 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 05:51:04,194 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 05:51:04,194 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045605954] [2020-12-09 05:51:04,194 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 05:51:04,194 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 05:51:04,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 05:51:04,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-09 05:51:04,195 INFO L87 Difference]: Start difference. First operand 71 states and 84 transitions. Second operand 5 states. [2020-12-09 05:51:04,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:51:04,373 INFO L93 Difference]: Finished difference Result 111 states and 128 transitions. [2020-12-09 05:51:04,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 05:51:04,373 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2020-12-09 05:51:04,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:51:04,374 INFO L225 Difference]: With dead ends: 111 [2020-12-09 05:51:04,374 INFO L226 Difference]: Without dead ends: 111 [2020-12-09 05:51:04,374 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 05:51:04,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2020-12-09 05:51:04,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 75. [2020-12-09 05:51:04,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2020-12-09 05:51:04,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 90 transitions. [2020-12-09 05:51:04,378 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 90 transitions. Word has length 9 [2020-12-09 05:51:04,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:51:04,378 INFO L481 AbstractCegarLoop]: Abstraction has 75 states and 90 transitions. [2020-12-09 05:51:04,378 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 05:51:04,378 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 90 transitions. [2020-12-09 05:51:04,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-12-09 05:51:04,379 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:51:04,379 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 05:51:04,580 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2020-12-09 05:51:04,581 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 05:51:04,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:51:04,582 INFO L82 PathProgramCache]: Analyzing trace with hash 1241130402, now seen corresponding path program 1 times [2020-12-09 05:51:04,583 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 05:51:04,583 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [626690719] [2020-12-09 05:51:04,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f9066140-8ed7-4b24-9e42-e35294023b38/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 05:51:04,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:51:04,638 INFO L263 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 9 conjunts are in the unsatisfiable core [2020-12-09 05:51:04,639 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 05:51:04,650 INFO L443 ElimStorePlain]: Different costs {0=[|v_#length_25|], 1=[|v_#valid_34|]} [2020-12-09 05:51:04,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 05:51:04,655 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 05:51:04,656 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 05:51:04,676 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 05:51:04,682 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 05:51:04,683 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 05:51:04,696 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 05:51:04,698 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 05:51:04,698 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:16 [2020-12-09 05:51:04,737 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 05:51:04,737 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 05:51:04,737 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [626690719] [2020-12-09 05:51:04,737 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 05:51:04,737 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 05:51:04,737 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103376116] [2020-12-09 05:51:04,737 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 05:51:04,738 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 05:51:04,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 05:51:04,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-09 05:51:04,738 INFO L87 Difference]: Start difference. First operand 75 states and 90 transitions. Second operand 5 states. [2020-12-09 05:51:05,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:51:05,013 INFO L93 Difference]: Finished difference Result 119 states and 138 transitions. [2020-12-09 05:51:05,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 05:51:05,014 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2020-12-09 05:51:05,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:51:05,014 INFO L225 Difference]: With dead ends: 119 [2020-12-09 05:51:05,014 INFO L226 Difference]: Without dead ends: 119 [2020-12-09 05:51:05,014 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 05:51:05,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2020-12-09 05:51:05,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 75. [2020-12-09 05:51:05,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2020-12-09 05:51:05,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 90 transitions. [2020-12-09 05:51:05,018 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 90 transitions. Word has length 9 [2020-12-09 05:51:05,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:51:05,018 INFO L481 AbstractCegarLoop]: Abstraction has 75 states and 90 transitions. [2020-12-09 05:51:05,018 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 05:51:05,018 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 90 transitions. [2020-12-09 05:51:05,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-12-09 05:51:05,019 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:51:05,019 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 05:51:05,219 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2020-12-09 05:51:05,220 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 05:51:05,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:51:05,222 INFO L82 PathProgramCache]: Analyzing trace with hash 629683418, now seen corresponding path program 1 times [2020-12-09 05:51:05,222 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 05:51:05,223 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1820148817] [2020-12-09 05:51:05,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f9066140-8ed7-4b24-9e42-e35294023b38/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 05:51:05,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:51:05,367 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 6 conjunts are in the unsatisfiable core [2020-12-09 05:51:05,368 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 05:51:05,395 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 05:51:05,395 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 05:51:05,396 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 05:51:05,418 INFO L625 ElimStorePlain]: treesize reduction 10, result has 67.7 percent of original size [2020-12-09 05:51:05,420 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 05:51:05,420 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:16, output treesize:12 [2020-12-09 05:51:05,433 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 05:51:05,433 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 05:51:05,434 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1820148817] [2020-12-09 05:51:05,434 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 05:51:05,434 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 05:51:05,434 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827438474] [2020-12-09 05:51:05,434 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 05:51:05,434 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 05:51:05,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 05:51:05,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-09 05:51:05,435 INFO L87 Difference]: Start difference. First operand 75 states and 90 transitions. Second operand 4 states. [2020-12-09 05:51:05,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:51:05,511 INFO L93 Difference]: Finished difference Result 107 states and 123 transitions. [2020-12-09 05:51:05,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 05:51:05,512 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2020-12-09 05:51:05,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:51:05,512 INFO L225 Difference]: With dead ends: 107 [2020-12-09 05:51:05,512 INFO L226 Difference]: Without dead ends: 107 [2020-12-09 05:51:05,513 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 05:51:05,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2020-12-09 05:51:05,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 78. [2020-12-09 05:51:05,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2020-12-09 05:51:05,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 94 transitions. [2020-12-09 05:51:05,515 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 94 transitions. Word has length 10 [2020-12-09 05:51:05,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:51:05,516 INFO L481 AbstractCegarLoop]: Abstraction has 78 states and 94 transitions. [2020-12-09 05:51:05,516 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 05:51:05,516 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 94 transitions. [2020-12-09 05:51:05,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-12-09 05:51:05,516 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:51:05,516 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 05:51:05,717 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 mathsat -unsat_core_generation=3 [2020-12-09 05:51:05,718 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 05:51:05,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:51:05,719 INFO L82 PathProgramCache]: Analyzing trace with hash -1890276516, now seen corresponding path program 1 times [2020-12-09 05:51:05,720 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 05:51:05,720 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [954611658] [2020-12-09 05:51:05,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f9066140-8ed7-4b24-9e42-e35294023b38/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 05:51:05,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:51:05,885 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 8 conjunts are in the unsatisfiable core [2020-12-09 05:51:05,887 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 05:51:05,964 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 05:51:05,964 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 05:51:05,968 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 05:51:06,060 INFO L625 ElimStorePlain]: treesize reduction 10, result has 68.8 percent of original size [2020-12-09 05:51:06,065 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 05:51:06,065 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:17, output treesize:13 [2020-12-09 05:51:06,138 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 05:51:06,138 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 05:51:06,138 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [954611658] [2020-12-09 05:51:06,138 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 05:51:06,138 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-09 05:51:06,138 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468165333] [2020-12-09 05:51:06,138 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-09 05:51:06,139 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 05:51:06,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-09 05:51:06,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2020-12-09 05:51:06,139 INFO L87 Difference]: Start difference. First operand 78 states and 94 transitions. Second operand 6 states. [2020-12-09 05:51:06,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:51:06,377 INFO L93 Difference]: Finished difference Result 112 states and 130 transitions. [2020-12-09 05:51:06,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-09 05:51:06,377 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2020-12-09 05:51:06,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:51:06,378 INFO L225 Difference]: With dead ends: 112 [2020-12-09 05:51:06,378 INFO L226 Difference]: Without dead ends: 112 [2020-12-09 05:51:06,378 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 05:51:06,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2020-12-09 05:51:06,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 74. [2020-12-09 05:51:06,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2020-12-09 05:51:06,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 89 transitions. [2020-12-09 05:51:06,381 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 89 transitions. Word has length 10 [2020-12-09 05:51:06,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:51:06,381 INFO L481 AbstractCegarLoop]: Abstraction has 74 states and 89 transitions. [2020-12-09 05:51:06,381 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-09 05:51:06,381 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 89 transitions. [2020-12-09 05:51:06,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-12-09 05:51:06,381 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:51:06,382 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 05:51:06,582 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 mathsat -unsat_core_generation=3 [2020-12-09 05:51:06,583 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 05:51:06,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:51:06,585 INFO L82 PathProgramCache]: Analyzing trace with hash -1226025170, now seen corresponding path program 1 times [2020-12-09 05:51:06,585 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 05:51:06,586 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1086063367] [2020-12-09 05:51:06,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f9066140-8ed7-4b24-9e42-e35294023b38/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 05:51:06,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:51:06,671 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 11 conjunts are in the unsatisfiable core [2020-12-09 05:51:06,671 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 05:51:06,681 INFO L443 ElimStorePlain]: Different costs {0=[|v_#length_28|], 1=[|v_#valid_35|]} [2020-12-09 05:51:06,686 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 05:51:06,686 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 05:51:06,687 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 05:51:06,701 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 05:51:06,706 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 05:51:06,708 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 05:51:06,724 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 05:51:06,725 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 05:51:06,726 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:16 [2020-12-09 05:51:06,836 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 05:51:06,836 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 05:51:07,253 INFO L443 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2020-12-09 05:51:07,256 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 05:51:07,257 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 05:51:07,258 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 05:51:07,258 INFO L515 ElimStorePlain]: Eliminatee |#length| vanished before elimination [2020-12-09 05:51:07,258 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 05:51:07,258 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:33, output treesize:1 [2020-12-09 05:51:07,260 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 05:51:07,260 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1086063367] [2020-12-09 05:51:07,260 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [557492529] [2020-12-09 05:51:07,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f9066140-8ed7-4b24-9e42-e35294023b38/bin/utaipan/cvc4 Starting monitored process 13 with cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4 --incremental --print-success --lang smt [2020-12-09 05:51:07,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:51:07,432 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 11 conjunts are in the unsatisfiable core [2020-12-09 05:51:07,432 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 05:51:07,440 INFO L443 ElimStorePlain]: Different costs {0=[|v_#length_30|], 1=[|v_#valid_37|]} [2020-12-09 05:51:07,444 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 05:51:07,444 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 05:51:07,445 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 05:51:07,460 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 05:51:07,465 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 05:51:07,466 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 05:51:07,483 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 05:51:07,485 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 05:51:07,485 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:16 [2020-12-09 05:51:07,567 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 05:51:07,567 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 05:51:08,000 INFO L443 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2020-12-09 05:51:08,003 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 05:51:08,004 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 05:51:08,005 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 05:51:08,005 INFO L515 ElimStorePlain]: Eliminatee |#length| vanished before elimination [2020-12-09 05:51:08,005 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 05:51:08,005 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:39, output treesize:1 [2020-12-09 05:51:08,007 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 05:51:08,007 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [116016189] [2020-12-09 05:51:08,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f9066140-8ed7-4b24-9e42-e35294023b38/bin/utaipan/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 05:51:08,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:51:08,037 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 10 conjunts are in the unsatisfiable core [2020-12-09 05:51:08,038 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 05:51:08,045 INFO L443 ElimStorePlain]: Different costs {0=[|v_#length_32|], 1=[|v_#valid_39|]} [2020-12-09 05:51:08,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 05:51:08,049 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 05:51:08,050 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 05:51:08,064 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 05:51:08,069 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 05:51:08,069 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 05:51:08,081 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 05:51:08,083 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 05:51:08,083 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:16 [2020-12-09 05:51:08,116 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 05:51:08,116 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 05:51:08,131 INFO L443 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2020-12-09 05:51:08,134 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 05:51:08,135 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 05:51:08,136 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 05:51:08,136 INFO L515 ElimStorePlain]: Eliminatee |#length| vanished before elimination [2020-12-09 05:51:08,136 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 05:51:08,136 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:27, output treesize:1 [2020-12-09 05:51:08,138 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 05:51:08,138 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2020-12-09 05:51:08,138 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5, 5, 5, 4] total 16 [2020-12-09 05:51:08,139 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186746303] [2020-12-09 05:51:08,139 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-12-09 05:51:08,139 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 05:51:08,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-12-09 05:51:08,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=188, Unknown=0, NotChecked=0, Total=272 [2020-12-09 05:51:08,140 INFO L87 Difference]: Start difference. First operand 74 states and 89 transitions. Second operand 17 states. [2020-12-09 05:51:08,717 WARN L197 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 28 [2020-12-09 05:51:08,927 WARN L197 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 17 [2020-12-09 05:51:09,479 WARN L197 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 24 [2020-12-09 05:51:09,996 WARN L197 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 24 [2020-12-09 05:51:10,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:51:10,477 INFO L93 Difference]: Finished difference Result 246 states and 280 transitions. [2020-12-09 05:51:10,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-12-09 05:51:10,479 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 11 [2020-12-09 05:51:10,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:51:10,480 INFO L225 Difference]: With dead ends: 246 [2020-12-09 05:51:10,480 INFO L226 Difference]: Without dead ends: 246 [2020-12-09 05:51:10,480 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 05:51:10,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2020-12-09 05:51:10,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 98. [2020-12-09 05:51:10,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2020-12-09 05:51:10,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 119 transitions. [2020-12-09 05:51:10,484 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 119 transitions. Word has length 11 [2020-12-09 05:51:10,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:51:10,484 INFO L481 AbstractCegarLoop]: Abstraction has 98 states and 119 transitions. [2020-12-09 05:51:10,484 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-12-09 05:51:10,484 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 119 transitions. [2020-12-09 05:51:10,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-12-09 05:51:10,484 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:51:10,484 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 05:51:11,086 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true,13 cvc4 --incremental --print-success --lang smt,12 mathsat -unsat_core_generation=3 [2020-12-09 05:51:11,087 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 05:51:11,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:51:11,088 INFO L82 PathProgramCache]: Analyzing trace with hash -464624129, now seen corresponding path program 1 times [2020-12-09 05:51:11,089 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 05:51:11,090 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [879917305] [2020-12-09 05:51:11,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f9066140-8ed7-4b24-9e42-e35294023b38/bin/utaipan/mathsat Starting monitored process 15 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with mathsat -unsat_core_generation=3 [2020-12-09 05:51:11,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:51:11,132 INFO L263 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 9 conjunts are in the unsatisfiable core [2020-12-09 05:51:11,133 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 05:51:11,170 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 05:51:11,170 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 05:51:11,170 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [879917305] [2020-12-09 05:51:11,170 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 05:51:11,170 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-09 05:51:11,170 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037776358] [2020-12-09 05:51:11,171 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-09 05:51:11,171 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 05:51:11,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-09 05:51:11,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-12-09 05:51:11,171 INFO L87 Difference]: Start difference. First operand 98 states and 119 transitions. Second operand 6 states. [2020-12-09 05:51:11,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:51:11,405 INFO L93 Difference]: Finished difference Result 160 states and 187 transitions. [2020-12-09 05:51:11,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 05:51:11,405 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2020-12-09 05:51:11,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:51:11,406 INFO L225 Difference]: With dead ends: 160 [2020-12-09 05:51:11,406 INFO L226 Difference]: Without dead ends: 160 [2020-12-09 05:51:11,406 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 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 05:51:11,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2020-12-09 05:51:11,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 118. [2020-12-09 05:51:11,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2020-12-09 05:51:11,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 149 transitions. [2020-12-09 05:51:11,409 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 149 transitions. Word has length 12 [2020-12-09 05:51:11,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:51:11,410 INFO L481 AbstractCegarLoop]: Abstraction has 118 states and 149 transitions. [2020-12-09 05:51:11,410 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-09 05:51:11,410 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 149 transitions. [2020-12-09 05:51:11,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-12-09 05:51:11,410 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:51:11,410 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 05:51:11,611 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 mathsat -unsat_core_generation=3 [2020-12-09 05:51:11,611 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 05:51:11,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:51:11,621 INFO L82 PathProgramCache]: Analyzing trace with hash -464624130, now seen corresponding path program 1 times [2020-12-09 05:51:11,623 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 05:51:11,623 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [173868839] [2020-12-09 05:51:11,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f9066140-8ed7-4b24-9e42-e35294023b38/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 05:51:11,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:51:11,688 INFO L263 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 4 conjunts are in the unsatisfiable core [2020-12-09 05:51:11,689 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 05:51:11,700 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 05:51:11,700 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 05:51:11,700 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [173868839] [2020-12-09 05:51:11,700 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 05:51:11,700 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 05:51:11,701 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539583449] [2020-12-09 05:51:11,701 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 05:51:11,701 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 05:51:11,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 05:51:11,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 05:51:11,701 INFO L87 Difference]: Start difference. First operand 118 states and 149 transitions. Second operand 4 states. [2020-12-09 05:51:11,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:51:11,777 INFO L93 Difference]: Finished difference Result 115 states and 143 transitions. [2020-12-09 05:51:11,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 05:51:11,778 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-12-09 05:51:11,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:51:11,779 INFO L225 Difference]: With dead ends: 115 [2020-12-09 05:51:11,779 INFO L226 Difference]: Without dead ends: 115 [2020-12-09 05:51:11,779 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 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 05:51:11,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2020-12-09 05:51:11,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2020-12-09 05:51:11,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2020-12-09 05:51:11,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 143 transitions. [2020-12-09 05:51:11,782 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 143 transitions. Word has length 12 [2020-12-09 05:51:11,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:51:11,783 INFO L481 AbstractCegarLoop]: Abstraction has 115 states and 143 transitions. [2020-12-09 05:51:11,783 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 05:51:11,783 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 143 transitions. [2020-12-09 05:51:11,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-12-09 05:51:11,783 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:51:11,783 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 05:51:11,984 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 mathsat -unsat_core_generation=3 [2020-12-09 05:51:11,985 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 05:51:11,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:51:11,987 INFO L82 PathProgramCache]: Analyzing trace with hash -857651139, now seen corresponding path program 1 times [2020-12-09 05:51:11,987 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 05:51:11,988 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1068286643] [2020-12-09 05:51:11,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f9066140-8ed7-4b24-9e42-e35294023b38/bin/utaipan/mathsat Starting monitored process 17 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with mathsat -unsat_core_generation=3 [2020-12-09 05:51:12,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:51:12,159 INFO L263 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 9 conjunts are in the unsatisfiable core [2020-12-09 05:51:12,160 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 05:51:12,225 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 05:51:12,225 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 05:51:12,225 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1068286643] [2020-12-09 05:51:12,225 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 05:51:12,225 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-09 05:51:12,225 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316584129] [2020-12-09 05:51:12,225 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-09 05:51:12,225 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 05:51:12,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-09 05:51:12,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-12-09 05:51:12,226 INFO L87 Difference]: Start difference. First operand 115 states and 143 transitions. Second operand 6 states. [2020-12-09 05:51:12,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:51:12,429 INFO L93 Difference]: Finished difference Result 135 states and 165 transitions. [2020-12-09 05:51:12,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 05:51:12,430 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2020-12-09 05:51:12,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:51:12,431 INFO L225 Difference]: With dead ends: 135 [2020-12-09 05:51:12,431 INFO L226 Difference]: Without dead ends: 135 [2020-12-09 05:51:12,431 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 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 05:51:12,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2020-12-09 05:51:12,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 103. [2020-12-09 05:51:12,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2020-12-09 05:51:12,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 128 transitions. [2020-12-09 05:51:12,433 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 128 transitions. Word has length 12 [2020-12-09 05:51:12,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:51:12,433 INFO L481 AbstractCegarLoop]: Abstraction has 103 states and 128 transitions. [2020-12-09 05:51:12,433 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-09 05:51:12,433 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 128 transitions. [2020-12-09 05:51:12,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-12-09 05:51:12,434 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:51:12,434 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 05:51:12,634 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 mathsat -unsat_core_generation=3 [2020-12-09 05:51:12,635 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 05:51:12,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:51:12,636 INFO L82 PathProgramCache]: Analyzing trace with hash -1862804906, now seen corresponding path program 1 times [2020-12-09 05:51:12,637 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 05:51:12,637 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [832680095] [2020-12-09 05:51:12,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f9066140-8ed7-4b24-9e42-e35294023b38/bin/utaipan/mathsat Starting monitored process 18 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with mathsat -unsat_core_generation=3 [2020-12-09 05:51:12,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:51:12,694 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 9 conjunts are in the unsatisfiable core [2020-12-09 05:51:12,696 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 05:51:12,719 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 05:51:12,719 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 05:51:12,720 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 05:51:12,743 INFO L625 ElimStorePlain]: treesize reduction 10, result has 68.8 percent of original size [2020-12-09 05:51:12,744 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 05:51:12,744 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:17, output treesize:13 [2020-12-09 05:51:12,811 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 05:51:12,812 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 05:51:13,164 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 05:51:13,164 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [832680095] [2020-12-09 05:51:13,164 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1273724427] [2020-12-09 05:51:13,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f9066140-8ed7-4b24-9e42-e35294023b38/bin/utaipan/cvc4 Starting monitored process 19 with cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with cvc4 --incremental --print-success --lang smt [2020-12-09 05:51:13,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:51:13,238 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 9 conjunts are in the unsatisfiable core [2020-12-09 05:51:13,239 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 05:51:13,257 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 05:51:13,257 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 05:51:13,258 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 05:51:13,280 INFO L625 ElimStorePlain]: treesize reduction 10, result has 68.8 percent of original size [2020-12-09 05:51:13,282 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 05:51:13,282 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:17, output treesize:13 [2020-12-09 05:51:13,302 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 05:51:13,302 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 05:51:13,315 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 05:51:13,315 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [702553870] [2020-12-09 05:51:13,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f9066140-8ed7-4b24-9e42-e35294023b38/bin/utaipan/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 05:51:13,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:51:13,347 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 10 conjunts are in the unsatisfiable core [2020-12-09 05:51:13,348 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 05:51:13,369 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 05:51:13,369 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 05:51:13,370 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 05:51:13,394 INFO L625 ElimStorePlain]: treesize reduction 10, result has 68.8 percent of original size [2020-12-09 05:51:13,395 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 05:51:13,395 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:17, output treesize:13 [2020-12-09 05:51:13,458 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 05:51:13,458 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 05:51:14,171 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 05:51:14,171 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2020-12-09 05:51:14,171 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6, 5, 6, 6] total 16 [2020-12-09 05:51:14,171 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416991689] [2020-12-09 05:51:14,172 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-12-09 05:51:14,172 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 05:51:14,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-12-09 05:51:14,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2020-12-09 05:51:14,172 INFO L87 Difference]: Start difference. First operand 103 states and 128 transitions. Second operand 17 states. [2020-12-09 05:51:14,901 WARN L197 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 17 [2020-12-09 05:51:15,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:51:15,366 INFO L93 Difference]: Finished difference Result 186 states and 224 transitions. [2020-12-09 05:51:15,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-12-09 05:51:15,367 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 13 [2020-12-09 05:51:15,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:51:15,368 INFO L225 Difference]: With dead ends: 186 [2020-12-09 05:51:15,368 INFO L226 Difference]: Without dead ends: 186 [2020-12-09 05:51:15,369 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 05:51:15,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2020-12-09 05:51:15,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 98. [2020-12-09 05:51:15,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2020-12-09 05:51:15,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 120 transitions. [2020-12-09 05:51:15,374 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 120 transitions. Word has length 13 [2020-12-09 05:51:15,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:51:15,374 INFO L481 AbstractCegarLoop]: Abstraction has 98 states and 120 transitions. [2020-12-09 05:51:15,374 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-12-09 05:51:15,374 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 120 transitions. [2020-12-09 05:51:15,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-12-09 05:51:15,375 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:51:15,375 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 05:51:15,977 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 mathsat -unsat_core_generation=3,19 cvc4 --incremental --print-success --lang smt,20 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 05:51:15,978 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 05:51:15,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:51:15,979 INFO L82 PathProgramCache]: Analyzing trace with hash -1432374396, now seen corresponding path program 1 times [2020-12-09 05:51:15,979 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 05:51:15,979 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [228631078] [2020-12-09 05:51:15,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f9066140-8ed7-4b24-9e42-e35294023b38/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 05:51:16,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:51:16,038 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 5 conjunts are in the unsatisfiable core [2020-12-09 05:51:16,039 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 05:51:16,053 INFO L348 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2020-12-09 05:51:16,053 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 05:51:16,054 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 05:51:16,058 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 05:51:16,058 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 05:51:16,058 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:9, output treesize:13 [2020-12-09 05:51:16,074 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 05:51:16,074 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 05:51:16,074 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [228631078] [2020-12-09 05:51:16,074 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 05:51:16,074 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 05:51:16,074 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068400123] [2020-12-09 05:51:16,075 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 05:51:16,075 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 05:51:16,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 05:51:16,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 05:51:16,075 INFO L87 Difference]: Start difference. First operand 98 states and 120 transitions. Second operand 4 states. [2020-12-09 05:51:16,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:51:16,138 INFO L93 Difference]: Finished difference Result 96 states and 117 transitions. [2020-12-09 05:51:16,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 05:51:16,138 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2020-12-09 05:51:16,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:51:16,139 INFO L225 Difference]: With dead ends: 96 [2020-12-09 05:51:16,139 INFO L226 Difference]: Without dead ends: 96 [2020-12-09 05:51:16,139 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 05:51:16,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2020-12-09 05:51:16,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2020-12-09 05:51:16,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2020-12-09 05:51:16,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 117 transitions. [2020-12-09 05:51:16,141 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 117 transitions. Word has length 16 [2020-12-09 05:51:16,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:51:16,141 INFO L481 AbstractCegarLoop]: Abstraction has 96 states and 117 transitions. [2020-12-09 05:51:16,141 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 05:51:16,141 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 117 transitions. [2020-12-09 05:51:16,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-12-09 05:51:16,141 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:51:16,141 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 05:51:16,342 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 mathsat -unsat_core_generation=3 [2020-12-09 05:51:16,343 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 05:51:16,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:51:16,344 INFO L82 PathProgramCache]: Analyzing trace with hash -1432374395, now seen corresponding path program 1 times [2020-12-09 05:51:16,345 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 05:51:16,345 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1836390513] [2020-12-09 05:51:16,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f9066140-8ed7-4b24-9e42-e35294023b38/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 05:51:16,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:51:16,415 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 10 conjunts are in the unsatisfiable core [2020-12-09 05:51:16,417 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 05:51:16,441 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 05:51:16,441 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 05:51:16,442 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 05:51:16,464 INFO L625 ElimStorePlain]: treesize reduction 10, result has 64.3 percent of original size [2020-12-09 05:51:16,465 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 05:51:16,466 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2020-12-09 05:51:16,489 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 05:51:16,490 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 05:51:16,490 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1836390513] [2020-12-09 05:51:16,490 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 05:51:16,490 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 05:51:16,490 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25430817] [2020-12-09 05:51:16,490 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 05:51:16,491 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 05:51:16,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 05:51:16,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-09 05:51:16,491 INFO L87 Difference]: Start difference. First operand 96 states and 117 transitions. Second operand 5 states. [2020-12-09 05:51:16,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:51:16,646 INFO L93 Difference]: Finished difference Result 139 states and 163 transitions. [2020-12-09 05:51:16,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 05:51:16,647 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-12-09 05:51:16,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:51:16,647 INFO L225 Difference]: With dead ends: 139 [2020-12-09 05:51:16,647 INFO L226 Difference]: Without dead ends: 139 [2020-12-09 05:51:16,648 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 05:51:16,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2020-12-09 05:51:16,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 110. [2020-12-09 05:51:16,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2020-12-09 05:51:16,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 134 transitions. [2020-12-09 05:51:16,650 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 134 transitions. Word has length 16 [2020-12-09 05:51:16,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:51:16,650 INFO L481 AbstractCegarLoop]: Abstraction has 110 states and 134 transitions. [2020-12-09 05:51:16,650 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 05:51:16,650 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 134 transitions. [2020-12-09 05:51:16,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-12-09 05:51:16,650 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:51:16,650 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 05:51:16,851 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 mathsat -unsat_core_generation=3 [2020-12-09 05:51:16,851 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 05:51:16,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:51:16,852 INFO L82 PathProgramCache]: Analyzing trace with hash -1432365322, now seen corresponding path program 1 times [2020-12-09 05:51:16,853 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 05:51:16,853 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1976783125] [2020-12-09 05:51:16,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f9066140-8ed7-4b24-9e42-e35294023b38/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 05:51:16,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:51:16,929 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 2 conjunts are in the unsatisfiable core [2020-12-09 05:51:16,929 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 05:51:16,938 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 05:51:16,938 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 05:51:16,939 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1976783125] [2020-12-09 05:51:16,939 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 05:51:16,939 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 05:51:16,939 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239881336] [2020-12-09 05:51:16,939 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 05:51:16,939 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 05:51:16,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 05:51:16,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 05:51:16,940 INFO L87 Difference]: Start difference. First operand 110 states and 134 transitions. Second operand 3 states. [2020-12-09 05:51:16,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:51:16,947 INFO L93 Difference]: Finished difference Result 113 states and 137 transitions. [2020-12-09 05:51:16,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 05:51:16,947 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2020-12-09 05:51:16,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:51:16,948 INFO L225 Difference]: With dead ends: 113 [2020-12-09 05:51:16,948 INFO L226 Difference]: Without dead ends: 113 [2020-12-09 05:51:16,948 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 14 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 05:51:16,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2020-12-09 05:51:16,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2020-12-09 05:51:16,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2020-12-09 05:51:16,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 137 transitions. [2020-12-09 05:51:16,950 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 137 transitions. Word has length 16 [2020-12-09 05:51:16,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:51:16,950 INFO L481 AbstractCegarLoop]: Abstraction has 113 states and 137 transitions. [2020-12-09 05:51:16,950 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 05:51:16,950 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 137 transitions. [2020-12-09 05:51:16,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-12-09 05:51:16,951 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:51:16,951 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 05:51:17,151 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 mathsat -unsat_core_generation=3 [2020-12-09 05:51:17,152 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 05:51:17,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:51:17,153 INFO L82 PathProgramCache]: Analyzing trace with hash -2019180409, now seen corresponding path program 1 times [2020-12-09 05:51:17,154 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 05:51:17,154 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [621728160] [2020-12-09 05:51:17,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f9066140-8ed7-4b24-9e42-e35294023b38/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 05:51:17,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:51:17,332 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 10 conjunts are in the unsatisfiable core [2020-12-09 05:51:17,333 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 05:51:17,356 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 05:51:17,356 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 05:51:17,357 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 05:51:17,385 INFO L625 ElimStorePlain]: treesize reduction 10, result has 68.8 percent of original size [2020-12-09 05:51:17,387 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 05:51:17,387 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:17, output treesize:10 [2020-12-09 05:51:17,411 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 05:51:17,411 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 05:51:17,411 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [621728160] [2020-12-09 05:51:17,411 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 05:51:17,411 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 05:51:17,411 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814170558] [2020-12-09 05:51:17,412 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 05:51:17,412 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 05:51:17,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 05:51:17,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-09 05:51:17,412 INFO L87 Difference]: Start difference. First operand 113 states and 137 transitions. Second operand 5 states. [2020-12-09 05:51:17,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:51:17,560 INFO L93 Difference]: Finished difference Result 121 states and 144 transitions. [2020-12-09 05:51:17,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 05:51:17,561 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-12-09 05:51:17,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:51:17,561 INFO L225 Difference]: With dead ends: 121 [2020-12-09 05:51:17,561 INFO L226 Difference]: Without dead ends: 121 [2020-12-09 05:51:17,562 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 05:51:17,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2020-12-09 05:51:17,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 100. [2020-12-09 05:51:17,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2020-12-09 05:51:17,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 120 transitions. [2020-12-09 05:51:17,564 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 120 transitions. Word has length 16 [2020-12-09 05:51:17,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:51:17,564 INFO L481 AbstractCegarLoop]: Abstraction has 100 states and 120 transitions. [2020-12-09 05:51:17,564 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 05:51:17,564 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 120 transitions. [2020-12-09 05:51:17,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-12-09 05:51:17,564 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:51:17,564 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 05:51:17,765 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 mathsat -unsat_core_generation=3 [2020-12-09 05:51:17,765 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 05:51:17,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:51:17,766 INFO L82 PathProgramCache]: Analyzing trace with hash 1532417320, now seen corresponding path program 1 times [2020-12-09 05:51:17,767 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 05:51:17,767 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [558376980] [2020-12-09 05:51:17,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f9066140-8ed7-4b24-9e42-e35294023b38/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 05:51:17,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:51:17,908 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 13 conjunts are in the unsatisfiable core [2020-12-09 05:51:17,909 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 05:51:17,919 INFO L443 ElimStorePlain]: Different costs {0=[|v_#length_42|], 1=[|v_#valid_45|]} [2020-12-09 05:51:17,924 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 05:51:17,925 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 05:51:17,925 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 05:51:17,941 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 05:51:17,946 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 05:51:17,947 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 05:51:17,960 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 05:51:17,961 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 05:51:17,962 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:16 [2020-12-09 05:51:18,096 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 05:51:18,096 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 05:51:18,737 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 05:51:18,739 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-12-09 05:51:18,743 INFO L443 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2020-12-09 05:51:18,745 INFO L173 IndexEqualityManager]: detected equality via solver [2020-12-09 05:51:18,748 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-12-09 05:51:18,748 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 05:51:18,751 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 05:51:18,752 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 05:51:18,752 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 05:51:18,752 INFO L515 ElimStorePlain]: Eliminatee |#length| vanished before elimination [2020-12-09 05:51:18,753 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 05:51:18,753 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:83, output treesize:1 [2020-12-09 05:51:18,755 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 05:51:18,755 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [558376980] [2020-12-09 05:51:18,755 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [593697437] [2020-12-09 05:51:18,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f9066140-8ed7-4b24-9e42-e35294023b38/bin/utaipan/cvc4 Starting monitored process 26 with cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with cvc4 --incremental --print-success --lang smt [2020-12-09 05:51:18,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:51:18,820 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 14 conjunts are in the unsatisfiable core [2020-12-09 05:51:18,821 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 05:51:18,828 INFO L443 ElimStorePlain]: Different costs {0=[|v_#length_44|], 1=[|v_#valid_47|]} [2020-12-09 05:51:18,832 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 05:51:18,833 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 05:51:18,833 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 05:51:18,847 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 05:51:18,852 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 05:51:18,853 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 05:51:18,866 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 05:51:18,867 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 05:51:18,867 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:16 [2020-12-09 05:51:18,987 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 05:51:18,987 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 05:51:19,201 WARN L197 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2020-12-09 05:51:19,207 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 05:51:19,208 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-12-09 05:51:19,211 INFO L443 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2020-12-09 05:51:19,213 INFO L173 IndexEqualityManager]: detected equality via solver [2020-12-09 05:51:19,216 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-12-09 05:51:19,216 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 05:51:19,219 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 05:51:19,220 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 05:51:19,220 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 05:51:19,220 INFO L515 ElimStorePlain]: Eliminatee |#length| vanished before elimination [2020-12-09 05:51:19,221 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 05:51:19,221 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:95, output treesize:1 [2020-12-09 05:51:19,223 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 05:51:19,223 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1520619345] [2020-12-09 05:51:19,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f9066140-8ed7-4b24-9e42-e35294023b38/bin/utaipan/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 05:51:19,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:51:19,261 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 14 conjunts are in the unsatisfiable core [2020-12-09 05:51:19,262 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 05:51:19,267 INFO L443 ElimStorePlain]: Different costs {0=[|v_#length_46|], 1=[|v_#valid_49|]} [2020-12-09 05:51:19,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 05:51:19,271 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 05:51:19,272 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 05:51:19,284 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 05:51:19,289 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 05:51:19,290 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 05:51:19,302 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 05:51:19,303 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 05:51:19,303 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:16 [2020-12-09 05:51:19,373 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 05:51:19,373 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 05:51:19,389 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 05:51:19,389 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-12-09 05:51:19,393 INFO L443 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2020-12-09 05:51:19,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 05:51:19,398 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 05:51:19,400 INFO L173 IndexEqualityManager]: detected equality via solver [2020-12-09 05:51:19,403 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-12-09 05:51:19,404 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 05:51:19,404 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 05:51:19,404 INFO L515 ElimStorePlain]: Eliminatee |#length| vanished before elimination [2020-12-09 05:51:19,405 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 05:51:19,405 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:95, output treesize:1 [2020-12-09 05:51:19,407 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 05:51:19,407 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2020-12-09 05:51:19,407 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 8, 8, 8, 8] total 16 [2020-12-09 05:51:19,408 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610949743] [2020-12-09 05:51:19,408 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-12-09 05:51:19,408 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 05:51:19,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-12-09 05:51:19,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=171, Unknown=0, NotChecked=0, Total=272 [2020-12-09 05:51:19,408 INFO L87 Difference]: Start difference. First operand 100 states and 120 transitions. Second operand 17 states. [2020-12-09 05:51:20,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:51:20,070 INFO L93 Difference]: Finished difference Result 220 states and 254 transitions. [2020-12-09 05:51:20,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-09 05:51:20,071 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 [2020-12-09 05:51:20,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:51:20,072 INFO L225 Difference]: With dead ends: 220 [2020-12-09 05:51:20,072 INFO L226 Difference]: Without dead ends: 220 [2020-12-09 05:51:20,072 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 73 SyntacticMatches, 8 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=131, Invalid=211, Unknown=0, NotChecked=0, Total=342 [2020-12-09 05:51:20,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2020-12-09 05:51:20,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 91. [2020-12-09 05:51:20,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2020-12-09 05:51:20,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 110 transitions. [2020-12-09 05:51:20,074 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 110 transitions. Word has length 17 [2020-12-09 05:51:20,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:51:20,075 INFO L481 AbstractCegarLoop]: Abstraction has 91 states and 110 transitions. [2020-12-09 05:51:20,075 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-12-09 05:51:20,075 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 110 transitions. [2020-12-09 05:51:20,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-12-09 05:51:20,075 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:51:20,075 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 05:51:20,677 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 cvc4 --incremental --print-success --lang smt,27 z3 -smt2 -in SMTLIB2_COMPLIANT=true,25 mathsat -unsat_core_generation=3 [2020-12-09 05:51:20,677 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 05:51:20,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:51:20,678 INFO L82 PathProgramCache]: Analyzing trace with hash -1365500555, now seen corresponding path program 1 times [2020-12-09 05:51:20,679 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 05:51:20,680 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1420620801] [2020-12-09 05:51:20,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f9066140-8ed7-4b24-9e42-e35294023b38/bin/utaipan/mathsat Starting monitored process 28 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with mathsat -unsat_core_generation=3 [2020-12-09 05:51:20,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:51:20,801 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 18 conjunts are in the unsatisfiable core [2020-12-09 05:51:20,803 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 05:51:20,818 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 05:51:20,819 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 05:51:20,823 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 05:51:20,823 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 05:51:20,823 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:12 [2020-12-09 05:51:20,953 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 05:51:20,953 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 35 treesize of output 31 [2020-12-09 05:51:20,954 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-09 05:51:20,956 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-09 05:51:20,957 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 05:51:20,980 INFO L625 ElimStorePlain]: treesize reduction 4, result has 86.2 percent of original size [2020-12-09 05:51:20,982 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 05:51:20,982 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:16 [2020-12-09 05:51:21,003 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 05:51:21,017 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 05:51:21,017 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 05:51:21,017 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1420620801] [2020-12-09 05:51:21,017 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 05:51:21,017 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-12-09 05:51:21,017 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686121982] [2020-12-09 05:51:21,018 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-12-09 05:51:21,018 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 05:51:21,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-12-09 05:51:21,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2020-12-09 05:51:21,018 INFO L87 Difference]: Start difference. First operand 91 states and 110 transitions. Second operand 12 states. [2020-12-09 05:51:21,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:51:21,749 INFO L93 Difference]: Finished difference Result 121 states and 140 transitions. [2020-12-09 05:51:21,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-12-09 05:51:21,750 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19 [2020-12-09 05:51:21,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:51:21,751 INFO L225 Difference]: With dead ends: 121 [2020-12-09 05:51:21,751 INFO L226 Difference]: Without dead ends: 121 [2020-12-09 05:51:21,752 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=143, Invalid=319, Unknown=0, NotChecked=0, Total=462 [2020-12-09 05:51:21,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2020-12-09 05:51:21,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 100. [2020-12-09 05:51:21,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2020-12-09 05:51:21,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 120 transitions. [2020-12-09 05:51:21,754 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 120 transitions. Word has length 19 [2020-12-09 05:51:21,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:51:21,755 INFO L481 AbstractCegarLoop]: Abstraction has 100 states and 120 transitions. [2020-12-09 05:51:21,755 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-12-09 05:51:21,755 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 120 transitions. [2020-12-09 05:51:21,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-12-09 05:51:21,755 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:51:21,755 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 05:51:21,956 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 mathsat -unsat_core_generation=3 [2020-12-09 05:51:21,956 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 05:51:21,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:51:21,957 INFO L82 PathProgramCache]: Analyzing trace with hash 1908398387, now seen corresponding path program 1 times [2020-12-09 05:51:21,958 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 05:51:21,958 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1617337438] [2020-12-09 05:51:21,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f9066140-8ed7-4b24-9e42-e35294023b38/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 05:51:22,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:51:22,064 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 20 conjunts are in the unsatisfiable core [2020-12-09 05:51:22,064 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 05:51:22,110 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 05:51:22,111 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 05:51:22,123 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 05:51:22,124 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 05:51:22,124 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2020-12-09 05:51:22,430 INFO L173 IndexEqualityManager]: detected equality via solver [2020-12-09 05:51:22,456 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 05:51:22,456 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 37 treesize of output 48 [2020-12-09 05:51:22,458 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-12-09 05:51:22,459 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-09 05:51:22,460 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-12-09 05:51:22,461 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-09 05:51:22,462 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 05:51:22,521 INFO L625 ElimStorePlain]: treesize reduction 17, result has 68.5 percent of original size [2020-12-09 05:51:22,524 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 05:51:22,524 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:47, output treesize:16 [2020-12-09 05:51:22,556 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 05:51:22,580 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 05:51:22,580 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 05:51:22,580 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1617337438] [2020-12-09 05:51:22,580 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 05:51:22,580 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-12-09 05:51:22,580 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443690759] [2020-12-09 05:51:22,581 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-12-09 05:51:22,581 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 05:51:22,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-12-09 05:51:22,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2020-12-09 05:51:22,581 INFO L87 Difference]: Start difference. First operand 100 states and 120 transitions. Second operand 14 states. [2020-12-09 05:51:23,164 WARN L197 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 48 [2020-12-09 05:51:23,369 WARN L197 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 45 [2020-12-09 05:51:23,538 WARN L197 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 45 [2020-12-09 05:51:23,776 WARN L197 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 49 [2020-12-09 05:51:24,014 WARN L197 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 51 [2020-12-09 05:51:24,233 WARN L197 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 52 [2020-12-09 05:51:24,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:51:24,554 INFO L93 Difference]: Finished difference Result 134 states and 156 transitions. [2020-12-09 05:51:24,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-12-09 05:51:24,555 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 19 [2020-12-09 05:51:24,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:51:24,556 INFO L225 Difference]: With dead ends: 134 [2020-12-09 05:51:24,556 INFO L226 Difference]: Without dead ends: 134 [2020-12-09 05:51:24,556 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=194, Invalid=456, Unknown=0, NotChecked=0, Total=650 [2020-12-09 05:51:24,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2020-12-09 05:51:24,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 101. [2020-12-09 05:51:24,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2020-12-09 05:51:24,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 122 transitions. [2020-12-09 05:51:24,559 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 122 transitions. Word has length 19 [2020-12-09 05:51:24,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:51:24,560 INFO L481 AbstractCegarLoop]: Abstraction has 101 states and 122 transitions. [2020-12-09 05:51:24,560 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-12-09 05:51:24,560 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 122 transitions. [2020-12-09 05:51:24,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-12-09 05:51:24,560 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:51:24,560 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 05:51:24,761 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 mathsat -unsat_core_generation=3 [2020-12-09 05:51:24,761 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 05:51:24,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:51:24,763 INFO L82 PathProgramCache]: Analyzing trace with hash 1756023060, now seen corresponding path program 1 times [2020-12-09 05:51:24,763 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 05:51:24,764 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1838127514] [2020-12-09 05:51:24,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f9066140-8ed7-4b24-9e42-e35294023b38/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 05:51:24,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:51:24,834 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 14 conjunts are in the unsatisfiable core [2020-12-09 05:51:24,835 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 05:51:24,857 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 05:51:24,858 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 05:51:24,864 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 05:51:24,864 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 05:51:24,864 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:12 [2020-12-09 05:51:24,892 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 17 treesize of output 9 [2020-12-09 05:51:24,893 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 05:51:24,894 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 05:51:24,894 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 05:51:24,894 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2020-12-09 05:51:24,911 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 05:51:24,911 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 05:51:24,911 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1838127514] [2020-12-09 05:51:24,911 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 05:51:24,912 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-12-09 05:51:24,912 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906413327] [2020-12-09 05:51:24,912 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-09 05:51:24,912 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 05:51:24,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-09 05:51:24,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-12-09 05:51:24,912 INFO L87 Difference]: Start difference. First operand 101 states and 122 transitions. Second operand 8 states. [2020-12-09 05:51:25,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:51:25,086 INFO L93 Difference]: Finished difference Result 121 states and 141 transitions. [2020-12-09 05:51:25,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-09 05:51:25,086 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2020-12-09 05:51:25,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:51:25,087 INFO L225 Difference]: With dead ends: 121 [2020-12-09 05:51:25,087 INFO L226 Difference]: Without dead ends: 121 [2020-12-09 05:51:25,087 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2020-12-09 05:51:25,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2020-12-09 05:51:25,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 116. [2020-12-09 05:51:25,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2020-12-09 05:51:25,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 138 transitions. [2020-12-09 05:51:25,089 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 138 transitions. Word has length 23 [2020-12-09 05:51:25,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:51:25,089 INFO L481 AbstractCegarLoop]: Abstraction has 116 states and 138 transitions. [2020-12-09 05:51:25,089 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-09 05:51:25,089 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 138 transitions. [2020-12-09 05:51:25,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-12-09 05:51:25,090 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:51:25,090 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 05:51:25,290 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 mathsat -unsat_core_generation=3 [2020-12-09 05:51:25,291 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 05:51:25,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:51:25,292 INFO L82 PathProgramCache]: Analyzing trace with hash 1756082642, now seen corresponding path program 1 times [2020-12-09 05:51:25,293 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 05:51:25,293 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [858723143] [2020-12-09 05:51:25,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f9066140-8ed7-4b24-9e42-e35294023b38/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 05:51:25,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:51:25,380 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 7 conjunts are in the unsatisfiable core [2020-12-09 05:51:25,381 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 05:51:25,384 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 05:51:25,384 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 05:51:25,386 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 05:51:25,386 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 05:51:25,386 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-12-09 05:51:27,478 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 05:51:27,478 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 05:51:27,479 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [858723143] [2020-12-09 05:51:27,479 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 05:51:27,479 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 05:51:27,479 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761957633] [2020-12-09 05:51:27,479 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-09 05:51:27,479 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 05:51:27,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-09 05:51:27,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=17, Unknown=1, NotChecked=0, Total=30 [2020-12-09 05:51:27,479 INFO L87 Difference]: Start difference. First operand 116 states and 138 transitions. Second operand 6 states. [2020-12-09 05:51:37,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:51:37,712 INFO L93 Difference]: Finished difference Result 115 states and 137 transitions. [2020-12-09 05:51:37,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-09 05:51:37,713 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2020-12-09 05:51:37,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:51:37,713 INFO L225 Difference]: With dead ends: 115 [2020-12-09 05:51:37,713 INFO L226 Difference]: Without dead ends: 78 [2020-12-09 05:51:37,713 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 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 05:51:37,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2020-12-09 05:51:37,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2020-12-09 05:51:37,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2020-12-09 05:51:37,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 88 transitions. [2020-12-09 05:51:37,715 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 88 transitions. Word has length 23 [2020-12-09 05:51:37,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:51:37,715 INFO L481 AbstractCegarLoop]: Abstraction has 78 states and 88 transitions. [2020-12-09 05:51:37,715 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-09 05:51:37,715 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 88 transitions. [2020-12-09 05:51:37,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-12-09 05:51:37,715 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:51:37,715 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 05:51:37,916 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 mathsat -unsat_core_generation=3 [2020-12-09 05:51:37,916 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 05:51:37,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:51:37,917 INFO L82 PathProgramCache]: Analyzing trace with hash 1775319862, now seen corresponding path program 1 times [2020-12-09 05:51:37,918 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 05:51:37,918 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [689897838] [2020-12-09 05:51:37,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f9066140-8ed7-4b24-9e42-e35294023b38/bin/utaipan/mathsat Starting monitored process 32 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with mathsat -unsat_core_generation=3 [2020-12-09 05:51:37,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:51:38,000 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 15 conjunts are in the unsatisfiable core [2020-12-09 05:51:38,001 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 05:51:38,009 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 05:51:38,010 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 05:51:38,016 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 05:51:38,016 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 05:51:38,016 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2020-12-09 05:51:38,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, 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 05:51:38,035 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 05:51:38,041 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 05:51:38,041 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 05:51:38,041 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2020-12-09 05:51:38,057 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 05:51:38,057 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 05:51:38,070 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 05:51:38,072 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 05:51:38,072 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:31, output treesize:27 [2020-12-09 05:51:38,138 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 05:51:38,139 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 05:51:38,143 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 05:51:38,144 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 05:51:38,144 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:32, output treesize:5 [2020-12-09 05:51:38,177 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 05:51:38,177 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 05:51:38,177 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [689897838] [2020-12-09 05:51:38,177 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 05:51:38,178 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-12-09 05:51:38,178 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971615741] [2020-12-09 05:51:38,178 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-09 05:51:38,178 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 05:51:38,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-09 05:51:38,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2020-12-09 05:51:38,178 INFO L87 Difference]: Start difference. First operand 78 states and 88 transitions. Second operand 9 states. [2020-12-09 05:51:40,498 WARN L197 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 34 [2020-12-09 05:51:40,653 WARN L197 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2020-12-09 05:51:40,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:51:40,813 INFO L93 Difference]: Finished difference Result 90 states and 100 transitions. [2020-12-09 05:51:40,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-09 05:51:40,814 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2020-12-09 05:51:40,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:51:40,814 INFO L225 Difference]: With dead ends: 90 [2020-12-09 05:51:40,814 INFO L226 Difference]: Without dead ends: 75 [2020-12-09 05:51:40,814 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2020-12-09 05:51:40,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2020-12-09 05:51:40,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2020-12-09 05:51:40,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2020-12-09 05:51:40,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 84 transitions. [2020-12-09 05:51:40,816 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 84 transitions. Word has length 23 [2020-12-09 05:51:40,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:51:40,816 INFO L481 AbstractCegarLoop]: Abstraction has 75 states and 84 transitions. [2020-12-09 05:51:40,816 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-09 05:51:40,816 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 84 transitions. [2020-12-09 05:51:40,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-12-09 05:51:40,816 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:51:40,816 INFO L422 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2020-12-09 05:51:41,017 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 mathsat -unsat_core_generation=3 [2020-12-09 05:51:41,017 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 05:51:41,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:51:41,019 INFO L82 PathProgramCache]: Analyzing trace with hash -591263241, now seen corresponding path program 2 times [2020-12-09 05:51:41,019 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 05:51:41,019 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [173764033] [2020-12-09 05:51:41,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f9066140-8ed7-4b24-9e42-e35294023b38/bin/utaipan/mathsat Starting monitored process 33 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with mathsat -unsat_core_generation=3 [2020-12-09 05:51:41,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:51:41,099 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 15 conjunts are in the unsatisfiable core [2020-12-09 05:51:41,100 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 05:51:41,108 INFO L443 ElimStorePlain]: Different costs {0=[|v_#length_48|], 1=[|v_#valid_55|]} [2020-12-09 05:51:41,112 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 05:51:41,113 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 05:51:41,113 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 05:51:41,127 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 05:51:41,131 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 05:51:41,133 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 05:51:41,148 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 05:51:41,150 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 05:51:41,150 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:16 [2020-12-09 05:51:41,388 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 05:51:41,388 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 05:51:42,607 INFO L443 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2020-12-09 05:51:42,611 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 05:51:42,612 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 05:51:42,613 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 05:51:42,613 INFO L515 ElimStorePlain]: Eliminatee |#length| vanished before elimination [2020-12-09 05:51:42,613 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 05:51:42,613 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:45, output treesize:1 [2020-12-09 05:51:42,616 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 05:51:42,617 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [173764033] [2020-12-09 05:51:42,617 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [68036699] [2020-12-09 05:51:42,617 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f9066140-8ed7-4b24-9e42-e35294023b38/bin/utaipan/cvc4 Starting monitored process 34 with cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with cvc4 --incremental --print-success --lang smt [2020-12-09 05:51:42,697 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-12-09 05:51:42,697 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-09 05:51:42,698 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 15 conjunts are in the unsatisfiable core [2020-12-09 05:51:42,699 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 05:51:42,705 INFO L443 ElimStorePlain]: Different costs {0=[|v_#length_50|], 1=[|v_#valid_57|]} [2020-12-09 05:51:42,710 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 05:51:42,710 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 05:51:42,711 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 05:51:42,731 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 05:51:42,737 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 05:51:42,738 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 05:51:42,753 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 05:51:42,754 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 05:51:42,754 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:16 [2020-12-09 05:51:43,101 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 05:51:43,101 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 05:51:44,983 INFO L443 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2020-12-09 05:51:44,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 05:51:44,988 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 05:51:44,988 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 05:51:44,989 INFO L515 ElimStorePlain]: Eliminatee |#length| vanished before elimination [2020-12-09 05:51:44,989 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 05:51:44,989 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:45, output treesize:1 [2020-12-09 05:51:44,992 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 05:51:44,992 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1221100026] [2020-12-09 05:51:44,992 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f9066140-8ed7-4b24-9e42-e35294023b38/bin/utaipan/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 05:51:45,031 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-12-09 05:51:45,031 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-09 05:51:45,033 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 14 conjunts are in the unsatisfiable core [2020-12-09 05:51:45,034 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 05:51:45,039 INFO L443 ElimStorePlain]: Different costs {0=[|v_#length_52|], 1=[|v_#valid_59|]} [2020-12-09 05:51:45,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 05:51:45,044 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 05:51:45,044 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 05:51:45,061 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 05:51:45,066 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 05:51:45,067 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 05:51:45,084 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 05:51:45,085 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 05:51:45,085 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:16 [2020-12-09 05:51:45,242 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 05:51:45,242 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 05:51:45,264 INFO L443 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2020-12-09 05:51:45,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 05:51:45,269 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 05:51:45,269 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 05:51:45,269 INFO L515 ElimStorePlain]: Eliminatee |#length| vanished before elimination [2020-12-09 05:51:45,270 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 05:51:45,270 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:39, output treesize:1 [2020-12-09 05:51:45,273 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 05:51:45,273 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2020-12-09 05:51:45,273 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9, 9, 8, 8] total 33 [2020-12-09 05:51:45,274 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473314450] [2020-12-09 05:51:45,274 INFO L461 AbstractCegarLoop]: Interpolant automaton has 34 states [2020-12-09 05:51:45,274 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 05:51:45,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2020-12-09 05:51:45,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=284, Invalid=838, Unknown=0, NotChecked=0, Total=1122 [2020-12-09 05:51:45,275 INFO L87 Difference]: Start difference. First operand 75 states and 84 transitions. Second operand 34 states. [2020-12-09 05:51:48,116 WARN L197 SmtUtils]: Spent 1.50 s on a formula simplification. DAG size of input: 62 DAG size of output: 61 [2020-12-09 05:51:49,859 WARN L197 SmtUtils]: Spent 1.48 s on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2020-12-09 05:51:53,318 WARN L197 SmtUtils]: Spent 1.11 s on a formula simplification. DAG size of input: 51 DAG size of output: 50 [2020-12-09 05:51:54,358 WARN L197 SmtUtils]: Spent 728.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 43 [2020-12-09 05:51:56,226 WARN L197 SmtUtils]: Spent 1.49 s on a formula simplification. DAG size of input: 58 DAG size of output: 57 [2020-12-09 05:51:58,658 WARN L197 SmtUtils]: Spent 510.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 39 [2020-12-09 05:51:59,416 WARN L197 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 32 [2020-12-09 05:52:01,156 WARN L197 SmtUtils]: Spent 1.37 s on a formula simplification. DAG size of input: 57 DAG size of output: 56 [2020-12-09 05:52:03,161 WARN L197 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 28 [2020-12-09 05:52:03,782 WARN L197 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 17 [2020-12-09 05:52:04,995 WARN L197 SmtUtils]: Spent 785.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 48 [2020-12-09 05:52:07,288 WARN L197 SmtUtils]: Spent 1.07 s on a formula simplification. DAG size of input: 45 DAG size of output: 44 [2020-12-09 05:52:08,913 WARN L197 SmtUtils]: Spent 853.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 44 [2020-12-09 05:52:10,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:52:10,900 INFO L93 Difference]: Finished difference Result 443 states and 478 transitions. [2020-12-09 05:52:10,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2020-12-09 05:52:10,901 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 23 [2020-12-09 05:52:10,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:52:10,903 INFO L225 Difference]: With dead ends: 443 [2020-12-09 05:52:10,903 INFO L226 Difference]: Without dead ends: 443 [2020-12-09 05:52:10,904 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 98 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 855 ImplicationChecksByTransitivity, 19.4s TimeCoverageRelationStatistics Valid=711, Invalid=1941, Unknown=0, NotChecked=0, Total=2652 [2020-12-09 05:52:10,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2020-12-09 05:52:10,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 123. [2020-12-09 05:52:10,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2020-12-09 05:52:10,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 138 transitions. [2020-12-09 05:52:10,907 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 138 transitions. Word has length 23 [2020-12-09 05:52:10,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:52:10,907 INFO L481 AbstractCegarLoop]: Abstraction has 123 states and 138 transitions. [2020-12-09 05:52:10,907 INFO L482 AbstractCegarLoop]: Interpolant automaton has 34 states. [2020-12-09 05:52:10,907 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 138 transitions. [2020-12-09 05:52:10,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-12-09 05:52:10,907 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:52:10,908 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 05:52:11,509 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 z3 -smt2 -in SMTLIB2_COMPLIANT=true,34 cvc4 --incremental --print-success --lang smt,33 mathsat -unsat_core_generation=3 [2020-12-09 05:52:11,509 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 05:52:11,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:52:11,510 INFO L82 PathProgramCache]: Analyzing trace with hash -2096945608, now seen corresponding path program 1 times [2020-12-09 05:52:11,510 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 05:52:11,510 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1640776537] [2020-12-09 05:52:11,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f9066140-8ed7-4b24-9e42-e35294023b38/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 05:52:11,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:52:11,584 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 19 conjunts are in the unsatisfiable core [2020-12-09 05:52:11,585 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 05:52:11,593 INFO L443 ElimStorePlain]: Different costs {0=[|v_#length_54|], 1=[|v_#valid_61|]} [2020-12-09 05:52:11,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-09 05:52:11,597 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 05:52:11,598 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 05:52:11,610 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 05:52:11,615 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 05:52:11,616 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 05:52:11,626 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 05:52:11,627 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 05:52:11,627 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:22 [2020-12-09 05:52:11,653 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 05:52:11,653 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 05:52:11,670 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 05:52:11,670 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 05:52:11,670 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:32 [2020-12-09 05:52:11,709 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 05:52:11,710 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 05:52:11,739 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 05:52:11,741 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 05:52:11,741 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:40 [2020-12-09 05:52:11,875 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 05:52:11,875 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 05:52:11,877 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 05:52:11,878 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 05:52:11,879 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 05:52:11,897 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 05:52:11,898 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 05:52:11,899 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 05:52:11,899 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:47, output treesize:27 [2020-12-09 05:52:11,900 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 05:52:11,943 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 05:52:12,253 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 05:52:12,254 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 05:52:12,990 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 05:52:13,012 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 05:52:13,016 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2020-12-09 05:52:13,020 INFO L625 ElimStorePlain]: treesize reduction 7, result has 30.0 percent of original size [2020-12-09 05:52:13,021 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 05:52:13,034 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 05:52:13,060 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 05:52:13,063 INFO L547 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2020-12-09 05:52:13,068 INFO L625 ElimStorePlain]: treesize reduction 7, result has 30.0 percent of original size [2020-12-09 05:52:13,068 INFO L547 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 05:52:13,094 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 05:52:13,094 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-12-09 05:52:13,095 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:49, output treesize:23 [2020-12-09 05:52:13,224 INFO L443 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2020-12-09 05:52:13,230 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 05:52:13,232 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 05:52:13,240 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 05:52:13,241 INFO L173 IndexEqualityManager]: detected equality via solver [2020-12-09 05:52:13,242 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 05:52:13,248 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 05:52:13,249 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 05:52:13,249 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:24, output treesize:7 [2020-12-09 05:52:13,308 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 05:52:13,309 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1640776537] [2020-12-09 05:52:13,309 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1712610280] [2020-12-09 05:52:13,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f9066140-8ed7-4b24-9e42-e35294023b38/bin/utaipan/cvc4 Starting monitored process 37 with cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with cvc4 --incremental --print-success --lang smt [2020-12-09 05:52:13,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:52:13,402 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 24 conjunts are in the unsatisfiable core [2020-12-09 05:52:13,403 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 05:52:13,410 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 05:52:13,411 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 05:52:13,419 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 05:52:13,420 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 05:52:13,420 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2020-12-09 05:52:13,488 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 05:52:13,488 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 05:52:13,536 INFO L625 ElimStorePlain]: treesize reduction 8, result has 80.5 percent of original size [2020-12-09 05:52:13,537 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 05:52:13,537 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:45, output treesize:33 [2020-12-09 05:52:13,632 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 05:52:13,634 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 05:52:13,662 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 05:52:13,663 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 05:52:13,663 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:40 [2020-12-09 05:52:17,695 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 05:52:17,695 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 31 treesize of output 25 [2020-12-09 05:52:17,696 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 05:52:17,699 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-12-09 05:52:17,724 INFO L625 ElimStorePlain]: treesize reduction 8, result has 74.2 percent of original size [2020-12-09 05:52:17,725 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 05:52:17,726 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:47, output treesize:19 [2020-12-09 05:52:17,900 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 05:52:17,900 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 05:52:18,331 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 05:52:18,343 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 05:52:18,344 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 05:52:18,359 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 05:52:18,361 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 05:52:18,434 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 05:52:18,442 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 05:52:18,467 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 05:52:18,470 INFO L547 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2020-12-09 05:52:18,473 INFO L625 ElimStorePlain]: treesize reduction 7, result has 30.0 percent of original size [2020-12-09 05:52:18,474 INFO L547 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 05:52:18,487 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 05:52:18,517 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 05:52:18,519 INFO L547 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2020-12-09 05:52:18,523 INFO L625 ElimStorePlain]: treesize reduction 7, result has 30.0 percent of original size [2020-12-09 05:52:18,523 INFO L547 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 05:52:18,578 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 05:52:18,579 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 05:52:18,579 INFO L244 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:83, output treesize:41 [2020-12-09 05:52:18,853 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 05:52:18,853 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [417002811] [2020-12-09 05:52:18,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f9066140-8ed7-4b24-9e42-e35294023b38/bin/utaipan/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 05:52:18,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:52:18,898 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 18 conjunts are in the unsatisfiable core [2020-12-09 05:52:18,899 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 05:52:18,906 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 05:52:18,907 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 05:52:18,915 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 05:52:18,915 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-09 05:52:18,915 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2020-12-09 05:52:19,099 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 05:52:19,100 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 05:52:19,138 INFO L625 ElimStorePlain]: treesize reduction 8, result has 78.4 percent of original size [2020-12-09 05:52:19,138 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 05:52:19,138 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:41, output treesize:29 [2020-12-09 05:52:19,279 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 05:52:19,279 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 05:52:19,306 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 05:52:19,308 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 05:52:19,308 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:44, output treesize:40 [2020-12-09 05:52:19,644 INFO L173 IndexEqualityManager]: detected equality via solver [2020-12-09 05:52:19,645 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 05:52:19,646 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 05:52:19,658 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 05:52:19,661 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 05:52:19,661 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:44, output treesize:5 [2020-12-09 05:52:19,812 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 05:52:19,812 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 05:52:19,812 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 4 imperfect interpolant sequences. [2020-12-09 05:52:19,812 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10, 9, 11, 8] total 36 [2020-12-09 05:52:19,812 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012450504] [2020-12-09 05:52:19,812 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-12-09 05:52:19,812 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 05:52:19,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-12-09 05:52:19,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=1116, Unknown=3, NotChecked=0, Total=1260 [2020-12-09 05:52:19,813 INFO L87 Difference]: Start difference. First operand 123 states and 138 transitions. Second operand 10 states. [2020-12-09 05:52:22,570 WARN L197 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 45 [2020-12-09 05:52:23,012 WARN L197 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 48 [2020-12-09 05:52:23,352 WARN L197 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 50 [2020-12-09 05:52:23,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:52:23,489 INFO L93 Difference]: Finished difference Result 135 states and 150 transitions. [2020-12-09 05:52:23,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-12-09 05:52:23,489 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2020-12-09 05:52:23,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:52:23,490 INFO L225 Difference]: With dead ends: 135 [2020-12-09 05:52:23,490 INFO L226 Difference]: Without dead ends: 123 [2020-12-09 05:52:23,490 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 73 SyntacticMatches, 3 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 470 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=237, Invalid=1566, Unknown=3, NotChecked=0, Total=1806 [2020-12-09 05:52:23,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2020-12-09 05:52:23,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2020-12-09 05:52:23,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2020-12-09 05:52:23,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 137 transitions. [2020-12-09 05:52:23,492 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 137 transitions. Word has length 23 [2020-12-09 05:52:23,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:52:23,492 INFO L481 AbstractCegarLoop]: Abstraction has 123 states and 137 transitions. [2020-12-09 05:52:23,492 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-12-09 05:52:23,492 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 137 transitions. [2020-12-09 05:52:23,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-12-09 05:52:23,493 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:52:23,493 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 05:52:24,094 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 z3 -smt2 -in SMTLIB2_COMPLIANT=true,36 mathsat -unsat_core_generation=3,37 cvc4 --incremental --print-success --lang smt [2020-12-09 05:52:24,095 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 05:52:24,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:52:24,096 INFO L82 PathProgramCache]: Analyzing trace with hash 119491195, now seen corresponding path program 1 times [2020-12-09 05:52:24,097 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 05:52:24,098 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1665365225] [2020-12-09 05:52:24,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f9066140-8ed7-4b24-9e42-e35294023b38/bin/utaipan/mathsat Starting monitored process 39 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with mathsat -unsat_core_generation=3 [2020-12-09 05:52:24,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:52:24,160 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 13 conjunts are in the unsatisfiable core [2020-12-09 05:52:24,161 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 05:52:24,297 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 05:52:24,297 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 05:52:24,467 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 05:52:24,489 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 05:52:24,491 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 05:52:24,495 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 05:52:24,496 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 05:52:24,508 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 05:52:24,508 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 05:52:24,509 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:15 [2020-12-09 05:52:24,652 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 05:52:24,652 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1665365225] [2020-12-09 05:52:24,652 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1298304242] [2020-12-09 05:52:24,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f9066140-8ed7-4b24-9e42-e35294023b38/bin/utaipan/cvc4 Starting monitored process 40 with cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with cvc4 --incremental --print-success --lang smt [2020-12-09 05:52:24,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:52:24,740 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 16 conjunts are in the unsatisfiable core [2020-12-09 05:52:24,741 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 05:52:24,929 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 05:52:24,929 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 05:52:24,938 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 05:52:24,954 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 05:52:24,955 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 05:52:24,958 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 05:52:24,959 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 05:52:24,969 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 05:52:24,970 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2020-12-09 05:52:24,970 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:15 [2020-12-09 05:52:25,310 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 05:52:25,310 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1719006178] [2020-12-09 05:52:25,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f9066140-8ed7-4b24-9e42-e35294023b38/bin/utaipan/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 05:52:25,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:52:25,359 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 14 conjunts are in the unsatisfiable core [2020-12-09 05:52:25,360 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 05:52:25,540 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 05:52:25,540 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 05:52:25,547 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 05:52:25,563 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 05:52:25,564 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 05:52:25,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 16 treesize of output 12 [2020-12-09 05:52:25,568 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-09 05:52:25,579 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 05:52:25,579 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 05:52:25,580 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:15 [2020-12-09 05:52:25,587 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-12-09 05:52:25,786 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 05:52:25,787 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2020-12-09 05:52:25,787 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 9, 8, 8, 8] total 22 [2020-12-09 05:52:25,787 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019434322] [2020-12-09 05:52:25,787 INFO L461 AbstractCegarLoop]: Interpolant automaton has 23 states [2020-12-09 05:52:25,787 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 05:52:25,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2020-12-09 05:52:25,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=398, Unknown=0, NotChecked=0, Total=506 [2020-12-09 05:52:25,788 INFO L87 Difference]: Start difference. First operand 123 states and 137 transitions. Second operand 23 states. [2020-12-09 05:52:26,188 WARN L197 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 28 [2020-12-09 05:52:26,946 WARN L197 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 35 [2020-12-09 05:52:27,460 WARN L197 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 35 [2020-12-09 05:52:28,147 WARN L197 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 34 [2020-12-09 05:52:28,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:52:28,202 INFO L93 Difference]: Finished difference Result 177 states and 195 transitions. [2020-12-09 05:52:28,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-12-09 05:52:28,203 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 27 [2020-12-09 05:52:28,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:52:28,204 INFO L225 Difference]: With dead ends: 177 [2020-12-09 05:52:28,204 INFO L226 Difference]: Without dead ends: 177 [2020-12-09 05:52:28,205 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 131 SyntacticMatches, 4 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=303, Invalid=819, Unknown=0, NotChecked=0, Total=1122 [2020-12-09 05:52:28,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2020-12-09 05:52:28,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 122. [2020-12-09 05:52:28,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2020-12-09 05:52:28,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 136 transitions. [2020-12-09 05:52:28,207 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 136 transitions. Word has length 27 [2020-12-09 05:52:28,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:52:28,207 INFO L481 AbstractCegarLoop]: Abstraction has 122 states and 136 transitions. [2020-12-09 05:52:28,207 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2020-12-09 05:52:28,207 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 136 transitions. [2020-12-09 05:52:28,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-12-09 05:52:28,207 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:52:28,207 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1] [2020-12-09 05:52:28,809 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 mathsat -unsat_core_generation=3,40 cvc4 --incremental --print-success --lang smt,41 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 05:52:28,810 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 05:52:28,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:52:28,811 INFO L82 PathProgramCache]: Analyzing trace with hash 2033318401, now seen corresponding path program 1 times [2020-12-09 05:52:28,812 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 05:52:28,812 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2037629211] [2020-12-09 05:52:28,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f9066140-8ed7-4b24-9e42-e35294023b38/bin/utaipan/mathsat Starting monitored process 42 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with mathsat -unsat_core_generation=3 [2020-12-09 05:52:28,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:52:28,911 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 14 conjunts are in the unsatisfiable core [2020-12-09 05:52:28,912 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 05:52:28,933 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 05:52:28,933 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 05:52:28,934 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 05:52:28,962 INFO L625 ElimStorePlain]: treesize reduction 10, result has 68.8 percent of original size [2020-12-09 05:52:28,963 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 05:52:28,963 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:17, output treesize:13 [2020-12-09 05:52:29,068 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 05:52:29,069 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 05:52:29,415 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 05:52:29,415 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2037629211] [2020-12-09 05:52:29,415 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [909842081] [2020-12-09 05:52:29,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f9066140-8ed7-4b24-9e42-e35294023b38/bin/utaipan/cvc4 Starting monitored process 43 with cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with cvc4 --incremental --print-success --lang smt [2020-12-09 05:52:29,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:52:29,509 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 15 conjunts are in the unsatisfiable core [2020-12-09 05:52:29,510 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 05:52:29,536 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 05:52:29,536 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 05:52:29,536 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 05:52:29,565 INFO L625 ElimStorePlain]: treesize reduction 10, result has 64.3 percent of original size [2020-12-09 05:52:29,566 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 05:52:29,566 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2020-12-09 05:52:29,917 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 05:52:29,917 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 05:52:30,521 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 05:52:30,521 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [423874722] [2020-12-09 05:52:30,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f9066140-8ed7-4b24-9e42-e35294023b38/bin/utaipan/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 05:52:30,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:52:30,570 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 15 conjunts are in the unsatisfiable core [2020-12-09 05:52:30,571 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 05:52:30,592 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 05:52:30,592 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 05:52:30,592 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 05:52:30,616 INFO L625 ElimStorePlain]: treesize reduction 10, result has 64.3 percent of original size [2020-12-09 05:52:30,617 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 05:52:30,617 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2020-12-09 05:52:30,635 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 05:52:30,635 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 05:52:30,660 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 05:52:30,661 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2020-12-09 05:52:30,661 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 8, 8, 8, 8] total 23 [2020-12-09 05:52:30,661 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390742974] [2020-12-09 05:52:30,661 INFO L461 AbstractCegarLoop]: Interpolant automaton has 24 states [2020-12-09 05:52:30,661 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 05:52:30,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2020-12-09 05:52:30,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=439, Unknown=0, NotChecked=0, Total=552 [2020-12-09 05:52:30,662 INFO L87 Difference]: Start difference. First operand 122 states and 136 transitions. Second operand 24 states. [2020-12-09 05:52:31,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 05:52:31,926 INFO L93 Difference]: Finished difference Result 180 states and 196 transitions. [2020-12-09 05:52:31,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-12-09 05:52:31,926 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 31 [2020-12-09 05:52:31,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 05:52:31,927 INFO L225 Difference]: With dead ends: 180 [2020-12-09 05:52:31,927 INFO L226 Difference]: Without dead ends: 166 [2020-12-09 05:52:31,928 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 157 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=311, Invalid=879, Unknown=0, NotChecked=0, Total=1190 [2020-12-09 05:52:31,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2020-12-09 05:52:31,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 126. [2020-12-09 05:52:31,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2020-12-09 05:52:31,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 139 transitions. [2020-12-09 05:52:31,930 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 139 transitions. Word has length 31 [2020-12-09 05:52:31,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 05:52:31,930 INFO L481 AbstractCegarLoop]: Abstraction has 126 states and 139 transitions. [2020-12-09 05:52:31,930 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2020-12-09 05:52:31,930 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 139 transitions. [2020-12-09 05:52:31,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-12-09 05:52:31,930 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 05:52:31,930 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-12-09 05:52:32,531 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 mathsat -unsat_core_generation=3,43 cvc4 --incremental --print-success --lang smt,44 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 05:52:32,532 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 05:52:32,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 05:52:32,532 INFO L82 PathProgramCache]: Analyzing trace with hash -1630243463, now seen corresponding path program 2 times [2020-12-09 05:52:32,533 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 05:52:32,533 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1041956262] [2020-12-09 05:52:32,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f9066140-8ed7-4b24-9e42-e35294023b38/bin/utaipan/mathsat Starting monitored process 45 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with mathsat -unsat_core_generation=3 [2020-12-09 05:52:32,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 05:52:32,756 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 33 conjunts are in the unsatisfiable core [2020-12-09 05:52:32,757 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 05:52:32,786 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 05:52:32,786 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 05:52:32,787 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 05:52:32,825 INFO L625 ElimStorePlain]: treesize reduction 10, result has 76.2 percent of original size [2020-12-09 05:52:32,826 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 05:52:32,826 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:23 [2020-12-09 05:52:32,995 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 05:52:32,995 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-09 05:52:33,010 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 05:52:33,010 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-09 05:52:33,010 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:34 [2020-12-09 05:52:33,476 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 05:52:33,477 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 05:52:33,498 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-09 05:52:33,503 INFO L173 IndexEqualityManager]: detected equality via solver [2020-12-09 05:52:33,518 INFO L348 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2020-12-09 05:52:33,518 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 37 treesize of output 30 [2020-12-09 05:52:33,519 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 05:52:33,520 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 05:52:33,521 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-09 05:52:33,559 INFO L625 ElimStorePlain]: treesize reduction 5, result has 86.8 percent of original size [2020-12-09 05:52:33,562 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-09 05:52:33,562 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:58, output treesize:16 [2020-12-09 05:52:33,607 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 05:52:33,643 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 05:52:33,643 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 05:52:34,340 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1041956262] [2020-12-09 05:52:34,341 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: incompatible size [2020-12-09 05:52:34,341 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [100205334] [2020-12-09 05:52:34,341 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f9066140-8ed7-4b24-9e42-e35294023b38/bin/utaipan/cvc4 Starting monitored process 46 with cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with cvc4 --incremental --print-success --lang smt [2020-12-09 05:52:34,467 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-12-09 05:52:34,467 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-09 05:52:34,469 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 23 conjunts are in the unsatisfiable core [2020-12-09 05:52:34,470 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 05:52:34,474 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@627e43f9 [2020-12-09 05:52:34,474 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [491412390] [2020-12-09 05:52:34,474 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f9066140-8ed7-4b24-9e42-e35294023b38/bin/utaipan/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 05:52:34,534 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-12-09 05:52:34,534 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-09 05:52:34,537 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 27 conjunts are in the unsatisfiable core [2020-12-09 05:52:34,538 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 05:52:34,540 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@627e43f9 [2020-12-09 05:52:34,541 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 0 imperfect interpolant sequences. [2020-12-09 05:52:34,541 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [] total 0 [2020-12-09 05:52:34,541 ERROR L205 FreeRefinementEngine]: Strategy WALRUS failed to provide any proof altough trace is infeasible [2020-12-09 05:52:34,541 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-12-09 05:52:35,145 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 47 z3 -smt2 -in SMTLIB2_COMPLIANT=true,45 mathsat -unsat_core_generation=3,46 cvc4 --incremental --print-success --lang smt [2020-12-09 05:52:35,160 WARN L254 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2020-12-09 05:52:35,160 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 05:52:35 BoogieIcfgContainer [2020-12-09 05:52:35,160 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-09 05:52:35,161 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-09 05:52:35,161 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-09 05:52:35,161 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-09 05:52:35,161 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 05:51:00" (3/4) ... [2020-12-09 05:52:35,164 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-12-09 05:52:35,164 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-09 05:52:35,164 INFO L168 Benchmark]: Toolchain (without parser) took 94968.99 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.2 MB in the beginning and 41.8 MB in the end (delta: -6.7 MB). Peak memory consumption was 23.3 MB. Max. memory is 16.1 GB. [2020-12-09 05:52:35,165 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 56.6 MB. Free memory is still 39.6 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-12-09 05:52:35,165 INFO L168 Benchmark]: CACSL2BoogieTranslator took 353.02 ms. Allocated memory is still 56.6 MB. Free memory was 35.0 MB in the beginning and 29.8 MB in the end (delta: 5.2 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. [2020-12-09 05:52:35,165 INFO L168 Benchmark]: Boogie Procedure Inliner took 32.62 ms. Allocated memory is still 56.6 MB. Free memory was 29.8 MB in the beginning and 27.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-09 05:52:35,165 INFO L168 Benchmark]: Boogie Preprocessor took 23.17 ms. Allocated memory is still 56.6 MB. Free memory was 27.7 MB in the beginning and 26.3 MB in the end (delta: 1.4 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-09 05:52:35,166 INFO L168 Benchmark]: RCFGBuilder took 390.16 ms. Allocated memory was 56.6 MB in the beginning and 71.3 MB in the end (delta: 14.7 MB). Free memory was 26.2 MB in the beginning and 53.2 MB in the end (delta: -26.9 MB). Peak memory consumption was 12.1 MB. Max. memory is 16.1 GB. [2020-12-09 05:52:35,166 INFO L168 Benchmark]: TraceAbstraction took 94162.50 ms. Allocated memory was 71.3 MB in the beginning and 86.0 MB in the end (delta: 14.7 MB). Free memory was 52.8 MB in the beginning and 41.8 MB in the end (delta: 10.9 MB). Peak memory consumption was 26.0 MB. Max. memory is 16.1 GB. [2020-12-09 05:52:35,166 INFO L168 Benchmark]: Witness Printer took 2.94 ms. Allocated memory is still 86.0 MB. Free memory is still 41.8 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-12-09 05:52:35,167 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.12 ms. Allocated memory is still 56.6 MB. Free memory is still 39.6 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 353.02 ms. Allocated memory is still 56.6 MB. Free memory was 35.0 MB in the beginning and 29.8 MB in the end (delta: 5.2 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 32.62 ms. Allocated memory is still 56.6 MB. Free memory was 29.8 MB in the beginning and 27.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 23.17 ms. Allocated memory is still 56.6 MB. Free memory was 27.7 MB in the beginning and 26.3 MB in the end (delta: 1.4 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 390.16 ms. Allocated memory was 56.6 MB in the beginning and 71.3 MB in the end (delta: 14.7 MB). Free memory was 26.2 MB in the beginning and 53.2 MB in the end (delta: -26.9 MB). Peak memory consumption was 12.1 MB. Max. memory is 16.1 GB. * TraceAbstraction took 94162.50 ms. Allocated memory was 71.3 MB in the beginning and 86.0 MB in the end (delta: 14.7 MB). Free memory was 52.8 MB in the beginning and 41.8 MB in the end (delta: 10.9 MB). Peak memory consumption was 26.0 MB. Max. memory is 16.1 GB. * Witness Printer took 2.94 ms. Allocated memory is still 86.0 MB. Free memory is still 41.8 MB. There was no memory consumed. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 517]: 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: [L526] int length1 = __VERIFIER_nondet_int(); [L527] int length2 = __VERIFIER_nondet_int(); [L528] COND FALSE !(length1 < 1) [L531] COND FALSE !(length2 < 1) [L534] char* nondetString1 = (char*) __builtin_alloca (length1 * sizeof(char)); [L535] char* nondetString2 = (char*) __builtin_alloca (length2 * sizeof(char)); [L537] int i = 0; [L537] COND TRUE i < length1 - 1 [L539] nondetString1[i] = __VERIFIER_nondet_char() [L537] i++ [L537] COND FALSE !(i < length1 - 1) [L542] int i = 0; [L542] COND TRUE i < length2 - 1 [L544] nondetString2[i] = __VERIFIER_nondet_char() [L542] i++ [L542] COND FALSE !(i < length2 - 1) [L547] nondetString1[length1-1] = '\0' [L548] nondetString2[length2-1] = '\0' [L516] unsigned char uc1, uc2; [L517] EXPR \read(*s1) [L517] *s1 != '\0' && *s1 == *s2 [L517] EXPR \read(*s1) [L517] EXPR \read(*s2) [L517] *s1 != '\0' && *s1 == *s2 [L517] COND TRUE *s1 != '\0' && *s1 == *s2 [L518] s1++ [L519] s2++ [L517] EXPR \read(*s1) [L517] *s1 != '\0' && *s1 == *s2 [L517] EXPR \read(*s1) [L517] EXPR \read(*s2) [L517] *s1 != '\0' && *s1 == *s2 [L517] COND TRUE *s1 != '\0' && *s1 == *s2 [L518] s1++ [L519] s2++ [L517] \read(*s1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 53 locations, 19 error locations. Started 1 CEGAR loops. VerificationResult: UNKNOWN, OverallTime: 94.1s, OverallIterations: 30, TraceHistogramMax: 5, AutomataDifference: 55.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1067 SDtfs, 6988 SDslu, 3652 SDs, 0 SdLazy, 3747 SolverSat, 340 SolverUnsat, 7 SolverUnknown, 0 SolverNotchecked, 29.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1185 GetRequests, 819 SyntacticMatches, 24 SemanticMatches, 342 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2370 ImplicationChecksByTransitivity, 43.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=126occurred in iteration=29, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 29 MinimizatonAttempts, 1257 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 23.6s InterpolantComputationTime, 728 NumberOfCodeBlocks, 728 NumberOfCodeBlocksAsserted, 45 NumberOfCheckSat, 1077 ConstructedInterpolants, 64 QuantifiedInterpolants, 339635 SizeOfPredicates, 354 NumberOfNonLiveVariables, 2393 ConjunctsInSsa, 474 ConjunctsInUnsatCore, 63 InterpolantComputations, 23 PerfectInterpolantSequences, 25/327 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...