./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memsafety-ext3/getNumbers4_true-valid-memsafety.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_c13b829e-a593-4ad2-a06c-fcefee1cc234/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_c13b829e-a593-4ad2-a06c-fcefee1cc234/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_c13b829e-a593-4ad2-a06c-fcefee1cc234/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_c13b829e-a593-4ad2-a06c-fcefee1cc234/bin-2019/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-ext3/getNumbers4_true-valid-memsafety.c -s /tmp/vcloud-vcloud-master/worker/working_dir_c13b829e-a593-4ad2-a06c-fcefee1cc234/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_c13b829e-a593-4ad2-a06c-fcefee1cc234/bin-2019/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 b8a667539b0a7850f9a7aa38ebbe1ead0e2c55d4 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 04:59:51,116 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 04:59:51,117 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 04:59:51,125 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 04:59:51,125 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 04:59:51,126 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 04:59:51,127 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 04:59:51,128 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 04:59:51,129 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 04:59:51,129 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 04:59:51,130 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 04:59:51,130 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 04:59:51,131 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 04:59:51,132 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 04:59:51,132 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 04:59:51,133 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 04:59:51,133 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 04:59:51,134 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 04:59:51,136 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 04:59:51,137 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 04:59:51,138 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 04:59:51,139 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 04:59:51,140 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 04:59:51,141 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 04:59:51,141 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 04:59:51,142 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 04:59:51,142 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 04:59:51,143 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 04:59:51,143 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 04:59:51,144 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 04:59:51,144 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 04:59:51,145 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 04:59:51,146 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 04:59:51,146 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 04:59:51,146 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 04:59:51,147 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 04:59:51,147 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_c13b829e-a593-4ad2-a06c-fcefee1cc234/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2018-11-23 04:59:51,157 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 04:59:51,157 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 04:59:51,157 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 04:59:51,158 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 04:59:51,158 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-23 04:59:51,158 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-23 04:59:51,158 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-23 04:59:51,158 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-23 04:59:51,158 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-23 04:59:51,158 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-23 04:59:51,158 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-23 04:59:51,159 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-23 04:59:51,159 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-23 04:59:51,159 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 04:59:51,159 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 04:59:51,159 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 04:59:51,160 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 04:59:51,160 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 04:59:51,160 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 04:59:51,160 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 04:59:51,160 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 04:59:51,160 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-11-23 04:59:51,160 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-11-23 04:59:51,160 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-11-23 04:59:51,161 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 04:59:51,163 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 04:59:51,163 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 04:59:51,163 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 04:59:51,163 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 04:59:51,163 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 04:59:51,163 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 04:59:51,164 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 04:59:51,164 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 04:59:51,164 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 04:59:51,164 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-23 04:59:51,164 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 04:59:51,164 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 04:59:51,164 INFO L133 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/working_dir_c13b829e-a593-4ad2-a06c-fcefee1cc234/bin-2019/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 -> b8a667539b0a7850f9a7aa38ebbe1ead0e2c55d4 [2018-11-23 04:59:51,188 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 04:59:51,197 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 04:59:51,199 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 04:59:51,200 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 04:59:51,201 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 04:59:51,202 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_c13b829e-a593-4ad2-a06c-fcefee1cc234/bin-2019/utaipan/../../sv-benchmarks/c/memsafety-ext3/getNumbers4_true-valid-memsafety.c [2018-11-23 04:59:51,248 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c13b829e-a593-4ad2-a06c-fcefee1cc234/bin-2019/utaipan/data/b88356ac2/d36cd7e5f2ad4e59aa32cc1d2d468f36/FLAGb8999f694 [2018-11-23 04:59:51,567 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 04:59:51,567 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_c13b829e-a593-4ad2-a06c-fcefee1cc234/sv-benchmarks/c/memsafety-ext3/getNumbers4_true-valid-memsafety.c [2018-11-23 04:59:51,571 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c13b829e-a593-4ad2-a06c-fcefee1cc234/bin-2019/utaipan/data/b88356ac2/d36cd7e5f2ad4e59aa32cc1d2d468f36/FLAGb8999f694 [2018-11-23 04:59:52,005 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_c13b829e-a593-4ad2-a06c-fcefee1cc234/bin-2019/utaipan/data/b88356ac2/d36cd7e5f2ad4e59aa32cc1d2d468f36 [2018-11-23 04:59:52,007 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 04:59:52,008 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 04:59:52,008 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 04:59:52,008 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 04:59:52,010 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 04:59:52,011 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 04:59:52" (1/1) ... [2018-11-23 04:59:52,013 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b01f361 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:59:52, skipping insertion in model container [2018-11-23 04:59:52,013 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 04:59:52" (1/1) ... [2018-11-23 04:59:52,020 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 04:59:52,032 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 04:59:52,147 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 04:59:52,157 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 04:59:52,169 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 04:59:52,183 INFO L195 MainTranslator]: Completed translation [2018-11-23 04:59:52,183 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:59:52 WrapperNode [2018-11-23 04:59:52,183 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 04:59:52,184 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 04:59:52,184 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 04:59:52,184 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 04:59:52,191 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:59:52" (1/1) ... [2018-11-23 04:59:52,200 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:59:52" (1/1) ... [2018-11-23 04:59:52,207 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 04:59:52,208 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 04:59:52,208 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 04:59:52,208 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 04:59:52,216 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:59:52" (1/1) ... [2018-11-23 04:59:52,217 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:59:52" (1/1) ... [2018-11-23 04:59:52,219 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:59:52" (1/1) ... [2018-11-23 04:59:52,219 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:59:52" (1/1) ... [2018-11-23 04:59:52,228 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:59:52" (1/1) ... [2018-11-23 04:59:52,270 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:59:52" (1/1) ... [2018-11-23 04:59:52,271 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:59:52" (1/1) ... [2018-11-23 04:59:52,273 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 04:59:52,273 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 04:59:52,274 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 04:59:52,274 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 04:59:52,274 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:59:52" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c13b829e-a593-4ad2-a06c-fcefee1cc234/bin-2019/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 [2018-11-23 04:59:52,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 04:59:52,313 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 04:59:52,313 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 04:59:52,313 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 04:59:52,313 INFO L130 BoogieDeclarations]: Found specification of procedure getNumbers3 [2018-11-23 04:59:52,313 INFO L138 BoogieDeclarations]: Found implementation of procedure getNumbers3 [2018-11-23 04:59:52,314 INFO L130 BoogieDeclarations]: Found specification of procedure getNumbers2 [2018-11-23 04:59:52,314 INFO L138 BoogieDeclarations]: Found implementation of procedure getNumbers2 [2018-11-23 04:59:52,314 INFO L130 BoogieDeclarations]: Found specification of procedure getNumbers4 [2018-11-23 04:59:52,314 INFO L138 BoogieDeclarations]: Found implementation of procedure getNumbers4 [2018-11-23 04:59:52,314 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 04:59:52,314 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 04:59:52,314 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 04:59:52,314 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 04:59:52,314 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 04:59:52,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2018-11-23 04:59:52,315 INFO L130 BoogieDeclarations]: Found specification of procedure getNumbers [2018-11-23 04:59:52,315 INFO L138 BoogieDeclarations]: Found implementation of procedure getNumbers [2018-11-23 04:59:52,636 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 04:59:52,637 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2018-11-23 04:59:52,637 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 04:59:52 BoogieIcfgContainer [2018-11-23 04:59:52,637 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 04:59:52,638 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 04:59:52,638 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 04:59:52,640 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 04:59:52,640 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 04:59:52" (1/3) ... [2018-11-23 04:59:52,640 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2864029b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 04:59:52, skipping insertion in model container [2018-11-23 04:59:52,641 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:59:52" (2/3) ... [2018-11-23 04:59:52,641 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2864029b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 04:59:52, skipping insertion in model container [2018-11-23 04:59:52,641 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 04:59:52" (3/3) ... [2018-11-23 04:59:52,642 INFO L112 eAbstractionObserver]: Analyzing ICFG getNumbers4_true-valid-memsafety.c [2018-11-23 04:59:52,648 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 04:59:52,653 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 17 error locations. [2018-11-23 04:59:52,662 INFO L257 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2018-11-23 04:59:52,680 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 04:59:52,680 INFO L383 AbstractCegarLoop]: Hoare is false [2018-11-23 04:59:52,680 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 04:59:52,680 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 04:59:52,681 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 04:59:52,681 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 04:59:52,681 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 04:59:52,681 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 04:59:52,692 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states. [2018-11-23 04:59:52,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-23 04:59:52,699 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:59:52,700 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 04:59:52,702 INFO L423 AbstractCegarLoop]: === Iteration 1 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-11-23 04:59:52,705 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:59:52,705 INFO L82 PathProgramCache]: Analyzing trace with hash 1830459948, now seen corresponding path program 1 times [2018-11-23 04:59:52,707 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 04:59:52,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:59:52,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:59:52,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:59:52,741 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 04:59:52,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:59:52,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 04:59:52,861 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:59:52,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 04:59:52,862 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 04:59:52,865 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 04:59:52,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 04:59:52,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 04:59:52,875 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 3 states. [2018-11-23 04:59:52,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:59:52,947 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2018-11-23 04:59:52,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 04:59:52,948 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-11-23 04:59:52,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:59:52,954 INFO L225 Difference]: With dead ends: 68 [2018-11-23 04:59:52,954 INFO L226 Difference]: Without dead ends: 63 [2018-11-23 04:59:52,956 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 04:59:52,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-11-23 04:59:52,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-11-23 04:59:52,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-11-23 04:59:52,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2018-11-23 04:59:52,980 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 12 [2018-11-23 04:59:52,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:59:52,980 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2018-11-23 04:59:52,980 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 04:59:52,980 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2018-11-23 04:59:52,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-23 04:59:52,981 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:59:52,981 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 04:59:52,981 INFO L423 AbstractCegarLoop]: === Iteration 2 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-11-23 04:59:52,981 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:59:52,982 INFO L82 PathProgramCache]: Analyzing trace with hash 1830459949, now seen corresponding path program 1 times [2018-11-23 04:59:52,982 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 04:59:52,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:59:52,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:59:52,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:59:52,983 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 04:59:53,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:59:53,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 04:59:53,089 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:59:53,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 04:59:53,089 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 04:59:53,090 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 04:59:53,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 04:59:53,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 04:59:53,091 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand 4 states. [2018-11-23 04:59:53,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:59:53,190 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2018-11-23 04:59:53,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 04:59:53,190 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-11-23 04:59:53,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:59:53,191 INFO L225 Difference]: With dead ends: 66 [2018-11-23 04:59:53,191 INFO L226 Difference]: Without dead ends: 66 [2018-11-23 04:59:53,191 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 04:59:53,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-11-23 04:59:53,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2018-11-23 04:59:53,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-11-23 04:59:53,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2018-11-23 04:59:53,197 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 12 [2018-11-23 04:59:53,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:59:53,198 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2018-11-23 04:59:53,198 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 04:59:53,198 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2018-11-23 04:59:53,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 04:59:53,198 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:59:53,198 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 04:59:53,199 INFO L423 AbstractCegarLoop]: === Iteration 3 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-11-23 04:59:53,199 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:59:53,199 INFO L82 PathProgramCache]: Analyzing trace with hash -1967365176, now seen corresponding path program 1 times [2018-11-23 04:59:53,199 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 04:59:53,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:59:53,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:59:53,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:59:53,200 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 04:59:53,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:59:53,334 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 04:59:53,334 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 04:59:53,334 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 04:59:53,335 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 16 with the following transitions: [2018-11-23 04:59:53,336 INFO L202 CegarAbsIntRunner]: [0], [1], [99], [107], [108], [110], [112], [118], [120], [122], [124], [125], [126], [128] [2018-11-23 04:59:53,357 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 04:59:53,357 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 04:59:53,513 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-23 04:59:53,514 INFO L272 AbstractInterpreter]: Visited 14 different actions 30 times. Merged at 4 different actions 16 times. Never widened. Performed 432 root evaluator evaluations with a maximum evaluation depth of 4. Performed 432 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 1 fixpoints after 1 different actions. Largest state had 32 variables. [2018-11-23 04:59:53,519 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:59:53,519 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-23 04:59:53,520 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 04:59:53,520 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c13b829e-a593-4ad2-a06c-fcefee1cc234/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 04:59:53,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:59:53,526 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 04:59:53,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:59:53,567 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 04:59:53,601 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2018-11-23 04:59:53,628 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:53,634 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 63 [2018-11-23 04:59:53,738 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:53,739 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:53,741 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 58 [2018-11-23 04:59:53,778 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:53,778 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:53,779 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:53,780 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:53,781 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:53,782 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 64 [2018-11-23 04:59:53,815 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:53,816 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:53,818 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:53,819 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:53,820 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:53,822 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:53,824 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 48 [2018-11-23 04:59:53,825 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 04:59:53,847 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:59:53,868 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:59:53,895 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:53,896 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:53,902 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:53,910 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 68 [2018-11-23 04:59:54,004 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:54,004 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:54,006 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:54,007 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:54,007 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:54,009 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:54,010 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:54,016 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 78 [2018-11-23 04:59:54,096 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:54,097 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:54,097 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:54,098 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:54,099 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:54,100 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:54,101 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:54,102 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:54,103 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:54,103 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:54,104 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 14 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 53 [2018-11-23 04:59:54,105 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 04:59:54,138 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:54,139 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:54,140 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:54,140 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:54,141 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:54,142 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:54,142 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:54,143 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 52 [2018-11-23 04:59:54,144 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-23 04:59:54,178 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 04:59:54,215 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:54,216 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:54,217 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:54,218 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:54,219 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:54,220 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 64 [2018-11-23 04:59:54,260 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:54,261 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:54,262 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:54,263 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:54,264 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:54,264 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:54,265 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:54,266 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 48 [2018-11-23 04:59:54,267 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-23 04:59:54,278 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:59:54,303 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 04:59:54,321 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:59:54,330 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:59:54,342 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2018-11-23 04:59:54,344 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:54,345 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 33 [2018-11-23 04:59:54,348 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 10 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2018-11-23 04:59:54,351 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 11 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2018-11-23 04:59:54,355 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 72 [2018-11-23 04:59:54,356 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-23 04:59:54,369 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:59:54,376 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:59:54,381 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:59:54,390 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:59:54,406 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-11-23 04:59:54,406 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 6 variables, input treesize:84, output treesize:53 [2018-11-23 04:59:54,505 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 04:59:54,505 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 04:59:54,609 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 04:59:54,625 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 04:59:54,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 11 [2018-11-23 04:59:54,625 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 04:59:54,625 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 04:59:54,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 04:59:54,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2018-11-23 04:59:54,626 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand 9 states. [2018-11-23 04:59:54,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:59:54,796 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2018-11-23 04:59:54,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 04:59:54,797 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-11-23 04:59:54,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:59:54,798 INFO L225 Difference]: With dead ends: 69 [2018-11-23 04:59:54,798 INFO L226 Difference]: Without dead ends: 69 [2018-11-23 04:59:54,798 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2018-11-23 04:59:54,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-11-23 04:59:54,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-11-23 04:59:54,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-11-23 04:59:54,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2018-11-23 04:59:54,802 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 15 [2018-11-23 04:59:54,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:59:54,802 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2018-11-23 04:59:54,802 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 04:59:54,802 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2018-11-23 04:59:54,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 04:59:54,802 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:59:54,803 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 04:59:54,803 INFO L423 AbstractCegarLoop]: === Iteration 4 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-11-23 04:59:54,803 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:59:54,803 INFO L82 PathProgramCache]: Analyzing trace with hash 189347113, now seen corresponding path program 1 times [2018-11-23 04:59:54,803 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 04:59:54,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:59:54,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:59:54,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:59:54,804 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 04:59:54,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:59:54,850 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-23 04:59:54,850 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:59:54,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 04:59:54,850 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 04:59:54,850 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 04:59:54,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 04:59:54,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-23 04:59:54,851 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand 6 states. [2018-11-23 04:59:54,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:59:54,936 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2018-11-23 04:59:54,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 04:59:54,936 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-11-23 04:59:54,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:59:54,937 INFO L225 Difference]: With dead ends: 68 [2018-11-23 04:59:54,937 INFO L226 Difference]: Without dead ends: 68 [2018-11-23 04:59:54,937 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-11-23 04:59:54,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-11-23 04:59:54,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-11-23 04:59:54,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-11-23 04:59:54,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2018-11-23 04:59:54,940 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 26 [2018-11-23 04:59:54,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:59:54,940 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2018-11-23 04:59:54,940 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 04:59:54,940 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2018-11-23 04:59:54,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 04:59:54,941 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:59:54,941 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 04:59:54,941 INFO L423 AbstractCegarLoop]: === Iteration 5 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-11-23 04:59:54,941 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:59:54,941 INFO L82 PathProgramCache]: Analyzing trace with hash 189347114, now seen corresponding path program 1 times [2018-11-23 04:59:54,941 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 04:59:54,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:59:54,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:59:54,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:59:54,942 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 04:59:54,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:59:54,996 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 04:59:54,996 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 04:59:54,996 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 04:59:54,996 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 27 with the following transitions: [2018-11-23 04:59:54,996 INFO L202 CegarAbsIntRunner]: [0], [1], [27], [35], [38], [99], [105], [107], [108], [112], [116], [117], [118], [120], [121], [122], [124], [125], [126], [128] [2018-11-23 04:59:54,998 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 04:59:54,998 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 04:59:55,065 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-23 04:59:55,065 INFO L272 AbstractInterpreter]: Visited 20 different actions 39 times. Merged at 6 different actions 15 times. Widened at 1 different actions 1 times. Performed 439 root evaluator evaluations with a maximum evaluation depth of 4. Performed 439 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 3 fixpoints after 3 different actions. Largest state had 35 variables. [2018-11-23 04:59:55,067 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:59:55,068 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-23 04:59:55,068 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 04:59:55,068 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c13b829e-a593-4ad2-a06c-fcefee1cc234/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 04:59:55,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:59:55,082 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 04:59:55,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:59:55,107 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 04:59:55,117 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 04:59:55,117 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 04:59:55,143 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 04:59:55,158 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 04:59:55,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2018-11-23 04:59:55,159 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 04:59:55,159 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 04:59:55,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 04:59:55,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 04:59:55,159 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand 7 states. [2018-11-23 04:59:55,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:59:55,178 INFO L93 Difference]: Finished difference Result 73 states and 77 transitions. [2018-11-23 04:59:55,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 04:59:55,178 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2018-11-23 04:59:55,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:59:55,178 INFO L225 Difference]: With dead ends: 73 [2018-11-23 04:59:55,178 INFO L226 Difference]: Without dead ends: 73 [2018-11-23 04:59:55,179 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 04:59:55,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-11-23 04:59:55,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 71. [2018-11-23 04:59:55,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-11-23 04:59:55,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2018-11-23 04:59:55,182 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 75 transitions. Word has length 26 [2018-11-23 04:59:55,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:59:55,182 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 75 transitions. [2018-11-23 04:59:55,182 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 04:59:55,182 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2018-11-23 04:59:55,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-23 04:59:55,183 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:59:55,183 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 04:59:55,183 INFO L423 AbstractCegarLoop]: === Iteration 6 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-11-23 04:59:55,183 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:59:55,183 INFO L82 PathProgramCache]: Analyzing trace with hash -378498171, now seen corresponding path program 2 times [2018-11-23 04:59:55,183 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 04:59:55,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:59:55,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:59:55,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:59:55,184 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 04:59:55,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:59:55,225 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 04:59:55,226 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 04:59:55,226 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 04:59:55,226 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 04:59:55,226 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 04:59:55,226 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 04:59:55,226 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c13b829e-a593-4ad2-a06c-fcefee1cc234/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 04:59:55,236 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 04:59:55,236 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-23 04:59:55,262 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2018-11-23 04:59:55,262 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 04:59:55,265 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 04:59:55,273 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2018-11-23 04:59:55,277 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:55,278 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:55,279 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 33 [2018-11-23 04:59:55,283 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:55,285 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:55,286 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2018-11-23 04:59:55,290 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:55,292 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:55,293 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:55,294 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2018-11-23 04:59:55,299 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:55,301 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:55,303 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:55,304 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:55,305 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 72 [2018-11-23 04:59:55,306 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 04:59:55,329 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:59:55,341 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:59:55,351 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:59:55,359 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:59:55,380 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2018-11-23 04:59:55,395 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:55,402 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 63 [2018-11-23 04:59:55,458 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:55,460 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:55,461 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 58 [2018-11-23 04:59:55,489 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:55,490 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:55,491 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:55,493 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:55,497 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:55,498 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 64 [2018-11-23 04:59:55,525 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:55,526 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:55,527 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:55,528 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:55,537 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:55,538 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:55,539 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 48 [2018-11-23 04:59:55,540 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-23 04:59:55,554 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:59:55,572 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:59:55,591 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:55,593 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:55,596 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:55,603 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 68 [2018-11-23 04:59:55,671 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:55,672 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:55,674 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:55,675 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:55,676 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:55,678 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:55,680 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:55,687 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 78 [2018-11-23 04:59:55,748 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:55,749 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:55,753 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:55,754 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:55,755 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:55,756 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:55,757 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:55,758 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:55,758 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:55,759 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:55,759 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 14 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 53 [2018-11-23 04:59:55,760 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-23 04:59:55,784 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:55,785 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:55,785 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:55,786 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:55,786 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:55,787 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:55,787 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:55,788 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:55,788 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 52 [2018-11-23 04:59:55,789 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-23 04:59:55,803 INFO L267 ElimStorePlain]: Start of recursive call 13: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:59:55,822 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:55,822 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:55,823 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:55,823 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:55,824 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:55,824 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 64 [2018-11-23 04:59:55,849 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:55,850 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:55,852 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:55,853 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:55,854 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:55,855 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:55,856 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:55,857 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 48 [2018-11-23 04:59:55,858 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-23 04:59:55,874 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:59:55,894 INFO L267 ElimStorePlain]: Start of recursive call 12: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 04:59:55,908 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:59:55,927 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:59:55,939 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-11-23 04:59:55,939 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 6 variables, input treesize:84, output treesize:53 [2018-11-23 04:59:56,070 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-11-23 04:59:56,070 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 04:59:56,197 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 18 [2018-11-23 04:59:56,239 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 18 [2018-11-23 04:59:56,246 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 18 [2018-11-23 04:59:56,313 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-11-23 04:59:56,329 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-23 04:59:56,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [7] total 17 [2018-11-23 04:59:56,329 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 04:59:56,329 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 04:59:56,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 04:59:56,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2018-11-23 04:59:56,329 INFO L87 Difference]: Start difference. First operand 71 states and 75 transitions. Second operand 7 states. [2018-11-23 04:59:56,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:59:56,508 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2018-11-23 04:59:56,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 04:59:56,509 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 29 [2018-11-23 04:59:56,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:59:56,509 INFO L225 Difference]: With dead ends: 71 [2018-11-23 04:59:56,509 INFO L226 Difference]: Without dead ends: 71 [2018-11-23 04:59:56,509 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2018-11-23 04:59:56,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-11-23 04:59:56,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-11-23 04:59:56,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-11-23 04:59:56,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2018-11-23 04:59:56,513 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 75 transitions. Word has length 29 [2018-11-23 04:59:56,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:59:56,513 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 75 transitions. [2018-11-23 04:59:56,513 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 04:59:56,513 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2018-11-23 04:59:56,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-23 04:59:56,514 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:59:56,514 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 04:59:56,514 INFO L423 AbstractCegarLoop]: === Iteration 7 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-11-23 04:59:56,514 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:59:56,514 INFO L82 PathProgramCache]: Analyzing trace with hash 1151458565, now seen corresponding path program 1 times [2018-11-23 04:59:56,514 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 04:59:56,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:59:56,515 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 04:59:56,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:59:56,515 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 04:59:56,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:59:56,574 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 04:59:56,574 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 04:59:56,574 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 04:59:56,574 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 31 with the following transitions: [2018-11-23 04:59:56,575 INFO L202 CegarAbsIntRunner]: [0], [1], [27], [35], [36], [40], [99], [105], [107], [108], [112], [116], [117], [118], [120], [121], [122], [124], [125], [126], [128] [2018-11-23 04:59:56,576 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 04:59:56,576 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 04:59:56,631 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-23 04:59:56,632 INFO L272 AbstractInterpreter]: Visited 21 different actions 40 times. Merged at 6 different actions 15 times. Widened at 1 different actions 1 times. Performed 446 root evaluator evaluations with a maximum evaluation depth of 4. Performed 446 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 3 fixpoints after 3 different actions. Largest state had 36 variables. [2018-11-23 04:59:56,649 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:59:56,649 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-23 04:59:56,649 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 04:59:56,649 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c13b829e-a593-4ad2-a06c-fcefee1cc234/bin-2019/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 04:59:56,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:59:56,664 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 04:59:56,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:59:56,705 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 04:59:56,730 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 04:59:56,731 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 04:59:56,784 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 04:59:56,799 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 04:59:56,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2018-11-23 04:59:56,799 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 04:59:56,800 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 04:59:56,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 04:59:56,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-23 04:59:56,800 INFO L87 Difference]: Start difference. First operand 71 states and 75 transitions. Second operand 8 states. [2018-11-23 04:59:56,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:59:56,824 INFO L93 Difference]: Finished difference Result 76 states and 80 transitions. [2018-11-23 04:59:56,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 04:59:56,824 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 30 [2018-11-23 04:59:56,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:59:56,825 INFO L225 Difference]: With dead ends: 76 [2018-11-23 04:59:56,825 INFO L226 Difference]: Without dead ends: 76 [2018-11-23 04:59:56,826 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-23 04:59:56,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-11-23 04:59:56,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 74. [2018-11-23 04:59:56,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-11-23 04:59:56,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 78 transitions. [2018-11-23 04:59:56,830 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 78 transitions. Word has length 30 [2018-11-23 04:59:56,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:59:56,830 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 78 transitions. [2018-11-23 04:59:56,830 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 04:59:56,830 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 78 transitions. [2018-11-23 04:59:56,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-23 04:59:56,831 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:59:56,831 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 04:59:56,831 INFO L423 AbstractCegarLoop]: === Iteration 8 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-11-23 04:59:56,831 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:59:56,831 INFO L82 PathProgramCache]: Analyzing trace with hash -387148320, now seen corresponding path program 2 times [2018-11-23 04:59:56,831 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 04:59:56,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:59:56,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:59:56,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:59:56,832 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 04:59:56,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:59:56,886 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 04:59:56,886 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 04:59:56,886 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 04:59:56,886 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 04:59:56,886 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 04:59:56,886 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 04:59:56,886 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c13b829e-a593-4ad2-a06c-fcefee1cc234/bin-2019/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 04:59:56,893 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 04:59:56,893 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-23 04:59:56,913 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2018-11-23 04:59:56,913 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 04:59:56,915 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 04:59:56,919 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 63 [2018-11-23 04:59:56,957 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:56,963 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 60 treesize of output 70 [2018-11-23 04:59:56,976 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 66 treesize of output 59 [2018-11-23 04:59:57,066 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:57,067 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:57,069 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:57,071 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:57,076 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:57,083 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 77 [2018-11-23 04:59:57,169 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:57,170 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:57,171 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:57,172 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:57,173 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:57,173 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:57,176 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:57,181 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:57,182 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:57,183 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:57,189 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 12 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 91 [2018-11-23 04:59:57,192 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 79 [2018-11-23 04:59:57,193 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 04:59:57,240 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:57,241 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:57,242 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:57,243 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:57,243 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:57,245 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:57,246 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:57,247 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:57,248 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:57,253 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 13 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 89 [2018-11-23 04:59:57,253 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-11-23 04:59:57,311 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 04:59:57,371 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:57,372 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:57,373 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:57,373 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:57,374 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:57,375 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:57,375 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:57,376 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 89 [2018-11-23 04:59:57,379 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 75 [2018-11-23 04:59:57,379 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-23 04:59:57,398 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:59:57,455 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-23 04:59:57,527 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:57,528 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:57,534 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:57,535 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 63 [2018-11-23 04:59:57,565 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:57,566 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:57,566 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:57,567 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:57,568 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:57,568 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:57,570 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:57,571 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 73 [2018-11-23 04:59:57,575 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 67 [2018-11-23 04:59:57,575 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-23 04:59:57,588 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:59:57,600 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:59:57,668 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-11-23 04:59:57,760 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:57,761 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 55 [2018-11-23 04:59:57,785 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:57,786 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:57,788 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:57,789 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 60 [2018-11-23 04:59:57,811 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:57,812 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:57,812 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:57,813 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:57,814 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:57,816 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:57,816 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 73 [2018-11-23 04:59:57,820 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 67 [2018-11-23 04:59:57,820 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-23 04:59:57,833 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:59:57,843 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:59:57,861 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:59:57,939 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 6 xjuncts. [2018-11-23 04:59:58,031 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 6 xjuncts. [2018-11-23 04:59:58,123 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 20 dim-0 vars, and 6 xjuncts. [2018-11-23 04:59:58,124 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 5 variables, input treesize:70, output treesize:357 [2018-11-23 04:59:58,266 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-11-23 04:59:58,266 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 04:59:58,338 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-11-23 04:59:58,364 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-23 04:59:58,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [8] total 10 [2018-11-23 04:59:58,364 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 04:59:58,364 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 04:59:58,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 04:59:58,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-11-23 04:59:58,365 INFO L87 Difference]: Start difference. First operand 74 states and 78 transitions. Second operand 3 states. [2018-11-23 04:59:58,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:59:58,392 INFO L93 Difference]: Finished difference Result 73 states and 77 transitions. [2018-11-23 04:59:58,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 04:59:58,392 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-11-23 04:59:58,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:59:58,393 INFO L225 Difference]: With dead ends: 73 [2018-11-23 04:59:58,393 INFO L226 Difference]: Without dead ends: 73 [2018-11-23 04:59:58,394 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-11-23 04:59:58,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-11-23 04:59:58,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-11-23 04:59:58,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-11-23 04:59:58,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 77 transitions. [2018-11-23 04:59:58,400 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 77 transitions. Word has length 33 [2018-11-23 04:59:58,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:59:58,400 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 77 transitions. [2018-11-23 04:59:58,400 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 04:59:58,400 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 77 transitions. [2018-11-23 04:59:58,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-23 04:59:58,401 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:59:58,401 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 04:59:58,401 INFO L423 AbstractCegarLoop]: === Iteration 9 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-11-23 04:59:58,401 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:59:58,401 INFO L82 PathProgramCache]: Analyzing trace with hash -387148319, now seen corresponding path program 1 times [2018-11-23 04:59:58,401 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 04:59:58,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:59:58,402 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 04:59:58,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:59:58,402 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 04:59:58,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:59:58,451 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 04:59:58,451 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 04:59:58,451 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 04:59:58,452 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 34 with the following transitions: [2018-11-23 04:59:58,452 INFO L202 CegarAbsIntRunner]: [0], [1], [27], [35], [36], [41], [99], [105], [107], [108], [112], [116], [117], [118], [120], [121], [122], [124], [125], [126], [128] [2018-11-23 04:59:58,453 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 04:59:58,453 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 04:59:58,499 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-23 04:59:58,499 INFO L272 AbstractInterpreter]: Visited 21 different actions 40 times. Merged at 6 different actions 15 times. Widened at 1 different actions 1 times. Performed 447 root evaluator evaluations with a maximum evaluation depth of 4. Performed 447 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 3 fixpoints after 3 different actions. Largest state had 36 variables. [2018-11-23 04:59:58,513 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:59:58,513 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-23 04:59:58,514 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 04:59:58,514 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c13b829e-a593-4ad2-a06c-fcefee1cc234/bin-2019/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 04:59:58,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:59:58,524 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 04:59:58,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:59:58,554 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 04:59:58,565 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 04:59:58,565 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 04:59:58,638 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 04:59:58,663 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 04:59:58,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 13 [2018-11-23 04:59:58,664 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 04:59:58,664 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 04:59:58,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 04:59:58,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-23 04:59:58,665 INFO L87 Difference]: Start difference. First operand 73 states and 77 transitions. Second operand 9 states. [2018-11-23 04:59:58,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:59:58,696 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions. [2018-11-23 04:59:58,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 04:59:58,697 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 33 [2018-11-23 04:59:58,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:59:58,697 INFO L225 Difference]: With dead ends: 78 [2018-11-23 04:59:58,697 INFO L226 Difference]: Without dead ends: 78 [2018-11-23 04:59:58,698 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 60 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-23 04:59:58,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-11-23 04:59:58,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2018-11-23 04:59:58,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-11-23 04:59:58,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 80 transitions. [2018-11-23 04:59:58,701 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 80 transitions. Word has length 33 [2018-11-23 04:59:58,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:59:58,701 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 80 transitions. [2018-11-23 04:59:58,701 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 04:59:58,701 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 80 transitions. [2018-11-23 04:59:58,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-23 04:59:58,702 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:59:58,702 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 04:59:58,702 INFO L423 AbstractCegarLoop]: === Iteration 10 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-11-23 04:59:58,702 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:59:58,702 INFO L82 PathProgramCache]: Analyzing trace with hash -1133876442, now seen corresponding path program 2 times [2018-11-23 04:59:58,702 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 04:59:58,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:59:58,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:59:58,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:59:58,703 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 04:59:58,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:59:58,747 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 04:59:58,747 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 04:59:58,748 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 04:59:58,748 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 04:59:58,748 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 04:59:58,748 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 04:59:58,748 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c13b829e-a593-4ad2-a06c-fcefee1cc234/bin-2019/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 04:59:58,758 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 04:59:58,758 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-23 04:59:58,775 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2018-11-23 04:59:58,775 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 04:59:58,777 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 04:59:58,781 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2018-11-23 04:59:58,785 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:58,793 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:58,793 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 33 [2018-11-23 04:59:58,801 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 33 [2018-11-23 04:59:58,813 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:58,814 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:58,815 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 41 [2018-11-23 04:59:58,817 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:58,818 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:58,819 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:58,820 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2018-11-23 04:59:58,820 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 04:59:58,835 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:59:58,851 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:58,851 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:58,853 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:58,854 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:58,855 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:58,855 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 55 [2018-11-23 04:59:58,859 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:58,860 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:58,861 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:58,862 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:58,863 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 70 [2018-11-23 04:59:58,863 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 04:59:58,878 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:59:58,893 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 04:59:58,910 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 04:59:58,924 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 04:59:58,947 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 45 [2018-11-23 04:59:58,957 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:58,963 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 55 [2018-11-23 04:59:58,965 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 41 [2018-11-23 04:59:58,984 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:58,985 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:58,987 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:58,988 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 51 [2018-11-23 04:59:59,009 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:59,010 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:59,011 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:59,012 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:59,013 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:59,015 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:59,016 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2018-11-23 04:59:59,016 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-23 04:59:59,041 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:59:59,051 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:59:59,075 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:59,078 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:59,085 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 53 [2018-11-23 04:59:59,140 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:59,141 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:59,143 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:59,145 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:59,148 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:59,158 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 68 [2018-11-23 04:59:59,232 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:59,233 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:59,233 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:59,234 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:59,235 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:59,235 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:59,236 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:59,236 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 56 [2018-11-23 04:59:59,237 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-11-23 04:59:59,291 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:59,292 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:59,293 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:59,295 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:59,296 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:59,305 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:59,308 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:59,310 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:59,311 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:59,312 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:59,313 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 12 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 45 [2018-11-23 04:59:59,313 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-23 04:59:59,333 INFO L267 ElimStorePlain]: Start of recursive call 15: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:59:59,361 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:59,362 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:59,365 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:59,366 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 54 [2018-11-23 04:59:59,386 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:59,387 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:59,387 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:59,388 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:59,389 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:59,389 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:59,391 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:59:59,391 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2018-11-23 04:59:59,392 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-11-23 04:59:59,400 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:59:59,412 INFO L267 ElimStorePlain]: Start of recursive call 14: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:59:59,423 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:59:59,429 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:59:59,450 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2018-11-23 04:59:59,451 INFO L202 ElimStorePlain]: Needed 19 recursive calls to eliminate 6 variables, input treesize:70, output treesize:102 [2018-11-23 05:00:01,236 WARN L180 SmtUtils]: Spent 1.78 s on a formula simplification that was a NOOP. DAG size: 61 [2018-11-23 05:00:07,810 WARN L180 SmtUtils]: Spent 6.44 s on a formula simplification that was a NOOP. DAG size: 65 [2018-11-23 05:00:07,826 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2018-11-23 05:00:07,827 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 05:00:07,919 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2018-11-23 05:00:07,934 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-23 05:00:07,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [9] total 15 [2018-11-23 05:00:07,935 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 05:00:07,935 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 05:00:07,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 05:00:07,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2018-11-23 05:00:07,935 INFO L87 Difference]: Start difference. First operand 76 states and 80 transitions. Second operand 5 states. [2018-11-23 05:00:07,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:00:07,998 INFO L93 Difference]: Finished difference Result 75 states and 79 transitions. [2018-11-23 05:00:07,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 05:00:07,998 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 36 [2018-11-23 05:00:07,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:00:07,999 INFO L225 Difference]: With dead ends: 75 [2018-11-23 05:00:07,999 INFO L226 Difference]: Without dead ends: 75 [2018-11-23 05:00:07,999 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2018-11-23 05:00:07,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-11-23 05:00:08,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-11-23 05:00:08,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-11-23 05:00:08,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 79 transitions. [2018-11-23 05:00:08,002 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 79 transitions. Word has length 36 [2018-11-23 05:00:08,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:00:08,002 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 79 transitions. [2018-11-23 05:00:08,002 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 05:00:08,003 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 79 transitions. [2018-11-23 05:00:08,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-23 05:00:08,003 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:00:08,003 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:00:08,003 INFO L423 AbstractCegarLoop]: === Iteration 11 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-11-23 05:00:08,004 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:00:08,004 INFO L82 PathProgramCache]: Analyzing trace with hash -69292150, now seen corresponding path program 1 times [2018-11-23 05:00:08,004 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 05:00:08,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:00:08,004 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 05:00:08,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:00:08,005 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 05:00:08,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:00:08,040 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2018-11-23 05:00:08,040 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:00:08,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 05:00:08,040 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 05:00:08,040 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 05:00:08,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 05:00:08,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-23 05:00:08,040 INFO L87 Difference]: Start difference. First operand 75 states and 79 transitions. Second operand 6 states. [2018-11-23 05:00:08,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:00:08,088 INFO L93 Difference]: Finished difference Result 74 states and 78 transitions. [2018-11-23 05:00:08,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 05:00:08,089 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 45 [2018-11-23 05:00:08,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:00:08,089 INFO L225 Difference]: With dead ends: 74 [2018-11-23 05:00:08,089 INFO L226 Difference]: Without dead ends: 74 [2018-11-23 05:00:08,089 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-11-23 05:00:08,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-11-23 05:00:08,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-11-23 05:00:08,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-11-23 05:00:08,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 78 transitions. [2018-11-23 05:00:08,092 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 78 transitions. Word has length 45 [2018-11-23 05:00:08,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:00:08,092 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 78 transitions. [2018-11-23 05:00:08,092 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 05:00:08,092 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 78 transitions. [2018-11-23 05:00:08,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-23 05:00:08,093 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:00:08,093 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:00:08,093 INFO L423 AbstractCegarLoop]: === Iteration 12 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-11-23 05:00:08,093 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:00:08,093 INFO L82 PathProgramCache]: Analyzing trace with hash -69292149, now seen corresponding path program 1 times [2018-11-23 05:00:08,094 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 05:00:08,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:00:08,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:00:08,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:00:08,094 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 05:00:08,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:00:08,141 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 05:00:08,142 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:00:08,142 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 05:00:08,142 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 46 with the following transitions: [2018-11-23 05:00:08,142 INFO L202 CegarAbsIntRunner]: [0], [1], [3], [11], [14], [27], [33], [35], [36], [39], [42], [44], [48], [49], [99], [105], [107], [108], [112], [116], [117], [118], [119], [120], [121], [122], [124], [125], [126], [128] [2018-11-23 05:00:08,143 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 05:00:08,143 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 05:00:08,196 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-23 05:00:08,196 INFO L272 AbstractInterpreter]: Visited 30 different actions 60 times. Merged at 8 different actions 24 times. Never widened. Performed 541 root evaluator evaluations with a maximum evaluation depth of 4. Performed 541 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 4 fixpoints after 4 different actions. Largest state had 39 variables. [2018-11-23 05:00:08,208 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:00:08,208 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-23 05:00:08,208 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:00:08,208 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c13b829e-a593-4ad2-a06c-fcefee1cc234/bin-2019/utaipan/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 05:00:08,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:00:08,216 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 05:00:08,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:00:08,237 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:00:08,244 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 05:00:08,244 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 05:00:08,291 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 05:00:08,305 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 05:00:08,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 13 [2018-11-23 05:00:08,306 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 05:00:08,306 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 05:00:08,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 05:00:08,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-23 05:00:08,306 INFO L87 Difference]: Start difference. First operand 74 states and 78 transitions. Second operand 10 states. [2018-11-23 05:00:08,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:00:08,324 INFO L93 Difference]: Finished difference Result 79 states and 83 transitions. [2018-11-23 05:00:08,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 05:00:08,325 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 45 [2018-11-23 05:00:08,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:00:08,325 INFO L225 Difference]: With dead ends: 79 [2018-11-23 05:00:08,325 INFO L226 Difference]: Without dead ends: 79 [2018-11-23 05:00:08,326 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 83 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-23 05:00:08,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-11-23 05:00:08,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 77. [2018-11-23 05:00:08,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-11-23 05:00:08,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 81 transitions. [2018-11-23 05:00:08,328 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 81 transitions. Word has length 45 [2018-11-23 05:00:08,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:00:08,329 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 81 transitions. [2018-11-23 05:00:08,329 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 05:00:08,329 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2018-11-23 05:00:08,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-23 05:00:08,329 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:00:08,330 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:00:08,330 INFO L423 AbstractCegarLoop]: === Iteration 13 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-11-23 05:00:08,330 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:00:08,330 INFO L82 PathProgramCache]: Analyzing trace with hash -912931504, now seen corresponding path program 2 times [2018-11-23 05:00:08,330 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 05:00:08,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:00:08,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:00:08,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:00:08,331 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 05:00:08,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:00:08,397 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 05:00:08,397 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:00:08,397 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 05:00:08,397 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 05:00:08,397 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 05:00:08,397 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:00:08,398 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c13b829e-a593-4ad2-a06c-fcefee1cc234/bin-2019/utaipan/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 05:00:08,405 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 05:00:08,406 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-23 05:00:08,422 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2018-11-23 05:00:08,422 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 05:00:08,424 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:00:08,429 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2018-11-23 05:00:08,432 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:00:08,433 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:00:08,433 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 33 [2018-11-23 05:00:08,440 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 33 [2018-11-23 05:00:08,443 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:00:08,447 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:00:08,448 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 41 [2018-11-23 05:00:08,451 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:00:08,451 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:00:08,452 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:00:08,452 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2018-11-23 05:00:08,453 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 05:00:08,464 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:00:08,478 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:00:08,479 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:00:08,480 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:00:08,481 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:00:08,481 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:00:08,482 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 55 [2018-11-23 05:00:08,484 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:00:08,485 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:00:08,486 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:00:08,487 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:00:08,487 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 70 [2018-11-23 05:00:08,488 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 05:00:08,501 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:00:08,513 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:00:08,527 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:00:08,540 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:00:08,559 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 45 [2018-11-23 05:00:08,568 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:00:08,573 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 55 [2018-11-23 05:00:08,589 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 47 [2018-11-23 05:00:08,624 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:00:08,625 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:00:08,626 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:00:08,627 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:00:08,629 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:00:08,641 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 68 [2018-11-23 05:00:08,719 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:00:08,720 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:00:08,720 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:00:08,722 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:00:08,722 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:00:08,723 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:00:08,725 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:00:08,726 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:00:08,726 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:00:08,727 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:00:08,727 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 12 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 45 [2018-11-23 05:00:08,728 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-23 05:00:08,751 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:00:08,751 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:00:08,752 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:00:08,752 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:00:08,753 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:00:08,753 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:00:08,755 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:00:08,755 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 41 [2018-11-23 05:00:08,756 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-23 05:00:08,774 INFO L267 ElimStorePlain]: Start of recursive call 12: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:00:08,793 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:00:08,793 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:00:08,795 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:00:08,795 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 54 [2018-11-23 05:00:08,814 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:00:08,814 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:00:08,815 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:00:08,815 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:00:08,816 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:00:08,817 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:00:08,818 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:00:08,819 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2018-11-23 05:00:08,819 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-11-23 05:00:08,830 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:00:08,842 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:00:08,857 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:00:08,857 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 40 [2018-11-23 05:00:08,875 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:00:08,876 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:00:08,878 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:00:08,879 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 51 [2018-11-23 05:00:08,898 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:00:08,899 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:00:08,900 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:00:08,900 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:00:08,901 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:00:08,903 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:00:08,903 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 33 [2018-11-23 05:00:08,903 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-11-23 05:00:08,910 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:00:08,915 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:00:08,923 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:00:08,928 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:00:08,947 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2018-11-23 05:00:08,947 INFO L202 ElimStorePlain]: Needed 19 recursive calls to eliminate 6 variables, input treesize:70, output treesize:102 [2018-11-23 05:00:12,549 WARN L180 SmtUtils]: Spent 3.35 s on a formula simplification. DAG size of input: 111 DAG size of output: 61 [2018-11-23 05:00:12,672 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-11-23 05:00:12,672 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 05:00:12,782 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 18 [2018-11-23 05:00:12,822 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-11-23 05:00:12,868 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-11-23 05:00:12,935 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-11-23 05:00:12,950 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-23 05:00:12,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [10] total 20 [2018-11-23 05:00:12,951 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 05:00:12,951 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 05:00:12,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 05:00:12,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2018-11-23 05:00:12,951 INFO L87 Difference]: Start difference. First operand 77 states and 81 transitions. Second operand 7 states. [2018-11-23 05:00:14,756 WARN L180 SmtUtils]: Spent 1.71 s on a formula simplification. DAG size of input: 84 DAG size of output: 68 [2018-11-23 05:00:16,976 WARN L180 SmtUtils]: Spent 2.18 s on a formula simplification. DAG size of input: 88 DAG size of output: 72 [2018-11-23 05:00:17,198 WARN L180 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 70 [2018-11-23 05:00:17,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:00:17,238 INFO L93 Difference]: Finished difference Result 77 states and 81 transitions. [2018-11-23 05:00:17,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 05:00:17,238 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 48 [2018-11-23 05:00:17,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:00:17,239 INFO L225 Difference]: With dead ends: 77 [2018-11-23 05:00:17,239 INFO L226 Difference]: Without dead ends: 77 [2018-11-23 05:00:17,239 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 85 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=96, Invalid=410, Unknown=0, NotChecked=0, Total=506 [2018-11-23 05:00:17,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-11-23 05:00:17,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-11-23 05:00:17,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-11-23 05:00:17,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 81 transitions. [2018-11-23 05:00:17,242 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 81 transitions. Word has length 48 [2018-11-23 05:00:17,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:00:17,242 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 81 transitions. [2018-11-23 05:00:17,242 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 05:00:17,242 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2018-11-23 05:00:17,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-23 05:00:17,243 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:00:17,243 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:00:17,243 INFO L423 AbstractCegarLoop]: === Iteration 14 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-11-23 05:00:17,243 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:00:17,243 INFO L82 PathProgramCache]: Analyzing trace with hash 1763894402, now seen corresponding path program 1 times [2018-11-23 05:00:17,243 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 05:00:17,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:00:17,244 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 05:00:17,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:00:17,244 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 05:00:17,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:00:17,322 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 05:00:17,322 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:00:17,322 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 05:00:17,322 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 50 with the following transitions: [2018-11-23 05:00:17,322 INFO L202 CegarAbsIntRunner]: [0], [1], [3], [11], [12], [16], [27], [33], [35], [36], [39], [42], [44], [48], [49], [99], [105], [107], [108], [112], [116], [117], [118], [119], [120], [121], [122], [124], [125], [126], [128] [2018-11-23 05:00:17,324 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 05:00:17,324 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 05:00:17,390 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-23 05:00:17,390 INFO L272 AbstractInterpreter]: Visited 31 different actions 70 times. Merged at 11 different actions 32 times. Widened at 1 different actions 1 times. Performed 600 root evaluator evaluations with a maximum evaluation depth of 4. Performed 600 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 5 fixpoints after 5 different actions. Largest state had 39 variables. [2018-11-23 05:00:17,409 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:00:17,409 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-23 05:00:17,409 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:00:17,409 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c13b829e-a593-4ad2-a06c-fcefee1cc234/bin-2019/utaipan/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 05:00:17,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:00:17,425 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 05:00:17,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:00:17,458 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:00:17,476 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 05:00:17,477 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 05:00:17,541 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 05:00:17,556 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 05:00:17,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 13 [2018-11-23 05:00:17,557 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 05:00:17,557 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 05:00:17,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 05:00:17,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-23 05:00:17,557 INFO L87 Difference]: Start difference. First operand 77 states and 81 transitions. Second operand 11 states. [2018-11-23 05:00:17,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:00:17,579 INFO L93 Difference]: Finished difference Result 82 states and 86 transitions. [2018-11-23 05:00:17,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 05:00:17,581 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 49 [2018-11-23 05:00:17,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:00:17,581 INFO L225 Difference]: With dead ends: 82 [2018-11-23 05:00:17,582 INFO L226 Difference]: Without dead ends: 82 [2018-11-23 05:00:17,582 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 90 SyntacticMatches, 6 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-23 05:00:17,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-11-23 05:00:17,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 80. [2018-11-23 05:00:17,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-11-23 05:00:17,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 84 transitions. [2018-11-23 05:00:17,584 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 84 transitions. Word has length 49 [2018-11-23 05:00:17,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:00:17,584 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 84 transitions. [2018-11-23 05:00:17,584 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 05:00:17,585 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 84 transitions. [2018-11-23 05:00:17,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-23 05:00:17,587 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:00:17,587 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:00:17,587 INFO L423 AbstractCegarLoop]: === Iteration 15 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-11-23 05:00:17,588 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:00:17,588 INFO L82 PathProgramCache]: Analyzing trace with hash -1239445561, now seen corresponding path program 2 times [2018-11-23 05:00:17,588 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 05:00:17,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:00:17,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:00:17,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:00:17,588 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 05:00:17,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:00:17,654 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 05:00:17,654 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:00:17,654 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 05:00:17,654 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 05:00:17,654 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 05:00:17,654 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:00:17,654 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c13b829e-a593-4ad2-a06c-fcefee1cc234/bin-2019/utaipan/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 05:00:17,662 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 05:00:17,662 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-23 05:00:17,681 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2018-11-23 05:00:17,681 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 05:00:17,683 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:00:17,690 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 41 [2018-11-23 05:00:17,693 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:00:17,701 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 44 [2018-11-23 05:00:17,705 INFO L478 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 0 case distinctions, treesize of input 38 treesize of output 37 [2018-11-23 05:00:17,710 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 33 [2018-11-23 05:00:17,719 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:00:17,720 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:00:17,721 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:00:17,726 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:00:17,727 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 54 [2018-11-23 05:00:17,732 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 49 [2018-11-23 05:00:17,733 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 05:00:17,742 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:00:17,761 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:00:17,770 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:00:17,794 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:00:17,798 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:00:17,809 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 47 [2018-11-23 05:00:17,813 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:00:17,815 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:00:17,822 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 50 [2018-11-23 05:00:17,881 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:00:17,882 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:00:17,883 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:00:17,887 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:00:17,888 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 73 [2018-11-23 05:00:17,892 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 57 [2018-11-23 05:00:17,893 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-23 05:00:17,908 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:00:17,932 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:00:17,933 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:00:17,934 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:00:17,937 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:00:17,939 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:00:17,940 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:00:17,942 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:00:17,947 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 75 [2018-11-23 05:00:17,950 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 73 [2018-11-23 05:00:17,951 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-23 05:00:17,987 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:00:17,989 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:00:17,990 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:00:17,990 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:00:17,991 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:00:17,993 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:00:17,994 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:00:17,995 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:00:17,996 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:00:18,000 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 9 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 73 [2018-11-23 05:00:18,001 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 2 xjuncts. [2018-11-23 05:00:18,048 INFO L267 ElimStorePlain]: Start of recursive call 12: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 05:00:18,093 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-23 05:00:18,149 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 44 [2018-11-23 05:00:18,168 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:00:18,169 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:00:18,170 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:00:18,174 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:00:18,174 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 58 [2018-11-23 05:00:18,182 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 53 [2018-11-23 05:00:18,182 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-23 05:00:18,194 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:00:18,203 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:00:18,256 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-11-23 05:00:18,318 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 6 xjuncts. [2018-11-23 05:00:18,375 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 6 xjuncts. [2018-11-23 05:00:18,434 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 20 dim-0 vars, and 6 xjuncts. [2018-11-23 05:00:18,434 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 5 variables, input treesize:42, output treesize:261 [2018-11-23 05:00:18,552 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2018-11-23 05:00:18,553 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 05:00:18,590 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2018-11-23 05:00:18,605 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-23 05:00:18,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [11] total 13 [2018-11-23 05:00:18,606 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 05:00:18,606 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 05:00:18,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 05:00:18,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2018-11-23 05:00:18,606 INFO L87 Difference]: Start difference. First operand 80 states and 84 transitions. Second operand 3 states. [2018-11-23 05:00:18,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:00:18,626 INFO L93 Difference]: Finished difference Result 79 states and 83 transitions. [2018-11-23 05:00:18,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 05:00:18,627 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2018-11-23 05:00:18,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:00:18,627 INFO L225 Difference]: With dead ends: 79 [2018-11-23 05:00:18,627 INFO L226 Difference]: Without dead ends: 79 [2018-11-23 05:00:18,628 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2018-11-23 05:00:18,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-11-23 05:00:18,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-11-23 05:00:18,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-11-23 05:00:18,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 83 transitions. [2018-11-23 05:00:18,630 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 83 transitions. Word has length 52 [2018-11-23 05:00:18,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:00:18,630 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 83 transitions. [2018-11-23 05:00:18,630 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 05:00:18,630 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 83 transitions. [2018-11-23 05:00:18,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-23 05:00:18,631 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:00:18,631 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:00:18,631 INFO L423 AbstractCegarLoop]: === Iteration 16 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-11-23 05:00:18,631 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:00:18,631 INFO L82 PathProgramCache]: Analyzing trace with hash -1239445560, now seen corresponding path program 1 times [2018-11-23 05:00:18,632 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 05:00:18,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:00:18,632 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 05:00:18,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:00:18,632 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 05:00:18,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:00:18,684 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 05:00:18,684 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:00:18,685 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 05:00:18,685 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 53 with the following transitions: [2018-11-23 05:00:18,685 INFO L202 CegarAbsIntRunner]: [0], [1], [3], [11], [12], [17], [27], [33], [35], [36], [39], [42], [44], [48], [49], [99], [105], [107], [108], [112], [116], [117], [118], [119], [120], [121], [122], [124], [125], [126], [128] [2018-11-23 05:00:18,686 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 05:00:18,686 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 05:00:18,751 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-23 05:00:18,752 INFO L272 AbstractInterpreter]: Visited 31 different actions 77 times. Merged at 14 different actions 38 times. Widened at 2 different actions 2 times. Performed 637 root evaluator evaluations with a maximum evaluation depth of 4. Performed 637 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 6 fixpoints after 6 different actions. Largest state had 39 variables. [2018-11-23 05:00:18,761 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:00:18,761 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-23 05:00:18,761 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:00:18,761 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c13b829e-a593-4ad2-a06c-fcefee1cc234/bin-2019/utaipan/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 05:00:18,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:00:18,786 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 05:00:18,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:00:18,813 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:00:18,833 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 05:00:18,833 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 05:00:18,880 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 05:00:18,896 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 05:00:18,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 13 [2018-11-23 05:00:18,896 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 05:00:18,897 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 05:00:18,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 05:00:18,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-23 05:00:18,897 INFO L87 Difference]: Start difference. First operand 79 states and 83 transitions. Second operand 12 states. [2018-11-23 05:00:18,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:00:18,925 INFO L93 Difference]: Finished difference Result 84 states and 88 transitions. [2018-11-23 05:00:18,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 05:00:18,926 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 52 [2018-11-23 05:00:18,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:00:18,927 INFO L225 Difference]: With dead ends: 84 [2018-11-23 05:00:18,927 INFO L226 Difference]: Without dead ends: 84 [2018-11-23 05:00:18,927 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 95 SyntacticMatches, 8 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-23 05:00:18,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-11-23 05:00:18,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 82. [2018-11-23 05:00:18,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-11-23 05:00:18,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 86 transitions. [2018-11-23 05:00:18,929 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 86 transitions. Word has length 52 [2018-11-23 05:00:18,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:00:18,930 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 86 transitions. [2018-11-23 05:00:18,930 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 05:00:18,930 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 86 transitions. [2018-11-23 05:00:18,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-23 05:00:18,930 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:00:18,930 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:00:18,931 INFO L423 AbstractCegarLoop]: === Iteration 17 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-11-23 05:00:18,931 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:00:18,931 INFO L82 PathProgramCache]: Analyzing trace with hash -981573021, now seen corresponding path program 2 times [2018-11-23 05:00:18,931 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 05:00:18,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:00:18,932 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:00:18,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:00:18,932 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 05:00:18,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:00:19,001 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 05:00:19,001 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:00:19,001 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 05:00:19,001 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 05:00:19,001 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 05:00:19,001 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:00:19,002 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c13b829e-a593-4ad2-a06c-fcefee1cc234/bin-2019/utaipan/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 05:00:19,018 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 05:00:19,018 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-23 05:00:19,037 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2018-11-23 05:00:19,037 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 05:00:19,039 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:00:19,042 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2018-11-23 05:00:19,046 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:00:19,054 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 27 [2018-11-23 05:00:19,056 INFO L478 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 0 case distinctions, treesize of input 21 treesize of output 23 [2018-11-23 05:00:19,060 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2018-11-23 05:00:19,073 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:00:19,078 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:00:19,078 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:00:19,079 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 33 [2018-11-23 05:00:19,080 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 05:00:19,087 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:00:19,093 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:00:19,107 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:00:19,110 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:00:19,115 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 33 [2018-11-23 05:00:19,118 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2018-11-23 05:00:19,122 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:00:19,123 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:00:19,123 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:00:19,124 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 37 [2018-11-23 05:00:19,124 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 05:00:19,134 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:00:19,149 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:00:19,150 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:00:19,153 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:00:19,158 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 39 [2018-11-23 05:00:19,160 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:00:19,162 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:00:19,163 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:00:19,164 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:00:19,165 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:00:19,166 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:00:19,167 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 62 [2018-11-23 05:00:19,167 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-23 05:00:19,195 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:00:19,197 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:00:19,198 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:00:19,198 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 52 [2018-11-23 05:00:19,198 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-23 05:00:19,249 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:00:19,272 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 05:00:19,299 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-23 05:00:19,324 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-23 05:00:19,353 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 23 [2018-11-23 05:00:19,356 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:00:19,361 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 29 [2018-11-23 05:00:19,363 INFO L478 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 0 case distinctions, treesize of input 23 treesize of output 25 [2018-11-23 05:00:19,368 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2018-11-23 05:00:19,374 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:00:19,375 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:00:19,376 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:00:19,378 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:00:19,378 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2018-11-23 05:00:19,379 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-23 05:00:19,384 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:00:19,388 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:00:19,399 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:00:19,401 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:00:19,406 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 35 [2018-11-23 05:00:19,409 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 35 [2018-11-23 05:00:19,424 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:00:19,425 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:00:19,425 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:00:19,427 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:00:19,427 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2018-11-23 05:00:19,427 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-11-23 05:00:19,434 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:00:19,447 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:00:19,448 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:00:19,449 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:00:19,453 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 41 [2018-11-23 05:00:19,484 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:00:19,484 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:00:19,485 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:00:19,487 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:00:19,488 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:00:19,489 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:00:19,489 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:00:19,490 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 29 [2018-11-23 05:00:19,490 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-11-23 05:00:19,507 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:00:19,508 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:00:19,509 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:00:19,511 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:00:19,511 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 25 [2018-11-23 05:00:19,511 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-11-23 05:00:19,521 INFO L267 ElimStorePlain]: Start of recursive call 21: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:00:19,530 INFO L267 ElimStorePlain]: Start of recursive call 18: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:00:19,536 INFO L267 ElimStorePlain]: Start of recursive call 14: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:00:19,540 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:00:19,566 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2018-11-23 05:00:19,566 INFO L202 ElimStorePlain]: Needed 23 recursive calls to eliminate 6 variables, input treesize:42, output treesize:78 [2018-11-23 05:00:19,643 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2018-11-23 05:00:19,643 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 05:00:19,719 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2018-11-23 05:00:19,734 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-23 05:00:19,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [12] total 18 [2018-11-23 05:00:19,734 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 05:00:19,734 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 05:00:19,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 05:00:19,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2018-11-23 05:00:19,735 INFO L87 Difference]: Start difference. First operand 82 states and 86 transitions. Second operand 5 states. [2018-11-23 05:00:19,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:00:19,777 INFO L93 Difference]: Finished difference Result 81 states and 85 transitions. [2018-11-23 05:00:19,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 05:00:19,777 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 55 [2018-11-23 05:00:19,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:00:19,778 INFO L225 Difference]: With dead ends: 81 [2018-11-23 05:00:19,778 INFO L226 Difference]: Without dead ends: 81 [2018-11-23 05:00:19,779 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2018-11-23 05:00:19,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-11-23 05:00:19,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-11-23 05:00:19,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-11-23 05:00:19,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 85 transitions. [2018-11-23 05:00:19,781 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 85 transitions. Word has length 55 [2018-11-23 05:00:19,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:00:19,781 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 85 transitions. [2018-11-23 05:00:19,781 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 05:00:19,781 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 85 transitions. [2018-11-23 05:00:19,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-23 05:00:19,782 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:00:19,782 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:00:19,782 INFO L423 AbstractCegarLoop]: === Iteration 18 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-11-23 05:00:19,782 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:00:19,782 INFO L82 PathProgramCache]: Analyzing trace with hash -965711231, now seen corresponding path program 1 times [2018-11-23 05:00:19,782 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 05:00:19,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:00:19,783 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 05:00:19,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:00:19,783 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 05:00:19,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:00:19,825 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2018-11-23 05:00:19,825 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:00:19,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 05:00:19,825 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 05:00:19,825 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 05:00:19,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 05:00:19,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-23 05:00:19,826 INFO L87 Difference]: Start difference. First operand 81 states and 85 transitions. Second operand 6 states. [2018-11-23 05:00:19,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:00:19,876 INFO L93 Difference]: Finished difference Result 80 states and 84 transitions. [2018-11-23 05:00:19,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 05:00:19,877 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2018-11-23 05:00:19,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:00:19,878 INFO L225 Difference]: With dead ends: 80 [2018-11-23 05:00:19,878 INFO L226 Difference]: Without dead ends: 80 [2018-11-23 05:00:19,878 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-11-23 05:00:19,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-11-23 05:00:19,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-11-23 05:00:19,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-11-23 05:00:19,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 84 transitions. [2018-11-23 05:00:19,880 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 84 transitions. Word has length 64 [2018-11-23 05:00:19,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:00:19,881 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 84 transitions. [2018-11-23 05:00:19,881 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 05:00:19,881 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 84 transitions. [2018-11-23 05:00:19,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-23 05:00:19,881 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:00:19,881 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:00:19,881 INFO L423 AbstractCegarLoop]: === Iteration 19 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-11-23 05:00:19,882 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:00:19,882 INFO L82 PathProgramCache]: Analyzing trace with hash -965711230, now seen corresponding path program 1 times [2018-11-23 05:00:19,882 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 05:00:19,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:00:19,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:00:19,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:00:19,886 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 05:00:19,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:00:19,992 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 05:00:19,992 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:00:19,993 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 05:00:19,993 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 65 with the following transitions: [2018-11-23 05:00:19,993 INFO L202 CegarAbsIntRunner]: [0], [1], [3], [9], [11], [12], [15], [18], [20], [24], [25], [27], [33], [35], [36], [39], [42], [44], [48], [49], [51], [59], [62], [99], [105], [107], [108], [112], [116], [117], [118], [119], [120], [121], [122], [123], [124], [125], [126], [128] [2018-11-23 05:00:19,994 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 05:00:19,994 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 05:00:20,062 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-23 05:00:20,062 INFO L272 AbstractInterpreter]: Visited 40 different actions 97 times. Merged at 16 different actions 47 times. Widened at 1 different actions 1 times. Performed 731 root evaluator evaluations with a maximum evaluation depth of 4. Performed 731 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 7 fixpoints after 7 different actions. Largest state had 39 variables. [2018-11-23 05:00:20,069 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:00:20,069 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-23 05:00:20,069 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:00:20,070 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c13b829e-a593-4ad2-a06c-fcefee1cc234/bin-2019/utaipan/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 05:00:20,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:00:20,080 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 05:00:20,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:00:20,115 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:00:20,128 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 05:00:20,128 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 05:00:20,213 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 05:00:20,238 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 05:00:20,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 13 [2018-11-23 05:00:20,238 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 05:00:20,239 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 05:00:20,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 05:00:20,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-23 05:00:20,239 INFO L87 Difference]: Start difference. First operand 80 states and 84 transitions. Second operand 13 states. [2018-11-23 05:00:20,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:00:20,266 INFO L93 Difference]: Finished difference Result 83 states and 87 transitions. [2018-11-23 05:00:20,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 05:00:20,267 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 64 [2018-11-23 05:00:20,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:00:20,268 INFO L225 Difference]: With dead ends: 83 [2018-11-23 05:00:20,268 INFO L226 Difference]: Without dead ends: 83 [2018-11-23 05:00:20,268 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 118 SyntacticMatches, 10 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-23 05:00:20,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-11-23 05:00:20,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-11-23 05:00:20,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-11-23 05:00:20,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 87 transitions. [2018-11-23 05:00:20,270 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 87 transitions. Word has length 64 [2018-11-23 05:00:20,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:00:20,270 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 87 transitions. [2018-11-23 05:00:20,270 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 05:00:20,271 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 87 transitions. [2018-11-23 05:00:20,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-23 05:00:20,271 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:00:20,271 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:00:20,271 INFO L423 AbstractCegarLoop]: === Iteration 20 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-11-23 05:00:20,271 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:00:20,272 INFO L82 PathProgramCache]: Analyzing trace with hash -1653003107, now seen corresponding path program 2 times [2018-11-23 05:00:20,272 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 05:00:20,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:00:20,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:00:20,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:00:20,272 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 05:00:20,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:00:20,306 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2018-11-23 05:00:20,307 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:00:20,307 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 05:00:20,307 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 05:00:20,307 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 05:00:20,307 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:00:20,307 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c13b829e-a593-4ad2-a06c-fcefee1cc234/bin-2019/utaipan/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 05:00:20,323 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 05:00:20,323 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-23 05:00:20,345 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2018-11-23 05:00:20,345 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 05:00:20,347 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:00:20,349 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 23 [2018-11-23 05:00:20,352 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:00:20,357 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 29 [2018-11-23 05:00:20,360 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:00:20,362 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:00:20,367 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 35 [2018-11-23 05:00:20,371 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 35 [2018-11-23 05:00:20,386 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:00:20,387 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:00:20,388 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:00:20,390 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:00:20,391 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2018-11-23 05:00:20,391 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 05:00:20,413 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:00:20,432 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:00:20,433 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:00:20,436 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:00:20,440 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 41 [2018-11-23 05:00:20,470 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:00:20,471 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:00:20,472 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:00:20,475 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:00:20,476 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:00:20,477 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:00:20,478 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:00:20,478 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 29 [2018-11-23 05:00:20,479 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 05:00:20,502 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:00:20,502 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:00:20,503 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:00:20,506 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:00:20,506 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 25 [2018-11-23 05:00:20,507 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 05:00:20,520 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:00:20,533 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:00:20,547 INFO L478 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 0 case distinctions, treesize of input 20 treesize of output 22 [2018-11-23 05:00:20,551 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2018-11-23 05:00:20,557 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:00:20,558 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:00:20,558 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:00:20,561 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:00:20,562 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2018-11-23 05:00:20,562 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-23 05:00:20,567 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:00:20,571 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:00:20,581 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:00:20,586 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:00:20,593 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2018-11-23 05:00:20,595 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:00:20,601 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 27 [2018-11-23 05:00:20,603 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:00:20,605 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:00:20,609 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 33 [2018-11-23 05:00:20,612 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:00:20,614 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:00:20,619 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 39 [2018-11-23 05:00:20,621 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:00:20,623 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:00:20,624 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 62 [2018-11-23 05:00:20,624 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-23 05:00:20,645 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 52 [2018-11-23 05:00:20,645 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-11-23 05:00:20,662 INFO L267 ElimStorePlain]: Start of recursive call 16: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:00:20,683 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2018-11-23 05:00:20,690 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 37 [2018-11-23 05:00:20,691 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-11-23 05:00:20,699 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:00:20,718 INFO L267 ElimStorePlain]: Start of recursive call 15: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 05:00:20,744 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2018-11-23 05:00:20,747 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2018-11-23 05:00:20,750 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 33 [2018-11-23 05:00:20,750 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-11-23 05:00:20,756 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:00:20,761 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:00:20,783 INFO L267 ElimStorePlain]: Start of recursive call 14: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-23 05:00:20,803 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-23 05:00:20,829 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2018-11-23 05:00:20,830 INFO L202 ElimStorePlain]: Needed 23 recursive calls to eliminate 6 variables, input treesize:42, output treesize:78 [2018-11-23 05:00:20,983 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2018-11-23 05:00:20,984 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 05:00:21,094 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 18 [2018-11-23 05:00:21,137 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-11-23 05:00:21,157 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-11-23 05:00:21,192 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2018-11-23 05:00:21,207 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-23 05:00:21,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [4] total 14 [2018-11-23 05:00:21,207 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 05:00:21,208 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 05:00:21,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 05:00:21,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2018-11-23 05:00:21,208 INFO L87 Difference]: Start difference. First operand 83 states and 87 transitions. Second operand 7 states. [2018-11-23 05:00:21,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:00:21,338 INFO L93 Difference]: Finished difference Result 83 states and 87 transitions. [2018-11-23 05:00:21,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 05:00:21,339 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 67 [2018-11-23 05:00:21,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:00:21,339 INFO L225 Difference]: With dead ends: 83 [2018-11-23 05:00:21,339 INFO L226 Difference]: Without dead ends: 83 [2018-11-23 05:00:21,339 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 123 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2018-11-23 05:00:21,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-11-23 05:00:21,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-11-23 05:00:21,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-11-23 05:00:21,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 87 transitions. [2018-11-23 05:00:21,341 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 87 transitions. Word has length 67 [2018-11-23 05:00:21,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:00:21,341 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 87 transitions. [2018-11-23 05:00:21,341 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 05:00:21,341 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 87 transitions. [2018-11-23 05:00:21,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-23 05:00:21,342 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:00:21,342 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:00:21,342 INFO L423 AbstractCegarLoop]: === Iteration 21 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-11-23 05:00:21,342 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:00:21,343 INFO L82 PathProgramCache]: Analyzing trace with hash 296511237, now seen corresponding path program 1 times [2018-11-23 05:00:21,343 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 05:00:21,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:00:21,343 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 05:00:21,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:00:21,343 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 05:00:21,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:00:21,375 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2018-11-23 05:00:21,375 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:00:21,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 05:00:21,375 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 05:00:21,376 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 05:00:21,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 05:00:21,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 05:00:21,376 INFO L87 Difference]: Start difference. First operand 83 states and 87 transitions. Second operand 3 states. [2018-11-23 05:00:21,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:00:21,386 INFO L93 Difference]: Finished difference Result 82 states and 86 transitions. [2018-11-23 05:00:21,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 05:00:21,386 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2018-11-23 05:00:21,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:00:21,387 INFO L225 Difference]: With dead ends: 82 [2018-11-23 05:00:21,387 INFO L226 Difference]: Without dead ends: 82 [2018-11-23 05:00:21,387 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 05:00:21,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-11-23 05:00:21,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-11-23 05:00:21,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-11-23 05:00:21,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 86 transitions. [2018-11-23 05:00:21,388 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 86 transitions. Word has length 68 [2018-11-23 05:00:21,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:00:21,388 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 86 transitions. [2018-11-23 05:00:21,388 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 05:00:21,388 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 86 transitions. [2018-11-23 05:00:21,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-23 05:00:21,389 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:00:21,389 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:00:21,389 INFO L423 AbstractCegarLoop]: === Iteration 22 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-11-23 05:00:21,389 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:00:21,389 INFO L82 PathProgramCache]: Analyzing trace with hash 296511238, now seen corresponding path program 1 times [2018-11-23 05:00:21,389 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 05:00:21,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:00:21,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:00:21,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:00:21,390 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 05:00:21,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:00:21,407 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2018-11-23 05:00:21,408 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:00:21,408 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 05:00:21,408 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 69 with the following transitions: [2018-11-23 05:00:21,408 INFO L202 CegarAbsIntRunner]: [0], [1], [3], [9], [11], [12], [15], [18], [20], [24], [25], [27], [33], [35], [36], [39], [42], [44], [48], [49], [51], [59], [60], [65], [99], [105], [107], [108], [112], [116], [117], [118], [119], [120], [121], [122], [123], [124], [125], [126], [128] [2018-11-23 05:00:21,409 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 05:00:21,409 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 05:00:21,459 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-23 05:00:21,459 INFO L272 AbstractInterpreter]: Visited 41 different actions 105 times. Merged at 19 different actions 53 times. Widened at 2 different actions 2 times. Performed 775 root evaluator evaluations with a maximum evaluation depth of 4. Performed 775 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 8 fixpoints after 8 different actions. Largest state had 39 variables. [2018-11-23 05:00:21,461 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:00:21,461 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-23 05:00:21,461 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:00:21,462 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c13b829e-a593-4ad2-a06c-fcefee1cc234/bin-2019/utaipan/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 05:00:21,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:00:21,485 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 05:00:21,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:00:21,515 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:00:21,526 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2018-11-23 05:00:21,526 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 05:00:21,546 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2018-11-23 05:00:21,561 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 05:00:21,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2018-11-23 05:00:21,561 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 05:00:21,561 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 05:00:21,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 05:00:21,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-23 05:00:21,562 INFO L87 Difference]: Start difference. First operand 82 states and 86 transitions. Second operand 5 states. [2018-11-23 05:00:21,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:00:21,576 INFO L93 Difference]: Finished difference Result 91 states and 95 transitions. [2018-11-23 05:00:21,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 05:00:21,579 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2018-11-23 05:00:21,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:00:21,580 INFO L225 Difference]: With dead ends: 91 [2018-11-23 05:00:21,580 INFO L226 Difference]: Without dead ends: 91 [2018-11-23 05:00:21,580 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-23 05:00:21,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-11-23 05:00:21,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 87. [2018-11-23 05:00:21,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-11-23 05:00:21,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 91 transitions. [2018-11-23 05:00:21,582 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 91 transitions. Word has length 68 [2018-11-23 05:00:21,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:00:21,583 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 91 transitions. [2018-11-23 05:00:21,583 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 05:00:21,583 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 91 transitions. [2018-11-23 05:00:21,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-11-23 05:00:21,583 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:00:21,583 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:00:21,584 INFO L423 AbstractCegarLoop]: === Iteration 23 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-11-23 05:00:21,584 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:00:21,584 INFO L82 PathProgramCache]: Analyzing trace with hash 725066786, now seen corresponding path program 2 times [2018-11-23 05:00:21,584 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 05:00:21,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:00:21,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:00:21,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:00:21,585 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 05:00:21,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:00:21,673 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2018-11-23 05:00:21,674 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:00:21,674 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 05:00:21,674 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 05:00:21,674 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 05:00:21,674 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:00:21,674 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c13b829e-a593-4ad2-a06c-fcefee1cc234/bin-2019/utaipan/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 05:00:21,682 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 05:00:21,682 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-23 05:00:21,700 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2018-11-23 05:00:21,700 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 05:00:21,702 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:00:21,705 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2018-11-23 05:00:21,708 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:00:21,712 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 27 [2018-11-23 05:00:21,714 INFO L478 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 0 case distinctions, treesize of input 21 treesize of output 23 [2018-11-23 05:00:21,718 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2018-11-23 05:00:21,722 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-11-23 05:00:21,722 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 05:00:21,727 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:00:21,732 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:00:21,744 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:00:21,746 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:00:21,751 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 33 [2018-11-23 05:00:21,755 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2018-11-23 05:00:21,759 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 25 [2018-11-23 05:00:21,760 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 05:00:21,766 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:00:21,781 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:00:21,782 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:00:21,786 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:00:21,790 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 39 [2018-11-23 05:00:21,793 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:00:21,797 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:00:21,802 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 42 [2018-11-23 05:00:21,802 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 2 xjuncts. [2018-11-23 05:00:21,831 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 40 [2018-11-23 05:00:21,832 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-23 05:00:21,854 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 05:00:21,878 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-23 05:00:21,905 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-11-23 05:00:21,929 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-11-23 05:00:21,956 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 10 dim-0 vars, and 3 xjuncts. [2018-11-23 05:00:21,956 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:22, output treesize:78 [2018-11-23 05:00:21,988 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2018-11-23 05:00:21,989 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 05:00:22,054 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2018-11-23 05:00:22,068 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-23 05:00:22,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [5] total 11 [2018-11-23 05:00:22,069 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 05:00:22,069 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 05:00:22,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 05:00:22,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2018-11-23 05:00:22,069 INFO L87 Difference]: Start difference. First operand 87 states and 91 transitions. Second operand 5 states. [2018-11-23 05:00:22,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:00:22,101 INFO L93 Difference]: Finished difference Result 86 states and 90 transitions. [2018-11-23 05:00:22,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 05:00:22,101 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 73 [2018-11-23 05:00:22,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:00:22,102 INFO L225 Difference]: With dead ends: 86 [2018-11-23 05:00:22,102 INFO L226 Difference]: Without dead ends: 86 [2018-11-23 05:00:22,102 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2018-11-23 05:00:22,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-11-23 05:00:22,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-11-23 05:00:22,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-11-23 05:00:22,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 90 transitions. [2018-11-23 05:00:22,104 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 90 transitions. Word has length 73 [2018-11-23 05:00:22,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:00:22,105 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 90 transitions. [2018-11-23 05:00:22,105 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 05:00:22,105 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 90 transitions. [2018-11-23 05:00:22,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-11-23 05:00:22,105 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:00:22,106 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:00:22,106 INFO L423 AbstractCegarLoop]: === Iteration 24 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-11-23 05:00:22,106 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:00:22,106 INFO L82 PathProgramCache]: Analyzing trace with hash 807677639, now seen corresponding path program 1 times [2018-11-23 05:00:22,106 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 05:00:22,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:00:22,107 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 05:00:22,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:00:22,107 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 05:00:22,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:00:22,149 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2018-11-23 05:00:22,149 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:00:22,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 05:00:22,149 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 05:00:22,150 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 05:00:22,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 05:00:22,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-23 05:00:22,150 INFO L87 Difference]: Start difference. First operand 86 states and 90 transitions. Second operand 6 states. [2018-11-23 05:00:22,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:00:22,198 INFO L93 Difference]: Finished difference Result 85 states and 89 transitions. [2018-11-23 05:00:22,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 05:00:22,199 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 82 [2018-11-23 05:00:22,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:00:22,200 INFO L225 Difference]: With dead ends: 85 [2018-11-23 05:00:22,200 INFO L226 Difference]: Without dead ends: 85 [2018-11-23 05:00:22,200 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-11-23 05:00:22,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-11-23 05:00:22,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-11-23 05:00:22,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-11-23 05:00:22,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 89 transitions. [2018-11-23 05:00:22,203 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 89 transitions. Word has length 82 [2018-11-23 05:00:22,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:00:22,203 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 89 transitions. [2018-11-23 05:00:22,203 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 05:00:22,203 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 89 transitions. [2018-11-23 05:00:22,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-11-23 05:00:22,204 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:00:22,204 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:00:22,204 INFO L423 AbstractCegarLoop]: === Iteration 25 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-11-23 05:00:22,204 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:00:22,204 INFO L82 PathProgramCache]: Analyzing trace with hash 807677640, now seen corresponding path program 1 times [2018-11-23 05:00:22,204 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 05:00:22,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:00:22,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:00:22,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:00:22,205 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 05:00:22,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:00:22,228 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2018-11-23 05:00:22,228 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:00:22,228 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 05:00:22,228 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 83 with the following transitions: [2018-11-23 05:00:22,228 INFO L202 CegarAbsIntRunner]: [0], [1], [3], [9], [11], [12], [15], [18], [20], [24], [25], [27], [33], [35], [36], [39], [42], [44], [48], [49], [51], [57], [59], [60], [63], [66], [68], [72], [73], [78], [86], [89], [99], [105], [107], [108], [112], [116], [117], [118], [119], [120], [121], [122], [123], [124], [125], [126], [128], [129] [2018-11-23 05:00:22,229 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 05:00:22,230 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 05:00:22,304 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-23 05:00:22,304 INFO L272 AbstractInterpreter]: Visited 50 different actions 125 times. Merged at 21 different actions 62 times. Widened at 1 different actions 1 times. Performed 869 root evaluator evaluations with a maximum evaluation depth of 4. Performed 869 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 9 fixpoints after 9 different actions. Largest state had 39 variables. [2018-11-23 05:00:22,325 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:00:22,325 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-23 05:00:22,325 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:00:22,325 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c13b829e-a593-4ad2-a06c-fcefee1cc234/bin-2019/utaipan/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 05:00:22,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:00:22,337 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 05:00:22,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:00:22,377 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:00:22,385 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2018-11-23 05:00:22,386 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 05:00:22,435 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2018-11-23 05:00:22,459 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 05:00:22,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2018-11-23 05:00:22,460 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 05:00:22,460 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 05:00:22,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 05:00:22,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-23 05:00:22,460 INFO L87 Difference]: Start difference. First operand 85 states and 89 transitions. Second operand 6 states. [2018-11-23 05:00:22,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:00:22,481 INFO L93 Difference]: Finished difference Result 94 states and 98 transitions. [2018-11-23 05:00:22,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 05:00:22,481 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 82 [2018-11-23 05:00:22,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:00:22,481 INFO L225 Difference]: With dead ends: 94 [2018-11-23 05:00:22,481 INFO L226 Difference]: Without dead ends: 94 [2018-11-23 05:00:22,482 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-23 05:00:22,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-11-23 05:00:22,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 90. [2018-11-23 05:00:22,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-11-23 05:00:22,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 94 transitions. [2018-11-23 05:00:22,484 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 94 transitions. Word has length 82 [2018-11-23 05:00:22,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:00:22,484 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 94 transitions. [2018-11-23 05:00:22,484 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 05:00:22,485 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 94 transitions. [2018-11-23 05:00:22,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-11-23 05:00:22,485 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:00:22,485 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:00:22,485 INFO L423 AbstractCegarLoop]: === Iteration 26 === [getNumbers3Err3REQUIRES_VIOLATION, getNumbers3Err0REQUIRES_VIOLATION, getNumbers3Err1REQUIRES_VIOLATION, getNumbers3Err2REQUIRES_VIOLATION, getNumbers2Err0REQUIRES_VIOLATION, getNumbers2Err1REQUIRES_VIOLATION, getNumbers2Err2REQUIRES_VIOLATION, getNumbers2Err3REQUIRES_VIOLATION, getNumbers4Err0REQUIRES_VIOLATION, getNumbers4Err1REQUIRES_VIOLATION, getNumbers4Err2REQUIRES_VIOLATION, getNumbers4Err3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2018-11-23 05:00:22,485 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:00:22,486 INFO L82 PathProgramCache]: Analyzing trace with hash 1455442660, now seen corresponding path program 2 times [2018-11-23 05:00:22,486 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 05:00:22,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:00:22,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:00:22,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:00:22,486 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 05:00:22,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:00:22,523 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2018-11-23 05:00:22,523 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:00:22,523 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 05:00:22,523 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 05:00:22,523 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 05:00:22,523 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:00:22,523 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c13b829e-a593-4ad2-a06c-fcefee1cc234/bin-2019/utaipan/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 05:00:22,540 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 05:00:22,540 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-23 05:00:22,572 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2018-11-23 05:00:22,572 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 05:00:22,574 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:00:22,577 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2018-11-23 05:00:22,580 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:00:22,587 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 27 [2018-11-23 05:00:22,589 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:00:22,595 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:00:22,599 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 33 [2018-11-23 05:00:22,601 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:00:22,618 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:00:22,622 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 39 [2018-11-23 05:00:22,625 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 40 [2018-11-23 05:00:22,625 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 05:00:22,642 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:00:22,644 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:00:22,645 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:00:22,650 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:00:22,654 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 42 [2018-11-23 05:00:22,654 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-11-23 05:00:22,677 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 05:00:22,707 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2018-11-23 05:00:22,712 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 25 [2018-11-23 05:00:22,712 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 05:00:22,718 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:00:22,743 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-23 05:00:22,773 INFO L478 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 0 case distinctions, treesize of input 21 treesize of output 23 [2018-11-23 05:00:22,776 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2018-11-23 05:00:22,780 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-11-23 05:00:22,780 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-23 05:00:22,784 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:00:22,788 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:00:22,819 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-11-23 05:00:22,843 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-11-23 05:00:22,870 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 10 dim-0 vars, and 3 xjuncts. [2018-11-23 05:00:22,871 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:22, output treesize:78 [2018-11-23 05:00:22,921 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2018-11-23 05:00:22,922 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 05:00:23,025 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-11-23 05:00:23,075 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 18 [2018-11-23 05:00:23,185 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-11-23 05:00:23,226 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2018-11-23 05:00:23,240 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-23 05:00:23,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 7] imperfect sequences [6] total 17 [2018-11-23 05:00:23,241 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 05:00:23,241 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 05:00:23,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 05:00:23,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2018-11-23 05:00:23,241 INFO L87 Difference]: Start difference. First operand 90 states and 94 transitions. Second operand 7 states. [2018-11-23 05:00:23,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:00:23,304 INFO L93 Difference]: Finished difference Result 90 states and 94 transitions. [2018-11-23 05:00:23,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 05:00:23,304 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 87 [2018-11-23 05:00:23,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:00:23,305 INFO L225 Difference]: With dead ends: 90 [2018-11-23 05:00:23,305 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 05:00:23,305 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 163 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2018-11-23 05:00:23,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 05:00:23,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 05:00:23,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 05:00:23,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 05:00:23,305 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 87 [2018-11-23 05:00:23,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:00:23,305 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 05:00:23,305 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 05:00:23,305 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 05:00:23,306 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 05:00:23,308 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 05:00:23 BoogieIcfgContainer [2018-11-23 05:00:23,309 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 05:00:23,309 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 05:00:23,309 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 05:00:23,309 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 05:00:23,309 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 04:59:52" (3/4) ... [2018-11-23 05:00:23,312 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 05:00:23,315 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-23 05:00:23,315 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure getNumbers3 [2018-11-23 05:00:23,315 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure getNumbers2 [2018-11-23 05:00:23,315 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure getNumbers4 [2018-11-23 05:00:23,316 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-23 05:00:23,316 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure getNumbers [2018-11-23 05:00:23,319 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 40 nodes and edges [2018-11-23 05:00:23,319 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2018-11-23 05:00:23,319 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-11-23 05:00:23,320 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2018-11-23 05:00:23,320 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-23 05:00:23,346 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_c13b829e-a593-4ad2-a06c-fcefee1cc234/bin-2019/utaipan/witness.graphml [2018-11-23 05:00:23,346 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 05:00:23,347 INFO L168 Benchmark]: Toolchain (without parser) took 31339.47 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 361.8 MB). Free memory was 959.1 MB in the beginning and 1.3 GB in the end (delta: -351.6 MB). Peak memory consumption was 10.1 MB. Max. memory is 11.5 GB. [2018-11-23 05:00:23,347 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 05:00:23,347 INFO L168 Benchmark]: CACSL2BoogieTranslator took 175.51 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 945.7 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2018-11-23 05:00:23,347 INFO L168 Benchmark]: Boogie Procedure Inliner took 23.51 ms. Allocated memory is still 1.0 GB. Free memory is still 945.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 05:00:23,348 INFO L168 Benchmark]: Boogie Preprocessor took 65.60 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 945.7 MB in the beginning and 1.1 GB in the end (delta: -188.5 MB). Peak memory consumption was 22.8 MB. Max. memory is 11.5 GB. [2018-11-23 05:00:23,348 INFO L168 Benchmark]: RCFGBuilder took 363.55 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.7 MB). Peak memory consumption was 27.7 MB. Max. memory is 11.5 GB. [2018-11-23 05:00:23,348 INFO L168 Benchmark]: TraceAbstraction took 30670.96 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 227.5 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -214.4 MB). Peak memory consumption was 13.2 MB. Max. memory is 11.5 GB. [2018-11-23 05:00:23,348 INFO L168 Benchmark]: Witness Printer took 37.27 ms. Allocated memory is still 1.4 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 11.5 GB. [2018-11-23 05:00:23,349 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 175.51 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 945.7 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 23.51 ms. Allocated memory is still 1.0 GB. Free memory is still 945.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 65.60 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 945.7 MB in the beginning and 1.1 GB in the end (delta: -188.5 MB). Peak memory consumption was 22.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 363.55 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.7 MB). Peak memory consumption was 27.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 30670.96 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 227.5 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -214.4 MB). Peak memory consumption was 13.2 MB. Max. memory is 11.5 GB. * Witness Printer took 37.27 ms. Allocated memory is still 1.4 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 28]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 28]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 28]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 28]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 19]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 19]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 19]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 19]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 38]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 38]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 38]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 38]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 47]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 47]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 43]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 9]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 9]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 17 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 70 locations, 17 error locations. SAFE Result, 30.6s OverallTime, 26 OverallIterations, 10 TraceHistogramMax, 5.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1274 SDtfs, 920 SDslu, 2867 SDs, 0 SdLazy, 1310 SolverSat, 60 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2067 GetRequests, 1775 SyntacticMatches, 36 SemanticMatches, 256 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 807 ImplicationChecksByTransitivity, 18.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=90occurred in iteration=25, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.8s AbstIntTime, 10 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 26 MinimizatonAttempts, 21 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 22.4s InterpolantComputationTime, 2197 NumberOfCodeBlocks, 1925 NumberOfCodeBlocksAsserted, 45 NumberOfCheckSat, 3077 ConstructedInterpolants, 374 QuantifiedInterpolants, 1470209 SizeOfPredicates, 73 NumberOfNonLiveVariables, 5042 ConjunctsInSsa, 205 ConjunctsInUnsatCore, 64 InterpolantComputations, 25 PerfectInterpolantSequences, 3531/5170 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...