./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/array-memsafety/openbsd_cstrspn-alloca-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_74222b51-48c1-43df-99b5-fad990262cd5/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_74222b51-48c1-43df-99b5-fad990262cd5/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_74222b51-48c1-43df-99b5-fad990262cd5/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_74222b51-48c1-43df-99b5-fad990262cd5/bin/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/array-memsafety/openbsd_cstrspn-alloca-2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_74222b51-48c1-43df-99b5-fad990262cd5/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_74222b51-48c1-43df-99b5-fad990262cd5/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 46421108dc6473f7bf7bcbb7826a3247c1ccc8d1 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_74222b51-48c1-43df-99b5-fad990262cd5/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_74222b51-48c1-43df-99b5-fad990262cd5/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_74222b51-48c1-43df-99b5-fad990262cd5/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_74222b51-48c1-43df-99b5-fad990262cd5/bin/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/array-memsafety/openbsd_cstrspn-alloca-2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_74222b51-48c1-43df-99b5-fad990262cd5/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_74222b51-48c1-43df-99b5-fad990262cd5/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 46421108dc6473f7bf7bcbb7826a3247c1ccc8d1 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 12:25:19,509 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 12:25:19,510 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 12:25:19,519 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 12:25:19,519 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 12:25:19,520 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 12:25:19,521 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 12:25:19,522 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 12:25:19,523 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 12:25:19,524 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 12:25:19,524 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 12:25:19,525 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 12:25:19,525 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 12:25:19,526 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 12:25:19,527 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 12:25:19,527 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 12:25:19,528 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 12:25:19,529 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 12:25:19,530 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 12:25:19,532 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 12:25:19,533 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 12:25:19,533 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 12:25:19,534 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 12:25:19,534 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 12:25:19,536 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 12:25:19,536 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 12:25:19,536 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 12:25:19,537 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 12:25:19,537 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 12:25:19,538 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 12:25:19,538 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 12:25:19,538 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 12:25:19,539 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 12:25:19,539 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 12:25:19,540 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 12:25:19,540 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 12:25:19,540 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 12:25:19,540 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 12:25:19,541 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 12:25:19,541 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 12:25:19,541 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 12:25:19,542 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_74222b51-48c1-43df-99b5-fad990262cd5/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2019-12-07 12:25:19,552 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 12:25:19,552 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 12:25:19,552 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 12:25:19,552 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 12:25:19,553 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 12:25:19,553 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 12:25:19,553 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 12:25:19,553 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 12:25:19,553 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 12:25:19,553 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 12:25:19,553 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 12:25:19,553 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 12:25:19,553 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 12:25:19,554 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 12:25:19,554 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 12:25:19,554 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 12:25:19,554 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 12:25:19,554 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 12:25:19,554 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 12:25:19,554 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 12:25:19,555 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 12:25:19,555 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 12:25:19,555 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 12:25:19,555 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-12-07 12:25:19,555 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-12-07 12:25:19,555 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-12-07 12:25:19,555 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 12:25:19,555 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 12:25:19,555 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 12:25:19,556 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 12:25:19,556 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 12:25:19,556 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 12:25:19,556 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 12:25:19,556 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 12:25:19,556 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 12:25:19,556 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 12:25:19,556 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 12:25:19,557 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 12:25:19,557 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 12:25:19,557 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 12:25:19,557 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_74222b51-48c1-43df-99b5-fad990262cd5/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 -> 46421108dc6473f7bf7bcbb7826a3247c1ccc8d1 [2019-12-07 12:25:19,656 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 12:25:19,664 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 12:25:19,666 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 12:25:19,667 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 12:25:19,668 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 12:25:19,668 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_74222b51-48c1-43df-99b5-fad990262cd5/bin/utaipan/../../sv-benchmarks/c/array-memsafety/openbsd_cstrspn-alloca-2.i [2019-12-07 12:25:19,705 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_74222b51-48c1-43df-99b5-fad990262cd5/bin/utaipan/data/fdef1fa97/d076b6d4a5d549268ed9f7c6f7409146/FLAG87511bd9d [2019-12-07 12:25:20,162 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 12:25:20,162 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_74222b51-48c1-43df-99b5-fad990262cd5/sv-benchmarks/c/array-memsafety/openbsd_cstrspn-alloca-2.i [2019-12-07 12:25:20,171 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_74222b51-48c1-43df-99b5-fad990262cd5/bin/utaipan/data/fdef1fa97/d076b6d4a5d549268ed9f7c6f7409146/FLAG87511bd9d [2019-12-07 12:25:20,180 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_74222b51-48c1-43df-99b5-fad990262cd5/bin/utaipan/data/fdef1fa97/d076b6d4a5d549268ed9f7c6f7409146 [2019-12-07 12:25:20,182 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 12:25:20,183 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 12:25:20,183 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 12:25:20,183 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 12:25:20,186 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 12:25:20,186 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 12:25:20" (1/1) ... [2019-12-07 12:25:20,188 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4bc9f4d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:25:20, skipping insertion in model container [2019-12-07 12:25:20,188 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 12:25:20" (1/1) ... [2019-12-07 12:25:20,192 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 12:25:20,217 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 12:25:20,417 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 12:25:20,423 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 12:25:20,452 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 12:25:20,483 INFO L208 MainTranslator]: Completed translation [2019-12-07 12:25:20,483 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:25:20 WrapperNode [2019-12-07 12:25:20,483 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 12:25:20,484 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 12:25:20,484 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 12:25:20,484 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 12:25:20,489 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:25:20" (1/1) ... [2019-12-07 12:25:20,498 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:25:20" (1/1) ... [2019-12-07 12:25:20,513 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 12:25:20,514 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 12:25:20,514 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 12:25:20,514 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 12:25:20,520 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:25:20" (1/1) ... [2019-12-07 12:25:20,520 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:25:20" (1/1) ... [2019-12-07 12:25:20,522 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:25:20" (1/1) ... [2019-12-07 12:25:20,522 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:25:20" (1/1) ... [2019-12-07 12:25:20,527 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:25:20" (1/1) ... [2019-12-07 12:25:20,530 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:25:20" (1/1) ... [2019-12-07 12:25:20,531 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:25:20" (1/1) ... [2019-12-07 12:25:20,533 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 12:25:20,533 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 12:25:20,534 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 12:25:20,534 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 12:25:20,534 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:25:20" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_74222b51-48c1-43df-99b5-fad990262cd5/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 12:25:20,573 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-07 12:25:20,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 12:25:20,574 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 12:25:20,574 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 12:25:20,574 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 12:25:20,574 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 12:25:20,841 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 12:25:20,841 INFO L287 CfgBuilder]: Removed 9 assume(true) statements. [2019-12-07 12:25:20,842 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:25:20 BoogieIcfgContainer [2019-12-07 12:25:20,842 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 12:25:20,843 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 12:25:20,843 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 12:25:20,845 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 12:25:20,845 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 12:25:20" (1/3) ... [2019-12-07 12:25:20,845 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4485ee19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 12:25:20, skipping insertion in model container [2019-12-07 12:25:20,846 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:25:20" (2/3) ... [2019-12-07 12:25:20,846 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4485ee19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 12:25:20, skipping insertion in model container [2019-12-07 12:25:20,846 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:25:20" (3/3) ... [2019-12-07 12:25:20,847 INFO L109 eAbstractionObserver]: Analyzing ICFG openbsd_cstrspn-alloca-2.i [2019-12-07 12:25:20,853 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 12:25:20,858 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 13 error locations. [2019-12-07 12:25:20,865 INFO L249 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2019-12-07 12:25:20,878 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 12:25:20,878 INFO L374 AbstractCegarLoop]: Hoare is false [2019-12-07 12:25:20,878 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 12:25:20,878 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 12:25:20,878 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 12:25:20,878 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 12:25:20,878 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 12:25:20,878 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 12:25:20,888 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2019-12-07 12:25:20,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-07 12:25:20,892 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:25:20,893 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-07 12:25:20,893 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 12:25:20,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:25:20,897 INFO L82 PathProgramCache]: Analyzing trace with hash 135278, now seen corresponding path program 1 times [2019-12-07 12:25:20,903 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:25:20,903 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608545911] [2019-12-07 12:25:20,903 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:25:20,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:25:21,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:25:21,015 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608545911] [2019-12-07 12:25:21,015 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:25:21,015 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 12:25:21,016 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245131141] [2019-12-07 12:25:21,019 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:25:21,019 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:25:21,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:25:21,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:25:21,030 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 3 states. [2019-12-07 12:25:21,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:25:21,061 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2019-12-07 12:25:21,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:25:21,063 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-07 12:25:21,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:25:21,068 INFO L225 Difference]: With dead ends: 27 [2019-12-07 12:25:21,069 INFO L226 Difference]: Without dead ends: 26 [2019-12-07 12:25:21,070 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:25:21,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-12-07 12:25:21,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-12-07 12:25:21,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-12-07 12:25:21,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2019-12-07 12:25:21,090 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 3 [2019-12-07 12:25:21,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:25:21,091 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2019-12-07 12:25:21,091 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:25:21,091 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2019-12-07 12:25:21,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-07 12:25:21,091 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:25:21,091 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-07 12:25:21,091 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 12:25:21,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:25:21,092 INFO L82 PathProgramCache]: Analyzing trace with hash 135279, now seen corresponding path program 1 times [2019-12-07 12:25:21,092 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:25:21,092 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416677142] [2019-12-07 12:25:21,092 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:25:21,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:25:21,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:25:21,135 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416677142] [2019-12-07 12:25:21,135 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:25:21,136 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:25:21,136 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983258143] [2019-12-07 12:25:21,137 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:25:21,137 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:25:21,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:25:21,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:25:21,137 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand 4 states. [2019-12-07 12:25:21,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:25:21,196 INFO L93 Difference]: Finished difference Result 50 states and 56 transitions. [2019-12-07 12:25:21,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:25:21,197 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-12-07 12:25:21,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:25:21,197 INFO L225 Difference]: With dead ends: 50 [2019-12-07 12:25:21,197 INFO L226 Difference]: Without dead ends: 50 [2019-12-07 12:25:21,198 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:25:21,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-12-07 12:25:21,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 28. [2019-12-07 12:25:21,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-12-07 12:25:21,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2019-12-07 12:25:21,201 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 3 [2019-12-07 12:25:21,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:25:21,202 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2019-12-07 12:25:21,202 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:25:21,202 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2019-12-07 12:25:21,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-12-07 12:25:21,202 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:25:21,202 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-12-07 12:25:21,202 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 12:25:21,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:25:21,203 INFO L82 PathProgramCache]: Analyzing trace with hash 4273920, now seen corresponding path program 1 times [2019-12-07 12:25:21,203 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:25:21,203 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354161906] [2019-12-07 12:25:21,203 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:25:21,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:25:21,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:25:21,223 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354161906] [2019-12-07 12:25:21,223 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:25:21,223 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 12:25:21,223 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061362786] [2019-12-07 12:25:21,223 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:25:21,223 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:25:21,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:25:21,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:25:21,224 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 3 states. [2019-12-07 12:25:21,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:25:21,240 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2019-12-07 12:25:21,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:25:21,240 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-12-07 12:25:21,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:25:21,241 INFO L225 Difference]: With dead ends: 26 [2019-12-07 12:25:21,241 INFO L226 Difference]: Without dead ends: 26 [2019-12-07 12:25:21,241 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:25:21,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-12-07 12:25:21,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-12-07 12:25:21,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-12-07 12:25:21,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2019-12-07 12:25:21,243 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 4 [2019-12-07 12:25:21,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:25:21,244 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2019-12-07 12:25:21,244 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:25:21,244 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2019-12-07 12:25:21,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-12-07 12:25:21,244 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:25:21,244 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-12-07 12:25:21,244 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 12:25:21,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:25:21,244 INFO L82 PathProgramCache]: Analyzing trace with hash 4273921, now seen corresponding path program 1 times [2019-12-07 12:25:21,245 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:25:21,245 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457426748] [2019-12-07 12:25:21,245 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:25:21,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:25:21,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:25:21,284 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457426748] [2019-12-07 12:25:21,284 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:25:21,284 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:25:21,284 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556117527] [2019-12-07 12:25:21,284 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 12:25:21,284 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:25:21,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 12:25:21,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:25:21,285 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand 5 states. [2019-12-07 12:25:21,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:25:21,333 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2019-12-07 12:25:21,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 12:25:21,333 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2019-12-07 12:25:21,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:25:21,334 INFO L225 Difference]: With dead ends: 45 [2019-12-07 12:25:21,334 INFO L226 Difference]: Without dead ends: 45 [2019-12-07 12:25:21,334 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 12:25:21,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-12-07 12:25:21,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 28. [2019-12-07 12:25:21,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-12-07 12:25:21,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2019-12-07 12:25:21,337 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 4 [2019-12-07 12:25:21,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:25:21,337 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2019-12-07 12:25:21,337 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 12:25:21,337 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2019-12-07 12:25:21,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-12-07 12:25:21,337 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:25:21,337 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-12-07 12:25:21,337 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 12:25:21,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:25:21,338 INFO L82 PathProgramCache]: Analyzing trace with hash 4276069, now seen corresponding path program 1 times [2019-12-07 12:25:21,338 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:25:21,338 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683066801] [2019-12-07 12:25:21,338 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:25:21,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:25:21,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:25:21,371 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683066801] [2019-12-07 12:25:21,371 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:25:21,372 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 12:25:21,372 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088855959] [2019-12-07 12:25:21,372 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:25:21,372 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:25:21,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:25:21,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:25:21,372 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. Second operand 3 states. [2019-12-07 12:25:21,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:25:21,387 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2019-12-07 12:25:21,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:25:21,388 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-12-07 12:25:21,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:25:21,388 INFO L225 Difference]: With dead ends: 27 [2019-12-07 12:25:21,388 INFO L226 Difference]: Without dead ends: 27 [2019-12-07 12:25:21,388 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:25:21,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-12-07 12:25:21,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-12-07 12:25:21,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-12-07 12:25:21,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2019-12-07 12:25:21,391 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 32 transitions. Word has length 4 [2019-12-07 12:25:21,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:25:21,391 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 32 transitions. [2019-12-07 12:25:21,391 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:25:21,391 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2019-12-07 12:25:21,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-07 12:25:21,391 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:25:21,391 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-12-07 12:25:21,391 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 12:25:21,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:25:21,391 INFO L82 PathProgramCache]: Analyzing trace with hash 130076894, now seen corresponding path program 1 times [2019-12-07 12:25:21,392 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:25:21,392 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510435006] [2019-12-07 12:25:21,392 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:25:21,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:25:21,441 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:25:21,442 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510435006] [2019-12-07 12:25:21,442 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1700508054] [2019-12-07 12:25:21,442 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_74222b51-48c1-43df-99b5-fad990262cd5/bin/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:25:21,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:25:21,478 INFO L264 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-07 12:25:21,482 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:25:21,511 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_40|], 2=[|v_#valid_60|]} [2019-12-07 12:25:21,518 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:25:21,524 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-12-07 12:25:21,525 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:25:21,533 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:25:21,539 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2019-12-07 12:25:21,540 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-12-07 12:25:21,557 INFO L614 ElimStorePlain]: treesize reduction 14, result has 60.0 percent of original size [2019-12-07 12:25:21,558 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:25:21,558 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:27, output treesize:12 [2019-12-07 12:25:21,579 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:25:21,579 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:25:21,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:25:21,622 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:25:21,622 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1842387476] [2019-12-07 12:25:21,637 INFO L159 IcfgInterpreter]: Started Sifa with 4 locations of interest [2019-12-07 12:25:21,638 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 12:25:21,642 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 12:25:21,646 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 12:25:21,646 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 12:25:21,992 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 12:25:22,010 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 12:25:22,157 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 12:25:22,412 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 12:25:22,412 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 12:25:22,412 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2019-12-07 12:25:22,413 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979973661] [2019-12-07 12:25:22,413 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 12:25:22,413 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:25:22,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 12:25:22,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-07 12:25:22,414 INFO L87 Difference]: Start difference. First operand 27 states and 32 transitions. Second operand 9 states. [2019-12-07 12:25:22,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:25:22,539 INFO L93 Difference]: Finished difference Result 69 states and 81 transitions. [2019-12-07 12:25:22,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 12:25:22,540 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 5 [2019-12-07 12:25:22,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:25:22,541 INFO L225 Difference]: With dead ends: 69 [2019-12-07 12:25:22,541 INFO L226 Difference]: Without dead ends: 69 [2019-12-07 12:25:22,541 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2019-12-07 12:25:22,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-12-07 12:25:22,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 24. [2019-12-07 12:25:22,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-12-07 12:25:22,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2019-12-07 12:25:22,545 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 5 [2019-12-07 12:25:22,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:25:22,545 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2019-12-07 12:25:22,545 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 12:25:22,545 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2019-12-07 12:25:22,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-07 12:25:22,546 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:25:22,546 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-07 12:25:22,746 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:25:22,747 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 12:25:22,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:25:22,748 INFO L82 PathProgramCache]: Analyzing trace with hash 132558133, now seen corresponding path program 1 times [2019-12-07 12:25:22,748 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:25:22,748 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783125363] [2019-12-07 12:25:22,748 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:25:22,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:25:22,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:25:22,809 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783125363] [2019-12-07 12:25:22,810 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:25:22,810 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 12:25:22,810 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606813522] [2019-12-07 12:25:22,811 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:25:22,811 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:25:22,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:25:22,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:25:22,812 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand 3 states. [2019-12-07 12:25:22,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:25:22,841 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2019-12-07 12:25:22,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:25:22,841 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-07 12:25:22,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:25:22,842 INFO L225 Difference]: With dead ends: 23 [2019-12-07 12:25:22,842 INFO L226 Difference]: Without dead ends: 23 [2019-12-07 12:25:22,843 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:25:22,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-12-07 12:25:22,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-12-07 12:25:22,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-12-07 12:25:22,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2019-12-07 12:25:22,847 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 5 [2019-12-07 12:25:22,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:25:22,847 INFO L462 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2019-12-07 12:25:22,847 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:25:22,847 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2019-12-07 12:25:22,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-12-07 12:25:22,848 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:25:22,848 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-12-07 12:25:22,848 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 12:25:22,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:25:22,848 INFO L82 PathProgramCache]: Analyzing trace with hash -187674084, now seen corresponding path program 1 times [2019-12-07 12:25:22,849 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:25:22,849 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467930613] [2019-12-07 12:25:22,849 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:25:22,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:25:22,912 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:25:22,913 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467930613] [2019-12-07 12:25:22,913 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [644413151] [2019-12-07 12:25:22,913 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_74222b51-48c1-43df-99b5-fad990262cd5/bin/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:25:22,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:25:22,964 INFO L264 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 11 conjunts are in the unsatisfiable core [2019-12-07 12:25:22,965 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:25:23,046 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:25:23,047 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:25:23,091 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:25:23,091 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1858146638] [2019-12-07 12:25:23,092 INFO L159 IcfgInterpreter]: Started Sifa with 5 locations of interest [2019-12-07 12:25:23,092 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 12:25:23,092 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 12:25:23,093 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 12:25:23,093 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 12:25:23,309 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 12:25:23,325 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 12:25:23,407 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 12:25:23,658 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 55 [2019-12-07 12:25:23,810 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 12:25:23,810 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 12:25:23,810 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 8 [2019-12-07 12:25:23,811 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21678603] [2019-12-07 12:25:23,811 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 12:25:23,811 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:25:23,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 12:25:23,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2019-12-07 12:25:23,812 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand 10 states. [2019-12-07 12:25:23,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:25:23,902 INFO L93 Difference]: Finished difference Result 53 states and 60 transitions. [2019-12-07 12:25:23,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 12:25:23,902 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-12-07 12:25:23,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:25:23,902 INFO L225 Difference]: With dead ends: 53 [2019-12-07 12:25:23,903 INFO L226 Difference]: Without dead ends: 53 [2019-12-07 12:25:23,903 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2019-12-07 12:25:23,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-12-07 12:25:23,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 20. [2019-12-07 12:25:23,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-12-07 12:25:23,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2019-12-07 12:25:23,905 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 6 [2019-12-07 12:25:23,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:25:23,905 INFO L462 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2019-12-07 12:25:23,905 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 12:25:23,905 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2019-12-07 12:25:23,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-07 12:25:23,905 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:25:23,905 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:25:24,106 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:25:24,106 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 12:25:24,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:25:24,107 INFO L82 PathProgramCache]: Analyzing trace with hash -1460613698, now seen corresponding path program 1 times [2019-12-07 12:25:24,107 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:25:24,107 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153938272] [2019-12-07 12:25:24,108 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:25:24,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:25:24,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:25:24,148 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153938272] [2019-12-07 12:25:24,149 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:25:24,149 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:25:24,149 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684971758] [2019-12-07 12:25:24,149 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 12:25:24,149 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:25:24,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 12:25:24,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:25:24,150 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand 5 states. [2019-12-07 12:25:24,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:25:24,179 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2019-12-07 12:25:24,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 12:25:24,180 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2019-12-07 12:25:24,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:25:24,180 INFO L225 Difference]: With dead ends: 19 [2019-12-07 12:25:24,180 INFO L226 Difference]: Without dead ends: 19 [2019-12-07 12:25:24,180 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-07 12:25:24,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-12-07 12:25:24,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-12-07 12:25:24,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-12-07 12:25:24,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2019-12-07 12:25:24,182 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 7 [2019-12-07 12:25:24,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:25:24,182 INFO L462 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2019-12-07 12:25:24,182 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 12:25:24,182 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2019-12-07 12:25:24,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-07 12:25:24,182 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:25:24,182 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:25:24,182 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 12:25:24,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:25:24,182 INFO L82 PathProgramCache]: Analyzing trace with hash -1460613697, now seen corresponding path program 1 times [2019-12-07 12:25:24,183 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:25:24,183 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206282814] [2019-12-07 12:25:24,183 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:25:24,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:25:24,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:25:24,215 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206282814] [2019-12-07 12:25:24,216 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:25:24,216 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:25:24,216 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139008074] [2019-12-07 12:25:24,216 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 12:25:24,216 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:25:24,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 12:25:24,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 12:25:24,216 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. Second operand 6 states. [2019-12-07 12:25:24,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:25:24,250 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2019-12-07 12:25:24,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 12:25:24,250 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2019-12-07 12:25:24,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:25:24,250 INFO L225 Difference]: With dead ends: 21 [2019-12-07 12:25:24,251 INFO L226 Difference]: Without dead ends: 21 [2019-12-07 12:25:24,251 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-12-07 12:25:24,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-12-07 12:25:24,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-12-07 12:25:24,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-12-07 12:25:24,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2019-12-07 12:25:24,252 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 7 [2019-12-07 12:25:24,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:25:24,252 INFO L462 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2019-12-07 12:25:24,253 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 12:25:24,253 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2019-12-07 12:25:24,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 12:25:24,253 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:25:24,253 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:25:24,253 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 12:25:24,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:25:24,253 INFO L82 PathProgramCache]: Analyzing trace with hash 804578756, now seen corresponding path program 1 times [2019-12-07 12:25:24,253 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:25:24,254 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680897391] [2019-12-07 12:25:24,254 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:25:24,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:25:24,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:25:24,272 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680897391] [2019-12-07 12:25:24,272 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:25:24,272 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:25:24,272 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603398835] [2019-12-07 12:25:24,272 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 12:25:24,272 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:25:24,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 12:25:24,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:25:24,273 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand 5 states. [2019-12-07 12:25:24,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:25:24,301 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2019-12-07 12:25:24,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 12:25:24,301 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-12-07 12:25:24,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:25:24,302 INFO L225 Difference]: With dead ends: 20 [2019-12-07 12:25:24,302 INFO L226 Difference]: Without dead ends: 20 [2019-12-07 12:25:24,302 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-07 12:25:24,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-12-07 12:25:24,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-12-07 12:25:24,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-12-07 12:25:24,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2019-12-07 12:25:24,303 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 9 [2019-12-07 12:25:24,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:25:24,304 INFO L462 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2019-12-07 12:25:24,304 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 12:25:24,304 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2019-12-07 12:25:24,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 12:25:24,304 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:25:24,304 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:25:24,304 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 12:25:24,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:25:24,304 INFO L82 PathProgramCache]: Analyzing trace with hash 804578757, now seen corresponding path program 1 times [2019-12-07 12:25:24,304 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:25:24,305 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744692389] [2019-12-07 12:25:24,305 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:25:24,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:25:24,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:25:24,341 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744692389] [2019-12-07 12:25:24,341 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:25:24,341 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:25:24,341 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205908469] [2019-12-07 12:25:24,341 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 12:25:24,341 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:25:24,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 12:25:24,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 12:25:24,342 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand 6 states. [2019-12-07 12:25:24,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:25:24,391 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2019-12-07 12:25:24,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 12:25:24,391 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2019-12-07 12:25:24,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:25:24,391 INFO L225 Difference]: With dead ends: 23 [2019-12-07 12:25:24,391 INFO L226 Difference]: Without dead ends: 23 [2019-12-07 12:25:24,392 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-12-07 12:25:24,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-12-07 12:25:24,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2019-12-07 12:25:24,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-12-07 12:25:24,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2019-12-07 12:25:24,393 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 9 [2019-12-07 12:25:24,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:25:24,393 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2019-12-07 12:25:24,393 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 12:25:24,393 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2019-12-07 12:25:24,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-12-07 12:25:24,393 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:25:24,394 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:25:24,394 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 12:25:24,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:25:24,394 INFO L82 PathProgramCache]: Analyzing trace with hash -1005820768, now seen corresponding path program 1 times [2019-12-07 12:25:24,394 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:25:24,394 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197883476] [2019-12-07 12:25:24,394 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:25:24,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:25:24,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:25:24,441 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197883476] [2019-12-07 12:25:24,441 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:25:24,442 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:25:24,442 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555975906] [2019-12-07 12:25:24,442 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:25:24,442 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:25:24,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:25:24,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:25:24,442 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand 4 states. [2019-12-07 12:25:24,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:25:24,457 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2019-12-07 12:25:24,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:25:24,457 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-12-07 12:25:24,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:25:24,458 INFO L225 Difference]: With dead ends: 21 [2019-12-07 12:25:24,458 INFO L226 Difference]: Without dead ends: 19 [2019-12-07 12:25:24,458 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:25:24,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-12-07 12:25:24,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-12-07 12:25:24,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-12-07 12:25:24,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2019-12-07 12:25:24,459 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 12 [2019-12-07 12:25:24,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:25:24,459 INFO L462 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2019-12-07 12:25:24,459 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:25:24,459 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2019-12-07 12:25:24,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 12:25:24,460 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:25:24,460 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:25:24,460 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 12:25:24,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:25:24,460 INFO L82 PathProgramCache]: Analyzing trace with hash -1115631095, now seen corresponding path program 1 times [2019-12-07 12:25:24,460 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:25:24,460 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988287604] [2019-12-07 12:25:24,460 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:25:24,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:25:24,545 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:25:24,545 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988287604] [2019-12-07 12:25:24,545 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:25:24,545 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 12:25:24,546 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370619298] [2019-12-07 12:25:24,546 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 12:25:24,546 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:25:24,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 12:25:24,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-07 12:25:24,546 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. Second operand 9 states. [2019-12-07 12:25:24,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:25:24,713 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2019-12-07 12:25:24,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 12:25:24,713 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 13 [2019-12-07 12:25:24,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:25:24,713 INFO L225 Difference]: With dead ends: 28 [2019-12-07 12:25:24,713 INFO L226 Difference]: Without dead ends: 21 [2019-12-07 12:25:24,714 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2019-12-07 12:25:24,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-12-07 12:25:24,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2019-12-07 12:25:24,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-12-07 12:25:24,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2019-12-07 12:25:24,715 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 13 [2019-12-07 12:25:24,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:25:24,715 INFO L462 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2019-12-07 12:25:24,715 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 12:25:24,715 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2019-12-07 12:25:24,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 12:25:24,716 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:25:24,716 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:25:24,716 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 12:25:24,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:25:24,716 INFO L82 PathProgramCache]: Analyzing trace with hash -58784434, now seen corresponding path program 1 times [2019-12-07 12:25:24,716 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:25:24,716 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949808107] [2019-12-07 12:25:24,716 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:25:24,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:25:24,798 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:25:24,798 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949808107] [2019-12-07 12:25:24,798 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [451651354] [2019-12-07 12:25:24,799 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_74222b51-48c1-43df-99b5-fad990262cd5/bin/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:25:24,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:25:24,832 INFO L264 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 27 conjunts are in the unsatisfiable core [2019-12-07 12:25:24,833 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:25:24,885 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:25:24,885 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:25:24,975 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:25:24,976 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1634967751] [2019-12-07 12:25:24,977 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-12-07 12:25:24,977 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 12:25:24,977 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 12:25:24,977 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 12:25:24,977 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 12:25:25,183 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 12:25:25,198 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 12:25:25,606 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 12:25:25,925 WARN L192 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 85 [2019-12-07 12:25:26,095 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 55 [2019-12-07 12:25:26,756 WARN L192 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 53 [2019-12-07 12:25:27,012 WARN L192 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 82 [2019-12-07 12:25:27,392 WARN L192 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 86 [2019-12-07 12:25:27,832 WARN L192 SmtUtils]: Spent 332.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 111 [2019-12-07 12:25:28,443 WARN L192 SmtUtils]: Spent 496.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 126 [2019-12-07 12:25:28,752 WARN L192 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 72 [2019-12-07 12:25:29,055 WARN L192 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 71 [2019-12-07 12:25:29,056 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 12:25:29,056 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 12:25:29,056 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2019-12-07 12:25:29,056 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491934307] [2019-12-07 12:25:29,057 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-07 12:25:29,057 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:25:29,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-07 12:25:29,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=879, Unknown=0, NotChecked=0, Total=992 [2019-12-07 12:25:29,058 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand 20 states. [2019-12-07 12:25:29,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:25:29,768 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2019-12-07 12:25:29,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 12:25:29,769 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 15 [2019-12-07 12:25:29,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:25:29,770 INFO L225 Difference]: With dead ends: 28 [2019-12-07 12:25:29,770 INFO L226 Difference]: Without dead ends: 28 [2019-12-07 12:25:29,771 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 351 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=224, Invalid=1416, Unknown=0, NotChecked=0, Total=1640 [2019-12-07 12:25:29,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-12-07 12:25:29,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 24. [2019-12-07 12:25:29,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-12-07 12:25:29,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2019-12-07 12:25:29,774 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 15 [2019-12-07 12:25:29,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:25:29,774 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2019-12-07 12:25:29,774 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-07 12:25:29,775 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2019-12-07 12:25:29,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 12:25:29,775 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:25:29,775 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:25:29,976 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:25:29,977 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 12:25:29,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:25:29,977 INFO L82 PathProgramCache]: Analyzing trace with hash -58786612, now seen corresponding path program 1 times [2019-12-07 12:25:29,977 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:25:29,977 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266855801] [2019-12-07 12:25:29,978 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:25:29,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:25:30,095 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 12:25:30,095 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266855801] [2019-12-07 12:25:30,095 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:25:30,095 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 12:25:30,096 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607374690] [2019-12-07 12:25:30,096 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 12:25:30,096 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:25:30,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 12:25:30,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-07 12:25:30,096 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand 9 states. [2019-12-07 12:25:30,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:25:30,258 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2019-12-07 12:25:30,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 12:25:30,258 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2019-12-07 12:25:30,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:25:30,259 INFO L225 Difference]: With dead ends: 44 [2019-12-07 12:25:30,259 INFO L226 Difference]: Without dead ends: 44 [2019-12-07 12:25:30,259 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2019-12-07 12:25:30,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-12-07 12:25:30,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2019-12-07 12:25:30,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-12-07 12:25:30,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 49 transitions. [2019-12-07 12:25:30,262 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 49 transitions. Word has length 15 [2019-12-07 12:25:30,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:25:30,262 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 49 transitions. [2019-12-07 12:25:30,262 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 12:25:30,262 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2019-12-07 12:25:30,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 12:25:30,263 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:25:30,263 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:25:30,263 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 12:25:30,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:25:30,264 INFO L82 PathProgramCache]: Analyzing trace with hash 116231867, now seen corresponding path program 1 times [2019-12-07 12:25:30,264 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:25:30,264 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245111446] [2019-12-07 12:25:30,264 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:25:30,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:25:30,326 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 12:25:30,327 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245111446] [2019-12-07 12:25:30,327 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [155884948] [2019-12-07 12:25:30,327 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_74222b51-48c1-43df-99b5-fad990262cd5/bin/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:25:30,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:25:30,357 INFO L264 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 27 conjunts are in the unsatisfiable core [2019-12-07 12:25:30,359 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:25:30,414 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 12:25:30,414 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:25:30,500 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 12:25:30,500 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [897534673] [2019-12-07 12:25:30,501 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-12-07 12:25:30,502 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 12:25:30,502 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 12:25:30,502 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 12:25:30,502 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 12:25:30,698 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 12:25:30,703 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 12:25:31,289 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 12:25:31,569 WARN L192 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 84 [2019-12-07 12:25:32,220 WARN L192 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 53 [2019-12-07 12:25:33,211 WARN L192 SmtUtils]: Spent 856.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 111 [2019-12-07 12:25:33,961 WARN L192 SmtUtils]: Spent 546.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 121 [2019-12-07 12:25:34,680 WARN L192 SmtUtils]: Spent 592.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 122 [2019-12-07 12:25:34,933 WARN L192 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 73 [2019-12-07 12:25:35,165 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 71 [2019-12-07 12:25:35,166 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 12:25:35,166 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 12:25:35,166 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 18 [2019-12-07 12:25:35,166 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605166714] [2019-12-07 12:25:35,167 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-07 12:25:35,167 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:25:35,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-07 12:25:35,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=862, Unknown=0, NotChecked=0, Total=992 [2019-12-07 12:25:35,167 INFO L87 Difference]: Start difference. First operand 42 states and 49 transitions. Second operand 20 states. [2019-12-07 12:25:35,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:25:35,563 INFO L93 Difference]: Finished difference Result 56 states and 64 transitions. [2019-12-07 12:25:35,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 12:25:35,563 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 17 [2019-12-07 12:25:35,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:25:35,563 INFO L225 Difference]: With dead ends: 56 [2019-12-07 12:25:35,564 INFO L226 Difference]: Without dead ends: 56 [2019-12-07 12:25:35,564 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 329 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=238, Invalid=1322, Unknown=0, NotChecked=0, Total=1560 [2019-12-07 12:25:35,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-12-07 12:25:35,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 54. [2019-12-07 12:25:35,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-12-07 12:25:35,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 64 transitions. [2019-12-07 12:25:35,567 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 64 transitions. Word has length 17 [2019-12-07 12:25:35,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:25:35,567 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 64 transitions. [2019-12-07 12:25:35,567 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-07 12:25:35,567 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 64 transitions. [2019-12-07 12:25:35,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 12:25:35,568 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:25:35,568 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:25:35,769 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:25:35,769 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 12:25:35,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:25:35,770 INFO L82 PathProgramCache]: Analyzing trace with hash -244447982, now seen corresponding path program 2 times [2019-12-07 12:25:35,770 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:25:35,771 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396683256] [2019-12-07 12:25:35,771 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:25:35,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:25:35,953 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:25:35,953 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396683256] [2019-12-07 12:25:35,953 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [568961145] [2019-12-07 12:25:35,953 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_74222b51-48c1-43df-99b5-fad990262cd5/bin/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:25:35,995 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-12-07 12:25:35,995 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 12:25:35,996 INFO L264 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 37 conjunts are in the unsatisfiable core [2019-12-07 12:25:35,998 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:25:36,150 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:25:36,150 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:25:36,270 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:25:36,270 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1912510032] [2019-12-07 12:25:36,271 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-12-07 12:25:36,271 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 12:25:36,271 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 12:25:36,271 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 12:25:36,271 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 12:25:36,468 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 12:25:36,474 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 12:25:36,852 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 12:25:37,202 WARN L192 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 83 [2019-12-07 12:25:37,521 WARN L192 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 55 [2019-12-07 12:25:38,250 WARN L192 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 82 [2019-12-07 12:25:38,476 WARN L192 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 86 [2019-12-07 12:25:38,989 WARN L192 SmtUtils]: Spent 383.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 121 [2019-12-07 12:25:39,462 WARN L192 SmtUtils]: Spent 357.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 116 [2019-12-07 12:25:39,666 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 72 [2019-12-07 12:25:39,862 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 71 [2019-12-07 12:25:39,863 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 12:25:39,863 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 12:25:39,863 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 27 [2019-12-07 12:25:39,864 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168035531] [2019-12-07 12:25:39,864 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-12-07 12:25:39,864 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:25:39,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-12-07 12:25:39,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=1332, Unknown=0, NotChecked=0, Total=1482 [2019-12-07 12:25:39,865 INFO L87 Difference]: Start difference. First operand 54 states and 64 transitions. Second operand 27 states. [2019-12-07 12:25:40,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:25:40,232 INFO L93 Difference]: Finished difference Result 94 states and 105 transitions. [2019-12-07 12:25:40,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-07 12:25:40,232 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 19 [2019-12-07 12:25:40,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:25:40,233 INFO L225 Difference]: With dead ends: 94 [2019-12-07 12:25:40,233 INFO L226 Difference]: Without dead ends: 77 [2019-12-07 12:25:40,234 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 4 DeprecatedPredicates, 704 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=323, Invalid=2127, Unknown=0, NotChecked=0, Total=2450 [2019-12-07 12:25:40,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-12-07 12:25:40,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 74. [2019-12-07 12:25:40,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-12-07 12:25:40,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 86 transitions. [2019-12-07 12:25:40,236 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 86 transitions. Word has length 19 [2019-12-07 12:25:40,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:25:40,236 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 86 transitions. [2019-12-07 12:25:40,236 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-12-07 12:25:40,236 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 86 transitions. [2019-12-07 12:25:40,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 12:25:40,237 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:25:40,237 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:25:40,437 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:25:40,438 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 12:25:40,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:25:40,438 INFO L82 PathProgramCache]: Analyzing trace with hash -1714949993, now seen corresponding path program 3 times [2019-12-07 12:25:40,439 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:25:40,439 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360888089] [2019-12-07 12:25:40,439 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:25:40,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:25:40,520 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:25:40,520 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360888089] [2019-12-07 12:25:40,520 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [51867359] [2019-12-07 12:25:40,520 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_74222b51-48c1-43df-99b5-fad990262cd5/bin/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:25:40,555 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-07 12:25:40,555 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 12:25:40,556 INFO L264 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 38 conjunts are in the unsatisfiable core [2019-12-07 12:25:40,558 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:25:40,694 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:25:40,694 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:25:40,863 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:25:40,864 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1362318287] [2019-12-07 12:25:40,864 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-12-07 12:25:40,864 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 12:25:40,865 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 12:25:40,865 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 12:25:40,865 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 12:25:41,053 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 12:25:41,058 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 12:25:41,410 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 12:25:41,745 WARN L192 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 85 [2019-12-07 12:25:41,927 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 55 [2019-12-07 12:25:42,583 WARN L192 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 82 [2019-12-07 12:25:42,815 WARN L192 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 86 [2019-12-07 12:25:43,267 WARN L192 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 111 [2019-12-07 12:25:43,839 WARN L192 SmtUtils]: Spent 428.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 126 [2019-12-07 12:25:44,045 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 72 [2019-12-07 12:25:44,274 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 71 [2019-12-07 12:25:44,275 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 12:25:44,275 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 12:25:44,275 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 29 [2019-12-07 12:25:44,275 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567106589] [2019-12-07 12:25:44,276 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-12-07 12:25:44,276 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:25:44,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-12-07 12:25:44,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=1629, Unknown=0, NotChecked=0, Total=1806 [2019-12-07 12:25:44,277 INFO L87 Difference]: Start difference. First operand 74 states and 86 transitions. Second operand 31 states. [2019-12-07 12:25:44,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:25:44,910 INFO L93 Difference]: Finished difference Result 100 states and 113 transitions. [2019-12-07 12:25:44,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-07 12:25:44,910 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 21 [2019-12-07 12:25:44,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:25:44,912 INFO L225 Difference]: With dead ends: 100 [2019-12-07 12:25:44,912 INFO L226 Difference]: Without dead ends: 100 [2019-12-07 12:25:44,913 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 748 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=401, Invalid=2461, Unknown=0, NotChecked=0, Total=2862 [2019-12-07 12:25:44,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-12-07 12:25:44,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 86. [2019-12-07 12:25:44,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-12-07 12:25:44,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 100 transitions. [2019-12-07 12:25:44,917 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 100 transitions. Word has length 21 [2019-12-07 12:25:44,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:25:44,917 INFO L462 AbstractCegarLoop]: Abstraction has 86 states and 100 transitions. [2019-12-07 12:25:44,917 INFO L463 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-12-07 12:25:44,917 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 100 transitions. [2019-12-07 12:25:44,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-07 12:25:44,918 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:25:44,918 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:25:45,118 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:25:45,119 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 12:25:45,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:25:45,119 INFO L82 PathProgramCache]: Analyzing trace with hash 1838144899, now seen corresponding path program 2 times [2019-12-07 12:25:45,119 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:25:45,120 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646813532] [2019-12-07 12:25:45,120 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:25:45,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:25:45,331 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 12:25:45,331 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646813532] [2019-12-07 12:25:45,332 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1399496204] [2019-12-07 12:25:45,332 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_74222b51-48c1-43df-99b5-fad990262cd5/bin/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:25:45,372 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-12-07 12:25:45,372 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 12:25:45,373 INFO L264 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 42 conjunts are in the unsatisfiable core [2019-12-07 12:25:45,375 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:25:45,598 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 12:25:45,599 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:25:45,795 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 12:25:45,795 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [924258851] [2019-12-07 12:25:45,796 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-12-07 12:25:45,796 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 12:25:45,796 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 12:25:45,796 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 12:25:45,797 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 12:25:45,980 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 12:25:45,991 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 12:25:46,570 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 12:25:46,891 WARN L192 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 86 [2019-12-07 12:25:48,177 WARN L192 SmtUtils]: Spent 515.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 111 [2019-12-07 12:25:48,767 WARN L192 SmtUtils]: Spent 447.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 120 [2019-12-07 12:25:49,565 WARN L192 SmtUtils]: Spent 638.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 119 [2019-12-07 12:25:49,768 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 73 [2019-12-07 12:25:49,982 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 71 [2019-12-07 12:25:49,983 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 12:25:49,983 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 12:25:49,983 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 29 [2019-12-07 12:25:49,983 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442143298] [2019-12-07 12:25:49,983 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-12-07 12:25:49,983 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:25:49,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-12-07 12:25:49,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=1579, Unknown=0, NotChecked=0, Total=1722 [2019-12-07 12:25:49,984 INFO L87 Difference]: Start difference. First operand 86 states and 100 transitions. Second operand 30 states. [2019-12-07 12:25:50,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:25:50,909 INFO L93 Difference]: Finished difference Result 145 states and 163 transitions. [2019-12-07 12:25:50,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-07 12:25:50,910 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 23 [2019-12-07 12:25:50,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:25:50,910 INFO L225 Difference]: With dead ends: 145 [2019-12-07 12:25:50,910 INFO L226 Difference]: Without dead ends: 131 [2019-12-07 12:25:50,911 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 621 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=344, Invalid=2626, Unknown=0, NotChecked=0, Total=2970 [2019-12-07 12:25:50,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-12-07 12:25:50,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 111. [2019-12-07 12:25:50,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-12-07 12:25:50,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 131 transitions. [2019-12-07 12:25:50,915 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 131 transitions. Word has length 23 [2019-12-07 12:25:50,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:25:50,915 INFO L462 AbstractCegarLoop]: Abstraction has 111 states and 131 transitions. [2019-12-07 12:25:50,915 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-12-07 12:25:50,915 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 131 transitions. [2019-12-07 12:25:50,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 12:25:50,916 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:25:50,916 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:25:51,117 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:25:51,118 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 12:25:51,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:25:51,118 INFO L82 PathProgramCache]: Analyzing trace with hash 1489047666, now seen corresponding path program 3 times [2019-12-07 12:25:51,118 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:25:51,118 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253670765] [2019-12-07 12:25:51,119 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:25:51,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:25:51,221 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 12:25:51,221 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253670765] [2019-12-07 12:25:51,222 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1976350532] [2019-12-07 12:25:51,222 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_74222b51-48c1-43df-99b5-fad990262cd5/bin/utaipan/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:25:51,269 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-07 12:25:51,269 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 12:25:51,270 INFO L264 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 36 conjunts are in the unsatisfiable core [2019-12-07 12:25:51,272 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:25:51,336 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 12:25:51,336 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:25:51,459 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 12:25:51,460 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2074546077] [2019-12-07 12:25:51,460 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-12-07 12:25:51,461 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 12:25:51,461 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 12:25:51,461 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 12:25:51,461 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 12:25:51,650 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 12:25:51,669 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 12:25:52,202 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 12:25:52,485 WARN L192 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 84 [2019-12-07 12:25:54,058 WARN L192 SmtUtils]: Spent 879.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 111 [2019-12-07 12:25:54,629 WARN L192 SmtUtils]: Spent 462.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 121 [2019-12-07 12:25:55,405 WARN L192 SmtUtils]: Spent 620.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 121 [2019-12-07 12:25:55,947 WARN L192 SmtUtils]: Spent 349.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 123 [2019-12-07 12:25:56,146 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 73 [2019-12-07 12:25:56,353 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 71 [2019-12-07 12:25:56,354 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 12:25:56,354 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 12:25:56,354 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 21 [2019-12-07 12:25:56,354 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160510710] [2019-12-07 12:25:56,355 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-12-07 12:25:56,355 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:25:56,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-12-07 12:25:56,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=1110, Unknown=0, NotChecked=0, Total=1260 [2019-12-07 12:25:56,355 INFO L87 Difference]: Start difference. First operand 111 states and 131 transitions. Second operand 23 states. [2019-12-07 12:25:56,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:25:56,644 INFO L93 Difference]: Finished difference Result 153 states and 174 transitions. [2019-12-07 12:25:56,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 12:25:56,644 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 25 [2019-12-07 12:25:56,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:25:56,645 INFO L225 Difference]: With dead ends: 153 [2019-12-07 12:25:56,645 INFO L226 Difference]: Without dead ends: 153 [2019-12-07 12:25:56,645 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 45 SyntacticMatches, 3 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 473 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=300, Invalid=1680, Unknown=0, NotChecked=0, Total=1980 [2019-12-07 12:25:56,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-12-07 12:25:56,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 133. [2019-12-07 12:25:56,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-12-07 12:25:56,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 157 transitions. [2019-12-07 12:25:56,648 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 157 transitions. Word has length 25 [2019-12-07 12:25:56,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:25:56,648 INFO L462 AbstractCegarLoop]: Abstraction has 133 states and 157 transitions. [2019-12-07 12:25:56,648 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-12-07 12:25:56,648 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 157 transitions. [2019-12-07 12:25:56,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 12:25:56,649 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:25:56,649 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:25:56,849 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:25:56,850 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 12:25:56,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:25:56,850 INFO L82 PathProgramCache]: Analyzing trace with hash -1639046181, now seen corresponding path program 4 times [2019-12-07 12:25:56,851 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:25:56,851 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769713365] [2019-12-07 12:25:56,851 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:25:56,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:25:56,978 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:25:56,978 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769713365] [2019-12-07 12:25:56,978 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1858644460] [2019-12-07 12:25:56,978 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_74222b51-48c1-43df-99b5-fad990262cd5/bin/utaipan/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:25:57,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:25:57,012 INFO L264 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 50 conjunts are in the unsatisfiable core [2019-12-07 12:25:57,013 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:25:57,295 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:25:57,295 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:25:57,657 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:25:57,657 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [981618523] [2019-12-07 12:25:57,658 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-12-07 12:25:57,658 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 12:25:57,658 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 12:25:57,658 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 12:25:57,658 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 12:25:57,833 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 12:25:57,853 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 12:25:58,189 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 12:25:58,643 WARN L192 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 85 [2019-12-07 12:25:58,904 WARN L192 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 55 [2019-12-07 12:25:59,246 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 47 [2019-12-07 12:25:59,544 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 41 [2019-12-07 12:26:00,098 WARN L192 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 82 [2019-12-07 12:26:00,416 WARN L192 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 86 [2019-12-07 12:26:00,946 WARN L192 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 117 [2019-12-07 12:26:01,792 WARN L192 SmtUtils]: Spent 632.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 127 [2019-12-07 12:26:02,018 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 72 [2019-12-07 12:26:02,263 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 71 [2019-12-07 12:26:02,264 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 12:26:02,264 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 12:26:02,264 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 36 [2019-12-07 12:26:02,264 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100728652] [2019-12-07 12:26:02,264 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-12-07 12:26:02,265 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:26:02,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-12-07 12:26:02,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=2073, Unknown=0, NotChecked=0, Total=2256 [2019-12-07 12:26:02,265 INFO L87 Difference]: Start difference. First operand 133 states and 157 transitions. Second operand 36 states. [2019-12-07 12:26:08,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:26:08,267 INFO L93 Difference]: Finished difference Result 294 states and 327 transitions. [2019-12-07 12:26:08,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-12-07 12:26:08,267 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 25 [2019-12-07 12:26:08,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:26:08,268 INFO L225 Difference]: With dead ends: 294 [2019-12-07 12:26:08,268 INFO L226 Difference]: Without dead ends: 251 [2019-12-07 12:26:08,270 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 38 SyntacticMatches, 3 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1461 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=770, Invalid=6036, Unknown=0, NotChecked=0, Total=6806 [2019-12-07 12:26:08,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2019-12-07 12:26:08,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 193. [2019-12-07 12:26:08,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2019-12-07 12:26:08,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 226 transitions. [2019-12-07 12:26:08,274 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 226 transitions. Word has length 25 [2019-12-07 12:26:08,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:26:08,274 INFO L462 AbstractCegarLoop]: Abstraction has 193 states and 226 transitions. [2019-12-07 12:26:08,274 INFO L463 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-12-07 12:26:08,274 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 226 transitions. [2019-12-07 12:26:08,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-07 12:26:08,274 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:26:08,275 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:26:08,475 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:26:08,475 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 12:26:08,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:26:08,476 INFO L82 PathProgramCache]: Analyzing trace with hash -1449985542, now seen corresponding path program 4 times [2019-12-07 12:26:08,476 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:26:08,476 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958930841] [2019-12-07 12:26:08,476 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:26:08,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:26:09,046 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:26:09,046 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958930841] [2019-12-07 12:26:09,046 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [759637033] [2019-12-07 12:26:09,046 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_74222b51-48c1-43df-99b5-fad990262cd5/bin/utaipan/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:26:09,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:26:09,086 INFO L264 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 79 conjunts are in the unsatisfiable core [2019-12-07 12:26:09,088 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:26:09,905 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 22 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 12:26:09,905 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:26:10,314 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@73046124 [2019-12-07 12:26:10,314 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1131459035] [2019-12-07 12:26:10,315 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-12-07 12:26:10,315 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 12:26:10,315 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 12:26:10,315 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 12:26:10,315 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 12:26:10,320 FATAL L? ?]: Ignoring exception! java.lang.IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@73046124 at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.managedscript.ManagedScript.lock(ManagedScript.java:83) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker.assertLhs(IncrementalPlicationChecker.java:74) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker.checkPlication(IncrementalPlicationChecker.java:106) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ArrayIndexEqualityManager.(ArrayIndexEqualityManager.java:91) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.computeCostEstimation(ElimStorePlain.java:555) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:428) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:234) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.quantifier(PartialQuantifierElimination.java:146) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools$EliminatingTermDomainOperationProvider.newQuantifier(SymbolicTools.java:279) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools$EliminatingTermDomainOperationProvider.projectExistentially(SymbolicTools.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.TermDomainOperationProvider.projectExistentially(TermDomainOperationProvider.java:1) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateTransformer.strongestPostcondition(PredicateTransformer.java:131) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools.post(SymbolicTools.java:116) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretInternal(DagInterpreter.java:227) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTransAndStoreLoiPred(DagInterpreter.java:209) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTrans(DagInterpreter.java:187) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:165) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:123) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:136) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:297) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:180) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-12-07 12:26:10,321 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-12-07 12:26:10,321 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-12-07 12:26:10,321 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349496215] [2019-12-07 12:26:10,322 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-12-07 12:26:10,322 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:26:10,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-12-07 12:26:10,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=2021, Unknown=0, NotChecked=0, Total=2162 [2019-12-07 12:26:10,322 INFO L87 Difference]: Start difference. First operand 193 states and 226 transitions. Second operand 23 states. [2019-12-07 12:26:10,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-12-07 12:26:10,523 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:26:10,523 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@73046124 at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.managedscript.ManagedScript.lock(ManagedScript.java:83) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.assertCodeBlock(IncrementalHoareTripleChecker.java:354) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.prepareAssertionStackAndAddTransition(IncrementalHoareTripleChecker.java:202) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.checkInternal(IncrementalHoareTripleChecker.java:127) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ProtectiveHoareTripleChecker.checkInternal(ProtectiveHoareTripleChecker.java:60) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.EfficientHoareTripleChecker.checkInternal(EfficientHoareTripleChecker.java:62) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.CachingHoareTripleChecker.checkInternal(CachingHoareTripleChecker.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$InternalSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:359) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.addOtherSuccessors(DeterministicInterpolantAutomaton.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1066) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:968) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:188) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:698) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:627) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:454) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-12-07 12:26:10,526 INFO L168 Benchmark]: Toolchain (without parser) took 50343.51 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 377.0 MB). Free memory was 943.5 MB in the beginning and 917.3 MB in the end (delta: 26.2 MB). Peak memory consumption was 403.2 MB. Max. memory is 11.5 GB. [2019-12-07 12:26:10,526 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 12:26:10,526 INFO L168 Benchmark]: CACSL2BoogieTranslator took 300.26 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 98.0 MB). Free memory was 938.2 MB in the beginning and 1.1 GB in the end (delta: -141.1 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. [2019-12-07 12:26:10,526 INFO L168 Benchmark]: Boogie Procedure Inliner took 29.84 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 12:26:10,526 INFO L168 Benchmark]: Boogie Preprocessor took 19.64 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 12:26:10,527 INFO L168 Benchmark]: RCFGBuilder took 308.67 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 39.1 MB). Peak memory consumption was 39.1 MB. Max. memory is 11.5 GB. [2019-12-07 12:26:10,527 INFO L168 Benchmark]: TraceAbstraction took 49682.33 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 278.9 MB). Free memory was 1.0 GB in the beginning and 917.3 MB in the end (delta: 117.5 MB). Peak memory consumption was 396.5 MB. Max. memory is 11.5 GB. [2019-12-07 12:26:10,528 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 300.26 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 98.0 MB). Free memory was 938.2 MB in the beginning and 1.1 GB in the end (delta: -141.1 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 29.84 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.64 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 308.67 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 39.1 MB). Peak memory consumption was 39.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 49682.33 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 278.9 MB). Free memory was 1.0 GB in the beginning and 917.3 MB in the end (delta: 117.5 MB). Peak memory consumption was 396.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@73046124 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@73046124: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.managedscript.ManagedScript.lock(ManagedScript.java:83) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.25-f470102 [2019-12-07 12:26:11,883 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 12:26:11,884 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 12:26:11,892 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 12:26:11,893 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 12:26:11,893 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 12:26:11,894 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 12:26:11,896 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 12:26:11,897 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 12:26:11,897 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 12:26:11,898 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 12:26:11,899 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 12:26:11,899 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 12:26:11,900 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 12:26:11,900 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 12:26:11,901 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 12:26:11,902 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 12:26:11,902 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 12:26:11,904 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 12:26:11,905 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 12:26:11,906 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 12:26:11,907 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 12:26:11,908 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 12:26:11,908 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 12:26:11,910 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 12:26:11,910 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 12:26:11,911 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 12:26:11,911 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 12:26:11,911 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 12:26:11,912 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 12:26:11,912 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 12:26:11,913 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 12:26:11,913 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 12:26:11,914 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 12:26:11,914 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 12:26:11,915 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 12:26:11,915 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 12:26:11,915 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 12:26:11,915 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 12:26:11,916 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 12:26:11,916 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 12:26:11,917 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_74222b51-48c1-43df-99b5-fad990262cd5/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2019-12-07 12:26:11,927 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 12:26:11,927 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 12:26:11,928 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 12:26:11,928 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 12:26:11,928 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 12:26:11,928 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 12:26:11,928 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 12:26:11,929 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 12:26:11,929 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 12:26:11,929 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 12:26:11,929 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 12:26:11,929 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 12:26:11,930 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 12:26:11,930 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 12:26:11,930 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 12:26:11,930 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 12:26:11,930 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 12:26:11,930 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-12-07 12:26:11,930 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-12-07 12:26:11,931 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-12-07 12:26:11,931 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 12:26:11,931 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 12:26:11,931 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-12-07 12:26:11,931 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-12-07 12:26:11,931 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 12:26:11,931 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 12:26:11,932 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 12:26:11,932 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 12:26:11,932 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 12:26:11,932 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 12:26:11,932 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 12:26:11,932 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 12:26:11,932 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 12:26:11,933 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2019-12-07 12:26:11,933 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-12-07 12:26:11,933 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 12:26:11,933 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 12:26:11,933 INFO L138 SettingsManager]: * Logic for external solver=AUFBV Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_74222b51-48c1-43df-99b5-fad990262cd5/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 -> 46421108dc6473f7bf7bcbb7826a3247c1ccc8d1 [2019-12-07 12:26:12,091 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 12:26:12,100 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 12:26:12,102 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 12:26:12,103 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 12:26:12,103 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 12:26:12,103 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_74222b51-48c1-43df-99b5-fad990262cd5/bin/utaipan/../../sv-benchmarks/c/array-memsafety/openbsd_cstrspn-alloca-2.i [2019-12-07 12:26:12,142 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_74222b51-48c1-43df-99b5-fad990262cd5/bin/utaipan/data/4871f1de2/aefbe90452a8407e9f1402b3b9158bf8/FLAGd7161b6de [2019-12-07 12:26:12,500 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 12:26:12,500 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_74222b51-48c1-43df-99b5-fad990262cd5/sv-benchmarks/c/array-memsafety/openbsd_cstrspn-alloca-2.i [2019-12-07 12:26:12,510 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_74222b51-48c1-43df-99b5-fad990262cd5/bin/utaipan/data/4871f1de2/aefbe90452a8407e9f1402b3b9158bf8/FLAGd7161b6de [2019-12-07 12:26:12,518 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_74222b51-48c1-43df-99b5-fad990262cd5/bin/utaipan/data/4871f1de2/aefbe90452a8407e9f1402b3b9158bf8 [2019-12-07 12:26:12,520 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 12:26:12,521 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 12:26:12,522 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 12:26:12,522 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 12:26:12,524 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 12:26:12,525 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 12:26:12" (1/1) ... [2019-12-07 12:26:12,526 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3bf51b27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:26:12, skipping insertion in model container [2019-12-07 12:26:12,527 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 12:26:12" (1/1) ... [2019-12-07 12:26:12,531 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 12:26:12,555 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 12:26:12,767 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 12:26:12,777 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 12:26:12,810 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 12:26:12,843 INFO L208 MainTranslator]: Completed translation [2019-12-07 12:26:12,844 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:26:12 WrapperNode [2019-12-07 12:26:12,844 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 12:26:12,844 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 12:26:12,844 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 12:26:12,844 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 12:26:12,850 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:26:12" (1/1) ... [2019-12-07 12:26:12,861 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:26:12" (1/1) ... [2019-12-07 12:26:12,876 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 12:26:12,876 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 12:26:12,876 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 12:26:12,876 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 12:26:12,882 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:26:12" (1/1) ... [2019-12-07 12:26:12,882 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:26:12" (1/1) ... [2019-12-07 12:26:12,885 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:26:12" (1/1) ... [2019-12-07 12:26:12,885 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:26:12" (1/1) ... [2019-12-07 12:26:12,890 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:26:12" (1/1) ... [2019-12-07 12:26:12,893 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:26:12" (1/1) ... [2019-12-07 12:26:12,895 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:26:12" (1/1) ... [2019-12-07 12:26:12,897 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 12:26:12,897 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 12:26:12,898 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 12:26:12,898 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 12:26:12,898 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:26:12" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_74222b51-48c1-43df-99b5-fad990262cd5/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 12:26:12,937 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2019-12-07 12:26:12,937 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 12:26:12,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2019-12-07 12:26:12,938 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 12:26:12,938 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 12:26:12,938 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 12:26:13,195 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 12:26:13,195 INFO L287 CfgBuilder]: Removed 9 assume(true) statements. [2019-12-07 12:26:13,196 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:26:13 BoogieIcfgContainer [2019-12-07 12:26:13,196 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 12:26:13,197 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 12:26:13,197 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 12:26:13,199 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 12:26:13,199 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 12:26:12" (1/3) ... [2019-12-07 12:26:13,199 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73e8afeb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 12:26:13, skipping insertion in model container [2019-12-07 12:26:13,199 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:26:12" (2/3) ... [2019-12-07 12:26:13,200 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73e8afeb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 12:26:13, skipping insertion in model container [2019-12-07 12:26:13,200 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:26:13" (3/3) ... [2019-12-07 12:26:13,201 INFO L109 eAbstractionObserver]: Analyzing ICFG openbsd_cstrspn-alloca-2.i [2019-12-07 12:26:13,207 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 12:26:13,212 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 13 error locations. [2019-12-07 12:26:13,219 INFO L249 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2019-12-07 12:26:13,231 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 12:26:13,231 INFO L374 AbstractCegarLoop]: Hoare is false [2019-12-07 12:26:13,231 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 12:26:13,231 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 12:26:13,231 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 12:26:13,231 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 12:26:13,231 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 12:26:13,231 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 12:26:13,242 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states. [2019-12-07 12:26:13,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-07 12:26:13,247 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:26:13,248 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:26:13,248 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 12:26:13,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:26:13,252 INFO L82 PathProgramCache]: Analyzing trace with hash 1805029096, now seen corresponding path program 1 times [2019-12-07 12:26:13,259 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 12:26:13,259 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1684053677] [2019-12-07 12:26:13,259 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_74222b51-48c1-43df-99b5-fad990262cd5/bin/utaipan/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2019-12-07 12:26:13,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:26:13,310 INFO L264 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 12:26:13,315 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:26:13,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:26:13,350 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:26:13,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:26:13,375 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1684053677] [2019-12-07 12:26:13,376 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:26:13,376 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 12:26:13,377 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042040392] [2019-12-07 12:26:13,381 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 12:26:13,381 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 12:26:13,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 12:26:13,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 12:26:13,394 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 6 states. [2019-12-07 12:26:13,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:26:13,492 INFO L93 Difference]: Finished difference Result 78 states and 86 transitions. [2019-12-07 12:26:13,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 12:26:13,494 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2019-12-07 12:26:13,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:26:13,501 INFO L225 Difference]: With dead ends: 78 [2019-12-07 12:26:13,502 INFO L226 Difference]: Without dead ends: 74 [2019-12-07 12:26:13,503 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 12:26:13,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-12-07 12:26:13,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 44. [2019-12-07 12:26:13,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-12-07 12:26:13,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 50 transitions. [2019-12-07 12:26:13,530 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 50 transitions. Word has length 7 [2019-12-07 12:26:13,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:26:13,530 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 50 transitions. [2019-12-07 12:26:13,531 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 12:26:13,531 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2019-12-07 12:26:13,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-07 12:26:13,531 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:26:13,531 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:26:13,732 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-12-07 12:26:13,732 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 12:26:13,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:26:13,733 INFO L82 PathProgramCache]: Analyzing trace with hash 1806876138, now seen corresponding path program 1 times [2019-12-07 12:26:13,733 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 12:26:13,734 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1122518375] [2019-12-07 12:26:13,734 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_74222b51-48c1-43df-99b5-fad990262cd5/bin/utaipan/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2019-12-07 12:26:13,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:26:13,799 INFO L264 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 12:26:13,801 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:26:13,880 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-12-07 12:26:13,880 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2019-12-07 12:26:13,881 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:26:13,888 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:26:13,891 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 12:26:13,891 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:15 [2019-12-07 12:26:13,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:26:13,905 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:26:13,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:26:13,916 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1122518375] [2019-12-07 12:26:13,916 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:26:13,916 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-12-07 12:26:13,917 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091361497] [2019-12-07 12:26:13,918 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:26:13,918 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 12:26:13,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:26:13,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:26:13,919 INFO L87 Difference]: Start difference. First operand 44 states and 50 transitions. Second operand 4 states. [2019-12-07 12:26:13,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:26:13,994 INFO L93 Difference]: Finished difference Result 42 states and 48 transitions. [2019-12-07 12:26:13,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:26:13,994 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-12-07 12:26:13,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:26:13,995 INFO L225 Difference]: With dead ends: 42 [2019-12-07 12:26:13,995 INFO L226 Difference]: Without dead ends: 42 [2019-12-07 12:26:13,996 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:26:13,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-12-07 12:26:13,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-12-07 12:26:13,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-12-07 12:26:13,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2019-12-07 12:26:13,999 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 48 transitions. Word has length 7 [2019-12-07 12:26:13,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:26:14,000 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 48 transitions. [2019-12-07 12:26:14,000 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:26:14,000 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2019-12-07 12:26:14,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-07 12:26:14,000 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:26:14,000 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:26:14,201 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-12-07 12:26:14,201 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 12:26:14,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:26:14,202 INFO L82 PathProgramCache]: Analyzing trace with hash 1806876139, now seen corresponding path program 1 times [2019-12-07 12:26:14,203 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 12:26:14,203 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [735850265] [2019-12-07 12:26:14,204 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_74222b51-48c1-43df-99b5-fad990262cd5/bin/utaipan/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2019-12-07 12:26:14,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:26:14,260 INFO L264 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-07 12:26:14,261 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:26:14,274 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_18|], 1=[|v_#valid_27|]} [2019-12-07 12:26:14,281 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:26:14,283 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-12-07 12:26:14,283 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:26:14,303 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:26:14,310 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-12-07 12:26:14,311 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 12:26:14,328 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:26:14,329 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:26:14,329 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:28, output treesize:13 [2019-12-07 12:26:14,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:26:14,344 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:26:14,455 INFO L430 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2019-12-07 12:26:14,462 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-12-07 12:26:14,463 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:26:14,472 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:26:14,474 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 12:26:14,474 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 12:26:14,483 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:26:14,483 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:26:14,483 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:21, output treesize:3 [2019-12-07 12:26:14,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:26:14,504 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [735850265] [2019-12-07 12:26:14,505 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:26:14,505 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2019-12-07 12:26:14,505 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757663723] [2019-12-07 12:26:14,505 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 12:26:14,505 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 12:26:14,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 12:26:14,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 12:26:14,506 INFO L87 Difference]: Start difference. First operand 42 states and 48 transitions. Second operand 6 states. [2019-12-07 12:26:14,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:26:14,842 INFO L93 Difference]: Finished difference Result 75 states and 84 transitions. [2019-12-07 12:26:14,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 12:26:14,844 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2019-12-07 12:26:14,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:26:14,845 INFO L225 Difference]: With dead ends: 75 [2019-12-07 12:26:14,845 INFO L226 Difference]: Without dead ends: 75 [2019-12-07 12:26:14,845 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-12-07 12:26:14,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-12-07 12:26:14,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 44. [2019-12-07 12:26:14,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-12-07 12:26:14,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2019-12-07 12:26:14,849 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 51 transitions. Word has length 7 [2019-12-07 12:26:14,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:26:14,849 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 51 transitions. [2019-12-07 12:26:14,849 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 12:26:14,849 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2019-12-07 12:26:14,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 12:26:14,850 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:26:14,850 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:26:15,050 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-12-07 12:26:15,051 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 12:26:15,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:26:15,052 INFO L82 PathProgramCache]: Analyzing trace with hash -533876960, now seen corresponding path program 1 times [2019-12-07 12:26:15,053 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 12:26:15,053 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1932672746] [2019-12-07 12:26:15,054 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_74222b51-48c1-43df-99b5-fad990262cd5/bin/utaipan/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2019-12-07 12:26:15,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:26:15,115 INFO L264 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 12:26:15,117 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:26:15,129 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_20|], 1=[|v_#valid_29|]} [2019-12-07 12:26:15,136 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:26:15,138 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-12-07 12:26:15,138 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:26:15,157 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:26:15,165 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-12-07 12:26:15,167 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 12:26:15,185 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:26:15,186 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:26:15,187 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:24, output treesize:12 [2019-12-07 12:26:15,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:26:15,204 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:26:15,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:26:15,283 INFO L430 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2019-12-07 12:26:15,290 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:26:15,291 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:26:15,294 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:26:15,294 INFO L502 ElimStorePlain]: Eliminatee |#length| vanished before elimination [2019-12-07 12:26:15,294 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:26:15,294 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:27, output treesize:5 [2019-12-07 12:26:15,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:26:15,316 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1932672746] [2019-12-07 12:26:15,316 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:26:15,317 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2019-12-07 12:26:15,317 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33587418] [2019-12-07 12:26:15,317 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 12:26:15,317 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 12:26:15,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 12:26:15,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 12:26:15,318 INFO L87 Difference]: Start difference. First operand 44 states and 51 transitions. Second operand 6 states. [2019-12-07 12:26:15,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:26:15,627 INFO L93 Difference]: Finished difference Result 71 states and 80 transitions. [2019-12-07 12:26:15,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 12:26:15,628 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2019-12-07 12:26:15,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:26:15,629 INFO L225 Difference]: With dead ends: 71 [2019-12-07 12:26:15,629 INFO L226 Difference]: Without dead ends: 71 [2019-12-07 12:26:15,629 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 12:26:15,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-12-07 12:26:15,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 43. [2019-12-07 12:26:15,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-12-07 12:26:15,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 50 transitions. [2019-12-07 12:26:15,633 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 50 transitions. Word has length 9 [2019-12-07 12:26:15,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:26:15,633 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 50 transitions. [2019-12-07 12:26:15,633 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 12:26:15,633 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 50 transitions. [2019-12-07 12:26:15,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 12:26:15,634 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:26:15,634 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:26:15,834 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-12-07 12:26:15,835 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 12:26:15,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:26:15,835 INFO L82 PathProgramCache]: Analyzing trace with hash -533876908, now seen corresponding path program 1 times [2019-12-07 12:26:15,836 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 12:26:15,836 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1877018115] [2019-12-07 12:26:15,836 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_74222b51-48c1-43df-99b5-fad990262cd5/bin/utaipan/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2019-12-07 12:26:15,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:26:15,870 INFO L264 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 12:26:15,871 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:26:15,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:26:15,883 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:26:15,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:26:15,906 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1877018115] [2019-12-07 12:26:15,906 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:26:15,906 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 12:26:15,906 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043398236] [2019-12-07 12:26:15,906 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 12:26:15,906 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 12:26:15,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 12:26:15,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 12:26:15,907 INFO L87 Difference]: Start difference. First operand 43 states and 50 transitions. Second operand 6 states. [2019-12-07 12:26:15,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:26:15,968 INFO L93 Difference]: Finished difference Result 76 states and 86 transitions. [2019-12-07 12:26:15,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 12:26:15,969 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2019-12-07 12:26:15,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:26:15,970 INFO L225 Difference]: With dead ends: 76 [2019-12-07 12:26:15,970 INFO L226 Difference]: Without dead ends: 76 [2019-12-07 12:26:15,970 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 12:26:15,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-12-07 12:26:15,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 54. [2019-12-07 12:26:15,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-12-07 12:26:15,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 64 transitions. [2019-12-07 12:26:15,974 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 64 transitions. Word has length 9 [2019-12-07 12:26:15,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:26:15,974 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 64 transitions. [2019-12-07 12:26:15,974 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 12:26:15,974 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 64 transitions. [2019-12-07 12:26:15,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 12:26:15,974 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:26:15,975 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:26:16,175 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-12-07 12:26:16,176 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 12:26:16,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:26:16,176 INFO L82 PathProgramCache]: Analyzing trace with hash -476618606, now seen corresponding path program 1 times [2019-12-07 12:26:16,177 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 12:26:16,177 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1497325292] [2019-12-07 12:26:16,177 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_74222b51-48c1-43df-99b5-fad990262cd5/bin/utaipan/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2019-12-07 12:26:16,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:26:16,235 INFO L264 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 12:26:16,236 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:26:16,252 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-12-07 12:26:16,253 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 11 [2019-12-07 12:26:16,253 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:26:16,257 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:26:16,257 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 12:26:16,258 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:9, output treesize:11 [2019-12-07 12:26:16,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:26:16,265 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:26:16,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:26:16,269 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1497325292] [2019-12-07 12:26:16,269 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:26:16,269 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-12-07 12:26:16,270 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179617168] [2019-12-07 12:26:16,270 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:26:16,270 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 12:26:16,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:26:16,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:26:16,271 INFO L87 Difference]: Start difference. First operand 54 states and 64 transitions. Second operand 3 states. [2019-12-07 12:26:16,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:26:16,312 INFO L93 Difference]: Finished difference Result 52 states and 62 transitions. [2019-12-07 12:26:16,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:26:16,312 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-07 12:26:16,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:26:16,313 INFO L225 Difference]: With dead ends: 52 [2019-12-07 12:26:16,313 INFO L226 Difference]: Without dead ends: 52 [2019-12-07 12:26:16,313 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:26:16,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-12-07 12:26:16,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-12-07 12:26:16,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-12-07 12:26:16,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 62 transitions. [2019-12-07 12:26:16,316 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 62 transitions. Word has length 9 [2019-12-07 12:26:16,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:26:16,317 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 62 transitions. [2019-12-07 12:26:16,317 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:26:16,317 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 62 transitions. [2019-12-07 12:26:16,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 12:26:16,317 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:26:16,317 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:26:16,518 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-12-07 12:26:16,518 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 12:26:16,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:26:16,519 INFO L82 PathProgramCache]: Analyzing trace with hash -476618605, now seen corresponding path program 1 times [2019-12-07 12:26:16,519 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 12:26:16,520 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [489380361] [2019-12-07 12:26:16,520 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_74222b51-48c1-43df-99b5-fad990262cd5/bin/utaipan/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2019-12-07 12:26:16,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:26:16,569 INFO L264 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 12:26:16,570 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:26:16,592 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:26:16,592 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 25 [2019-12-07 12:26:16,592 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:26:16,621 INFO L614 ElimStorePlain]: treesize reduction 10, result has 68.8 percent of original size [2019-12-07 12:26:16,622 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:26:16,622 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:17, output treesize:10 [2019-12-07 12:26:16,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:26:16,645 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:26:16,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:26:16,785 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [489380361] [2019-12-07 12:26:16,785 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:26:16,785 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2019-12-07 12:26:16,786 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748690752] [2019-12-07 12:26:16,786 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 12:26:16,786 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 12:26:16,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 12:26:16,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-12-07 12:26:16,786 INFO L87 Difference]: Start difference. First operand 52 states and 62 transitions. Second operand 8 states. [2019-12-07 12:26:17,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:26:17,031 INFO L93 Difference]: Finished difference Result 76 states and 88 transitions. [2019-12-07 12:26:17,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 12:26:17,032 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2019-12-07 12:26:17,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:26:17,033 INFO L225 Difference]: With dead ends: 76 [2019-12-07 12:26:17,033 INFO L226 Difference]: Without dead ends: 76 [2019-12-07 12:26:17,033 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2019-12-07 12:26:17,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-12-07 12:26:17,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 54. [2019-12-07 12:26:17,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-12-07 12:26:17,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 65 transitions. [2019-12-07 12:26:17,036 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 65 transitions. Word has length 9 [2019-12-07 12:26:17,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:26:17,036 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 65 transitions. [2019-12-07 12:26:17,036 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 12:26:17,036 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 65 transitions. [2019-12-07 12:26:17,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-07 12:26:17,037 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:26:17,037 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:26:17,238 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2019-12-07 12:26:17,239 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 12:26:17,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:26:17,240 INFO L82 PathProgramCache]: Analyzing trace with hash 629683418, now seen corresponding path program 1 times [2019-12-07 12:26:17,240 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 12:26:17,241 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [890668041] [2019-12-07 12:26:17,241 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_74222b51-48c1-43df-99b5-fad990262cd5/bin/utaipan/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2019-12-07 12:26:17,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:26:17,313 INFO L264 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 12:26:17,314 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:26:17,361 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:26:17,362 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 25 [2019-12-07 12:26:17,362 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:26:17,417 INFO L614 ElimStorePlain]: treesize reduction 10, result has 67.7 percent of original size [2019-12-07 12:26:17,418 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:26:17,418 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:16, output treesize:12 [2019-12-07 12:26:17,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:26:17,446 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:26:17,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:26:17,573 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [890668041] [2019-12-07 12:26:17,573 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:26:17,573 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2019-12-07 12:26:17,573 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039029041] [2019-12-07 12:26:17,573 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 12:26:17,573 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 12:26:17,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 12:26:17,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 12:26:17,574 INFO L87 Difference]: Start difference. First operand 54 states and 65 transitions. Second operand 6 states. [2019-12-07 12:26:17,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:26:17,774 INFO L93 Difference]: Finished difference Result 73 states and 84 transitions. [2019-12-07 12:26:17,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 12:26:17,776 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2019-12-07 12:26:17,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:26:17,776 INFO L225 Difference]: With dead ends: 73 [2019-12-07 12:26:17,776 INFO L226 Difference]: Without dead ends: 73 [2019-12-07 12:26:17,777 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 12:26:17,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-12-07 12:26:17,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 53. [2019-12-07 12:26:17,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-12-07 12:26:17,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 64 transitions. [2019-12-07 12:26:17,780 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 64 transitions. Word has length 10 [2019-12-07 12:26:17,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:26:17,780 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 64 transitions. [2019-12-07 12:26:17,780 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 12:26:17,780 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 64 transitions. [2019-12-07 12:26:17,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 12:26:17,781 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:26:17,781 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:26:17,981 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2019-12-07 12:26:17,982 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 12:26:17,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:26:17,983 INFO L82 PathProgramCache]: Analyzing trace with hash -1226025170, now seen corresponding path program 1 times [2019-12-07 12:26:17,983 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 12:26:17,984 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [494329769] [2019-12-07 12:26:17,984 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_74222b51-48c1-43df-99b5-fad990262cd5/bin/utaipan/mathsat Starting monitored process 10 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with mathsat -unsat_core_generation=3 [2019-12-07 12:26:18,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:26:18,027 INFO L264 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 11 conjunts are in the unsatisfiable core [2019-12-07 12:26:18,029 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:26:18,038 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_28|], 1=[|v_#valid_36|]} [2019-12-07 12:26:18,042 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:26:18,043 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-12-07 12:26:18,043 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:26:18,058 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:26:18,063 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-12-07 12:26:18,063 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 12:26:18,077 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:26:18,078 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:26:18,078 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:16 [2019-12-07 12:26:18,207 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:26:18,207 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:26:18,664 INFO L430 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2019-12-07 12:26:18,667 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:26:18,668 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:26:18,668 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:26:18,668 INFO L502 ElimStorePlain]: Eliminatee |#length| vanished before elimination [2019-12-07 12:26:18,669 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:26:18,669 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:33, output treesize:1 [2019-12-07 12:26:18,669 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:26:18,670 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [494329769] [2019-12-07 12:26:18,670 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [772035642] [2019-12-07 12:26:18,670 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_74222b51-48c1-43df-99b5-fad990262cd5/bin/utaipan/cvc4 Starting monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 12:26:18,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:26:18,729 INFO L264 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 11 conjunts are in the unsatisfiable core [2019-12-07 12:26:18,729 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:26:18,733 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_30|], 1=[|v_#valid_38|]} [2019-12-07 12:26:18,737 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:26:18,738 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-12-07 12:26:18,738 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:26:18,753 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:26:18,758 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-12-07 12:26:18,758 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 12:26:18,771 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:26:18,772 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:26:18,772 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:16 [2019-12-07 12:26:18,879 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:26:18,879 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:26:19,324 INFO L430 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2019-12-07 12:26:19,328 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:26:19,329 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:26:19,330 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:26:19,330 INFO L502 ElimStorePlain]: Eliminatee |#length| vanished before elimination [2019-12-07 12:26:19,330 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:26:19,330 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:39, output treesize:1 [2019-12-07 12:26:19,331 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:26:19,331 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [589099339] [2019-12-07 12:26:19,331 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_74222b51-48c1-43df-99b5-fad990262cd5/bin/utaipan/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:26:19,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:26:19,420 INFO L264 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 12:26:19,420 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:26:19,425 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_32|], 1=[|v_#valid_40|]} [2019-12-07 12:26:19,429 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:26:19,430 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-12-07 12:26:19,431 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:26:19,448 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:26:19,454 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-12-07 12:26:19,454 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 12:26:19,472 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:26:19,472 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:26:19,473 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:24, output treesize:12 [2019-12-07 12:26:19,621 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:26:19,621 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:26:19,629 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:26:19,629 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2019-12-07 12:26:19,630 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5, 5, 4, 5] total 18 [2019-12-07 12:26:19,630 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521973946] [2019-12-07 12:26:19,630 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-07 12:26:19,630 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 12:26:19,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-07 12:26:19,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=240, Unknown=0, NotChecked=0, Total=342 [2019-12-07 12:26:19,631 INFO L87 Difference]: Start difference. First operand 53 states and 64 transitions. Second operand 19 states. [2019-12-07 12:26:20,315 WARN L192 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 28 [2019-12-07 12:26:20,584 WARN L192 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 17 [2019-12-07 12:26:21,148 WARN L192 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 24 [2019-12-07 12:26:21,670 WARN L192 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 24 [2019-12-07 12:26:22,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:26:22,049 INFO L93 Difference]: Finished difference Result 193 states and 222 transitions. [2019-12-07 12:26:22,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 12:26:22,050 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 11 [2019-12-07 12:26:22,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:26:22,051 INFO L225 Difference]: With dead ends: 193 [2019-12-07 12:26:22,051 INFO L226 Difference]: Without dead ends: 193 [2019-12-07 12:26:22,052 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=179, Invalid=421, Unknown=0, NotChecked=0, Total=600 [2019-12-07 12:26:22,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2019-12-07 12:26:22,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 77. [2019-12-07 12:26:22,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-12-07 12:26:22,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 94 transitions. [2019-12-07 12:26:22,056 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 94 transitions. Word has length 11 [2019-12-07 12:26:22,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:26:22,056 INFO L462 AbstractCegarLoop]: Abstraction has 77 states and 94 transitions. [2019-12-07 12:26:22,056 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-07 12:26:22,056 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 94 transitions. [2019-12-07 12:26:22,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 12:26:22,056 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:26:22,057 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:26:22,658 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,10 mathsat -unsat_core_generation=3,11 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 12:26:22,659 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 12:26:22,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:26:22,660 INFO L82 PathProgramCache]: Analyzing trace with hash -1518446205, now seen corresponding path program 1 times [2019-12-07 12:26:22,660 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 12:26:22,660 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [95855076] [2019-12-07 12:26:22,660 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_74222b51-48c1-43df-99b5-fad990262cd5/bin/utaipan/mathsat Starting monitored process 13 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with mathsat -unsat_core_generation=3 [2019-12-07 12:26:22,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:26:22,730 INFO L264 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 12:26:22,731 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:26:22,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:26:22,744 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:26:22,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:26:22,747 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [95855076] [2019-12-07 12:26:22,747 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:26:22,747 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-12-07 12:26:22,747 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177849298] [2019-12-07 12:26:22,748 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 12:26:22,748 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 12:26:22,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 12:26:22,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:26:22,748 INFO L87 Difference]: Start difference. First operand 77 states and 94 transitions. Second operand 5 states. [2019-12-07 12:26:22,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:26:22,843 INFO L93 Difference]: Finished difference Result 76 states and 93 transitions. [2019-12-07 12:26:22,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 12:26:22,844 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-12-07 12:26:22,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:26:22,845 INFO L225 Difference]: With dead ends: 76 [2019-12-07 12:26:22,845 INFO L226 Difference]: Without dead ends: 76 [2019-12-07 12:26:22,846 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-07 12:26:22,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-12-07 12:26:22,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2019-12-07 12:26:22,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-12-07 12:26:22,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 93 transitions. [2019-12-07 12:26:22,850 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 93 transitions. Word has length 13 [2019-12-07 12:26:22,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:26:22,850 INFO L462 AbstractCegarLoop]: Abstraction has 76 states and 93 transitions. [2019-12-07 12:26:22,850 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 12:26:22,850 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 93 transitions. [2019-12-07 12:26:22,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 12:26:22,851 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:26:22,851 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:26:23,051 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 mathsat -unsat_core_generation=3 [2019-12-07 12:26:23,052 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 12:26:23,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:26:23,053 INFO L82 PathProgramCache]: Analyzing trace with hash -1518446204, now seen corresponding path program 1 times [2019-12-07 12:26:23,053 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 12:26:23,053 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1310396755] [2019-12-07 12:26:23,054 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_74222b51-48c1-43df-99b5-fad990262cd5/bin/utaipan/mathsat Starting monitored process 14 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with mathsat -unsat_core_generation=3 [2019-12-07 12:26:23,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:26:23,104 INFO L264 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-07 12:26:23,105 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:26:23,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:26:23,168 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:26:23,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:26:23,358 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2019-12-07 12:26:23,358 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 12:26:23,367 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2019-12-07 12:26:23,368 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 12:26:23,398 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:26:23,398 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-12-07 12:26:23,398 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:25 [2019-12-07 12:26:23,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:26:23,548 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1310396755] [2019-12-07 12:26:23,548 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:26:23,548 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 11 [2019-12-07 12:26:23,548 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346228786] [2019-12-07 12:26:23,549 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 12:26:23,549 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 12:26:23,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 12:26:23,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-12-07 12:26:23,549 INFO L87 Difference]: Start difference. First operand 76 states and 93 transitions. Second operand 12 states. [2019-12-07 12:26:24,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:26:24,339 INFO L93 Difference]: Finished difference Result 110 states and 130 transitions. [2019-12-07 12:26:24,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 12:26:24,340 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 13 [2019-12-07 12:26:24,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:26:24,341 INFO L225 Difference]: With dead ends: 110 [2019-12-07 12:26:24,341 INFO L226 Difference]: Without dead ends: 110 [2019-12-07 12:26:24,341 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=111, Invalid=269, Unknown=0, NotChecked=0, Total=380 [2019-12-07 12:26:24,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-12-07 12:26:24,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 78. [2019-12-07 12:26:24,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-12-07 12:26:24,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 95 transitions. [2019-12-07 12:26:24,343 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 95 transitions. Word has length 13 [2019-12-07 12:26:24,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:26:24,344 INFO L462 AbstractCegarLoop]: Abstraction has 78 states and 95 transitions. [2019-12-07 12:26:24,344 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 12:26:24,344 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 95 transitions. [2019-12-07 12:26:24,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 12:26:24,344 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:26:24,344 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:26:24,545 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 mathsat -unsat_core_generation=3 [2019-12-07 12:26:24,545 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 12:26:24,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:26:24,546 INFO L82 PathProgramCache]: Analyzing trace with hash -1862804906, now seen corresponding path program 1 times [2019-12-07 12:26:24,546 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 12:26:24,546 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1355173225] [2019-12-07 12:26:24,547 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_74222b51-48c1-43df-99b5-fad990262cd5/bin/utaipan/mathsat Starting monitored process 15 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with mathsat -unsat_core_generation=3 [2019-12-07 12:26:24,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:26:24,604 INFO L264 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-07 12:26:24,606 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:26:24,630 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:26:24,630 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 25 [2019-12-07 12:26:24,630 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:26:24,657 INFO L614 ElimStorePlain]: treesize reduction 10, result has 68.8 percent of original size [2019-12-07 12:26:24,658 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:26:24,658 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:17, output treesize:13 [2019-12-07 12:26:24,739 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:26:24,739 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:26:25,111 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:26:25,111 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1355173225] [2019-12-07 12:26:25,111 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [87367826] [2019-12-07 12:26:25,111 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_74222b51-48c1-43df-99b5-fad990262cd5/bin/utaipan/cvc4 Starting monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 12:26:25,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:26:25,166 INFO L264 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-07 12:26:25,167 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:26:25,183 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:26:25,183 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 25 [2019-12-07 12:26:25,183 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:26:25,211 INFO L614 ElimStorePlain]: treesize reduction 10, result has 68.8 percent of original size [2019-12-07 12:26:25,211 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:26:25,211 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:17, output treesize:13 [2019-12-07 12:26:25,231 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:26:25,232 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:26:25,238 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:26:25,238 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [81287497] [2019-12-07 12:26:25,238 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_74222b51-48c1-43df-99b5-fad990262cd5/bin/utaipan/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:26:25,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:26:25,270 INFO L264 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 12:26:25,271 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:26:25,288 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:26:25,288 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 25 [2019-12-07 12:26:25,288 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:26:25,317 INFO L614 ElimStorePlain]: treesize reduction 10, result has 68.8 percent of original size [2019-12-07 12:26:25,318 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:26:25,318 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:17, output treesize:13 [2019-12-07 12:26:25,402 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:26:25,402 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:26:26,117 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:26:26,117 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2019-12-07 12:26:26,117 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6, 5, 6, 6] total 16 [2019-12-07 12:26:26,117 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732586070] [2019-12-07 12:26:26,117 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-07 12:26:26,118 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 12:26:26,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-07 12:26:26,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2019-12-07 12:26:26,118 INFO L87 Difference]: Start difference. First operand 78 states and 95 transitions. Second operand 17 states. [2019-12-07 12:26:27,035 WARN L192 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 17 [2019-12-07 12:26:27,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:26:27,385 INFO L93 Difference]: Finished difference Result 123 states and 143 transitions. [2019-12-07 12:26:27,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 12:26:27,386 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 13 [2019-12-07 12:26:27,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:26:27,387 INFO L225 Difference]: With dead ends: 123 [2019-12-07 12:26:27,387 INFO L226 Difference]: Without dead ends: 123 [2019-12-07 12:26:27,387 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 52 SyntacticMatches, 5 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=165, Invalid=341, Unknown=0, NotChecked=0, Total=506 [2019-12-07 12:26:27,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-12-07 12:26:27,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 75. [2019-12-07 12:26:27,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-12-07 12:26:27,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 91 transitions. [2019-12-07 12:26:27,389 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 91 transitions. Word has length 13 [2019-12-07 12:26:27,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:26:27,390 INFO L462 AbstractCegarLoop]: Abstraction has 75 states and 91 transitions. [2019-12-07 12:26:27,390 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-07 12:26:27,390 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 91 transitions. [2019-12-07 12:26:27,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 12:26:27,390 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:26:27,390 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:26:27,991 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 mathsat -unsat_core_generation=3,16 cvc4 --incremental --print-success --lang smt --rewrite-divk,17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:26:27,992 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 12:26:27,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:26:27,992 INFO L82 PathProgramCache]: Analyzing trace with hash -1435298785, now seen corresponding path program 1 times [2019-12-07 12:26:27,992 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 12:26:27,992 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1022145791] [2019-12-07 12:26:27,993 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_74222b51-48c1-43df-99b5-fad990262cd5/bin/utaipan/mathsat Starting monitored process 18 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with mathsat -unsat_core_generation=3 [2019-12-07 12:26:28,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:26:28,067 INFO L264 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 12:26:28,068 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:26:28,078 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-12-07 12:26:28,078 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 11 [2019-12-07 12:26:28,078 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:26:28,082 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:26:28,082 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 12:26:28,082 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:9, output treesize:11 [2019-12-07 12:26:28,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:26:28,099 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:26:28,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:26:28,103 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1022145791] [2019-12-07 12:26:28,103 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:26:28,103 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2019-12-07 12:26:28,103 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106462560] [2019-12-07 12:26:28,103 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 12:26:28,103 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 12:26:28,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 12:26:28,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 12:26:28,104 INFO L87 Difference]: Start difference. First operand 75 states and 91 transitions. Second operand 6 states. [2019-12-07 12:26:28,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:26:28,207 INFO L93 Difference]: Finished difference Result 75 states and 91 transitions. [2019-12-07 12:26:28,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 12:26:28,208 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-12-07 12:26:28,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:26:28,208 INFO L225 Difference]: With dead ends: 75 [2019-12-07 12:26:28,208 INFO L226 Difference]: Without dead ends: 75 [2019-12-07 12:26:28,208 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-07 12:26:28,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-12-07 12:26:28,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 74. [2019-12-07 12:26:28,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-12-07 12:26:28,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 90 transitions. [2019-12-07 12:26:28,210 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 90 transitions. Word has length 16 [2019-12-07 12:26:28,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:26:28,210 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 90 transitions. [2019-12-07 12:26:28,210 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 12:26:28,210 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 90 transitions. [2019-12-07 12:26:28,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 12:26:28,211 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:26:28,211 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:26:28,411 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 mathsat -unsat_core_generation=3 [2019-12-07 12:26:28,412 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 12:26:28,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:26:28,412 INFO L82 PathProgramCache]: Analyzing trace with hash -1435298784, now seen corresponding path program 1 times [2019-12-07 12:26:28,413 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 12:26:28,413 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [353057495] [2019-12-07 12:26:28,413 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_74222b51-48c1-43df-99b5-fad990262cd5/bin/utaipan/mathsat Starting monitored process 19 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with mathsat -unsat_core_generation=3 [2019-12-07 12:26:28,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:26:28,463 INFO L264 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-07 12:26:28,464 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:26:28,481 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:26:28,481 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 25 [2019-12-07 12:26:28,481 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:26:28,502 INFO L614 ElimStorePlain]: treesize reduction 10, result has 64.3 percent of original size [2019-12-07 12:26:28,503 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:26:28,503 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2019-12-07 12:26:28,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:26:28,543 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:26:28,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:26:28,769 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [353057495] [2019-12-07 12:26:28,769 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:26:28,769 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 11 [2019-12-07 12:26:28,769 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770175339] [2019-12-07 12:26:28,769 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 12:26:28,769 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 12:26:28,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 12:26:28,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-12-07 12:26:28,770 INFO L87 Difference]: Start difference. First operand 74 states and 90 transitions. Second operand 12 states. [2019-12-07 12:26:29,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:26:29,717 INFO L93 Difference]: Finished difference Result 100 states and 117 transitions. [2019-12-07 12:26:29,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 12:26:29,718 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 16 [2019-12-07 12:26:29,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:26:29,719 INFO L225 Difference]: With dead ends: 100 [2019-12-07 12:26:29,719 INFO L226 Difference]: Without dead ends: 100 [2019-12-07 12:26:29,719 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=115, Invalid=305, Unknown=0, NotChecked=0, Total=420 [2019-12-07 12:26:29,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-12-07 12:26:29,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 76. [2019-12-07 12:26:29,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-12-07 12:26:29,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 92 transitions. [2019-12-07 12:26:29,722 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 92 transitions. Word has length 16 [2019-12-07 12:26:29,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:26:29,722 INFO L462 AbstractCegarLoop]: Abstraction has 76 states and 92 transitions. [2019-12-07 12:26:29,722 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 12:26:29,722 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 92 transitions. [2019-12-07 12:26:29,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 12:26:29,723 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:26:29,723 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:26:29,923 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 mathsat -unsat_core_generation=3 [2019-12-07 12:26:29,924 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 12:26:29,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:26:29,924 INFO L82 PathProgramCache]: Analyzing trace with hash 1033258167, now seen corresponding path program 1 times [2019-12-07 12:26:29,925 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 12:26:29,925 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [899768404] [2019-12-07 12:26:29,925 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_74222b51-48c1-43df-99b5-fad990262cd5/bin/utaipan/mathsat Starting monitored process 20 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with mathsat -unsat_core_generation=3 [2019-12-07 12:26:30,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:26:30,031 INFO L264 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 12:26:30,032 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:26:30,035 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-07 12:26:30,035 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:26:30,036 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:26:30,036 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:26:30,036 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 12:26:32,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:26:32,086 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:26:34,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:26:34,161 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [899768404] [2019-12-07 12:26:34,161 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:26:34,161 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 8 [2019-12-07 12:26:34,161 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524238526] [2019-12-07 12:26:34,161 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 12:26:34,162 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 12:26:34,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 12:26:34,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=46, Unknown=2, NotChecked=0, Total=72 [2019-12-07 12:26:34,162 INFO L87 Difference]: Start difference. First operand 76 states and 92 transitions. Second operand 9 states. [2019-12-07 12:26:44,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:26:44,350 INFO L93 Difference]: Finished difference Result 98 states and 115 transitions. [2019-12-07 12:26:44,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 12:26:44,350 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-12-07 12:26:44,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:26:44,351 INFO L225 Difference]: With dead ends: 98 [2019-12-07 12:26:44,351 INFO L226 Difference]: Without dead ends: 95 [2019-12-07 12:26:44,351 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=29, Invalid=59, Unknown=2, NotChecked=0, Total=90 [2019-12-07 12:26:44,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-12-07 12:26:44,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 93. [2019-12-07 12:26:44,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-12-07 12:26:44,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 112 transitions. [2019-12-07 12:26:44,353 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 112 transitions. Word has length 21 [2019-12-07 12:26:44,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:26:44,353 INFO L462 AbstractCegarLoop]: Abstraction has 93 states and 112 transitions. [2019-12-07 12:26:44,353 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 12:26:44,353 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 112 transitions. [2019-12-07 12:26:44,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 12:26:44,354 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:26:44,354 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:26:44,554 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 mathsat -unsat_core_generation=3 [2019-12-07 12:26:44,555 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 12:26:44,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:26:44,555 INFO L82 PathProgramCache]: Analyzing trace with hash 1033312273, now seen corresponding path program 1 times [2019-12-07 12:26:44,556 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 12:26:44,556 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1293833173] [2019-12-07 12:26:44,556 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_74222b51-48c1-43df-99b5-fad990262cd5/bin/utaipan/mathsat Starting monitored process 21 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with mathsat -unsat_core_generation=3 [2019-12-07 12:26:44,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:26:44,628 INFO L264 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 18 conjunts are in the unsatisfiable core [2019-12-07 12:26:44,629 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:26:44,639 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2019-12-07 12:26:44,639 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:26:44,642 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:26:44,642 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:26:44,643 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:12 [2019-12-07 12:26:44,679 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2019-12-07 12:26:44,680 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:26:44,681 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:26:44,681 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:26:44,681 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2019-12-07 12:26:44,699 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:26:44,699 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:26:44,766 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2019-12-07 12:26:44,768 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2019-12-07 12:26:44,768 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 12:26:44,770 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:26:44,770 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:26:44,771 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:26:44,771 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:26:44,771 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:6 [2019-12-07 12:26:44,774 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:26:44,774 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1293833173] [2019-12-07 12:26:44,774 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:26:44,774 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10, 9] imperfect sequences [] total 14 [2019-12-07 12:26:44,774 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623940202] [2019-12-07 12:26:44,775 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-07 12:26:44,775 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 12:26:44,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-07 12:26:44,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2019-12-07 12:26:44,775 INFO L87 Difference]: Start difference. First operand 93 states and 112 transitions. Second operand 14 states. [2019-12-07 12:26:45,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:26:45,059 INFO L93 Difference]: Finished difference Result 103 states and 116 transitions. [2019-12-07 12:26:45,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 12:26:45,060 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 21 [2019-12-07 12:26:45,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:26:45,060 INFO L225 Difference]: With dead ends: 103 [2019-12-07 12:26:45,060 INFO L226 Difference]: Without dead ends: 89 [2019-12-07 12:26:45,060 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 25 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2019-12-07 12:26:45,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-12-07 12:26:45,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 84. [2019-12-07 12:26:45,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-12-07 12:26:45,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 99 transitions. [2019-12-07 12:26:45,062 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 99 transitions. Word has length 21 [2019-12-07 12:26:45,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:26:45,062 INFO L462 AbstractCegarLoop]: Abstraction has 84 states and 99 transitions. [2019-12-07 12:26:45,062 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-07 12:26:45,062 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 99 transitions. [2019-12-07 12:26:45,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 12:26:45,063 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:26:45,063 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:26:45,263 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 mathsat -unsat_core_generation=3 [2019-12-07 12:26:45,264 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 12:26:45,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:26:45,264 INFO L82 PathProgramCache]: Analyzing trace with hash -960886539, now seen corresponding path program 1 times [2019-12-07 12:26:45,264 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 12:26:45,265 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1563832974] [2019-12-07 12:26:45,265 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_74222b51-48c1-43df-99b5-fad990262cd5/bin/utaipan/mathsat Starting monitored process 22 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with mathsat -unsat_core_generation=3 [2019-12-07 12:26:45,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:26:45,367 INFO L264 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 12:26:45,368 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:26:45,371 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-07 12:26:45,371 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:26:45,372 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:26:45,372 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:26:45,372 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 12:26:47,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:26:47,428 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:26:50,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:26:50,760 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1563832974] [2019-12-07 12:26:50,760 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:26:50,761 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 8 [2019-12-07 12:26:50,761 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474977891] [2019-12-07 12:26:50,761 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 12:26:50,761 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 12:26:50,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 12:26:50,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=46, Unknown=2, NotChecked=0, Total=72 [2019-12-07 12:26:50,761 INFO L87 Difference]: Start difference. First operand 84 states and 99 transitions. Second operand 9 states. [2019-12-07 12:26:58,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:26:58,957 INFO L93 Difference]: Finished difference Result 109 states and 126 transitions. [2019-12-07 12:26:58,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 12:26:58,958 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-12-07 12:26:58,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:26:58,958 INFO L225 Difference]: With dead ends: 109 [2019-12-07 12:26:58,959 INFO L226 Difference]: Without dead ends: 106 [2019-12-07 12:26:58,959 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=29, Invalid=59, Unknown=2, NotChecked=0, Total=90 [2019-12-07 12:26:58,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-12-07 12:26:58,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 104. [2019-12-07 12:26:58,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-12-07 12:26:58,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 123 transitions. [2019-12-07 12:26:58,961 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 123 transitions. Word has length 21 [2019-12-07 12:26:58,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:26:58,961 INFO L462 AbstractCegarLoop]: Abstraction has 104 states and 123 transitions. [2019-12-07 12:26:58,961 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 12:26:58,961 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 123 transitions. [2019-12-07 12:26:58,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 12:26:58,962 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:26:58,962 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:26:59,162 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 mathsat -unsat_core_generation=3 [2019-12-07 12:26:59,162 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 12:26:59,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:26:59,163 INFO L82 PathProgramCache]: Analyzing trace with hash -960832433, now seen corresponding path program 1 times [2019-12-07 12:26:59,163 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 12:26:59,163 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [893264057] [2019-12-07 12:26:59,163 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_74222b51-48c1-43df-99b5-fad990262cd5/bin/utaipan/mathsat Starting monitored process 23 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with mathsat -unsat_core_generation=3 [2019-12-07 12:26:59,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:26:59,228 INFO L264 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 25 conjunts are in the unsatisfiable core [2019-12-07 12:26:59,229 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:26:59,254 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:26:59,254 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 25 [2019-12-07 12:26:59,255 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:26:59,284 INFO L614 ElimStorePlain]: treesize reduction 10, result has 68.8 percent of original size [2019-12-07 12:26:59,284 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:26:59,284 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:13 [2019-12-07 12:26:59,303 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2019-12-07 12:26:59,303 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:26:59,316 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:26:59,316 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:26:59,316 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2019-12-07 12:26:59,490 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:26:59,490 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 23 [2019-12-07 12:26:59,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:26:59,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:26:59,491 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 12:26:59,505 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:26:59,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:26:59,505 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 12:26:59,506 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:29 [2019-12-07 12:26:59,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:26:59,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:26:59,829 WARN L192 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 18 [2019-12-07 12:26:59,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:27:00,112 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:27:00,112 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:27:01,020 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2019-12-07 12:27:01,042 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 27 [2019-12-07 12:27:01,043 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-12-07 12:27:01,047 INFO L614 ElimStorePlain]: treesize reduction 7, result has 46.2 percent of original size [2019-12-07 12:27:01,047 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:27:01,058 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2019-12-07 12:27:01,077 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 27 [2019-12-07 12:27:01,078 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2019-12-07 12:27:01,082 INFO L614 ElimStorePlain]: treesize reduction 7, result has 46.2 percent of original size [2019-12-07 12:27:01,082 INFO L534 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:27:01,109 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:27:01,110 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-07 12:27:01,110 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:49, output treesize:29 [2019-12-07 12:27:01,328 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:27:01,328 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [893264057] [2019-12-07 12:27:01,328 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [456922176] [2019-12-07 12:27:01,328 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_74222b51-48c1-43df-99b5-fad990262cd5/bin/utaipan/cvc4 Starting monitored process 24 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 12:27:01,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:27:01,420 INFO L264 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 23 conjunts are in the unsatisfiable core [2019-12-07 12:27:01,421 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:27:01,507 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:27:01,507 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 25 [2019-12-07 12:27:01,507 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:27:01,538 INFO L614 ElimStorePlain]: treesize reduction 10, result has 68.8 percent of original size [2019-12-07 12:27:01,539 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:27:01,539 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:17, output treesize:13 [2019-12-07 12:27:01,545 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2019-12-07 12:27:01,546 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:27:01,582 INFO L614 ElimStorePlain]: treesize reduction 12, result has 65.7 percent of original size [2019-12-07 12:27:01,582 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:27:01,582 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:39, output treesize:23 [2019-12-07 12:27:01,596 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:27:01,596 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 23 [2019-12-07 12:27:01,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:27:01,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:27:01,598 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 12:27:01,611 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:27:01,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:27:01,612 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 12:27:01,612 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:29 [2019-12-07 12:27:01,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:27:01,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:27:01,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:27:01,695 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:27:01,695 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:27:01,713 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2019-12-07 12:27:01,741 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 27 [2019-12-07 12:27:01,743 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-12-07 12:27:01,748 INFO L614 ElimStorePlain]: treesize reduction 7, result has 46.2 percent of original size [2019-12-07 12:27:01,748 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:27:01,767 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2019-12-07 12:27:01,800 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 27 [2019-12-07 12:27:01,802 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2019-12-07 12:27:01,806 INFO L614 ElimStorePlain]: treesize reduction 7, result has 46.2 percent of original size [2019-12-07 12:27:01,806 INFO L534 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:27:01,889 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:27:01,889 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-07 12:27:01,889 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:67, output treesize:47 [2019-12-07 12:27:02,206 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:27:02,206 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1761419327] [2019-12-07 12:27:02,206 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_74222b51-48c1-43df-99b5-fad990262cd5/bin/utaipan/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:27:02,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:27:02,254 INFO L264 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 24 conjunts are in the unsatisfiable core [2019-12-07 12:27:02,255 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:27:02,271 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:27:02,271 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 25 [2019-12-07 12:27:02,272 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:27:02,300 INFO L614 ElimStorePlain]: treesize reduction 10, result has 68.8 percent of original size [2019-12-07 12:27:02,301 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:27:02,301 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:17, output treesize:13 [2019-12-07 12:27:02,309 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2019-12-07 12:27:02,309 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:27:02,344 INFO L614 ElimStorePlain]: treesize reduction 21, result has 52.3 percent of original size [2019-12-07 12:27:02,344 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:27:02,344 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:48, output treesize:23 [2019-12-07 12:27:02,354 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:27:02,355 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 23 [2019-12-07 12:27:02,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:27:02,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:27:02,356 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 12:27:02,368 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:27:02,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:27:02,369 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 12:27:02,369 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:29 [2019-12-07 12:27:02,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:27:02,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:27:02,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:27:02,415 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:27:02,415 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:27:02,431 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2019-12-07 12:27:02,459 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 27 [2019-12-07 12:27:02,461 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-12-07 12:27:02,464 INFO L614 ElimStorePlain]: treesize reduction 7, result has 46.2 percent of original size [2019-12-07 12:27:02,464 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:27:02,483 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2019-12-07 12:27:02,512 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 27 [2019-12-07 12:27:02,513 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2019-12-07 12:27:02,517 INFO L614 ElimStorePlain]: treesize reduction 7, result has 46.2 percent of original size [2019-12-07 12:27:02,517 INFO L534 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:27:02,586 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:27:02,586 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-07 12:27:02,586 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:83, output treesize:63 [2019-12-07 12:27:02,884 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:27:02,884 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2019-12-07 12:27:02,884 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11, 10, 11, 10] total 25 [2019-12-07 12:27:02,884 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810761224] [2019-12-07 12:27:02,885 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-12-07 12:27:02,885 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 12:27:02,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-12-07 12:27:02,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=567, Unknown=0, NotChecked=0, Total=650 [2019-12-07 12:27:02,885 INFO L87 Difference]: Start difference. First operand 104 states and 123 transitions. Second operand 26 states. [2019-12-07 12:27:04,124 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2019-12-07 12:27:04,272 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 40 [2019-12-07 12:27:04,542 WARN L192 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 47 [2019-12-07 12:27:04,753 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 45 [2019-12-07 12:27:04,976 WARN L192 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 58 [2019-12-07 12:27:05,216 WARN L192 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 56 [2019-12-07 12:27:05,484 WARN L192 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 66 [2019-12-07 12:27:05,754 WARN L192 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 64 [2019-12-07 12:27:06,286 WARN L192 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 49 [2019-12-07 12:27:06,526 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 45 [2019-12-07 12:27:07,032 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 47 [2019-12-07 12:27:07,335 WARN L192 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 55 [2019-12-07 12:27:08,085 WARN L192 SmtUtils]: Spent 669.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 53 [2019-12-07 12:27:08,385 WARN L192 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 59 [2019-12-07 12:27:08,709 WARN L192 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2019-12-07 12:27:09,063 WARN L192 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 63 [2019-12-07 12:27:09,384 WARN L192 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 61 [2019-12-07 12:27:09,980 WARN L192 SmtUtils]: Spent 506.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 38 [2019-12-07 12:27:10,524 WARN L192 SmtUtils]: Spent 356.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 41 [2019-12-07 12:27:10,921 WARN L192 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 36 [2019-12-07 12:27:11,577 WARN L192 SmtUtils]: Spent 554.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 38 [2019-12-07 12:27:12,140 WARN L192 SmtUtils]: Spent 461.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 36 [2019-12-07 12:27:12,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:27:12,319 INFO L93 Difference]: Finished difference Result 146 states and 168 transitions. [2019-12-07 12:27:12,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-12-07 12:27:12,321 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 21 [2019-12-07 12:27:12,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:27:12,322 INFO L225 Difference]: With dead ends: 146 [2019-12-07 12:27:12,322 INFO L226 Difference]: Without dead ends: 146 [2019-12-07 12:27:12,323 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 91 SyntacticMatches, 5 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 482 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=703, Invalid=2159, Unknown=0, NotChecked=0, Total=2862 [2019-12-07 12:27:12,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-12-07 12:27:12,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 124. [2019-12-07 12:27:12,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-12-07 12:27:12,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 149 transitions. [2019-12-07 12:27:12,325 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 149 transitions. Word has length 21 [2019-12-07 12:27:12,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:27:12,325 INFO L462 AbstractCegarLoop]: Abstraction has 124 states and 149 transitions. [2019-12-07 12:27:12,325 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-12-07 12:27:12,325 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 149 transitions. [2019-12-07 12:27:12,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 12:27:12,326 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:27:12,326 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:27:12,926 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 mathsat -unsat_core_generation=3,24 cvc4 --incremental --print-success --lang smt --rewrite-divk,25 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:27:12,927 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 12:27:12,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:27:12,928 INFO L82 PathProgramCache]: Analyzing trace with hash -960834611, now seen corresponding path program 1 times [2019-12-07 12:27:12,928 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 12:27:12,929 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [966248572] [2019-12-07 12:27:12,929 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_74222b51-48c1-43df-99b5-fad990262cd5/bin/utaipan/mathsat Starting monitored process 26 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with mathsat -unsat_core_generation=3 [2019-12-07 12:27:12,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:27:13,003 INFO L264 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 20 conjunts are in the unsatisfiable core [2019-12-07 12:27:13,004 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:27:13,055 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-12-07 12:27:13,055 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:27:13,072 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:27:13,072 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 12:27:13,072 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2019-12-07 12:27:13,196 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 12:27:13,197 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:27:13,198 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 12 [2019-12-07 12:27:13,198 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:27:13,209 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:27:13,211 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:27:13,211 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:29, output treesize:5 [2019-12-07 12:27:13,256 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:27:13,257 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:27:13,381 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2019-12-07 12:27:13,383 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2019-12-07 12:27:13,384 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 12:27:13,385 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:27:13,385 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:27:13,386 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:27:13,387 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:27:13,387 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:6 [2019-12-07 12:27:13,521 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:27:13,521 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [966248572] [2019-12-07 12:27:13,522 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:27:13,522 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12, 11] imperfect sequences [] total 19 [2019-12-07 12:27:13,522 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063668359] [2019-12-07 12:27:13,522 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-07 12:27:13,522 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 12:27:13,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-07 12:27:13,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2019-12-07 12:27:13,523 INFO L87 Difference]: Start difference. First operand 124 states and 149 transitions. Second operand 19 states. [2019-12-07 12:27:14,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:27:14,665 INFO L93 Difference]: Finished difference Result 157 states and 181 transitions. [2019-12-07 12:27:14,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-07 12:27:14,666 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 21 [2019-12-07 12:27:14,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:27:14,667 INFO L225 Difference]: With dead ends: 157 [2019-12-07 12:27:14,667 INFO L226 Difference]: Without dead ends: 147 [2019-12-07 12:27:14,668 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=210, Invalid=602, Unknown=0, NotChecked=0, Total=812 [2019-12-07 12:27:14,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-12-07 12:27:14,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 126. [2019-12-07 12:27:14,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-12-07 12:27:14,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 152 transitions. [2019-12-07 12:27:14,670 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 152 transitions. Word has length 21 [2019-12-07 12:27:14,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:27:14,670 INFO L462 AbstractCegarLoop]: Abstraction has 126 states and 152 transitions. [2019-12-07 12:27:14,670 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-07 12:27:14,671 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 152 transitions. [2019-12-07 12:27:14,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 12:27:14,671 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:27:14,671 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:27:14,871 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 mathsat -unsat_core_generation=3 [2019-12-07 12:27:14,872 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 12:27:14,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:27:14,872 INFO L82 PathProgramCache]: Analyzing trace with hash -655685575, now seen corresponding path program 1 times [2019-12-07 12:27:14,872 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 12:27:14,872 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [462958387] [2019-12-07 12:27:14,872 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_74222b51-48c1-43df-99b5-fad990262cd5/bin/utaipan/mathsat Starting monitored process 27 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with mathsat -unsat_core_generation=3 [2019-12-07 12:27:14,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:27:14,942 INFO L264 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 12:27:14,943 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:27:14,946 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-07 12:27:14,946 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:27:14,947 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:27:14,948 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:27:14,948 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 12:27:17,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:27:17,012 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:27:19,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:27:19,099 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [462958387] [2019-12-07 12:27:19,099 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:27:19,099 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 8 [2019-12-07 12:27:19,099 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964470521] [2019-12-07 12:27:19,099 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 12:27:19,099 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 12:27:19,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 12:27:19,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=46, Unknown=2, NotChecked=0, Total=72 [2019-12-07 12:27:19,100 INFO L87 Difference]: Start difference. First operand 126 states and 152 transitions. Second operand 9 states. [2019-12-07 12:27:29,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:27:29,318 INFO L93 Difference]: Finished difference Result 127 states and 151 transitions. [2019-12-07 12:27:29,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 12:27:29,318 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-12-07 12:27:29,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:27:29,319 INFO L225 Difference]: With dead ends: 127 [2019-12-07 12:27:29,319 INFO L226 Difference]: Without dead ends: 112 [2019-12-07 12:27:29,319 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=29, Invalid=59, Unknown=2, NotChecked=0, Total=90 [2019-12-07 12:27:29,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-12-07 12:27:29,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 79. [2019-12-07 12:27:29,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-12-07 12:27:29,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 91 transitions. [2019-12-07 12:27:29,321 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 91 transitions. Word has length 21 [2019-12-07 12:27:29,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:27:29,321 INFO L462 AbstractCegarLoop]: Abstraction has 79 states and 91 transitions. [2019-12-07 12:27:29,321 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 12:27:29,321 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 91 transitions. [2019-12-07 12:27:29,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-07 12:27:29,321 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:27:29,321 INFO L410 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2019-12-07 12:27:29,522 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 mathsat -unsat_core_generation=3 [2019-12-07 12:27:29,522 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 12:27:29,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:27:29,522 INFO L82 PathProgramCache]: Analyzing trace with hash -591263241, now seen corresponding path program 2 times [2019-12-07 12:27:29,523 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 12:27:29,523 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1399248040] [2019-12-07 12:27:29,523 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_74222b51-48c1-43df-99b5-fad990262cd5/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 [2019-12-07 12:27:29,563 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 12:27:29,563 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 12:27:29,565 INFO L264 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-07 12:27:29,566 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:27:29,572 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_55|], 1=[|v_#valid_69|]} [2019-12-07 12:27:29,578 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:27:29,578 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-12-07 12:27:29,578 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:27:29,596 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:27:29,601 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-12-07 12:27:29,601 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 12:27:29,617 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:27:29,617 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:27:29,617 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:16 [2019-12-07 12:27:29,843 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:27:29,843 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:27:30,893 INFO L430 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2019-12-07 12:27:30,897 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:27:30,897 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:27:30,898 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:27:30,898 INFO L502 ElimStorePlain]: Eliminatee |#length| vanished before elimination [2019-12-07 12:27:30,898 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:27:30,898 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:39, output treesize:1 [2019-12-07 12:27:30,901 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:27:30,901 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1399248040] [2019-12-07 12:27:30,901 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [793888411] [2019-12-07 12:27:30,901 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_74222b51-48c1-43df-99b5-fad990262cd5/bin/utaipan/cvc4 Starting monitored process 29 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 12:27:30,986 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 12:27:30,986 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 12:27:30,987 INFO L264 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 15 conjunts are in the unsatisfiable core [2019-12-07 12:27:30,988 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:27:30,990 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_57|], 1=[|v_#valid_71|]} [2019-12-07 12:27:30,994 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:27:30,995 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-12-07 12:27:30,995 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:27:31,011 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:27:31,016 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-12-07 12:27:31,016 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 12:27:31,032 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:27:31,032 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:27:31,032 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:16 [2019-12-07 12:27:31,518 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:27:31,518 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:27:33,305 INFO L430 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2019-12-07 12:27:33,309 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:27:33,310 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:27:33,311 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:27:33,311 INFO L502 ElimStorePlain]: Eliminatee |#length| vanished before elimination [2019-12-07 12:27:33,311 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:27:33,311 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:45, output treesize:1 [2019-12-07 12:27:33,313 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:27:33,313 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1118477045] [2019-12-07 12:27:33,313 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_74222b51-48c1-43df-99b5-fad990262cd5/bin/utaipan/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:27:33,353 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 12:27:33,353 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 12:27:33,355 INFO L264 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-07 12:27:33,356 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:27:33,358 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_59|], 1=[|v_#valid_73|]} [2019-12-07 12:27:33,362 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:27:33,363 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-12-07 12:27:33,363 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:27:33,378 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:27:33,382 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-12-07 12:27:33,383 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 12:27:33,396 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:27:33,397 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:27:33,397 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:16 [2019-12-07 12:27:33,505 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:27:33,505 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:27:33,510 INFO L430 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2019-12-07 12:27:33,513 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:27:33,514 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:27:33,515 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:27:33,515 INFO L502 ElimStorePlain]: Eliminatee |#length| vanished before elimination [2019-12-07 12:27:33,515 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:27:33,515 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:39, output treesize:1 [2019-12-07 12:27:33,517 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:27:33,517 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2019-12-07 12:27:33,517 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9, 9, 8, 8] total 29 [2019-12-07 12:27:33,517 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200699243] [2019-12-07 12:27:33,518 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-12-07 12:27:33,518 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 12:27:33,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-12-07 12:27:33,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=655, Unknown=0, NotChecked=0, Total=870 [2019-12-07 12:27:33,518 INFO L87 Difference]: Start difference. First operand 79 states and 91 transitions. Second operand 30 states. [2019-12-07 12:27:36,308 WARN L192 SmtUtils]: Spent 1.43 s on a formula simplification. DAG size of input: 62 DAG size of output: 61 [2019-12-07 12:27:37,691 WARN L192 SmtUtils]: Spent 1.20 s on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2019-12-07 12:27:41,026 WARN L192 SmtUtils]: Spent 1.07 s on a formula simplification. DAG size of input: 51 DAG size of output: 50 [2019-12-07 12:27:41,954 WARN L192 SmtUtils]: Spent 673.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 43 [2019-12-07 12:27:43,692 WARN L192 SmtUtils]: Spent 1.43 s on a formula simplification. DAG size of input: 58 DAG size of output: 57 [2019-12-07 12:27:45,713 WARN L192 SmtUtils]: Spent 692.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 39 [2019-12-07 12:27:46,425 WARN L192 SmtUtils]: Spent 393.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 32 [2019-12-07 12:27:47,696 WARN L192 SmtUtils]: Spent 905.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 52 [2019-12-07 12:27:49,177 WARN L192 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 28 [2019-12-07 12:27:49,775 WARN L192 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 17 [2019-12-07 12:27:50,645 WARN L192 SmtUtils]: Spent 534.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 42 [2019-12-07 12:27:51,913 WARN L192 SmtUtils]: Spent 444.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 38 [2019-12-07 12:27:52,986 WARN L192 SmtUtils]: Spent 499.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 38 [2019-12-07 12:27:53,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:27:53,953 INFO L93 Difference]: Finished difference Result 457 states and 515 transitions. [2019-12-07 12:27:53,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-07 12:27:53,955 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 23 [2019-12-07 12:27:53,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:27:53,957 INFO L225 Difference]: With dead ends: 457 [2019-12-07 12:27:53,957 INFO L226 Difference]: Without dead ends: 457 [2019-12-07 12:27:53,958 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 101 SyntacticMatches, 3 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 785 ImplicationChecksByTransitivity, 16.9s TimeCoverageRelationStatistics Valid=665, Invalid=1785, Unknown=0, NotChecked=0, Total=2450 [2019-12-07 12:27:53,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2019-12-07 12:27:53,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 127. [2019-12-07 12:27:53,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-12-07 12:27:53,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 145 transitions. [2019-12-07 12:27:53,961 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 145 transitions. Word has length 23 [2019-12-07 12:27:53,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:27:53,961 INFO L462 AbstractCegarLoop]: Abstraction has 127 states and 145 transitions. [2019-12-07 12:27:53,961 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-12-07 12:27:53,961 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 145 transitions. [2019-12-07 12:27:53,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 12:27:53,962 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:27:53,962 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:27:54,563 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 z3 -smt2 -in SMTLIB2_COMPLIANT=true,28 mathsat -unsat_core_generation=3,29 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 12:27:54,563 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 12:27:54,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:27:54,564 INFO L82 PathProgramCache]: Analyzing trace with hash -278256, now seen corresponding path program 1 times [2019-12-07 12:27:54,564 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 12:27:54,564 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2005219035] [2019-12-07 12:27:54,564 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_74222b51-48c1-43df-99b5-fad990262cd5/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 [2019-12-07 12:27:54,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:27:54,625 INFO L264 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 20 conjunts are in the unsatisfiable core [2019-12-07 12:27:54,626 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:27:54,631 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-12-07 12:27:54,631 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:27:54,637 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:27:54,637 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:27:54,637 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-12-07 12:27:54,647 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2019-12-07 12:27:54,647 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:27:54,652 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:27:54,653 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:27:54,653 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2019-12-07 12:27:54,664 INFO L377 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 [2019-12-07 12:27:54,664 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:27:54,684 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:27:54,684 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-12-07 12:27:54,684 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:31, output treesize:27 [2019-12-07 12:27:54,790 INFO L377 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 [2019-12-07 12:27:54,791 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:27:54,796 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:27:54,796 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:27:54,797 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:32, output treesize:5 [2019-12-07 12:27:54,852 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 12:27:54,852 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:27:55,037 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2019-12-07 12:27:55,039 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2019-12-07 12:27:55,040 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 12:27:55,042 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:27:55,042 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:27:55,043 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:27:55,043 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:27:55,043 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:6 [2019-12-07 12:27:55,046 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 12:27:55,046 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2005219035] [2019-12-07 12:27:55,046 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:27:55,046 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11, 9] imperfect sequences [] total 15 [2019-12-07 12:27:55,046 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525807476] [2019-12-07 12:27:55,046 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-07 12:27:55,046 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 12:27:55,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-07 12:27:55,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2019-12-07 12:27:55,047 INFO L87 Difference]: Start difference. First operand 127 states and 145 transitions. Second operand 15 states. [2019-12-07 12:27:55,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:27:55,743 INFO L93 Difference]: Finished difference Result 157 states and 176 transitions. [2019-12-07 12:27:55,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 12:27:55,745 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 25 [2019-12-07 12:27:55,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:27:55,745 INFO L225 Difference]: With dead ends: 157 [2019-12-07 12:27:55,745 INFO L226 Difference]: Without dead ends: 157 [2019-12-07 12:27:55,746 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=106, Invalid=356, Unknown=0, NotChecked=0, Total=462 [2019-12-07 12:27:55,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-12-07 12:27:55,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 156. [2019-12-07 12:27:55,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2019-12-07 12:27:55,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 176 transitions. [2019-12-07 12:27:55,748 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 176 transitions. Word has length 25 [2019-12-07 12:27:55,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:27:55,748 INFO L462 AbstractCegarLoop]: Abstraction has 156 states and 176 transitions. [2019-12-07 12:27:55,748 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-07 12:27:55,748 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 176 transitions. [2019-12-07 12:27:55,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 12:27:55,749 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:27:55,749 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:27:55,949 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 mathsat -unsat_core_generation=3 [2019-12-07 12:27:55,950 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 12:27:55,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:27:55,951 INFO L82 PathProgramCache]: Analyzing trace with hash -1805716590, now seen corresponding path program 1 times [2019-12-07 12:27:55,951 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 12:27:55,951 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [562742014] [2019-12-07 12:27:55,952 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_74222b51-48c1-43df-99b5-fad990262cd5/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 [2019-12-07 12:27:56,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:27:56,032 INFO L264 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 26 conjunts are in the unsatisfiable core [2019-12-07 12:27:56,033 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:27:56,039 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_62|], 1=[|v_#valid_77|]} [2019-12-07 12:27:56,042 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:27:56,043 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-12-07 12:27:56,043 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:27:56,056 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:27:56,061 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-12-07 12:27:56,061 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 12:27:56,073 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:27:56,073 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:27:56,073 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:22 [2019-12-07 12:27:56,095 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2019-12-07 12:27:56,095 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:27:56,119 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:27:56,119 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:27:56,119 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:32 [2019-12-07 12:27:56,156 INFO L377 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 [2019-12-07 12:27:56,157 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:27:56,191 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:27:56,191 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 12:27:56,191 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:40 [2019-12-07 12:27:56,393 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:27:56,393 INFO L377 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 36 treesize of output 27 [2019-12-07 12:27:56,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:27:56,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:27:56,394 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 12:27:56,410 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:27:56,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:27:56,411 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 12:27:56,411 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:51, output treesize:31 [2019-12-07 12:27:56,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:27:56,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:27:56,740 WARN L192 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 21 [2019-12-07 12:27:56,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:27:57,099 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 12:27:57,100 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:27:58,833 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2019-12-07 12:27:58,851 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2019-12-07 12:27:58,852 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-12-07 12:27:58,865 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:27:58,866 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-12-07 12:27:58,952 INFO L614 ElimStorePlain]: treesize reduction 18, result has 75.7 percent of original size [2019-12-07 12:27:58,958 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2019-12-07 12:27:58,976 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2019-12-07 12:27:58,976 INFO L534 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-12-07 12:27:58,989 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:27:58,990 INFO L534 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-12-07 12:27:59,082 INFO L614 ElimStorePlain]: treesize reduction 18, result has 73.9 percent of original size [2019-12-07 12:27:59,084 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-07 12:27:59,084 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:61, output treesize:29 [2019-12-07 12:27:59,236 INFO L430 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2019-12-07 12:27:59,241 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-12-07 12:27:59,241 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:27:59,251 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:27:59,253 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 12:27:59,253 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 12:27:59,261 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:27:59,262 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:27:59,262 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:24, output treesize:7 [2019-12-07 12:27:59,344 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 12:27:59,344 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [562742014] [2019-12-07 12:27:59,344 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1609102854] [2019-12-07 12:27:59,344 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_74222b51-48c1-43df-99b5-fad990262cd5/bin/utaipan/cvc4 Starting monitored process 33 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 12:27:59,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:27:59,461 INFO L264 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 30 conjunts are in the unsatisfiable core [2019-12-07 12:27:59,462 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:27:59,467 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-12-07 12:27:59,467 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:27:59,477 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:27:59,478 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:27:59,478 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2019-12-07 12:27:59,574 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-12-07 12:27:59,574 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:27:59,633 INFO L614 ElimStorePlain]: treesize reduction 8, result has 80.5 percent of original size [2019-12-07 12:27:59,634 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 12:27:59,634 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:45, output treesize:33 [2019-12-07 12:27:59,760 INFO L377 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 [2019-12-07 12:27:59,760 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:27:59,795 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:27:59,796 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-12-07 12:27:59,796 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:40 [2019-12-07 12:28:06,243 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:28:06,243 INFO L377 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 [2019-12-07 12:28:06,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:28:06,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:28:06,244 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 12:28:06,264 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:28:06,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:28:06,264 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 12:28:06,264 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:49, output treesize:32 [2019-12-07 12:28:06,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:28:06,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:28:07,499 WARN L192 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 27 [2019-12-07 12:28:08,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:28:09,416 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 12:28:09,416 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:28:10,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:28:10,204 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2019-12-07 12:28:10,204 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 12:28:10,229 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2019-12-07 12:28:10,229 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 12:28:10,345 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2019-12-07 12:28:10,345 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:28:10,363 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2019-12-07 12:28:10,405 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2019-12-07 12:28:10,406 INFO L534 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-12-07 12:28:10,421 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:28:10,422 INFO L534 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-12-07 12:28:10,439 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2019-12-07 12:28:10,475 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2019-12-07 12:28:10,476 INFO L534 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-12-07 12:28:10,490 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:28:10,490 INFO L534 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-12-07 12:28:10,728 WARN L192 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 42 [2019-12-07 12:28:10,729 INFO L614 ElimStorePlain]: treesize reduction 36, result has 68.7 percent of original size [2019-12-07 12:28:10,731 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-12-07 12:28:10,731 INFO L239 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:95, output treesize:57 [2019-12-07 12:28:11,192 WARN L192 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 22 [2019-12-07 12:28:11,204 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 12:28:11,204 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [215328687] [2019-12-07 12:28:11,204 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_74222b51-48c1-43df-99b5-fad990262cd5/bin/utaipan/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:28:11,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:28:11,246 INFO L264 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 27 conjunts are in the unsatisfiable core [2019-12-07 12:28:11,247 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:28:11,249 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_65|], 1=[|v_#valid_81|]} [2019-12-07 12:28:11,253 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:28:11,254 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-12-07 12:28:11,254 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:28:11,267 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:28:11,272 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-12-07 12:28:11,272 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 12:28:11,285 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:28:11,285 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:28:11,285 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:22 [2019-12-07 12:28:11,292 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2019-12-07 12:28:11,292 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:28:11,338 INFO L614 ElimStorePlain]: treesize reduction 12, result has 72.7 percent of original size [2019-12-07 12:28:11,338 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:28:11,339 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:48, output treesize:32 [2019-12-07 12:28:11,344 INFO L377 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 [2019-12-07 12:28:11,345 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:28:11,374 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:28:11,375 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 12:28:11,375 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:40 [2019-12-07 12:28:11,390 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:28:11,391 INFO L377 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 36 treesize of output 27 [2019-12-07 12:28:11,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:28:11,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:28:11,391 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 12:28:11,412 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:28:11,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:28:11,413 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 12:28:11,413 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:51, output treesize:31 [2019-12-07 12:28:11,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:28:11,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:28:11,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:28:11,490 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 12:28:11,490 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:28:12,468 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2019-12-07 12:28:12,496 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2019-12-07 12:28:12,496 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-12-07 12:28:12,507 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:28:12,508 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-12-07 12:28:12,702 WARN L192 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 43 [2019-12-07 12:28:12,702 INFO L614 ElimStorePlain]: treesize reduction 18, result has 80.4 percent of original size [2019-12-07 12:28:12,718 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2019-12-07 12:28:12,754 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2019-12-07 12:28:12,754 INFO L534 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-12-07 12:28:12,766 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:28:12,766 INFO L534 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-12-07 12:28:12,964 WARN L192 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 38 [2019-12-07 12:28:12,964 INFO L614 ElimStorePlain]: treesize reduction 18, result has 79.3 percent of original size [2019-12-07 12:28:12,967 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-07 12:28:12,967 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:79, output treesize:47 [2019-12-07 12:28:13,303 INFO L430 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2019-12-07 12:28:13,306 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:28:13,307 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:28:13,308 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:28:13,308 INFO L502 ElimStorePlain]: Eliminatee |#length| vanished before elimination [2019-12-07 12:28:13,308 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:28:13,308 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:30, output treesize:1 [2019-12-07 12:28:13,311 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 12:28:13,311 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2019-12-07 12:28:13,311 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 12, 10, 12, 10] total 34 [2019-12-07 12:28:13,311 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251317762] [2019-12-07 12:28:13,312 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-12-07 12:28:13,312 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 12:28:13,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-12-07 12:28:13,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=1048, Unknown=3, NotChecked=0, Total=1190 [2019-12-07 12:28:13,312 INFO L87 Difference]: Start difference. First operand 156 states and 176 transitions. Second operand 35 states. [2019-12-07 12:28:13,772 WARN L192 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 29 [2019-12-07 12:28:22,756 WARN L192 SmtUtils]: Spent 8.14 s on a formula simplification. DAG size of input: 48 DAG size of output: 39 [2019-12-07 12:28:31,348 WARN L192 SmtUtils]: Spent 8.45 s on a formula simplification. DAG size of input: 70 DAG size of output: 51 [2019-12-07 12:28:44,040 WARN L192 SmtUtils]: Spent 12.36 s on a formula simplification. DAG size of input: 75 DAG size of output: 58 [2019-12-07 12:28:56,660 WARN L192 SmtUtils]: Spent 12.45 s on a formula simplification. DAG size of input: 89 DAG size of output: 69 [2019-12-07 12:29:05,105 WARN L192 SmtUtils]: Spent 8.24 s on a formula simplification. DAG size of input: 63 DAG size of output: 54 [2019-12-07 12:29:13,558 WARN L192 SmtUtils]: Spent 8.27 s on a formula simplification. DAG size of input: 67 DAG size of output: 58 [2019-12-07 12:29:22,939 WARN L192 SmtUtils]: Spent 8.23 s on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2019-12-07 12:29:31,284 WARN L192 SmtUtils]: Spent 8.19 s on a formula simplification. DAG size of input: 57 DAG size of output: 48 [2019-12-07 12:29:45,905 WARN L192 SmtUtils]: Spent 8.26 s on a formula simplification. DAG size of input: 62 DAG size of output: 53 [2019-12-07 12:30:00,430 WARN L192 SmtUtils]: Spent 8.21 s on a formula simplification. DAG size of input: 54 DAG size of output: 45 [2019-12-07 12:30:00,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:30:00,683 INFO L93 Difference]: Finished difference Result 178 states and 201 transitions. [2019-12-07 12:30:00,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-07 12:30:00,685 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 25 [2019-12-07 12:30:00,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:30:00,685 INFO L225 Difference]: With dead ends: 178 [2019-12-07 12:30:00,686 INFO L226 Difference]: Without dead ends: 178 [2019-12-07 12:30:00,686 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 93 SyntacticMatches, 19 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 815 ImplicationChecksByTransitivity, 120.1s TimeCoverageRelationStatistics Valid=400, Invalid=1847, Unknown=9, NotChecked=0, Total=2256 [2019-12-07 12:30:00,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2019-12-07 12:30:00,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 176. [2019-12-07 12:30:00,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2019-12-07 12:30:00,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 200 transitions. [2019-12-07 12:30:00,689 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 200 transitions. Word has length 25 [2019-12-07 12:30:00,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:30:00,689 INFO L462 AbstractCegarLoop]: Abstraction has 176 states and 200 transitions. [2019-12-07 12:30:00,689 INFO L463 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-12-07 12:30:00,689 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 200 transitions. [2019-12-07 12:30:00,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 12:30:00,689 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:30:00,689 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:30:01,291 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 mathsat -unsat_core_generation=3,34 z3 -smt2 -in SMTLIB2_COMPLIANT=true,33 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 12:30:01,292 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 12:30:01,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:30:01,292 INFO L82 PathProgramCache]: Analyzing trace with hash -1828996195, now seen corresponding path program 2 times [2019-12-07 12:30:01,293 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 12:30:01,293 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1099068967] [2019-12-07 12:30:01,293 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_74222b51-48c1-43df-99b5-fad990262cd5/bin/utaipan/mathsat Starting monitored process 35 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with mathsat -unsat_core_generation=3 [2019-12-07 12:30:01,361 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 12:30:01,361 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 12:30:01,366 INFO L264 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 26 conjunts are in the unsatisfiable core [2019-12-07 12:30:01,366 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:30:01,374 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_67|], 1=[|v_#valid_83|]} [2019-12-07 12:30:01,379 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:30:01,379 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-12-07 12:30:01,380 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:30:01,397 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:30:01,402 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-12-07 12:30:01,402 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 12:30:01,420 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:30:01,420 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:30:01,420 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:16 [2019-12-07 12:30:01,575 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 12:30:01,575 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:30:02,360 INFO L430 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2019-12-07 12:30:02,363 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:30:02,364 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:30:02,365 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:30:02,365 INFO L502 ElimStorePlain]: Eliminatee |#length| vanished before elimination [2019-12-07 12:30:02,365 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:30:02,365 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:38, output treesize:1 [2019-12-07 12:30:02,368 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 12:30:02,368 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1099068967] [2019-12-07 12:30:02,368 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1649360754] [2019-12-07 12:30:02,368 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_74222b51-48c1-43df-99b5-fad990262cd5/bin/utaipan/cvc4 Starting monitored process 36 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 12:30:02,497 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 12:30:02,497 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 12:30:02,499 INFO L264 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 26 conjunts are in the unsatisfiable core [2019-12-07 12:30:02,500 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:30:02,501 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_69|], 1=[|v_#valid_85|]} [2019-12-07 12:30:02,505 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:30:02,506 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-12-07 12:30:02,506 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:30:02,522 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:30:02,526 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-12-07 12:30:02,527 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 12:30:02,541 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:30:02,542 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:30:02,542 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:16 [2019-12-07 12:30:02,549 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 12:30:02,549 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:30:02,556 INFO L430 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2019-12-07 12:30:02,560 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:30:02,560 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:30:02,561 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:30:02,562 INFO L502 ElimStorePlain]: Eliminatee |#length| vanished before elimination [2019-12-07 12:30:02,562 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:30:02,562 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:38, output treesize:1 [2019-12-07 12:30:02,565 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 12:30:02,565 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [737609557] [2019-12-07 12:30:02,565 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_74222b51-48c1-43df-99b5-fad990262cd5/bin/utaipan/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:30:02,610 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 12:30:02,610 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 12:30:02,613 INFO L264 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 26 conjunts are in the unsatisfiable core [2019-12-07 12:30:02,614 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:30:02,616 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_71|], 1=[|v_#valid_87|]} [2019-12-07 12:30:02,621 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:30:02,621 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-12-07 12:30:02,622 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:30:02,639 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:30:02,645 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-12-07 12:30:02,645 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 12:30:02,663 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:30:02,663 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:30:02,664 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:16 [2019-12-07 12:30:02,670 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 12:30:02,671 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:30:02,675 INFO L430 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2019-12-07 12:30:02,679 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:30:02,680 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:30:02,681 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:30:02,681 INFO L502 ElimStorePlain]: Eliminatee |#length| vanished before elimination [2019-12-07 12:30:02,681 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:30:02,681 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:38, output treesize:1 [2019-12-07 12:30:02,684 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 12:30:02,684 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2019-12-07 12:30:02,684 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 8, 8, 8] total 15 [2019-12-07 12:30:02,685 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302400290] [2019-12-07 12:30:02,685 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-07 12:30:02,685 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 12:30:02,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-07 12:30:02,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2019-12-07 12:30:02,685 INFO L87 Difference]: Start difference. First operand 176 states and 200 transitions. Second operand 15 states. [2019-12-07 12:30:03,358 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 34 [2019-12-07 12:30:03,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:30:03,982 INFO L93 Difference]: Finished difference Result 208 states and 235 transitions. [2019-12-07 12:30:03,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 12:30:03,984 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 33 [2019-12-07 12:30:03,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:30:03,985 INFO L225 Difference]: With dead ends: 208 [2019-12-07 12:30:03,985 INFO L226 Difference]: Without dead ends: 206 [2019-12-07 12:30:03,985 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 176 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=111, Invalid=351, Unknown=0, NotChecked=0, Total=462 [2019-12-07 12:30:03,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2019-12-07 12:30:03,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 176. [2019-12-07 12:30:03,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2019-12-07 12:30:03,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 200 transitions. [2019-12-07 12:30:03,988 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 200 transitions. Word has length 33 [2019-12-07 12:30:03,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:30:03,988 INFO L462 AbstractCegarLoop]: Abstraction has 176 states and 200 transitions. [2019-12-07 12:30:03,988 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-07 12:30:03,988 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 200 transitions. [2019-12-07 12:30:03,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-07 12:30:03,988 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:30:03,989 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:30:04,590 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 mathsat -unsat_core_generation=3,37 z3 -smt2 -in SMTLIB2_COMPLIANT=true,36 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 12:30:04,590 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 12:30:04,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:30:04,590 INFO L82 PathProgramCache]: Analyzing trace with hash -964759118, now seen corresponding path program 1 times [2019-12-07 12:30:04,591 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 12:30:04,591 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [422815717] [2019-12-07 12:30:04,591 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_74222b51-48c1-43df-99b5-fad990262cd5/bin/utaipan/mathsat Starting monitored process 38 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with mathsat -unsat_core_generation=3 [2019-12-07 12:30:04,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:30:04,655 INFO L264 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 31 conjunts are in the unsatisfiable core [2019-12-07 12:30:04,656 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:30:04,676 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:30:04,676 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 25 [2019-12-07 12:30:04,677 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:30:04,706 INFO L614 ElimStorePlain]: treesize reduction 10, result has 68.8 percent of original size [2019-12-07 12:30:04,707 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:30:04,707 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:17, output treesize:13 [2019-12-07 12:30:05,145 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:30:05,145 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:30:07,547 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:30:07,547 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [422815717] [2019-12-07 12:30:07,547 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [923067725] [2019-12-07 12:30:07,547 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_74222b51-48c1-43df-99b5-fad990262cd5/bin/utaipan/cvc4 Starting monitored process 39 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 12:30:07,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:30:07,659 INFO L264 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 24 conjunts are in the unsatisfiable core [2019-12-07 12:30:07,659 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:30:08,340 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-12-07 12:30:08,340 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:30:08,353 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:30:08,354 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 12:30:08,354 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:26 [2019-12-07 12:30:09,038 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 12:30:09,040 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:30:09,040 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 12 [2019-12-07 12:30:09,040 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:30:09,048 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:30:09,049 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:30:09,049 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:5 [2019-12-07 12:30:09,291 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 12:30:09,292 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:30:10,149 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2019-12-07 12:30:10,151 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2019-12-07 12:30:10,152 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 12:30:10,153 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:30:10,154 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:30:10,155 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:30:10,155 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:30:10,155 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:8 [2019-12-07 12:30:10,894 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 12:30:10,895 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1209130453] [2019-12-07 12:30:10,895 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_74222b51-48c1-43df-99b5-fad990262cd5/bin/utaipan/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:30:10,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:30:10,939 INFO L264 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 26 conjunts are in the unsatisfiable core [2019-12-07 12:30:10,940 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:30:10,954 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:30:10,955 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 25 [2019-12-07 12:30:10,955 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:30:10,984 INFO L614 ElimStorePlain]: treesize reduction 10, result has 68.8 percent of original size [2019-12-07 12:30:10,984 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:30:10,984 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:17, output treesize:13 [2019-12-07 12:30:12,415 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:30:12,415 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:30:14,610 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:30:14,610 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2019-12-07 12:30:14,610 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 15, 13, 13, 12] total 63 [2019-12-07 12:30:14,610 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058451022] [2019-12-07 12:30:14,611 INFO L442 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-12-07 12:30:14,611 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 12:30:14,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-12-07 12:30:14,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=301, Invalid=3605, Unknown=0, NotChecked=0, Total=3906 [2019-12-07 12:30:14,612 INFO L87 Difference]: Start difference. First operand 176 states and 200 transitions. Second operand 63 states. [2019-12-07 12:30:16,460 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 40 [2019-12-07 12:30:17,465 WARN L192 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 53 [2019-12-07 12:30:17,919 WARN L192 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 60 [2019-12-07 12:30:18,366 WARN L192 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 54 [2019-12-07 12:30:18,855 WARN L192 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 64 [2019-12-07 12:30:19,307 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 29 [2019-12-07 12:30:19,731 WARN L192 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 67 [2019-12-07 12:30:20,161 WARN L192 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 69 [2019-12-07 12:30:20,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:30:20,527 INFO L93 Difference]: Finished difference Result 235 states and 260 transitions. [2019-12-07 12:30:20,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-07 12:30:20,529 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 35 [2019-12-07 12:30:20,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:30:20,530 INFO L225 Difference]: With dead ends: 235 [2019-12-07 12:30:20,530 INFO L226 Difference]: Without dead ends: 212 [2019-12-07 12:30:20,531 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 136 SyntacticMatches, 7 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1494 ImplicationChecksByTransitivity, 13.4s TimeCoverageRelationStatistics Valid=747, Invalid=4953, Unknown=0, NotChecked=0, Total=5700 [2019-12-07 12:30:20,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2019-12-07 12:30:20,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 205. [2019-12-07 12:30:20,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2019-12-07 12:30:20,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 231 transitions. [2019-12-07 12:30:20,534 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 231 transitions. Word has length 35 [2019-12-07 12:30:20,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:30:20,534 INFO L462 AbstractCegarLoop]: Abstraction has 205 states and 231 transitions. [2019-12-07 12:30:20,534 INFO L463 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-12-07 12:30:20,534 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 231 transitions. [2019-12-07 12:30:20,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-07 12:30:20,534 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:30:20,535 INFO L410 BasicCegarLoop]: trace histogram [3, 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] [2019-12-07 12:30:21,136 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 cvc4 --incremental --print-success --lang smt --rewrite-divk,38 mathsat -unsat_core_generation=3,40 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:30:21,137 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 12:30:21,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:30:21,137 INFO L82 PathProgramCache]: Analyzing trace with hash -988436448, now seen corresponding path program 1 times [2019-12-07 12:30:21,138 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 12:30:21,138 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1223754721] [2019-12-07 12:30:21,139 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_74222b51-48c1-43df-99b5-fad990262cd5/bin/utaipan/mathsat Starting monitored process 41 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with mathsat -unsat_core_generation=3 [2019-12-07 12:30:21,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:30:21,276 INFO L264 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 43 conjunts are in the unsatisfiable core [2019-12-07 12:30:21,277 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:30:21,282 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_77|], 1=[|v_#valid_91|]} [2019-12-07 12:30:21,286 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:30:21,287 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-12-07 12:30:21,287 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:30:21,305 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:30:21,310 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-12-07 12:30:21,310 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 12:30:21,323 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:30:21,323 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:30:21,324 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:22 [2019-12-07 12:30:21,346 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2019-12-07 12:30:21,346 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:30:21,366 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:30:21,366 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:30:21,366 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:32 [2019-12-07 12:30:21,401 INFO L377 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 [2019-12-07 12:30:21,401 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:30:21,429 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:30:21,429 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 12:30:21,429 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:40 [2019-12-07 12:30:22,816 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:30:22,816 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 54 treesize of output 84 [2019-12-07 12:30:22,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:30:22,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:30:22,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:30:22,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:30:22,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:30:22,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:30:22,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:30:22,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:30:22,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:30:22,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:30:22,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:30:22,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:30:22,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:30:22,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:30:22,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:30:22,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:30:22,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:30:22,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:30:22,823 INFO L534 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 12:30:23,022 WARN L192 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 55 [2019-12-07 12:30:23,022 INFO L614 ElimStorePlain]: treesize reduction 8, result has 91.9 percent of original size [2019-12-07 12:30:23,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:30:23,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:30:23,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:30:23,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:30:23,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:30:23,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:30:23,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:30:23,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:30:23,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:30:23,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:30:23,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:30:23,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:30:23,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:30:23,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:30:23,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:30:23,028 INFO L534 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. [2019-12-07 12:30:23,029 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:74, output treesize:91 [2019-12-07 12:30:23,449 WARN L192 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 40 [2019-12-07 12:30:23,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:30:23,872 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 12:30:23,873 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:30:30,729 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2019-12-07 12:30:30,774 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:30:30,775 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 482 treesize of output 451 [2019-12-07 12:30:30,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:30:30,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:30:30,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:30:30,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:30:30,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:30:30,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:30:30,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:30:30,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:30:30,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:30:30,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:30:30,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:30:30,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:30:30,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:30:30,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:30:30,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:30:30,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:30:30,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:30:30,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:30:30,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:30:30,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:30:30,798 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:30:31,532 WARN L192 SmtUtils]: Spent 733.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 63 [2019-12-07 12:30:31,533 INFO L614 ElimStorePlain]: treesize reduction 1741, result has 10.7 percent of original size [2019-12-07 12:30:31,577 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:30:31,577 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 482 treesize of output 451 [2019-12-07 12:30:31,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:30:31,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:30:31,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:30:31,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:30:31,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:30:31,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:30:31,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:30:31,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:30:31,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:30:31,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:30:31,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:30:31,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:30:31,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:30:31,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:30:31,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:30:31,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:30:31,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:30:31,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:30:31,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:30:31,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:30:31,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:30:31,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:30:31,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:30:31,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:30:31,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:30:31,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:30:31,607 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 12:30:32,359 WARN L192 SmtUtils]: Spent 751.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 50 [2019-12-07 12:30:32,359 INFO L614 ElimStorePlain]: treesize reduction 1504, result has 7.0 percent of original size [2019-12-07 12:30:32,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:30:32,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:30:32,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:30:32,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:30:32,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:30:32,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:30:32,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:30:32,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:30:32,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:30:32,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:30:32,363 INFO L534 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-07 12:30:32,363 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:303, output treesize:49 [2019-12-07 12:30:32,684 INFO L430 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2019-12-07 12:30:32,687 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:30:32,688 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:30:32,689 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:30:32,689 INFO L502 ElimStorePlain]: Eliminatee |#length| vanished before elimination [2019-12-07 12:30:32,689 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:30:32,689 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:38, output treesize:1 [2019-12-07 12:30:32,697 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 12:30:32,697 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1223754721] [2019-12-07 12:30:32,697 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [211359665] [2019-12-07 12:30:32,697 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_74222b51-48c1-43df-99b5-fad990262cd5/bin/utaipan/cvc4 Starting monitored process 42 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 12:30:32,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:30:32,864 INFO L264 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 35 conjunts are in the unsatisfiable core [2019-12-07 12:30:32,865 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:30:33,072 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-12-07 12:30:33,072 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:30:33,090 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:30:33,091 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:30:33,091 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-12-07 12:30:35,597 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-12-07 12:30:35,597 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:30:35,622 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:30:35,623 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 12:30:35,623 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:44 [2019-12-07 12:30:35,943 INFO L377 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 [2019-12-07 12:30:35,943 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:30:35,971 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:30:35,972 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-12-07 12:30:35,972 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:55, output treesize:51 [2019-12-07 12:30:37,150 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 12:30:37,151 INFO L377 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 29 treesize of output 13 [2019-12-07 12:30:37,152 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:30:37,171 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:30:37,174 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:30:37,174 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:55, output treesize:5 [2019-12-07 12:30:37,816 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:30:37,816 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:30:39,619 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 53 [2019-12-07 12:30:39,620 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:30:39,656 INFO L614 ElimStorePlain]: treesize reduction 15, result has 58.3 percent of original size [2019-12-07 12:30:39,657 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:30:39,657 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:48, output treesize:21 [2019-12-07 12:30:42,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:30:42,987 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:30:42,987 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [160529158] [2019-12-07 12:30:42,987 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_74222b51-48c1-43df-99b5-fad990262cd5/bin/utaipan/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:30:43,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:30:43,038 INFO L264 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 29 conjunts are in the unsatisfiable core [2019-12-07 12:30:43,039 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:30:43,043 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-12-07 12:30:43,043 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:30:43,053 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:30:43,053 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:30:43,053 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2019-12-07 12:30:44,306 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-12-07 12:30:44,306 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:30:44,342 INFO L614 ElimStorePlain]: treesize reduction 8, result has 78.9 percent of original size [2019-12-07 12:30:44,343 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 12:30:44,343 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:42, output treesize:30 [2019-12-07 12:30:44,671 INFO L377 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 [2019-12-07 12:30:44,671 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:30:44,701 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:30:44,701 INFO L534 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. [2019-12-07 12:30:44,701 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:45, output treesize:41 [2019-12-07 12:30:46,381 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 12:30:46,382 INFO L377 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 [2019-12-07 12:30:46,382 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:30:46,395 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:30:46,397 INFO L534 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:30:46,397 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:45, output treesize:5 [2019-12-07 12:30:46,404 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 12:30:46,404 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:30:47,032 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2019-12-07 12:30:47,047 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2019-12-07 12:30:47,048 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 12:30:47,049 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:30:47,049 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:30:47,074 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:30:47,074 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:30:47,074 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:18 [2019-12-07 12:30:49,399 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 12:30:49,399 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2019-12-07 12:30:49,399 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 20, 18, 15, 13] total 83 [2019-12-07 12:30:49,400 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754198749] [2019-12-07 12:30:49,400 INFO L442 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-12-07 12:30:49,400 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 12:30:49,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-12-07 12:30:49,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=438, Invalid=6367, Unknown=1, NotChecked=0, Total=6806 [2019-12-07 12:30:49,402 INFO L87 Difference]: Start difference. First operand 205 states and 231 transitions. Second operand 83 states. [2019-12-07 12:30:51,064 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 49 [2019-12-07 12:30:52,325 WARN L192 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 57 [2019-12-07 12:30:53,526 WARN L192 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 49 [2019-12-07 12:30:55,802 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 28 [2019-12-07 12:30:56,247 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 31 [2019-12-07 12:30:57,386 WARN L192 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 60 [2019-12-07 12:30:58,430 WARN L192 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 35 [2019-12-07 12:30:59,116 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 42 [2019-12-07 12:30:59,585 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 42 [2019-12-07 12:31:00,454 WARN L192 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 48 [2019-12-07 12:31:05,126 WARN L192 SmtUtils]: Spent 4.23 s on a formula simplification. DAG size of input: 63 DAG size of output: 52 [2019-12-07 12:31:06,002 WARN L192 SmtUtils]: Spent 348.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 60 [2019-12-07 12:31:10,909 WARN L192 SmtUtils]: Spent 4.55 s on a formula simplification. DAG size of input: 103 DAG size of output: 81 [2019-12-07 12:31:12,317 WARN L192 SmtUtils]: Spent 486.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 67 [2019-12-07 12:31:18,101 WARN L192 SmtUtils]: Spent 4.59 s on a formula simplification. DAG size of input: 108 DAG size of output: 88 [2019-12-07 12:31:18,697 WARN L192 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 38 [2019-12-07 12:31:24,703 WARN L192 SmtUtils]: Spent 4.90 s on a formula simplification. DAG size of input: 113 DAG size of output: 95 [2019-12-07 12:31:25,752 WARN L192 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 45 [2019-12-07 12:31:26,694 WARN L192 SmtUtils]: Spent 360.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 67 [2019-12-07 12:31:32,333 WARN L192 SmtUtils]: Spent 4.99 s on a formula simplification. DAG size of input: 103 DAG size of output: 84 [2019-12-07 12:31:34,900 WARN L192 SmtUtils]: Spent 2.18 s on a formula simplification. DAG size of input: 56 DAG size of output: 43 [2019-12-07 12:31:35,751 WARN L192 SmtUtils]: Spent 323.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 52 [2019-12-07 12:31:38,558 WARN L192 SmtUtils]: Spent 393.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 67 [2019-12-07 12:31:44,719 WARN L192 SmtUtils]: Spent 4.94 s on a formula simplification. DAG size of input: 103 DAG size of output: 84 [2019-12-07 12:31:46,294 WARN L192 SmtUtils]: Spent 840.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 74 [2019-12-07 12:31:47,746 WARN L192 SmtUtils]: Spent 488.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 64 [2019-12-07 12:31:48,906 WARN L192 SmtUtils]: Spent 505.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 72 [2019-12-07 12:31:56,220 WARN L192 SmtUtils]: Spent 6.76 s on a formula simplification. DAG size of input: 112 DAG size of output: 89 [2019-12-07 12:32:01,172 WARN L192 SmtUtils]: Spent 1.13 s on a formula simplification. DAG size of input: 101 DAG size of output: 79 [2019-12-07 12:32:02,934 WARN L192 SmtUtils]: Spent 675.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 71 [2019-12-07 12:32:05,954 WARN L192 SmtUtils]: Spent 2.39 s on a formula simplification. DAG size of input: 81 DAG size of output: 74 [2019-12-07 12:32:13,269 WARN L192 SmtUtils]: Spent 6.79 s on a formula simplification. DAG size of input: 118 DAG size of output: 91 [2019-12-07 12:32:15,628 WARN L192 SmtUtils]: Spent 920.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 86 [2019-12-07 12:32:16,912 WARN L192 SmtUtils]: Spent 358.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 71 [2019-12-07 12:32:24,226 WARN L192 SmtUtils]: Spent 5.27 s on a formula simplification. DAG size of input: 104 DAG size of output: 85 [2019-12-07 12:32:27,136 WARN L192 SmtUtils]: Spent 1.66 s on a formula simplification. DAG size of input: 96 DAG size of output: 75 [2019-12-07 12:32:30,397 WARN L192 SmtUtils]: Spent 537.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 71 [2019-12-07 12:32:31,417 WARN L192 SmtUtils]: Spent 400.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 76 [2019-12-07 12:32:36,387 WARN L192 SmtUtils]: Spent 4.53 s on a formula simplification. DAG size of input: 97 DAG size of output: 79 [2019-12-07 12:32:41,017 WARN L192 SmtUtils]: Spent 501.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 75 [2019-12-07 12:32:43,934 WARN L192 SmtUtils]: Spent 510.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 71 [2019-12-07 12:32:49,361 WARN L192 SmtUtils]: Spent 4.46 s on a formula simplification. DAG size of input: 100 DAG size of output: 80 [2019-12-07 12:32:55,156 WARN L192 SmtUtils]: Spent 5.04 s on a formula simplification. DAG size of input: 105 DAG size of output: 80 [2019-12-07 12:32:58,787 WARN L192 SmtUtils]: Spent 2.66 s on a formula simplification. DAG size of input: 91 DAG size of output: 76 [2019-12-07 12:33:04,791 WARN L192 SmtUtils]: Spent 5.33 s on a formula simplification. DAG size of input: 121 DAG size of output: 86 [2019-12-07 12:33:08,272 WARN L192 SmtUtils]: Spent 2.81 s on a formula simplification. DAG size of input: 111 DAG size of output: 82 [2019-12-07 12:33:10,845 WARN L192 SmtUtils]: Spent 802.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 78 [2019-12-07 12:33:11,944 WARN L192 SmtUtils]: Spent 367.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 69 [2019-12-07 12:33:16,983 WARN L192 SmtUtils]: Spent 4.53 s on a formula simplification. DAG size of input: 115 DAG size of output: 96 [2019-12-07 12:33:19,331 WARN L192 SmtUtils]: Spent 510.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 76 [2019-12-07 12:33:20,996 WARN L192 SmtUtils]: Spent 842.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 75 [2019-12-07 12:33:26,438 WARN L192 SmtUtils]: Spent 4.91 s on a formula simplification. DAG size of input: 115 DAG size of output: 98 [2019-12-07 12:33:29,531 WARN L192 SmtUtils]: Spent 2.49 s on a formula simplification. DAG size of input: 92 DAG size of output: 71 [2019-12-07 12:33:31,407 WARN L192 SmtUtils]: Spent 504.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 70 [2019-12-07 12:33:32,564 WARN L192 SmtUtils]: Spent 440.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 75 [2019-12-07 12:33:37,884 WARN L192 SmtUtils]: Spent 4.82 s on a formula simplification. DAG size of input: 137 DAG size of output: 107 [2019-12-07 12:33:41,317 WARN L192 SmtUtils]: Spent 2.49 s on a formula simplification. DAG size of input: 93 DAG size of output: 71 [2019-12-07 12:33:50,815 WARN L192 SmtUtils]: Spent 8.70 s on a formula simplification. DAG size of input: 93 DAG size of output: 80 [2019-12-07 12:33:56,957 WARN L192 SmtUtils]: Spent 5.69 s on a formula simplification. DAG size of input: 150 DAG size of output: 112 [2019-12-07 12:34:02,304 WARN L192 SmtUtils]: Spent 2.53 s on a formula simplification. DAG size of input: 114 DAG size of output: 77 [2019-12-07 12:34:16,021 WARN L192 SmtUtils]: Spent 8.85 s on a formula simplification. DAG size of input: 114 DAG size of output: 87 [2019-12-07 12:34:21,949 WARN L192 SmtUtils]: Spent 5.00 s on a formula simplification. DAG size of input: 151 DAG size of output: 114 [2019-12-07 12:34:24,416 WARN L192 SmtUtils]: Spent 1.68 s on a formula simplification. DAG size of input: 85 DAG size of output: 68 [2019-12-07 12:34:29,907 WARN L192 SmtUtils]: Spent 4.68 s on a formula simplification. DAG size of input: 108 DAG size of output: 89 [2019-12-07 12:34:33,045 WARN L192 SmtUtils]: Spent 776.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 97 [2019-12-07 12:34:36,046 WARN L192 SmtUtils]: Spent 434.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 91 [2019-12-07 12:34:37,998 WARN L192 SmtUtils]: Spent 717.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 97 [2019-12-07 12:34:39,256 WARN L192 SmtUtils]: Spent 561.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 80 [2019-12-07 12:34:42,830 WARN L192 SmtUtils]: Spent 1.77 s on a formula simplification. DAG size of input: 91 DAG size of output: 74 [2019-12-07 12:34:46,374 WARN L192 SmtUtils]: Spent 1.19 s on a formula simplification. DAG size of input: 130 DAG size of output: 98 [2019-12-07 12:34:48,393 WARN L192 SmtUtils]: Spent 1.17 s on a formula simplification. DAG size of input: 138 DAG size of output: 106 [2019-12-07 12:34:52,997 WARN L192 SmtUtils]: Spent 2.37 s on a formula simplification. DAG size of input: 90 DAG size of output: 69 [2019-12-07 12:34:56,535 WARN L192 SmtUtils]: Spent 3.05 s on a formula simplification. DAG size of input: 143 DAG size of output: 101 [2019-12-07 12:35:01,984 WARN L192 SmtUtils]: Spent 2.63 s on a formula simplification. DAG size of input: 148 DAG size of output: 110 [2019-12-07 12:35:06,707 WARN L192 SmtUtils]: Spent 3.42 s on a formula simplification. DAG size of input: 144 DAG size of output: 102 [2019-12-07 12:35:11,492 WARN L192 SmtUtils]: Spent 1.91 s on a formula simplification. DAG size of input: 149 DAG size of output: 127 [2019-12-07 12:35:16,134 WARN L192 SmtUtils]: Spent 1.73 s on a formula simplification. DAG size of input: 88 DAG size of output: 73 [2019-12-07 12:35:18,390 WARN L192 SmtUtils]: Spent 1.16 s on a formula simplification. DAG size of input: 149 DAG size of output: 111 [2019-12-07 12:35:20,829 WARN L192 SmtUtils]: Spent 1.15 s on a formula simplification. DAG size of input: 114 DAG size of output: 98 [2019-12-07 12:35:23,475 WARN L192 SmtUtils]: Spent 648.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 79 [2019-12-07 12:35:26,009 WARN L192 SmtUtils]: Spent 1.24 s on a formula simplification. DAG size of input: 119 DAG size of output: 103 [2019-12-07 12:35:34,893 WARN L192 SmtUtils]: Spent 3.00 s on a formula simplification. DAG size of input: 113 DAG size of output: 100 [2019-12-07 12:35:40,819 WARN L192 SmtUtils]: Spent 1.19 s on a formula simplification. DAG size of input: 108 DAG size of output: 95 [2019-12-07 12:35:44,593 WARN L192 SmtUtils]: Spent 3.01 s on a formula simplification. DAG size of input: 117 DAG size of output: 104 [2019-12-07 12:35:50,953 WARN L192 SmtUtils]: Spent 1.21 s on a formula simplification. DAG size of input: 108 DAG size of output: 95 [2019-12-07 12:35:56,649 WARN L192 SmtUtils]: Spent 2.14 s on a formula simplification. DAG size of input: 153 DAG size of output: 123 [2019-12-07 12:36:00,181 WARN L192 SmtUtils]: Spent 1.45 s on a formula simplification. DAG size of input: 115 DAG size of output: 102 [2019-12-07 12:36:04,658 WARN L192 SmtUtils]: Spent 1.51 s on a formula simplification. DAG size of input: 122 DAG size of output: 109 [2019-12-07 12:36:16,182 WARN L192 SmtUtils]: Spent 1.22 s on a formula simplification. DAG size of input: 103 DAG size of output: 90 [2019-12-07 12:36:21,431 WARN L192 SmtUtils]: Spent 1.24 s on a formula simplification. DAG size of input: 119 DAG size of output: 106 [2019-12-07 12:36:24,871 WARN L192 SmtUtils]: Spent 971.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 81 [2019-12-07 12:36:28,387 WARN L192 SmtUtils]: Spent 750.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 78 [2019-12-07 12:36:31,880 WARN L192 SmtUtils]: Spent 1.21 s on a formula simplification. DAG size of input: 125 DAG size of output: 112 [2019-12-07 12:36:33,927 WARN L192 SmtUtils]: Spent 787.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 83 [2019-12-07 12:36:38,541 WARN L192 SmtUtils]: Spent 991.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 94 [2019-12-07 12:36:42,453 WARN L192 SmtUtils]: Spent 469.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 70 [2019-12-07 12:36:44,906 WARN L192 SmtUtils]: Spent 1.16 s on a formula simplification. DAG size of input: 113 DAG size of output: 99 [2019-12-07 12:36:50,265 WARN L192 SmtUtils]: Spent 559.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 70 [2019-12-07 12:36:54,789 WARN L192 SmtUtils]: Spent 1.17 s on a formula simplification. DAG size of input: 100 DAG size of output: 87 [2019-12-07 12:37:02,481 WARN L192 SmtUtils]: Spent 561.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 75 [2019-12-07 12:37:09,996 WARN L192 SmtUtils]: Spent 577.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 80 [2019-12-07 12:37:17,688 WARN L192 SmtUtils]: Spent 438.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 66 [2019-12-07 12:37:26,182 WARN L192 SmtUtils]: Spent 1.06 s on a formula simplification. DAG size of input: 94 DAG size of output: 81 [2019-12-07 12:37:28,355 WARN L192 SmtUtils]: Spent 411.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 58 [2019-12-07 12:37:30,642 WARN L192 SmtUtils]: Spent 428.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 58 [2019-12-07 12:37:37,922 WARN L192 SmtUtils]: Spent 649.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 78 [2019-12-07 12:37:40,542 WARN L192 SmtUtils]: Spent 372.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 58 [2019-12-07 12:37:40,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:37:40,788 INFO L93 Difference]: Finished difference Result 368 states and 403 transitions. [2019-12-07 12:37:40,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2019-12-07 12:37:40,791 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 37 [2019-12-07 12:37:40,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:37:40,792 INFO L225 Difference]: With dead ends: 368 [2019-12-07 12:37:40,793 INFO L226 Difference]: Without dead ends: 349 [2019-12-07 12:37:40,800 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 129 SyntacticMatches, 6 SemanticMatches, 199 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11020 ImplicationChecksByTransitivity, 413.6s TimeCoverageRelationStatistics Valid=5256, Invalid=34935, Unknown=9, NotChecked=0, Total=40200 [2019-12-07 12:37:40,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2019-12-07 12:37:40,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 314. [2019-12-07 12:37:40,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2019-12-07 12:37:40,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 356 transitions. [2019-12-07 12:37:40,806 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 356 transitions. Word has length 37 [2019-12-07 12:37:40,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:37:40,806 INFO L462 AbstractCegarLoop]: Abstraction has 314 states and 356 transitions. [2019-12-07 12:37:40,806 INFO L463 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-12-07 12:37:40,806 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 356 transitions. [2019-12-07 12:37:40,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-07 12:37:40,807 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:37:40,807 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:37:41,408 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 mathsat -unsat_core_generation=3,42 cvc4 --incremental --print-success --lang smt --rewrite-divk,43 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:37:41,409 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 12:37:41,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:37:41,409 INFO L82 PathProgramCache]: Analyzing trace with hash 1971973557, now seen corresponding path program 2 times [2019-12-07 12:37:41,410 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 12:37:41,410 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [36847341] [2019-12-07 12:37:41,410 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_74222b51-48c1-43df-99b5-fad990262cd5/bin/utaipan/mathsat Starting monitored process 44 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with mathsat -unsat_core_generation=3 [2019-12-07 12:37:41,524 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 12:37:41,524 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 12:37:41,531 INFO L264 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 50 conjunts are in the unsatisfiable core [2019-12-07 12:37:41,531 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:37:41,544 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_81|], 1=[|v_#valid_97|]} [2019-12-07 12:37:41,549 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:37:41,550 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-12-07 12:37:41,550 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:37:41,566 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:37:41,571 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-12-07 12:37:41,571 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 12:37:41,586 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:37:41,586 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:37:41,586 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:28 [2019-12-07 12:37:41,736 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2019-12-07 12:37:41,736 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:37:41,765 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:37:41,765 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:37:41,765 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:47, output treesize:43 [2019-12-07 12:37:41,827 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:37:41,828 INFO L377 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 [2019-12-07 12:37:41,828 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:37:41,864 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:37:41,864 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:37:41,864 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:57, output treesize:53 [2019-12-07 12:37:42,760 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:37:42,760 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 12:37:42,767 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:37:42,768 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 29 [2019-12-07 12:37:42,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:37:42,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:37:42,768 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 12:37:42,827 INFO L614 ElimStorePlain]: treesize reduction 5, result has 89.4 percent of original size [2019-12-07 12:37:42,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:37:42,828 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 12:37:42,828 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:65, output treesize:42 [2019-12-07 12:37:42,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:37:42,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:37:43,398 WARN L192 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 30 [2019-12-07 12:37:43,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:37:43,812 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:37:43,812 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:37:53,361 WARN L192 SmtUtils]: Spent 6.11 s on a formula simplification that was a NOOP. DAG size: 23 [2019-12-07 12:37:53,361 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:37:53,361 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 191 treesize of output 183 [2019-12-07 12:37:53,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:37:53,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:37:53,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:37:53,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:37:53,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:37:53,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:37:53,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:37:53,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:37:53,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:37:53,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:37:53,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:37:53,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:37:53,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:37:53,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:37:53,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:37:53,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:37:53,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:37:53,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:37:53,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:37:53,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:37:53,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:37:53,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:37:53,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:37:53,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:37:53,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:37:53,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:37:53,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:37:53,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:37:53,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:37:53,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:37:53,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:37:53,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:37:53,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:37:53,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:37:53,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:37:53,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:37:53,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:37:53,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:37:53,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:37:53,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:37:53,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:37:53,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:37:53,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:37:53,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:37:53,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:37:53,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:37:53,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:37:53,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:37:53,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:37:53,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:37:53,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:37:53,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:37:53,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:37:53,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:37:53,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:37:53,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:37:53,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:37:53,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:37:53,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:37:53,439 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:37:53,439 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 183 treesize of output 177 [2019-12-07 12:37:53,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:37:53,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:37:53,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:37:53,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:37:53,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:37:53,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:37:53,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:37:53,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:37:53,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:37:53,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:37:53,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:37:53,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:37:53,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:37:53,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:37:53,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:37:53,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:37:53,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:37:53,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:37:53,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:37:53,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:37:53,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:37:53,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:37:53,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:37:53,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:37:53,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:37:53,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:37:53,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:37:53,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:37:53,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:37:53,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:37:53,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:37:53,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:37:53,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:37:53,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:37:53,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:37:53,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:37:53,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:37:53,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:37:53,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:37:53,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:37:53,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:37:53,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:37:53,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:37:53,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:37:53,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:37:53,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:37:53,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:37:53,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:37:53,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:37:53,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:37:53,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:37:53,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:37:53,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:37:53,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:37:53,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:37:53,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:37:53,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:37:53,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:37:53,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:37:53,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:37:53,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:37:53,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:37:53,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:37:53,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:37:53,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:37:53,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:37:53,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:37:53,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:37:53,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:37:53,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:37:53,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:37:53,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:37:53,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:37:53,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:37:53,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:37:53,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:37:53,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:37:53,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:37:53,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:37:53,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:37:53,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:37:53,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:37:53,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:37:53,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:37:53,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:37:53,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:37:53,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:37:53,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:37:53,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:37:53,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:37:53,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:37:53,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:37:53,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:37:53,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:37:53,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:37:53,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:37:53,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:37:53,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:37:53,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:37:53,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:37:53,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:37:53,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:37:53,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:37:53,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:37:53,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:37:53,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:37:53,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:37:53,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:37:53,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:37:53,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:37:53,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:37:53,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:37:53,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:37:53,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:37:53,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:37:53,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:37:53,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:37:53,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:37:53,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:37:53,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:37:53,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:37:53,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:37:53,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:37:53,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:37:53,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:37:53,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:37:53,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:37:53,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:37:53,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:37:53,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:37:53,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:37:53,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:37:53,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:37:53,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:37:53,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:37:53,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:37:53,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:37:53,507 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [36847341] [2019-12-07 12:37:53,507 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@35337578 [2019-12-07 12:37:53,508 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [42622095] [2019-12-07 12:37:53,508 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_74222b51-48c1-43df-99b5-fad990262cd5/bin/utaipan/cvc4 Starting monitored process 45 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 12:37:53,663 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 12:37:53,663 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 12:37:53,665 INFO L264 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 46 conjunts are in the unsatisfiable core [2019-12-07 12:37:53,666 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:37:53,667 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@35337578 [2019-12-07 12:37:53,667 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [597912257] [2019-12-07 12:37:53,667 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_74222b51-48c1-43df-99b5-fad990262cd5/bin/utaipan/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:37:53,716 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 12:37:53,716 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 12:37:53,719 INFO L264 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 36 conjunts are in the unsatisfiable core [2019-12-07 12:37:53,720 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:37:53,720 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@35337578 [2019-12-07 12:37:53,720 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:37:53,720 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [] total 0 [2019-12-07 12:37:53,720 ERROR L206 FreeRefinementEngine]: Strategy WALRUS failed to provide any proof altough trace is infeasible [2019-12-07 12:37:53,720 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 12:37:54,325 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 mathsat -unsat_core_generation=3,45 cvc4 --incremental --print-success --lang smt --rewrite-divk,46 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:37:54,339 WARN L229 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2019-12-07 12:37:54,339 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 12:37:54 BoogieIcfgContainer [2019-12-07 12:37:54,340 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 12:37:54,340 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 12:37:54,340 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 12:37:54,340 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 12:37:54,340 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:26:13" (3/4) ... [2019-12-07 12:37:54,342 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-12-07 12:37:54,342 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 12:37:54,343 INFO L168 Benchmark]: Toolchain (without parser) took 701822.27 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.9 MB). Free memory was 945.7 MB in the beginning and 964.3 MB in the end (delta: -18.7 MB). Peak memory consumption was 108.2 MB. Max. memory is 11.5 GB. [2019-12-07 12:37:54,343 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 12:37:54,344 INFO L168 Benchmark]: CACSL2BoogieTranslator took 322.10 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.9 MB). Free memory was 945.7 MB in the beginning and 1.1 GB in the end (delta: -164.1 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB. [2019-12-07 12:37:54,344 INFO L168 Benchmark]: Boogie Procedure Inliner took 31.60 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2019-12-07 12:37:54,344 INFO L168 Benchmark]: Boogie Preprocessor took 21.30 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 12:37:54,344 INFO L168 Benchmark]: RCFGBuilder took 298.40 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 27.1 MB). Peak memory consumption was 27.1 MB. Max. memory is 11.5 GB. [2019-12-07 12:37:54,344 INFO L168 Benchmark]: TraceAbstraction took 701142.93 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: -1.0 MB). Free memory was 1.1 GB in the beginning and 964.3 MB in the end (delta: 111.4 MB). Peak memory consumption was 110.4 MB. Max. memory is 11.5 GB. [2019-12-07 12:37:54,344 INFO L168 Benchmark]: Witness Printer took 2.76 ms. Allocated memory is still 1.2 GB. Free memory is still 964.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 12:37:54,345 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 322.10 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.9 MB). Free memory was 945.7 MB in the beginning and 1.1 GB in the end (delta: -164.1 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 31.60 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 21.30 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 298.40 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 27.1 MB). Peak memory consumption was 27.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 701142.93 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: -1.0 MB). Free memory was 1.1 GB in the beginning and 964.3 MB in the end (delta: 111.4 MB). Peak memory consumption was 110.4 MB. Max. memory is 11.5 GB. * Witness Printer took 2.76 ms. Allocated memory is still 1.2 GB. Free memory is still 964.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 520]: 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 TRUE length1 < 1 [L529] 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 FALSE !(i< length1 -1) [L541] int i = 0; [L541] COND TRUE i< length2 -1 [L543] nondetString2[i] = __VERIFIER_nondet_char() [L541] i++ [L541] COND TRUE i< length2 -1 [L543] nondetString2[i] = __VERIFIER_nondet_char() [L541] i++ [L541] COND FALSE !(i< length2 -1) [L545] nondetString1[length1-1] = '\0' [L546] nondetString2[length2-1] = '\0' [L516] const char *p = s1, *spanp; [L517] char c, sc; [L519] EXPR p++ [L519] c = *p++ [L520] spanp = s2 [L520] EXPR spanp++ [L520] EXPR sc = *spanp++ [L520] COND TRUE (sc = *spanp++) != 0 [L521] COND FALSE !(sc == c) [L520] EXPR spanp++ [L520] EXPR sc = *spanp++ [L520] COND TRUE (sc = *spanp++) != 0 [L521] COND FALSE !(sc == c) [L520] EXPR spanp++ [L520] EXPR sc = *spanp++ [L520] COND TRUE (sc = *spanp++) != 0 [L521] COND FALSE !(sc == c) [L520] spanp++ - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 43 locations, 13 error locations. Result: UNKNOWN, OverallTime: 701.0s, OverallIterations: 27, TraceHistogramMax: 5, AutomataDifference: 593.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 782 SDtfs, 7175 SDslu, 4681 SDs, 0 SdLazy, 6332 SolverSat, 1044 SolverUnsat, 16 SolverUnknown, 0 SolverNotchecked, 66.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1882 GetRequests, 1162 SyntacticMatches, 62 SemanticMatches, 658 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15210 ImplicationChecksByTransitivity, 599.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=314occurred in iteration=26, 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, 26 MinimizatonAttempts, 864 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 83.0s InterpolantComputationTime, 849 NumberOfCodeBlocks, 849 NumberOfCodeBlocksAsserted, 48 NumberOfCheckSat, 1614 ConstructedInterpolants, 144 QuantifiedInterpolants, 697000 SizeOfPredicates, 542 NumberOfNonLiveVariables, 2858 ConjunctsInSsa, 684 ConjunctsInUnsatCore, 84 InterpolantComputations, 36 PerfectInterpolantSequences, 148/554 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [MP z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process Received shutdown request...